The Community for Technology Leaders
RSS Icon
Subscribe
Issue No.05 - May (1993 vol.15)
pp: 504-507
ABSTRACT
<p>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.</p>
INDEX TERMS
2D min filters; image processing; max filters; statistic filter transforms; polylog time; median filter; logarithmic time; filtering and prediction theory; image processing
CITATION
J. Gil, M. Werman, "Computing 2-D Min, Median, and Max Filters", IEEE Transactions on Pattern Analysis & Machine Intelligence, vol.15, no. 5, pp. 504-507, May 1993, doi:10.1109/34.211471
17 ms
(Ver 2.0)

Marketing Automation Platform Marketing Automation Tool