This Article 
 Bibliographic References 
 Add to: 
Computing 2-D Min, Median, and Max Filters
May 1993 (vol. 15 no. 5)
pp. 504-507

Fast algorithms for computing min, median, max, or any other order statistic filter transforms are described. The algorithms take constant time per pixel to compute min or max filters and polylog time per pixel, in the size of the filter, to compute the median filter. A logarithmic time per pixel lower bound for the computation of the median filter is shown.

[1] D. R. Brownrigg, "The weighted median filter,"Commun. Assoc. Comput. Mach., vol. 27, pp. 204-208, Aug. 1984.
[2] J. Gil, W. Steiger, and A. Wigderson,Running Medians, to be published.
[3] T.S. Huang,Two-Dimensional Digital Signal Procesing II: Transfoms and Median Filters. Berlin: Springer-Verlag, 1981.
[4] J. Katajainen M. Juhola, and T. Raito, "Comparison of algorithma for standard median filtering,"IEEE Trans. Signal Procesing, vol. 39, pp. 204-208, Jan. 1991.
[5] J. Serra,Image Analysis and Mathematical Morphology. New York: Academic, 1982.
[6] M. Werman and S. Peleg, "Min max operators in texture analysis,"IEEE Trans. Patt. Anal. Machine Intell., vol. PAMI-7, pp. 730-733, Nov. 1985.

Index Terms:
2D min filters; image processing; max filters; statistic filter transforms; polylog time; median filter; logarithmic time; filtering and prediction theory; image processing
J. Gil, M. Werman, "Computing 2-D Min, Median, and Max Filters," IEEE Transactions on Pattern Analysis and Machine Intelligence, vol. 15, no. 5, pp. 504-507, May 1993, doi:10.1109/34.211471
Usage of this product signifies your acceptance of the Terms of Use.