Translator Disclaimer
16 December 1988 Skeletonizing The Distance Transform Parallelwise
Author Affiliations +
Abstract
An iterated parallel algorithm to get the labeled skeleton of a digital figure F is presented. At every iteration, the current 8-connected contour is identified and the pixels preventing contour simplicity are taken as the skeletal pixels. The set of the skeletal pixels has all the properties generally satisfied by the skeleton, except for unit width. This property is enjoyed if one iteration of a standard parallel thinning algorithm is applied. Every skeletal pixel is assigned a label indicating the first iteration of the process at which it has been recognized as a skeletal pixel. Such a label is equal to the 4-distance of the pixel from the complement of F. The obtained labeled skeleton coincides with the skeleton one could get by skeletonizing the 4-distance transform of F.
© (1988) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.
Carlo Arcelli and Gabriella Sanniti di Baja "Skeletonizing The Distance Transform Parallelwise", Proc. SPIE 0974, Applications of Digital Image Processing XI, (16 December 1988); https://doi.org/10.1117/12.948474
PROCEEDINGS
6 PAGES


SHARE
Advertisement
Advertisement
RELATED CONTENT


Back to Top