Communications of the ACM
Two-Dimensional Digital Signal Processing II: Transforms and Median Filters
Two-Dimensional Digital Signal Processing II: Transforms and Median Filters
Image Analysis and Mathematical Morphology
Image Analysis and Mathematical Morphology
Improving Gil-Werman Algorithm for Running Min and Max Filters
IEEE Transactions on Pattern Analysis and Machine Intelligence
Directional Morphological Filtering
IEEE Transactions on Pattern Analysis and Machine Intelligence
Efficient Dilation, Erosion, Opening, and Closing Algorithms
IEEE Transactions on Pattern Analysis and Machine Intelligence
Parallel Algorithms for Median Filtering on Arrays with Reconfigurable Optical Buses
IPDPS '02 Proceedings of the 16th International Parallel and Distributed Processing Symposium
Morphological Operators with Discrete Line Segments
DGCI '00 Proceedings of the 9th International Conference on Discrete Geometry for Computer Imagery
Morphological Erosions and Openings: Fast Algorithms Based on Anchors
Journal of Mathematical Imaging and Vision
Fast median and bilateral filtering
ACM SIGGRAPH 2006 Papers
Streaming maximum-minimum filter using no more than three comparisons per element
Nordic Journal of Computing
An Efficient Hardware Architecture without Line Memories for Morphological Image Processing
ACIVS '08 Proceedings of the 10th International Conference on Advanced Concepts for Intelligent Vision Systems
ICALP '09 Proceedings of the 36th International Colloquium on Automata, Languages and Programming: Part I
Computing rank-convolutions with a mask
ACM Transactions on Algorithms (TALG)
Local Detection Of Defects From Image Sequences
International Journal of Applied Mathematics and Computer Science - Issues in Fault Diagnosis and Fault Tolerant Control
Fast median filtering algorithms for mesh computers
Pattern Recognition
Accelerating pattern matching or how much can you slide?
ACCV'07 Proceedings of the 8th Asian conference on Computer vision - Volume Part II
Theoretical Computer Science
Computationally efficient, one-pass algorithm for morphological filters
Journal of Visual Communication and Image Representation
Dynamic range selection in linear space
ISAAC'11 Proceedings of the 22nd international conference on Algorithms and Computation
Highly Parallelable Bidimensional Median Filter for Modern Parallel Programming Models
Journal of Signal Processing Systems
| Hi-index | 0.15 |
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.