20 November 1986 A Skeletonizing Algorithm With Improved Isotropy
Author Affiliations +
Proceedings Volume 0707, Visual Communications and Image Processing; (1986) https://doi.org/10.1117/12.937258
Event: Cambridge Symposium-Fiber/LASE '86, 1986, Cambridge, MA, United States
Abstract
An improved algorithm is presented which is capable of transforming thick objects in a discrete binary image into thinner representations called skeletons. The skeletal shapes produced are shown to be more isotropic than those produced using other algorithms. The algorithm uses a non-iterative procedure based on the 4-distance ("city block") transform to produce connected reversible skeletons. The types and properties of 4-distance neighborhoods, which are used in skeletal pixel selection, are developed. Local-maxima are included in the skeleton, allowing reversibility using a reverse distance transform. Improved isotropy is achieved by defining pixels with certain types of neighborhoods to be interesting. It is shown that these isotropy-improving pixels may be added to the skeletons produced by any 4-distance-based skeletonizing algorithm that retains all local-maxima without affecting connectedness.
© (1986) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.
Donald J. Healy, Donald J. Healy, } "A Skeletonizing Algorithm With Improved Isotropy", Proc. SPIE 0707, Visual Communications and Image Processing, (20 November 1986); doi: 10.1117/12.937258; https://doi.org/10.1117/12.937258
PROCEEDINGS
8 PAGES


SHARE
RELATED CONTENT

Text segmentation for automatic document processing
Proceedings of SPIE (January 07 1999)
Euclidean skeletons and conditional bisectors
Proceedings of SPIE (November 01 1992)
Streak splicing using medial-axis transform techniques
Proceedings of SPIE (October 22 1993)

Back to Top