Share Email Print

Proceedings Paper

Skeletonizing The Distance Transform Parallelwise
Author(s): Carlo Arcelli; Gabriella Sanniti di Baja
Format Member Price Non-Member Price
PDF $17.00 $21.00

Paper 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.

Paper Details

Date Published: 16 December 1988
PDF: 6 pages
Proc. SPIE 0974, Applications of Digital Image Processing XI, (16 December 1988); doi: 10.1117/12.948474
Show Author Affiliations
Carlo Arcelli, Istituto di Cibernetica del C.N.R. (Italy)
Gabriella Sanniti di Baja, Istituto di Cibernetica del C.N.R (Italy)

Published in SPIE Proceedings Vol. 0974:
Applications of Digital Image Processing XI
Andrew G. Tescher, Editor(s)

© SPIE. Terms of Use
Back to Top
Sign in to read the full article
Create a free SPIE account to get access to
premium articles and original research
Forgot your username?