A fast two-dimensional median filtering algorithm
Thomas S. Huang, Gang Yang, G. Tang · IEEE Transactions on Acoustics Speech and Signal Processing · 1979
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).
Cited by 1,390 works. doi:10.1109/tassp.1979.1163188
Authors
References
- The Design and Analysis of Computer Algorithms
- Applications of a nonlinear smoothing algorithm to speech processing
- Exploratory Data Analysis
- Average- and Median-Based Smoothing Techniques for Improving Digital Speech Quality in the Presence of Transmission Errors
- A new restoring algorithm for the preferential enhancement of edge gradients
- Exploratory Data Analysis