A Fast Two-Dimensional Median Filtering Algorithm

Thomas S. Huang; George J. Yang; Gregory Y. Tang

doi:10.1109/TASSP.1979.1163188

A Fast Two-Dimensional Median Filtering Algorithm

Thomas S. Huang, George J. Yang, Gregory Y. Tang

Research output: Contribution to journal › Article › peer-review

Abstract

We present a fast algorithm for two-dimensional median filtering. It is based on storing and updating the gray level histogram of the picture elements in the window. The algorithm is much faster than conventional sorting methods. For a window size of m × n, the computer time required is 0(n).

Original language	English (US)
Pages (from-to)	13-18
Number of pages	6
Journal	IEEE Transactions on Acoustics, Speech, and Signal Processing
Volume	27
Issue number	1
DOIs	https://doi.org/10.1109/TASSP.1979.1163188
State	Published - Feb 1979
Externally published	Yes

ASJC Scopus subject areas

Signal Processing

Online availability

10.1109/TASSP.1979.1163188

Library availability

Discover UIUC Full Text

Cite this

@article{fa784fde3fce45a8bb7947b9d6228461,

title = "A Fast Two-Dimensional Median Filtering Algorithm",

abstract = "We present a fast algorithm for two-dimensional median filtering. It is based on storing and updating the gray level histogram of the picture elements in the window. The algorithm is much faster than conventional sorting methods. For a window size of m × n, the computer time required is 0(n).",

author = "Huang, {Thomas S.} and Yang, {George J.} and Tang, {Gregory Y.}",

year = "1979",

month = feb,

doi = "10.1109/TASSP.1979.1163188",

language = "English (US)",

volume = "27",

pages = "13--18",

journal = "IEEE Transactions on Acoustics, Speech, and Signal Processing",

issn = "0096-3518",

publisher = "Institute of Electrical and Electronics Engineers Inc.",

number = "1",

}

TY - JOUR

T1 - A Fast Two-Dimensional Median Filtering Algorithm

AU - Huang, Thomas S.

AU - Yang, George J.

AU - Tang, Gregory Y.

PY - 1979/2

Y1 - 1979/2

N2 - We present a fast algorithm for two-dimensional median filtering. It is based on storing and updating the gray level histogram of the picture elements in the window. The algorithm is much faster than conventional sorting methods. For a window size of m × n, the computer time required is 0(n).

AB - We present a fast algorithm for two-dimensional median filtering. It is based on storing and updating the gray level histogram of the picture elements in the window. The algorithm is much faster than conventional sorting methods. For a window size of m × n, the computer time required is 0(n).

UR - http://www.scopus.com/inward/record.url?scp=0018432155&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0018432155&partnerID=8YFLogxK

U2 - 10.1109/TASSP.1979.1163188

DO - 10.1109/TASSP.1979.1163188

M3 - Article

AN - SCOPUS:0018432155

SN - 0096-3518

VL - 27

SP - 13

EP - 18

JO - IEEE Transactions on Acoustics, Speech, and Signal Processing

JF - IEEE Transactions on Acoustics, Speech, and Signal Processing

IS - 1

ER -

A Fast Two-Dimensional Median Filtering Algorithm

Abstract

ASJC Scopus subject areas

Online availability

Library availability

Related links

Fingerprint

Cite this