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
The algebraic basis of mathematical morphology. I. dilations and erosions
Computer Vision, Graphics, and Image Processing
Watersheds in Digital Spaces: An Efficient Algorithm Based on Immersion Simulations
IEEE Transactions on Pattern Analysis and Machine Intelligence
The algebraic basis of mathematical morphology
CVGIP: Image Understanding
A fast algorithm for local minimum and maximum filters on rectangular and octagonal kernels
Pattern Recognition Letters
Attribute openings, thinnings, and granulometries
Computer Vision and Image Understanding
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
Granulometries and opening trees
Fundamenta Informaticae - Special issue on mathematical morphology
Directional Morphological Filtering
IEEE Transactions on Pattern Analysis and Machine Intelligence
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
Journal of Mathematical Imaging and Vision
Image Analysis and Mathematical Morphology
Image Analysis and Mathematical Morphology
Running max/min calculation using a pruned ordered list
IEEE Transactions on Signal Processing
Flat zones filtering, connected operators, and filters by reconstruction
IEEE Transactions on Image Processing
Streaming maximum-minimum filter using no more than three comparisons per element
Nordic Journal of Computing
Image contrast enhancement using morphological decomposition by reconstruction
WSEAS Transactions on Circuits and Systems
FPGA implementation of image morphological decomposition with reconstruction
ICC'08 Proceedings of the 12th WSEAS international conference on Circuits
Computationally efficient, one-pass algorithm for morphological filters
Journal of Visual Communication and Image Representation
Fast streaming algorithm for 1-D morphological opening and closing on 2-D support
ISMM'11 Proceedings of the 10th international conference on Mathematical morphology and its applications to image and signal processing
| Hi-index | 0.00 |
Several efficient algorithms for computing erosions and openings have been proposed recently. They improve on van Herk's algorithm in terms of number of comparisons for large structuring elements. In this paper we introduce a theoretical framework of anchors that aims at a better understanding of the process involved in the computation of erosions and openings. It is shown that the knowledge of opening anchors of a signal f is sufficient to perform both the erosion and the opening of f.Then we propose an algorithm for one-dimensional erosions and openings which exploits opening anchors. This algorithm improves on the fastest algorithms available in literature by approximately 30% in terms of computation speed, for a range of structuring element sizes and image contents.