This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Penalized-Distance Volumetric Skeleton Algorithm
July-September 2001 (vol. 7 no. 3)
pp. 195-206
ASCII Text
x 
 
Ingmar Bitter, Arie E. Kaufman, Mie Sato, "Penalized-Distance Volumetric Skeleton Algorithm," IEEE Transactions on Visualization and Computer Graphics, vol. 7, no. 3, pp. 195-206, July-September, 2001.
 
 
BibTex
x
 
@article{ 10.1109/2945.942688,
author = {Ingmar Bitter and Arie E. Kaufman and Mie Sato},
title = {Penalized-Distance Volumetric Skeleton Algorithm},
journal ={IEEE Transactions on Visualization and Computer Graphics},
volume = {7},
number = {3},
issn = {1077-2626},
year = {2001},
pages = {195-206},
doi = {http://doi.ieeecomputersociety.org/10.1109/2945.942688},
publisher = {IEEE Computer Society},
address = {Los Alamitos, CA, USA},
}
 
 
RefWorks Procite/RefMan/Endnote
x 
 
TY - JOUR
JO - IEEE Transactions on Visualization and Computer Graphics
TI - Penalized-Distance Volumetric Skeleton Algorithm
IS - 3
SN - 1077-2626
SP195
EP206
EPD - 195-206
A1 - Ingmar Bitter,
A1 - Arie E. Kaufman,
A1 - Mie Sato,
PY - 2001
KW - Skeleton
KW - centerline
KW - medial axis
KW - automatic preprocessing
KW - modeling.
VL - 7
JA - IEEE Transactions on Visualization and Computer Graphics
ER -
 

Abstract—This paper introduces a refined general definition of a skeleton that is based on a penalized-distance function and cannot create any of the degenerate cases of the earlier Ceasar and Teasar algorithms. Additionally, we provide an algorithm that finds the skeleton accurately and rapidly. Our solution is fully automatic, which frees the user from having to engage in manual data preprocessing. We present the accurate skeletons computed on a number of test datasets. The algorithm is very efficient as demonstrated by the running times which were all below seven minutes.

[1] I. Bitter, M. Sato, M. Bender, K.T. McDonnell, A. Kaufman, and M. Wan, “CEASAR: A Smooth, Accurate and Robust Centerline Extraction Algorithm,” Proc. IEEE Visualization 2000, pp. 45-52, 2000.
[2] D. Chen, B. Li, Z. Liang, M. Wan, A. Kaufman, and M. Wax, “A Tree-Branch Searching, Multiresolution Approach to Skeletonization for Virtual Endoskopy,” Proc. SPIE Int'l Symp. Medical Imaging 2000, pp. 726-734, Feb. 2000.
[3] E.W. Dijkstra, “A Note on Two Problems in Connexion with Graphs,” Numerishe Mathemetik, vol. 1, pp. 269-271, 1959.
[4] Y. Ge, D.R. Stelts, and D.J. Vining, “3D Skeleton for Virtual Colonoscopy,” SPIE, 1995.
[5] Y. Ge, D.R. Stelts, J. Wang, and D.J. Vining, “Computing the Centerline of a Colon: A Robust and Efficient Method Based on 3D Skeletons,” J. Computer Assisted Tomography, vol. 23, no. 5, pp. 786-794, 1999.
[6] T. He and A. Kaufman, “Collision Detection for Volumetric Models,” Proc. IEEE Visualization '97, pp. 27-34, Oct. 1997.
[7] L. Hong, S. Muraki, A. Kaufman, D. Bartz, and T. He, "Virtual Voyage: Interactive Navigation In The Human Colon," Computer Graphics, pp. 27-34, Aug. 1997. ACM/SIGGRAPH Press.
[8] F.A. Jolesz, W.E. Lorensen, H. Shinmoto, H. Atsumi, S. Nakajima, P. Kavanaugh, P. Saiviroonpron, S.E. Seltzer, S.G. Silverman, M. Philips, and R. Kikinis, “Interactive Virtual Endoscopy,” Am. J. Roentgenology, vol. 169, pp. 1229-1235, Nov. 1997.
[9] A.F. Kaufman, Volume Visualization. IEEE CS Press, 1990.
[10] S. Lakare, M. Wan, M. Sato, and A. Kaufman, “3D Digital Cleansing Using Segmentation Rays,” Proc. IEEE Visualization 2000, pp. 37-44, 2000.
[11] E.G. McFarland, G. Wang, J.A. Brink, D.M. Balfe, J.P. Heiken, and M.W. Vannier, “Spiral Computed Tomographic Colonography: Determination of the Central Axis and Digital Unraveling of the Colon,” Academy of Radiology, vol. 4, pp. 367-373, 1997.
[12] D.S. Paik, C.F. Beaulieu, R.B. Jeffery, G.D. Rubin, and S. Napel, “Automated Flight Path Planning for Virtual Endoscopy,” Medical Physics, vol. 25, no. 5, pp. 629-637, 1998.
[13] T. Pavlidis, “A Thinning Algorithm for Discrete Binary Images,” Computer Graphics and Image Processing, vol. 13, pp. 142-157, 1980.
[14] L. Piegl and W. Tiller, The NURBS Book.New York: Springer-Verlag, 1995.
[15] T. Saito and J. Toriwaki, “New Algorithms for Euclidian Distance Transformantion of an n-Dimensional Digitized Picture with Applications,” Pattern Recognition, vol. 27, no. 11, pp. 1551-1565, 1994.
[16] Y. Samara, M. Fiebrich, A. Dachman, J. Kuniyoshi, K. Doi, and K.R. Hoffmann, “Automated Calculation of the Centerline of the Human Colon on CT Images,” Academy of Radiology, vol. 6, pp. 352-359, 1999.
[17] M. Sato, I. Bitter, M. Bender, A. Kaufman, and M. Nakajima, “TEASAR: Tree-Structure Extraction Algorithm for Accurate and Robust Skeletons,” Proc. Pacific Graphics 2000, pp. 281-289, Oct. 2000.
[18] I. Sobel, “An Isotropic 3x3x3 Volume Gradient Operator,” Hewlett-Packard's Voxelator V-3 CD-ROM, Aug. 1996. Online Information athttp://www.hp.com/infovoxelator(Paper is only on CD, not online).
[19] F. Yamaguchi, Curves and Surfaces in Computer Aided Geometric Design. Berlin: Springer-Verlag, 1988.
[20] Y. Zhou and A.W. Toga, “Efficient Skeletonization of Volumetric Objects,” IEEE Trans. Visialization and Computer Graphics, vol. 5, no. 3, pp. 196-209, July-Sept. 1999.

Index Terms:
Skeleton, centerline, medial axis, automatic preprocessing, modeling.
Citation:
Ingmar Bitter, Arie E. Kaufman, Mie Sato, "Penalized-Distance Volumetric Skeleton Algorithm," IEEE Transactions on Visualization and Computer Graphics, vol. 7, no. 3, pp. 195-206, July-Sept. 2001, doi:10.1109/2945.942688
Usage of this product signifies your acceptance of the Terms of Use.