Efficient Skeletonization of Volumetric Objects

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.

[1]  Arthur W. Toga,et al.  Three-dimensional skeleton and centerline generation based on an approximate minimum distance field , 1998, The Visual Computer.

[2]  Sergey Ablameyko Hierarchical Decomposition of Distance Labeled Skeletons , 1996, Int. J. Pattern Recognit. Artif. Intell..

[3]  ArcelliCarlo,et al.  Finding local maxima in a pseudo-Euclidean distance transform , 1988 .

[4]  D S Paik,et al.  Automated flight path planning for virtual endoscopy. , 1998, Medical physics.

[5]  Nicholas M. Patrikalakis,et al.  An Algorithm for the Medial Axis Transform of 3D Polyhedral Solids , 1996, IEEE Trans. Vis. Comput. Graph..

[6]  Frederic Fol Leymarie,et al.  Simulating the Grassfire Transform Using an Active Contour Model , 1992, IEEE Trans. Pattern Anal. Mach. Intell..

[7]  Dirk Bartz,et al.  Virtual voyage: interactive navigation in the human colon , 1997, SIGGRAPH.

[8]  M. Sonka,et al.  A Fully Parallel 3D Thinning Algorithm and Its Applications , 1996, Comput. Vis. Image Underst..

[9]  Paul M. Thompson,et al.  Extracting and Representing the Cortical Sulci , 1999, IEEE Computer Graphics and Applications.

[10]  Jun-ichiro Toriwaki,et al.  New algorithms for euclidean distance transformation of an n-dimensional digitized picture with applications , 1994, Pattern Recognit..

[11]  Koji Koyamada,et al.  Volume thinning for automatic isosurface propagation , 1996, Proceedings of Seventh Annual IEEE Visualization '96.

[12]  Wayne Niblack,et al.  Generating skeletons and centerlines from the distance transform , 1992, CVGIP Graph. Model. Image Process..

[13]  Partha Pratim Das,et al.  Thinning of 3-D images using the Safe Point Thinning Algorithm (SPTA) , 1989, Pattern Recognit. Lett..

[14]  Azriel Rosenfeld,et al.  Sequential Operations in Digital Picture Processing , 1966, JACM.

[15]  Arthur W. Toga,et al.  Voxel-coding for tiling complex volumetric objects , 2000, Proceedings the Eighth Pacific Conference on Computer Graphics and Applications.

[16]  Gunilla Borgefors,et al.  Distance transformations in digital images , 1986, Comput. Vis. Graph. Image Process..

[17]  T. Pavlidis A thinning algorithm for discrete binary images , 1980 .

[18]  Robert M. O'Bara,et al.  Geometrically deformed models: a method for extracting closed geometric models form volume data , 1991, SIGGRAPH.

[19]  Arthur W. Toga,et al.  Distance field manipulation of surface models , 1992, IEEE Computer Graphics and Applications.

[20]  Damian J. Sheehy,et al.  Shape Description By Medial Surface Construction , 1996, IEEE Trans. Vis. Comput. Graph..

[21]  V MillerJames,et al.  Geometrically deformed models , 1991 .

[22]  Olaf Kübler,et al.  Hierarchic Voronoi skeletons , 1995, Pattern Recognit..

[23]  Gabriella Sanniti di Baja,et al.  Finding local maxima in a pseudo-Euclidian distance transform , 1988, Comput. Vis. Graph. Image Process..

[24]  Lambertus Hesselink,et al.  Visualizing vector field topology in fluid flows , 1991, IEEE Computer Graphics and Applications.

[25]  Milan Sonka,et al.  A Fully Parallel 3D Thinning Algorithm and Its Applications , 1996, Comput. Vis. Image Underst..

[26]  Xin Wang,et al.  Volume tracking , 1996, Proceedings of Seventh Annual IEEE Visualization '96.

[27]  Arthur W. Toga,et al.  Turning unorganized points into contours , 2000, Proceedings the Eighth Pacific Conference on Computer Graphics and Applications.