论文信息 - A fast two-dimensional median filtering algorithm

A fast two-dimensional median filtering algorithm

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).

[1] Alfred V. Aho,et al. The Design and Analysis of Computer Algorithms , 1974 .

[2] B. Frieden. A new restoring algorithm for the preferential enhancement of edge gradients , 1976 .

[3] Lawrence R. Rabiner,et al. Applications of a nonlinear smoothing algorithm to speech processing , 1975 .

[4] Nuggehally Sampath Jayant. Average- and Median-Based Smoothing Techniques for Improving Digital Speech Quality in the Presence of Transmission Errors , 1976, IEEE Trans. Commun..