Name
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. |
Year | DOI | Venue |
|---|---|---|
1993 | 10.1109/34.211471 | Pattern Analysis and Machine Intelligence, IEEE Transactions |
Keywords | Field | DocType |
filtering and prediction theory,image processing,2D min filters,image processing,logarithmic time,max filters,median filter,polylog time,statistic filter transforms | Noise reduction,Median filter,Upper and lower bounds,Image processing,Artificial intelligence,Logarithm,Order statistic,Computer vision,Combinatorics,Filter (signal processing),Pixel,Statistics,Mathematics | Journal |
Volume | Issue | ISSN |
15 | 5 | 0162-8828 |
Citations | PageRank | References |
65 | 9.61 | 3 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Joseph Gil | 1 | 65 | 9.61 |
| M. Werman | 2 | 343 | 112.04 |