DocumentCode
889623
Title
Computing 2-D min, median, and max filters
Author
Gil, Joseph ; Werman, Michael
Author_Institution
Dept. of Comput. Sci., Hebrew Univ., Jerusalem, Israel
Volume
15
Issue
5
fYear
1993
fDate
5/1/1993 12:00:00 AM
Firstpage
504
Lastpage
507
Abstract
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
Keywords
filtering and prediction theory; image processing; 2D min filters; image processing; logarithmic time; max filters; median filter; polylog time; statistic filter transforms; Degradation; Filters; Gas insulated transmission lines; Noise reduction; Shape; Statistics; Symmetric matrices;
fLanguage
English
Journal_Title
Pattern Analysis and Machine Intelligence, IEEE Transactions on
Publisher
ieee
ISSN
0162-8828
Type
jour
DOI
10.1109/34.211471
Filename
211471
Link To Document