Optical Engineering · 2006 · 25 citations · 24 references
ComputingComputer ScienceBiomedical ImagingComputational GeometryGeometric ModelingGeometry ProcessingShape AnalysisShape RepresentationComputational Complexity Of AlgorithmsHigh-resolution ImagingShapeSkeletonizationSymmetriesSymmetry AnalysisSymmetry ExtractionSymmetry Transformations
This paper presents an efficient skeletonization method based on generalized discrete local symmetries. A generalized discrete local symmetry is a local symmetry between a contour pixel and a contour segment on the opposite side of the underlying shape. The centerlines of the local symmetries of a shape form the skeleton of the shape. The proposed method is fast compared to two existing skeletonization methods. A speed-up factor of more than 50 can be achieved for high-resolution images. The method is also robust against noise and geometrical transformations, such as rotation and uniform scaling. The method is suitable for skeletonizing high-resolution images where it can be impractical to use other skeletonization techniques, such as thinning and distance transforms, because of the high computational complexity.
24
A fast parallel algorithm for thinning digital patterns
Tingwei Zhang, Ching Y. Suen · Communications of the ACM · 1984 · 2.7K citations · Full text
Computational geometry. an introduction
Franco P. Preparata, Michael Ian Shamos · 1985 · 2.4K citations
Biological shape and visual science (part I)
H.E. Blum · Journal of Theoretical Biology · 1973 · 1.2K citations
A survey of shape analysis techniques
Sven Lončarić · Pattern Recognition · 1998 · 951 citations