Image Analysis Using Mathematical Morphology
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 and accurate erosion-dilation method suitable for microcomputers
CVGIP: Graphical Models and Image Processing
Fast erosion and dilation by contour processing and thresholding of distance maps
Pattern Recognition Letters
Methods for fast morphological image transforms using bitmapped binary images
CVGIP: Graphical Models and Image Processing
A fast algorithm for local minimum and maximum filters on rectangular and octagonal kernels
Pattern Recognition Letters
An overview of morphological filtering
Circuits, Systems, and Signal Processing - Special issue: median and morphological filters
A linear algorithm for incremental digital display of circular arcs
Communications of the ACM
Image Analysis and Mathematical Morphology
Image Analysis and Mathematical Morphology
Periodic lines: Definition, cascades, and application to granulometries
Pattern Recognition Letters
Directional Morphological Filtering
IEEE Transactions on Pattern Analysis and Machine Intelligence
Mathematical morphology: A useful set of tools for imageanalysis
Statistics and Computing
Efficient Dilation, Erosion, Opening, and Closing Algorithms
IEEE Transactions on Pattern Analysis and Machine Intelligence
Morphological Operators with Discrete Line Segments
DGCI '00 Proceedings of the 9th International Conference on Discrete Geometry for Computer Imagery
Image Structure Orientation Using Mathematical Morphology
ICPR '98 Proceedings of the 14th International Conference on Pattern Recognition-Volume 2 - Volume 2
Using Line Segments as Structuring Elements for Sampling-Invariant Measurements
IEEE Transactions on Pattern Analysis and Machine Intelligence
Moving average algorithms for diamond, hexagon, and general polygonal shaped window operations
Pattern Recognition Letters
IEEE Transactions on Pattern Analysis and Machine Intelligence
Efficient complete and incomplete path openings and closings
Image and Vision Computing
Mask-Based Second-Generation Connectivity and Attribute Filters
IEEE Transactions on Pattern Analysis and Machine Intelligence
Automatic Segmentation of Unstained Living Cells in Bright-Field Microscope Images
MDA '08 Proceedings of the 3rd international conference on Advances in Mass Data Analysis of Images and Signals in Medicine, Biotechnology, Chemistry and Food Industry
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
Directional structures detection based on morphological line-segment and orientation functions
DGCI'08 Proceedings of the 14th IAPR international conference on Discrete geometry for computer imagery
Digital Steiner sets and Matheron semi-groups
Image and Vision Computing
ISBI'10 Proceedings of the 2010 IEEE international conference on Biomedical imaging: from nano to Macro
Computationally efficient, one-pass algorithm for morphological filters
Journal of Visual Communication and Image Representation
Fast binary dilation/erosion algorithm using kernel subdivision
ACCV'06 Proceedings of the 7th Asian conference on Computer Vision - Volume Part II
From Binary to Grey Scale Convex Hulls
Fundamenta Informaticae
Fast recursive grayscale morphology operators: from the algorithm to the pipeline architecture
Journal of Real-Time Image Processing
Hi-index | 0.14 |
Van Herk has shown that the erosion/dilation operator with a linear structuring element of an arbitrary length can be implemented in only three min/max operations per pixel. In this paper, the algorithm is generalized to erosions and dilations along discrete lines at arbitrary angles. We also address the padding problem; so that the operation can be performed in place without copying the pixels to and from an intermediate buffer. Applications to image filtering and to radial decompositions of discs are presented.