The Community for Technology Leaders
RSS Icon
Subscribe
Issue No.12 - December (2008 vol.30)
pp: 2204-2217
Wim H. Hesselink , University of Groningen, Groningen
Jos B.T.M. Roerdink , University of Groningen, Groningen
ABSTRACT
A general algorithm for computing Euclidean skeletons of 2D and 3D data sets in linear time is presented. These skeletons are defined in terms of a new concept, called the integer medial axis (IMA) transform. We prove a number of fundamental properties of the IMA skeleton, and compare these with properties of the CMD (centers of maximal disks) skeleton. Several pruning methods for IMA skeletons are introduced (constant, linear and square-root pruning) and their properties studied. The algorithm for computing the IMA skeleton is based upon the feature transform, using a modification of a linear-time algorithm for Euclidean distance transforms. The skeletonization algorithm has a time complexity which is linear in the number of input points, and can be easily parallelized. We present experimental results for several data sets, looking at skeleton quality, memory usage and computation time, both for 2D images and 3D volumes.
INDEX TERMS
Curve, surface, solid, and object representations, Image Representation, Edge and feature detection, Feature representation, Shape, Volume visualization
CITATION
Wim H. Hesselink, Jos B.T.M. Roerdink, "Euclidean Skeletons of Digital Image and Volume Data in Linear Time by the Integer Medial Axis Transform", IEEE Transactions on Pattern Analysis & Machine Intelligence, vol.30, no. 12, pp. 2204-2217, December 2008, doi:10.1109/TPAMI.2008.21
REFERENCES
[1] J.L. Pfaltz and A. Rosenfeld, “Computer Representation of Planar Regions by Their Skeletons,” Comm. ACM, vol. 10, pp. 119-125, 1972.
[2] A. Webb, Statistical Pattern Recognition. Ar nold, 1999.
[3] J.R. Parker, Algorithms for Image Processing and Computer Vision. John Wiley & Sons, 1996.
[4] S. Beucher, “Digital Skeletons in Euclidean and Geodesic Spaces,” Signal Processing, vol. 38, pp. 127-141, 1994.
[5] P. Maragos and R.W. Schafer, “Morphological Skeleton Representation and Coding of Binary Images,” IEEE Trans. Acoustics, Speech, and Signal Processing, vol. 34, pp. 1228-1244, 1986.
[6] F. Meyer, “The Binary Skeleton in Three Steps,” Proc. IEEE Workshop Computer Architecture and Image Database Management, pp. 477-483, 1985.
[7] J. Serra, Image Analysis and Mathematical Morphology. Academic Press, 1982.
[8] H. Talbot and L. Vincent, “Euclidean Skeletons and Conditional Bisectors,” Proc. SPIE Visual Comm. and Image Processing, pp. 862-876, Nov. 1992.
[9] L. Vincent, “Efficient Computation of Various Types of Skeletons,” Proc. SPIE Symp. Medical Imaging, pp. 297-311, Feb. 1991.
[10] F.Y. Shih and C.C. Pu, “A Skeletonization Algorithm by Maxima Tracking on Euclidean Distance Transform,” Pattern Recognition, vol. 28, no. 3, pp. 331-341, 1995.
[11] H. Blum, “A Transformation for Extracting New Descriptors of Shape,” Proc. Symp. Models for the Perception of Speech and Visual Form, W. Wathen-Dunn, ed., pp. 362-380, 1967.
[12] P.E. Danielsson, “Euclidean Distance Mapping,” Computer Graphics and Image Processing, vol. 14, pp. 227-248, 1980.
[13] G. Borgefors, I. Nystrom, and G.S.D. Baja, “Computing Skeletons in Three Dimensions,” Pattern Recognition, vol. 32, no. 7, pp. 1225-1236, 1999.
[14] Y. Ge and J. Fitzpatrick, “On the Generation of Skeletons from Discrete Euclidean Distance Maps,” IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 18, pp. 1055-1066, 1996.
[15] T. Hirata, “A Unified Linear-Time Algorithm for Computing Distance Maps,” Information Processing Letters, vol. 58, pp. 129-133, 1996.
[16] A. Meijster, J.B.T.M. Roerdink, and W.H. Hesselink, “A General Algorithm for Computing Distance Transforms in Linear Time,” Math. Morphology and Its Applications to Image and Signal Processing, J. Goutsias, L. Vincent, and D.S. Bloomberg, eds., pp. 331-340, Kluwer Academic, 2000.
[17] C.R. Maurer Jr., R. Qi, and V. Raghavan, “A Linear Time Algorithm for Computing the Euclidean Distance Transform in Arbitrary Dimensions,” IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 25, no. 2, pp. 265-270, Feb. 2003.
[18] C.R. Maurer Jr., V. Raghavan, and R. Qi, “A Linear Time Algorithm for Computing the Euclidean Distance Transform in Arbitrary Dimensions,” Information Processing in Medical Imaging, pp. 358-364, 2001.
[19] W.H. Hesselink, M. Visser, and J.B.T.M. Roerdink, “Euclidean Skeletons of 3D Data Sets in Linear Time by the Integer Medial Axis Transform,” Math. Morphology: 40 Years On, Proc. Seventh Int'l Symp. Math. Morphology. C. Ronse, L. Najman, and E. Decencière, eds., pp. 259-268, 2005.
[20] D. Attali and A. Montanvert, “Computing and Simplifying 2D and 3D Continuous Skeletons,” Computer Vision and Image Understanding, vol. 67, no. 3, pp. 161-273, 1997.
[21] R. Strzodka and A. Telea, “Generalized Distance Transforms and Skeletons in Graphics Hardware,” Proc. Eurographics IEEE TCVG Symp. Visualization, pp. 221-230, 2004.
[22] E. Remy and E. Thiel, “Look-Up Tables for Medial Axis on Squared Euclidean Distance Transform,” Proc. Int'l Conf. Discrete Geometry for Computer Imagery, pp. 224-235, 2003.
[23] T.Y. Kong and A. Rosenfeld, “Digital Topology: Introduction and Survey,” Computer Vision, Graphics and Image Processing, vol. 48, no. 3, pp. 357-393, 1989.
[24] W.H. Hesselink, “A Linear-Time Algorithm for Euclidean Feature Transform Sets,” Information Processing Letters, vol. 102, pp. 181-186, 2007.
[25] D. Coeurjolly, “$d\hbox{-}{\rm Dimensional}$ Reverse Euclidean Distance Transformation and Euclidean Medial Axis Extraction in Optimal Time,” Proc. Int'l Conf. Discrete Geometry for Computer Imagery, pp.327-337, 2003.
[26] M. Couprie and R. Zrour, “Discrete Bisector Function and Euclidean Skeleton,” Discrete Geometry for Computer Imagery, E.Andres, G. Damiand, and P. Lienhardt, eds., pp. 216-227, Springer, 2005.
[27] W. van der Kallen, “Integral Medial Axis and the Distance between Closest Points,” Regular and Chaotic Dynamics, vol. 12, no. 6, pp. 734-743, 2007.
[28] R.A. Drebin, L. Carpenter, and P. Hanrahan, “Volume Rendering,” Computer Graphics (Proc. SIGGRAPH '88), vol. 22, no. 4, pp.65-74, 1988.
[29] A. Telea and J.J. van Wijk, “An Augmented Fast Marching Method for Computing Skeletons and Centerlines,” Proc. Eurographics— IEEE TCVG Symp. Data Visualization, D. Ebert, P. Brunet, and I.Navazo, eds., pp. 251-ff, 2002.
24 ms
(Ver 2.0)

Marketing Automation Platform Marketing Automation Tool