Continuous skeleton computation by Voronoi diagram

The skeleton of a continuous shape can be approximated from the Voronoi diagram of points sampled along the shape boundary. To bound the error of this approximation, one must relate the spatial complexity of the shape to the boundary sampling density. The regular set model of mathematical morphology provides a practical basis to establish such a relationship. Given a binary image shape, we exhibit a corresponding continuous, regular shape such that the sequence of points describing its boundary constitutes a sufficiently dense sampling for an accurate skeleton approximation. Additionally, we bound the regeneration error from the sampling density and the regularity parameter. This approach opens significant new possibilities for shape analysis by the exact, Euclidean skeleton. As a simple example, we describe how the skeleton can be refined by pruning, without introducing significant error in the regenerated image.

[1]  David G. Kirkpatrick,et al.  Efficient computation of continuous skeletons , 1979, 20th Annual Symposium on Foundations of Computer Science (sfcs 1979).

[2]  F. Bookstein The line-skeleton , 1979 .

[3]  Vijay Srinivasan,et al.  Voronoi Diagram for Multiply-Connected Polygonal Domains I: Algorithm , 1987, IBM J. Res. Dev..

[4]  J. Sklansky,et al.  Skeleton generation fromx, y boundary sequences , 1981 .

[5]  Kazuo Murota,et al.  A Fast Voronoi-Diagram Algorithm With Quaternary Tree Bucketing , 1984, Inf. Process. Lett..

[6]  J. A. Riley,et al.  THE SKELETONS OF STABLE PLANE SETS. , 1967 .

[7]  Siavash N. Meshkat,et al.  Voronoi Diagram for Multiply-Connected Polygonal Domains II: Implementation and Application , 1987, IBM J. Res. Dev..

[8]  W. E. Hartnett,et al.  Shape Recognition, Prairie Fires, Convex Deficiencies and Skeletons , 1968 .

[9]  D. T. Lee,et al.  Medial Axis Transformation of a Planar Shape , 1982, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[10]  Raymond W. Smith,et al.  Computer processing of line images: A survey , 1987, Pattern Recognit..

[11]  H. Blum Biological shape and visual science (part I) , 1973 .

[12]  Michel Schmitt,et al.  Some examples of algorithm analysis in computational geometry by means of mathematical morphological techniques , 1988, Geometry and Robotics.

[13]  Carlo Arcelli,et al.  Pattern thinning by contour tracing , 1981 .

[14]  Jose L. Navalón,et al.  A thinning algorithm based on contours , 1987 .

[15]  Azriel Rosenfeld,et al.  Three-dimensional boundary following , 1989, Comput. Vis. Graph. Image Process..