1 November 1992 Euclidean skeletons and conditional bisectors
Author Affiliations +
Proceedings Volume 1818, Visual Communications and Image Processing '92; (1992) https://doi.org/10.1117/12.131499
Event: Applications in Optical Science and Engineering, 1992, Boston, MA, United States
This paper deals with the determination of skeletons and conditional bisectors in discrete binary images using the Euclidean metrics. The algorithm proceeds in two steps: first, the Centers of the Euclidean Maximal Discs (CMD) included in the set to skeletonize are characterized and robustly identified. Second, a firefront propagation is simulated starting from the set boundaries, in which pixels which are not centers of maximal discs and are not crucial to homotopy preservation are removed. Not only is the resulting algorithm fast and accurate, it allows the computation of a vast variety of skeletons. Furthermore, it can be extended to provide conditional bisectors of any angular parameter (theta) . This leads to the introduction of a new morphological transformation, the bisector function, which synthesizes the information contained in all the (theta) -conditional bisectors. The interest of all these skeleton-like transformations is illustrated on the segmentation of binary images of glass fibers.
© (1992) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.
Hugues Talbot, Hugues Talbot, Luc M. Vincent, Luc M. Vincent, } "Euclidean skeletons and conditional bisectors", Proc. SPIE 1818, Visual Communications and Image Processing '92, (1 November 1992); doi: 10.1117/12.131499; https://doi.org/10.1117/12.131499


Aggregate particle image segmentation
Proceedings of SPIE (November 26 2007)
A Skeletonizing Algorithm With Improved Isotropy
Proceedings of SPIE (November 19 1986)
Fast opening functions and morphological granulometries
Proceedings of SPIE (June 29 1994)
Digital Euclidean skeletons
Proceedings of SPIE (August 31 1990)

Back to Top