Classification of the Distance Transformation Algorithms under the Mathematical Morphology Approach

Authors:
Francisco de Assis Zampirolli;Roberto de Alencar Lotufo
Affiliations:
-;-
Venue:
SIBGRAPI '00 Proceedings of the 13th Brazilian Symposium on Computer Graphics and Image Processing
Year:
2000

Citing 0
Cited 4

2D Euclidean distance transform algorithms: A comparative survey

ACM Computing Surveys (CSUR)
An efficient navigation method for virtual endoscopy using volume ray casting

ICCS'03 Proceedings of the 2003 international conference on Computational science: PartIII
Implementing automatic spot addressing and contour based segmentation in microarray image analysis

BEBI'08 Proceedings of the 1st WSEAS international conference on Biomedical electronics and biomedical informatics
Efficient Euclidean distance transform algorithm of binary images in arbitrary dimensions

Pattern Recognition

Quantified Score

Hi-index	0.00

Visualization

Abstract

The distance transform (DT) is a morphological erosion of the binary image by a given structuring function, that dictates the distance metric in the transformation. There are many known algorithms and structuring function decompositions to efficiently implement a morphological erosion. Most of the erosion algorithms are classified as parallel, sequential raster (and anti-raster), and propagation. Based on this classification and decomposition, we review and classify most of the DT algorithms reported in the literature. As a result of this study, we have contributed not only to better classify and understand the diversity of the DT algorithms in the literature, but also to create a collection of efficient erosion algorithms suitable to different computer architectures.