Learn More
The skeleton of a digital figure can often be regarded as a convenient alternative to the figure itself. It is useful both to diminish drastically the amount of data to be handled, and to simplify the computational procedures required for description and classification purposes. Thinning a digital figure down to its skeleton is a time-consuming process when(More)
A medial surface representation of a grey-level volume image is computed. The foreground is reduced to a subset topologically equivalent to the initial foreground and mainly consisting of surfaces centred within regions having locally higher intensities, here, regarded as more informative. This result is obtained by combining distance information with(More)
A skeletonization algorithm is presented, characterized by two main features: invariance under isometric transformations of the pattern, and recoverability. The algorithm is driven by the Euclidean distance map of the pattern. Invariance under isometric transformations is guaranteed due to the use of the Euclidean distance to compute the distance map;(More)
In picture processing it is often convenient to deal with a stick-like version (skeleton) of binary digital images. Although skeleton connectedness is not necessary for storage and retrieval purposes, this property is desirable when a structural description of images is of interest. In this paper a parallel procedure is described which, applied to a(More)
A distance-driven method to compute the surface and curve skeletons of 3D objects in voxel images is described. The method is based on the use of the <;3,4,5>; weighted distance transform, on the detection of anchor points, and on the application of topology preserving removal operations. The obtained surface and curve skeletons are centered within(More)