This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Parallel Computation of the Euclidean Distance Transform on a Three-Dimensional Image Array
March 2003 (vol. 14 no. 3)
pp. 203-212

Abstract—In a two- or three-dimensional image array, the computation of Euclidean distance transform (EDT) is an important task. With the increasing application of 3D voxel images, it is useful to consider the distance transform of a 3D digital image array. Because the EDT computation is a global operation, it is prohibitively time consuming when performing the EDT for image processing. In order to provide the efficient transform computations, parallelism is employed. In this paper, we first derive several important geometry relations and properties among parallel planes. We then, develop a parallel algorithm for the three-dimensional Euclidean distance transform (3D_EDT) on the EREW PRAM computation model. The time complexity of our parallel algorithm is O(\log^2 N) for an N \times N \times N image array and this is currently the best known result. A generalized parallel algorithm for the 3D-EDT is also proposed. We implement the proposed algorithms sequentially, the performance of which exceeds the existing algorithms (proposed by Yamada, Toriwaki). Finally, we develop the corresponding parallel programs on both the emulated EREW PRAM model computer and the IBM SP2 to verify the speed-up properties of the proposed algorithms.

[1] S.G. Akl, The Design and Analysis of Parallel Algorithms. Orlando, Fl.: Academic Press, 1989.
[2] S.G. Akl and K.A. Lyons, Parallel Computational Geometry, Prentice Hall, Englewood Cliffs, N.J., 1993.
[3] C. Arcelli and G. Sanniti di Baja, “A Width-Independent Fast Thinning Algorithm,” IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 7, pp. 463-474, 1985.
[4] C. Arcelli and G. Sanniti de Baja,“Computing Voronoi diagrams in digital pictures,” Pattern Recognition Letters, pp. 383-389, 1986.
[5] H. Blum, “A Transformation for Extracting New Descriptors of Shape,” Models for the Perception of Speech and Visual Form, Mass.: MIT Press, W. Wathen-Dunn, ed., pp. 362-380, 1967.
[6] G. Borgefors, “Distance Transformations in Arbitrary Dimensions,” Computer Vision, Graphics, and Image Processing, vol. 27, pp. 321-345, 1984.
[7] G. Borgefors, “Distance Transforms in Digital Images,” Computer Vision, Graphics, and Image Processing, vol. 34, pp. 344-371, 1986.
[8] G. Borgefors, “Applications of Distance Transforms,” Aspects of Visual Form Processing, A. Arcelli et al., eds., pp. 83-108, 1994.
[9] G. Borgefors, “On Digital Distance Transforms in Three Dimensions,” Computer Vision, Graphics, and Image Processing, vol. 64, pp. 368-376, 1996.
[10] L. Chen and H.Y.H. Chuang, "A Fast Algorithm for Euclidean Distance Maps of a 2-D Binary Image," Information Processing Letters, vol. 51, pp.25-29, 1994.
[11] L. Chen and H.Y.H. Chuang, "An Efficient Algorithm for Complete Euclidean Distance Transform on Mesh-Connected SIMD," Parallel Computing, vol. 21, no. 5, pp. 841-852, 1995.
[12] P.E. Danielsson, “Euclidean Distance Mapping,” Computer Vision, Graphics, and Image Processing, vol. 14, pp. 227-248, 1980.
[13] A. Fujiwara, T. Masuzawa, and H. Fujiwara, "An Optimal Parallel Algorithm for the Euclidean Distance Maps," Information Processing Letters, vol. 54, pp. 295-300, 1995.
[14] A. Fujiwara, M. Inoue, T. Masuzawa, and H. Fujiwara, “A Parallel Algorithm for Weighted Distance Transforms,” Proc. 11th Int'l Parallel Processing Symp., pp. 407-412, 1997.
[15] T. He and A. Kaufman, “Collision Detection for Volumetric Models,” Proc. IEEE Visualization '97, pp. 27-34, Oct. 1997.
[16] T. Hirata, "A Unified Linear-Time Algorithm for Computing Distance Maps," Information Processing Letters, vol. 58, pp. 129-133, 1996.
[17] J. J'aJ'a, An Introduction to Parallel Algorithms.New York: Addison-Wesley, 1992.
[18] J.F. Jenq and S. Sahni, "Serial and Parallel Algorithms for Medial Axis Transform," IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 14, no. 12, pp. 1,218-1,224, Dec. 1992.
[19] M.N. Kolountzakis and K.N. Kutulakos,“Fast computationion of the Euclidean distance map for binary images,” Information Processing Letters, vol. 43, pp. 181-184, 1992.
[20] Y.H. Lee and S.J. Horng, “Fast Parallel Chessboard Distance Transform Algorithm,” Proc. Int'l Conf. Parallel and Distributed Systems, pp. 488-493, 1996.
[21] Y.H. Lee and S.J. Horng, “The Equivalence of the Chessboard Distance Transform and the Medial Axis Transform,” Proc. 10th Int'l Parallel Processing Symp., pp. 424-428, 1996.
[22] Y.-H. Lee, S.-J. Horng, T.-W. Kao, F.-S. Jaung, Y.-J. Chen, and H.-R. Tsai, "Parallel Computation of Exact Euclidean Distance Transform," Parallel Computing, vol. 22, no. 2, pp. 311-325, 1996.
[23] Y.H. Lee, S.J. Horng, T.W. Kao, and Y.J. Chen, “Parallel Computing Euclidean Distance Transform on the Mesh of Trees and Hypercube Computer,” Computer Vision and Image Understanding, vol. 68, pp. 109-119, 1997.
[24] Y.H. Lee and S.J. Horng, “Equivalence of the Chessboard Distance Transform and the Medial Axis Transform,” Int'l J. Computer Math., vol. 65, pp. 165-177, 1997.
[25] Y.H. Lee and S.J. Horng, “Optimal Computing the Chessboard Distance Transform on Parallel Processing Systems,” Computer Vision and Image Understanding, vol. 73, pp. 374-390, 1999.
[26] Y.H. Lee, S.J. Horng, and J. Seitzer, Fast Computation of the 3D Euclidean Distance Transform on the EREW PRAM Model Proc. 2001 Int'l Conf. Parallel Processing, pp. 471-478, 2001.
[27] J. Mayer and G.G. Langdon, “Post-Processing Enhancement of Decompressed Images Using Variable Order Bezier Polynomials and Distance Transform,” IEEE Proc. 1998 Data Compression Conf., p. 561, 1998.
[28] D.W. Paglieroni,“A unified distance transform algorithm and architecture,” Machine Vision and Applications, vol. 5, pp. 47-55, 1992.
[29] D.W. Pagliero,“Distance transforms,” Computer Vision, Graphics, and Image Processing: Graphical models and Image Processing, vol. 54, pp. 56-74, 1992.
[30] Y. Pan, M. Hamdi, and K. Li, “Euclidean Distance Transform for Binary Images on Reconfigurable Mesh-Connected Computers,” IEEE Trans. Systems, Man, and Cybernetics, vol. 30, pp. 240-244, 2000.
[31] A. Rosenfeld and J. Pfaltz,“Sequential operations in digital picture processing,” J. ACM, vol. 13, pp. 471-494, 1966.
[32] A. Rosenfeld and J.L. Pfalz, “Distance Function on Digital Pictures,” Pattern Recognition, vol. 1, pp. 33-61, 1968.
[33] A. Rosenfeld and A.C. Kak,Digital Picture Processing. Academic Press, 2nd ed., 1982
[34] T. Saito and J. Toriwaki, “New Algorithms for Euclidean Distance Transformation of an n-Dimensional Digitized Picture with Applications,” Pattern Recognition, vol. 27, pp. 1551-1565, 1994.
[35] O. Schwarzkopf, “Parallel Computation of Distance Transforms,” Algorithmica, vol. 6, pp. 685-697, 1991.
[36] A. Utsumi, T. Miyasato, F. Kishino, J. Ohya, and R. Ryohei, “Multiple-Camera Based Hand Pose Estimation Method Using Distance Transformation,” J. Institute of Image Information and Television Engineers, vol. 51, pp. 2116-2125, 1997.
[37] H. Yamada, “Complete Euclidean Distance Transformation by Parallel Operation,” Proc. Seventh Int'l Conf. Pattern Recognition, vol. 1, pp. 69-71, 1984.
[38] Q.Z. Ye, "The Signed Euclidean Distance Transform and Its Applications," Int'l Conf. Pattern Recognition, pp. 495-499, 1988.

Index Terms:
Computer vision, Euclidean distance, distance transform, image processing, parallel algorithm, three-dimension, EREW PRAM model.
Citation:
Yu-Hua Lee, Shi-Jinn Horng, Jennifer Seitzer, "Parallel Computation of the Euclidean Distance Transform on a Three-Dimensional Image Array," IEEE Transactions on Parallel and Distributed Systems, vol. 14, no. 3, pp. 203-212, March 2003, doi:10.1109/TPDS.2003.1189579
Usage of this product signifies your acceptance of the Terms of Use.