Optimal separable algorithms to compute the reverse euclidean distance transformation and discrete medial axis in arbitrary dimension

IEEE Transactions on Pattern Analysis and Machine Intelligence

Volumn 29, Issue 3, 2007, Pages 437-448

  Coeurjolly, David ^a   Montanvert, Annick ^b,c  

^a UNIVERSITÉ LYON 1   (France)

^b GRENOBLE INSTITUTE OF TECHNOLOGY   (France)

^c UNIV GRENOBLE ALPES   (France)

Author keywords

d dimensional shapes; Distance transformation; Medial axis extraction; Reverse Euclidean distance transformation; Shape representation

Indexed keywords

ALGORITHMS; FEATURE EXTRACTION; GEOMETRY; IMAGE RECONSTRUCTION; SIGNAL FILTERING AND PREDICTION;

DISTANCE TRANSFORMATION; MEDIAL AXIS EXTRACTION; REVERSE EUCLIDEAN DISTANCE TRANSFORMATION; SHAPE REPRESENTATION;

BINARY IMAGES;

ALGORITHM; ARTICLE; ARTIFICIAL INTELLIGENCE; AUTOMATED PATTERN RECOGNITION; COMPUTER ASSISTED DIAGNOSIS; EVALUATION; IMAGE ENHANCEMENT; INFORMATION RETRIEVAL; MATHEMATICAL COMPUTING; METHODOLOGY; SIGNAL PROCESSING; THREE DIMENSIONAL IMAGING;

ALGORITHMS; ARTIFICIAL INTELLIGENCE; IMAGE ENHANCEMENT; IMAGE INTERPRETATION, COMPUTER-ASSISTED; IMAGING, THREE-DIMENSIONAL; INFORMATION STORAGE AND RETRIEVAL; NUMERICAL ANALYSIS, COMPUTER-ASSISTED; PATTERN RECOGNITION, AUTOMATED; SIGNAL PROCESSING, COMPUTER-ASSISTED;

EID: 33847382795     PISSN: 01628828     EISSN: None     Source Type: Journal    
DOI: 10.1109/TPAMI.2007.54     Document Type: Article

References (44)

1. A. Rosenfeld and J.L. Pfaltz, "Sequential Operations in Digital Picture Processing," J. ACM, vol. 13, no. 4, pp. 471-494, Oct. 1966.
2. A. Rosenfeld and J.L. Pfalz, "Distance Functions on Digital Pictures," Pattern Recognition, vol. 1, pp. 33-61, 1968.
3. G. Borgefors, "Distance Transformations in Digital Images," Computer Vision, Graphics, and Image Processing, vol. 34, no. 3, pp. 344-371, June 1986.
4. E. Remy and E. Thiel, "Optimizing 3D Chamfer Masks with Norm Constraints," Proc. Int'l Workshop Combinatorial Image Analysis, pp. 39-56, July 2000.
5. C. Fouard and G. Malandain, "3-D Chamfer Distances and Norms in Anisotropic Grids," Image and Vision Computing, vol. 23, no. 2, pp. 143-158, Feb. 2005.
6. J. Mukherjee, P.P. Das, M.A. Kumarb, and B.N. Chatterjib, "On Approximating Euclidean Metrics by Digital Distances in 2D and 3D," Pattern Recognition Letters, vol. 21, no. 6-7, pp. 573-582, 2000.
7. B. Nagy, "A Comparison among Distances Based on Neighborhood Sequences in Regular Grids," Proc. 14th Scandinavian Conf. Image Analysis, pp. 1027-1036, 2005.
8. P.-E. Danielsson, "Euclidean Distance Mapping," Computer Graphics and Image Processing, vol. 14, pp. 227-248, 1980.
9. I. Ragnemalm, Contour Processing Distance Transforms, pp. 204-211. World Scientific, 1990.
10. J.C. Mullikin, "The Vector Distance Transform in Two and Three Dimensions," Computer Vision, Graphics, and Image Processing, vol. 54, no. 6, pp. 526-535, Nov. 1992.
11. O. Cuisenaire and B. Macq, "Fast Euclidean Distance Transformations by Propagation Using Multiple Neighbourhoods," Computer Vision and Image Understanding, vol. 76, no. 2, pp. 163-172, Nov. 1999.
12. H. Breu, J. Gil, D. Kirkpatrick, and M. Werman, "Linear Time Euclidean Distance Transform Algorithms," IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 17, no. 5, pp. 529-533, May 1995.
13. C. Gotsman and M. Lindenbaum, "Euclidean Voronoi Labeling on the Multidimensional Grid," Pattern Recognition Letters, vol. 16, pp. 409-415, 1995.
14. W. Guan and S. Ma, "A List-Processing Approach to Compute Voronoi Diagrams and the Euclidean Distance Transform," IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 20, no. 7, pp. 757-761, July 1998.
15. C.R. Maurer, R. Qi, and V. Raghavan, "A Linear Time Algorithm for Computing Exact Euclidean Distance Transforms of Binary Images in Arbitrary Dimensions," IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 25, no. 2, pp. 265-270, Feb. 2003.
16. T. Saito and J.I. Toriwaki, "New Algorithms for Euclidean Distance Transformations of an n-Dimensional Digitized Picture with Applications," Pattern Recognition, vol. 27, pp. 1551-1565, 1994.
17. T. Hirata, "A Unified Linear-Time Algorithm for Computing Distance Maps," Information Processing Letters, vol. 58, no. 3, pp. 129-133, May 1996.
18. A. Meijster, J. 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, pp. 331-340, Kluwer, 2000.
19. H. Blum, "A Transformation for Extracting Descriptors of Shape," Models for the Perception of Speech and Visual Forms, pp. 362-380, MIT Press, 1967.
20. U. Montanari, "Continuous Skeletons from Digitized Images," J. ACM, vol. 16, no. 4, pp. 534-549, Oct. 1969.
21. P. Giblin and B.B. Kimia, "On the Local Form and Transitions of Symmetry Sets, Medial Axes, and Shocks," Int'l J. Computer Vision, vol. 54, nos. 1-3, pp. 143-157, 2003.
22. P. Giblin and B.B. Kimia, "A Formal Classification of 3D Medial Axis Points and Their Local Geometry," IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 26, no. 2, pp. 238-251, Feb. 2004.
23. 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.
24. F.F. Leymarie and M.D. Levine, "Simulating the Grassfire Transform Using an Active Contour Model," IEEE Trans. Pattern Analysis Machine Intelligence, vol. 14, no. 1, pp. 56-75, Jan. 1992.
25. R. Kimmel, D. Shaked, N. Kiryati, and A.M. Bruckstein, "Skeletonization via Distance Maps and Level Sets," Computer Vision and Image Understanding, vol. 62, no. 3, pp. 381-391, 1995.
26. K. Siddiqi, S. Bouix, A. Tannenbaum, and S. Zucker, "The Hamilton-Jacobi Skeleton," Proc. Seventh IEEE Int'l Conf. Computer Vision, vol. 2, pp. 828-834, Sept. 1999.
27. J.H. Chuang, C.H. Tsai, and M.C. Ko, "Skeletonization of Three-Dimensional Object Using Generalized Potential Field," IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 22, no. 11, pp. 1241-1251, Nov. 2000.
28. R. Klette and A. Rosenfeld, Digital Geometry, Geometric Methods for Digital Picture Analysis, series in computer graphics and geometric modeling. Morgan Kaufmann, 2004.
29. G.S. di Baja, "Well-Shaped, Stable, and Reversible Skeletons from the (3, 4)-Distance Transform," J. Visual Comm. and Image Representation, vol. 5, pp. 107-115, 1994.
30. E. Remy and E. Thiel, "Medial Axis for Chamfer Distances: Computing Look-Up Tables and Neighbourhoods in 2D or 3D," Pattern Recognition Letters, vol. 23, no. 6, pp. 649-661, 2002.
31. I. Ragnemalm, "The Euclidean Distance Transform," PhD dissertation, Linko"ping Univ., Linko"ping, Sweden, 1993.
32. Y. Ge and J.M. Fitzpatrick, "On the Generation of Skeletons from Discrete Euclidean Distance Maps," IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 18, no. 11, pp. 1055-1066, Nov. 1996.
33. T. Saito and J.-I. Toriwaki, "Reverse Distance Transformation and Skeletons Based upon the Euclidean Metric for n-Dimensionnal Digital Pictures," IECE Trans. Information & Systems, vol. 77, no. 9, pp. 1005-1016, Sept. 1994.
34. E. Remy and E. Thiel, "Exact Medial Axis with Euclidean Distance," Image and Vision Computing, vol. 23, no. 2, pp. 167-175, 2005.
35. G. Borgefors and I. Nyström, "Efficient Shape Representation by Minimizing the Set of Centers of Maximal Discs/Spheres," Pattern Recognition Letters, vol. 18, pp. 465-472, 1997.
36. F. Nilsson and P.-E. Danielsson, "Finding the Minimal Set of Maximum Disks for Binary Objects," Graphical Models and Image Processing, vol. 59, no. 1, pp. 55-60, Jan. 1997.
37. D. Attali, G.S. di Baja, and E. Thiel, "Pruning Discrete and Semiocontinuous Skeletons," Proc. Eighth Int'l Conf. Image Analysis and Processing, pp. 488-493, 1995.
38. G. Malandain and S. Fernández-Vidal, "Euclidean Skeletons," Image Vision Computer, vol. 16, no. 5, pp. 317-327, 1998.
39. F.P. Preparata and M.I. Shamos, Computational Geometry: An Introduction. Springer-Verlag, 1985.
40. D. Coeurjolly, "Algorithmique et Géométrie Discréte pour la Caractérisation des Courbes et des Surfaces," PhD dissertation, Université Lumière Lyon 2, Bron, Laboratoire ERIC, Dec. 2002.
41. 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, Apr. 2005.
42. F. Aurenhammer, "Power Diagrams: Properties, Algorithms, and Applications," SIAMJ. Computing, vol. 16, no. 1, pp. 78-96, Feb. 1987.
43. J.D. Boissonnat, A. Cerezo, O. Devillers, J. Duquesne, and M. Yvinec, "An Algorithm for Constructing the Convex Hull of a Set of Spheres in Dimension d," Computational Geometry: Theory and Applications, vol. 6, no. 2, pp. 123-130, 1996.
44. N. Amenta, S. Choi, and R.K. Kolluri, "The Power Crust, Unions of Balls, and the Medial Axis Transform," Computational Geometry: Theory and Applications, vol. 19, no. 2-3, pp. 127-153, 2001.