Computer Vision, Graphics, and Image Processing
Morphological structuring element decomposition
Computer Vision, Graphics, and Image Processing
Image Analysis Using Mathematical Morphology
IEEE Transactions on Pattern Analysis and Machine Intelligence
Pattern Spectrum and Multiscale Shape Representation
IEEE Transactions on Pattern Analysis and Machine Intelligence
An efficient algorithm for running window pel gray level ranking 2-D images
Pattern Recognition Letters
A fast algorithm for local minimum and maximum filters on rectangular and octagonal kernels
Pattern Recognition Letters
Morphological filtering: an overview
Signal Processing - Special issue on mathematical morphology and its applications to signal processing
Recursive Implementation of Erosions and Dilations Along Discrete Lines at Arbitrary Angles
IEEE Transactions on Pattern Analysis and Machine Intelligence
Improving Gil-Werman Algorithm for Running Min and Max Filters
IEEE Transactions on Pattern Analysis and Machine Intelligence
Fast computation of morphological operations with arbitrary structuring elements
Pattern Recognition Letters
Off-Line Signature Verification by Local Granulometric Size Distributions
IEEE Transactions on Pattern Analysis and Machine Intelligence
IEEE Transactions on Pattern Analysis and Machine Intelligence
Granulometries and opening trees
Fundamenta Informaticae - Special issue on mathematical morphology
An edge preserving noise smoothing technique using multiscale morphology
Signal Processing
Computing 2-D Min, Median, and Max Filters
IEEE Transactions on Pattern Analysis and Machine Intelligence
Efficient Dilation, Erosion, Opening, and Closing Algorithms
IEEE Transactions on Pattern Analysis and Machine Intelligence
Morphological Erosions and Openings: Fast Algorithms Based on Anchors
Journal of Mathematical Imaging and Vision
Image Analysis and Mathematical Morphology
Image Analysis and Mathematical Morphology
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
Grey-Scale Morphology with Spatially-Variant Rectangles in Linear Time
ACIVS '08 Proceedings of the 10th International Conference on Advanced Concepts for Intelligent Vision Systems
Faster retrieval with a two-pass dynamic-time-warping lower bound
Pattern Recognition
Binary morphology with spatially variant structuring elements: algorithm and architecture
IEEE Transactions on Image Processing
Mathematical Morphology and Its Application to Signal and Image Processing: 9th International Symposium on Mathematical Morphology, ISMM 2009 Groningen, ... Vision, Pattern Recognition, and Graphics
Speeding-up successive Minkowski operations with bit-plane computers
Pattern Recognition Letters
Morphological operators for image and video compression
IEEE Transactions on Image Processing
Efficient 2-D Grayscale Morphological Transformations With Arbitrary Flat Structuring Elements
IEEE Transactions on Image Processing
| Hi-index | 0.00 |
Many useful morphological filters are built as long concatenations of erosions and dilations: openings, closings, size distributions, sequential filters, etc. This paper proposes a new algorithm implementing morphological dilation and erosion of functions. It supports rectangular structuring element, runs in linear time w.r.t. the image size and constant time w.r.t. the structuring element size, and has minimal memory usage. It has zero algorithm latency and processes data in stream. These properties are inherited by operators composed by concatenation, and allow their efficient implementation. We show how to compute in one pass an Alternate Sequential Filter (ASF^n) regardless the number of stages n. This algorithm opens the way to such time-critical applications where the complexity and memory requirements of serial morphological operators represented a bottleneck limiting their usability.