CSDL Home IEEE Transactions on Pattern Analysis & Machine Intelligence 2002 vol.24 Issue No.01 - January
Issue No.01 - January (2002 vol.24)
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/34.982884
<p>We propose an algorithm to find piecewise linear skeletons of handwritten characters by using principal curves. The development of the method was inspired by the apparent similarity between the definition of principal curves (smooth curves which pass through the "middle" of a cloud of points) and the medial axis (smooth curves that go equidistantly from the contours of a character image). The central fitting-and-smoothing step of the algorithm is an extension of the polygonal line algorithm which approximates principal curves of data sets by piecewise linear curves. The polygonal line algorithm is extended to find principal graphs and complemented with two steps specific to the task of skeletonization: an initialization method to capture the approximate topology of the character, and a collection of restructuring operations to improve the structural quality of the skeleton produced by the initialization method. An advantage of our approach over existing methods is that we optimize the skeleton graph by minimizing an intuitive and explicit objective function that captures the two competing criteria of smoothing the skeleton and fitting it closely to the pixels of the character image. We tested the algorithm on isolated handwritten digits and images of continuous handwriting. The results indicate that the proposed algorithm finds a smooth medial axis of the great majority of a wide variety of character templates and substantially improves the pixelwise skeleton obtained by traditional thinning methods.</p>
Skeletonization, principal curves, feature extraction, image processing.
Balazs Kegl, "Piecewise Linear Skeletonization Using Principal Curves", IEEE Transactions on Pattern Analysis & Machine Intelligence, vol.24, no. 1, pp. 59-74, January 2002, doi:10.1109/34.982884