Translator Disclaimer
4 January 1995 Three-dimensional thinning algorithm using subfields
Author Affiliations +
Proceedings Volume 2356, Vision Geometry III; (1995) https://doi.org/10.1117/12.198601
Event: Photonics for Industrial Applications, 1994, Boston, MA, United States
Abstract
A three-dimensional parallel thinning algorithm is presented. This algorithm works in cubic grid with the 26-connectivity. It is based upon two topological numbers introduced elsewhere. These numbers allow us to check if a point is simple or not and to detect end points. The strategy which is used for removing points in parallel without altering the topology of the image is a strategy based upon subfields: the cubic grid is divided into 8 subfields which are successively activated. The use of 4 subfields is also considered. One major interest of the subfield approach is that it is `complete,' i.e., all simple points which are not considered as skeletal points are removed. The proposed algorithm allows us to get a curve skeleton, a surface skeleton as well as a topological kernel of the objects. Furthermore it is possible to implement it by using only Boolean conditions.
© (1995) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.
Gilles Bertrand and Zouina Aktouf "Three-dimensional thinning algorithm using subfields", Proc. SPIE 2356, Vision Geometry III, (4 January 1995); https://doi.org/10.1117/12.198601
PROCEEDINGS
12 PAGES


SHARE
Advertisement
Advertisement
Back to Top