1 April 1996 Skeletonization of binary digital patterns using a fast Euclidean distance transformation
Author Affiliations +
Abstract
In this paper we present a new thinning algorithm based on distance transformation. Because the choice of a distance measure will influence the result of skeletonization, we introduce an approach to Euclidean distance transformation that achieves a better accuracy than D4 , D8 , or octagonal distance transformation. We have developed a fast method to compute the Euclidean distance transformation. Using this technique, we can extract a reliable skeleton efficiently to represent a binary pattern. Our method works well on real images and compares favorably with other methods.
Hung-Hsin Chang, Hong Yan, "Skeletonization of binary digital patterns using a fast Euclidean distance transformation," Optical Engineering 35(4), (1 April 1996). https://doi.org/10.1117/1.600716
JOURNAL ARTICLE
6 PAGES


SHARE
RELATED CONTENT

A Skeletonizing Algorithm With Improved Isotropy
Proceedings of SPIE (November 20 1986)
Text segmentation for automatic document processing
Proceedings of SPIE (January 07 1999)
Image matching using algebraic topology
Proceedings of SPIE (January 18 2006)
Comparison of connected-component algorithms
Proceedings of SPIE (August 27 1999)
Note on a new class of metrics: touching metrics
Proceedings of SPIE (September 30 1996)
Parallelisable method for real-time aerial images matching
Proceedings of SPIE (August 22 1995)

Back to Top