Euclidean skeleton via centre-of-maximal-disc extraction

Abstract

A skeletonization algorithm is presented, characterized by two main features: invariance under isometric transformations of the pattern, and recoverability. The algorithm is driven by the Euclidean distance map of the pattern. Invariance under isometric transformations is guaranteed due to the use of the Euclidean distance to compute the distance map; recoverability is guaranteed by the inclusion in the set of the skeletal pixels of the centres of the maximal discs. The skeletonization algorithm includes a beautifying step and a pruning step, which favour the use of the skeleton for shape analysis tasks.

DOI: 10.1016/0262-8856(93)90055-L

Extracted Key Phrases

11 Figures and Tables

Statistics

051015'96'98'00'02'04'06'08'10'12'14'16
Citations per Year

81 Citations

Semantic Scholar estimates that this publication has 81 citations based on the available data.

See our FAQ for additional information.

Cite this paper

@article{Arcelli1993EuclideanSV, title={Euclidean skeleton via centre-of-maximal-disc extraction}, author={Carlo Arcelli and Gabriella Sanniti di Baja}, journal={Image Vision Comput.}, year={1993}, volume={11}, pages={163-173} }