Paper
16 December 1988 Skeletonizing The Distance Transform Parallelwise
Carlo Arcelli, Gabriella Sanniti di Baja
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
Lens.org Logo
CITATIONS
Cited by 2 scholarly publications.
Advertisement
Advertisement
RIGHTS & PERMISSIONS
Get copyright permission  Get copyright permission on Copyright Marketplace
KEYWORDS
Evolutionary algorithms

Aluminum

Digital image processing

Stars

Binary data

Detection and tracking algorithms

Iterated function systems

RELATED CONTENT

Digital halftoning using a blue-noise mask
Proceedings of SPIE (June 01 1991)
Region-enclosing contours from edge pixels
Proceedings of SPIE (November 24 2002)
Robust recognition of 1D barcodes using Hough transform
Proceedings of SPIE (February 02 2012)
Automatic generation of morphological sequences
Proceedings of SPIE (June 01 1992)
Fast one pass algorithm to label objects and compute their...
Proceedings of SPIE (December 01 1991)
Sublinear constant multiplication algorithms
Proceedings of SPIE (August 25 2006)

Back to Top