Issue No. 03 - July-September (1999 vol. 5)
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/2945.795212
<p><b>Abstract</b>—Skeletonization promises to become a powerful tool for compact shape description, path planning, and other applications. However, current techniques can seldom efficiently process real, complicated 3D data sets, such as MRI and CT data of human organs. In this paper, we present an efficient voxel-coding based algorithm for skeletonization of 3D voxelized objects. The skeletons are interpreted as connected centerlines, consisting of sequences of medial points of consecutive clusters. These centerlines are initially extracted as paths of voxels, followed by medial point replacement, refinement, smoothness, and connection operations. The voxel-coding techniques have been proposed for each of these operations in a uniform and systematic fashion. In addition to preserving basic connectivity and centeredness, the algorithm is characterized by straightforward computation, no sensitivity to object boundary complexity, explicit extraction of ready-to-parameterize and branch-controlled skeletons, and efficient object hole detection. These issues are rarely discussed in traditional methods. A range of 3D medical MRI and CT data sets were used for testing the algorithm, demonstrating its utility.</p>
3D skeleton and centerline, medial axis, volume subdivision, region growing, hole detection, distance transformation, voxel-coding.
A. W. Toga and Y. Zhou, "Efficient Skeletonization of Volumetric Objects," in IEEE Transactions on Visualization & Computer Graphics, vol. 5, no. , pp. 196-209, 1999.