Skeletonization is a transformation of a component of a digital image into a subset of the original component. There are different categories of skeletonization methods: one category is based on distance transforms, and a specified subset of the transformed image is a distance skeleton. The original component can be reconstructed from the distance skeleton. Another category is defined by thinning approaches; and the result of skeletonization using thinning algorithms should be a connected set of digital curves or arcs. Motivations for interest in skeletonization algorithms are the need to compute a reduced amount of data or to simplify the shape of an object in order to find features for recognition algorithms and classifications. Additionally the transformation of a component into an image showing essential characteristics can eliminate local noise at the frontier. Thinning algorithms are a very active area of research, with a main focus on connectivity preserving methods allowing parallel implementation. There are hundreds of publications on different aspects of these transformations. This report reviews contributions in this area with respect to properties of algorithms and characterizations of simple points, and informs about a few new results. 1 Centre for Image Technology and Robotics, Tamaki Campus, Building 731, The University of Auckland, Morrin Road, Glen Innes, Auckland 1005, New Zealand. You are granted permission for the non-commercial reproduction, distribution, display, and performance of this technical report in any format, BUT this permission is only for a period of 45 (forty-five) days from the most recent time that you verified that this technical report is still available from the CITR Tamaki web site under terms that include this permission. All other rights are reserved by the author(s). Skeletons in Digital Image Processing Gisela Klette CITR Tamaki, University of Auckland Tamaki Campus, Building 731, Auckland, New Zealand
[1]
Ching Y. Suen,et al.
Thinning Methodologies - A Comprehensive Survey
,
1992,
IEEE Trans. Pattern Anal. Mach. Intell..
[2]
Ching Y. Suen,et al.
A fast parallel algorithm for thinning digital patterns
,
1984,
CACM.
[3]
T. Yung Kong,et al.
On Topology Preservation in 2-D and 3-D Thinning
,
1995,
Int. J. Pattern Recognit. Artif. Intell..
[4]
Azriel Rosenfeld,et al.
A Characterization of Parallel Thinning Algorithms
,
1975,
Inf. Control..
[5]
Gabriella Sanniti di Baja,et al.
Skeletons of planar patterns
,
1996
.
[6]
Christian Ronse,et al.
A Topological Characterization of Thinning
,
1986,
Theor. Comput. Sci..
[7]
Azriel Rosenfeld,et al.
Sequential Operations in Digital Picture Processing
,
1966,
JACM.
[8]
C. J. Hilditch,et al.
Linear Skeletons From Square Cupboards
,
1969
.
[9]
T. Pavlidis.
A thinning algorithm for discrete binary images
,
1980
.
[10]
Ugo Montanari,et al.
A Method for Obtaining Skeletons Using a Quasi-Euclidean Distance
,
1968,
J. ACM.
[11]
Gabriella Sanniti di Baja.
Well-Shaped, Stable, and Reversible Skeletons from the (3, 4)-Distance Transform
,
1994,
J. Vis. Commun. Image Represent..
[12]
Stefano Levialdi,et al.
Parallel thinning of binary pictures
,
1975
.
[13]
Vladimir Kovalevsky,et al.
Algorithms and Data Structures for Computer Topology
,
2000,
Digital and Image Geometry.
[14]
Azriel Rosenfeld,et al.
Computer representation of planar regions by their skeletons
,
1967,
CACM.
[15]
Richard W. Hall,et al.
Fast parallel thinning algorithms: parallel speed and connectivity preservation
,
1989,
CACM.