A high performance 3D exact euclidean distance transform algorithm for distributed computing

International Journal of Pattern Recognition and Artificial Intelligence

Volumn 24, Issue 6, 2010, Pages 897-915

  Torelli, Julio Cesar ^a   Fabbri, Ricardo ^b   Travieso, Gonzalo ^a   Bruno, Odemir Martinez ^a  

^a UNIVERSITY OF SÃO PAULO   (Brazil)

^b BROWN UNIVERSITY   (United States)

Author keywords

distributed computing; Euclidean distance transform; parallel computing

Indexed keywords

3-D IMAGE; APPLIED MATHEMATICS; CLUSTER OF WORKSTATIONS; COMMUNICATION TIME; DATA COMPRESSION TOOLS; DISTRIBUTED COMPUTING; DOMAIN DECOMPOSITIONS; EDT ALGORITHMS; EUCLIDEAN DISTANCE TRANSFORMS; EXACT EUCLIDEAN DISTANCE; LOW-BANDWIDTH; PARALLEL COMPUTING; PARALLEL IMPLEMENTATIONS;

BANDWIDTH COMPRESSION; CLUSTERING ALGORITHMS; COMPUTER VISION; DOMAIN DECOMPOSITION METHODS; IMAGE ANALYSIS; PARALLEL ARCHITECTURES; PIPELINE PROCESSING SYSTEMS; THREE DIMENSIONAL;

DATA COMPRESSION;

EID: 77957163495     PISSN: 02180014     EISSN: None     Source Type: Journal    
DOI: 10.1142/S0218001410008202     Document Type: Article

References (33)

1. A. R. Backes, D. Casanova and O. M. Bruno, Plant leaf identification based on volumetric fractal dimension, Int. J. Patt. Recogn. Artif. Intell. 23 (2009) 1145-1160.
2. O. M. Bruno, R. de O. Plotze, M. Falvo and M. de Castro, Fractal dimension applied to plant identification, Inform. Sci. 178 (2008) 2722-2733.
3. O. M. Bruno and L. F. Costa, A parallel implementation of exact Euclidean distance transform based on exact dilations, Microprocessors and Microsystems 28(3) (2004) 107-113.
4. H. D. Ceniceros and A. M. Roma, A multi-phase flow method with a fast, geometry-based fluid indicator, J. Comput. Phys. 205(2) (2005) 391-400.
5. L. Chen and H. Y. H. Chuang, An efficient algorithm for complete Euclidean distance transform on mesh-connected simd, Parallel Computing 21(5) (1995) 841-852.
6. L. Chen, Y. Pan, Y. Chen and X. Xu, Efficient parallel algorithms for Euclidean distance transform, The Computing J. 47(6) (2004) 694-700.
7. O. Cuisenaire and B. Macq, Fast and exact signed Euclidean distance transformation with linear complexity, Proc. IEEE Int. Conf. Acoustics, Speech and Signal Processing (1999), pp. 3293-3296.
8. O. Cuisenaire and B. Macq, Fast Euclidean distance transformations by propagation using multiple neighborhoods, Comput. Vis. Imag. Underst. 76(2) (1999) 163-172.
9. O. Cuisenaire, Distance Transformations: Fast Algorithms and Applications to Medical Image Processing, PhD thesis, Université Catholique de Louvain (1999).
10. P. E. Danielsson, Euclidean distance mapping, Comput. Graph. Imag. Process. 14 (1980) 227-248.
11. H. Eggers, Two fast Euclidean distance transformations in z2 based on sufficient propagation, Comput. Vis. Imag. Underst. 69(1) (1998) 106-116.
12. R. Fabbri, L. Da F. Costa, J. C. Torelli and O. M. Bruno, 2d Euclidean distance transform algorithms: A comparative survey, ACM Comput. Surv. 40(1) (2008) 1-44.
13. I. Foster, Designing and Building Parallel Programs (Addison-Wesley, Reading, MA, 1995).
14. M. Frucci, Oversegmentation reduction by flooding regions and digging watershed lines, Int. J. Patt. Recogn. Artif. Intell. 20(1) (2006) 15-38.
15. W.-F. Kuo, C.-Y. Lin and Y.-N. Sun, Region similarity relationship between watershed and penalized fuzzy hopfield neural network algorithms for brain segmentation, Int. J. Patt. Recogn. Artif. Intell. 22(7) (2008) 1403-1425.
16. 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 Comput. 22 (1996) 311-325.
17. Y. Lee, S. Horng, T. Kao and Y. Chen, Parallel computation of the Euclidean distance transform on the mesh of trees and the hypercube computer, Comput. Vis. Imag. Underst. 68(1) (1997) 109-119.
18. Y. Lee, S. Horng and J. Seltzer, Parallel computation of the euclidean distance transform on a three-dimensional image array, Parall. Distrib. Syst. 14(3) (2003) 203-212.
19. R. A. Lotufo, A. A. Falcão and F. A. Zampirolli, Fast Euclidean distance transform using a graph-search algorithm, Proc. Brazilian Symp. Computer Graphics and Image Processing (2000), pp. 269-275.
20. R. A. Lotufo and F. A. Zampirolli, Fast multi-dimensional parallel Euclidean distance transform based on mathematical morphology, Proc. Brazilian Symp. Computer Graphics and Image Processing (2001), pp. 100-105.
21. Y. Lu, C. Xiao and C. L. Tan, Constructing area voronoi diagram based on direct calculation of the freeman code of expanded contours, Int. J. Patt. Recogn. Artif. Intell. 21(5) (2007) 947-960.
22. 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. Patt. Anal. Mach. Intell. 25(2) (2003) 265-270.
23. S. Osher and J. A. Sethian, Fronts propagating with curvature-dependent speed, J. Comput. Phys. 79(1) (1988) 12-49.
24. A. Rosenfeld and J. L. Pfaltz, Sequential operations in digital picture processing, J. Assoc. Comp. Mach. 13 (1966) 471-494.
25. J. C. Russ, The Image Processing Handbook (CRC Press, Boca Raton, FL, 2002).
26. T. Saito and J. I. Toriwaki, New algorithms for Euclidean distance transformation of an n-dimensional digitized picture with applications, Patt. Recogn. 27(11) (1994) 1551-1565.
27. J. A. Sethian, Level Set Methods: Evolving Interfaces in Geometry, Fluid Mechanics, Computer Vision, and Materials Science (Cambridge University Press, Cambridge, 1996).
28. F. Y. Shih and C. C. Pu, A skeletonization algorithm by maxima tracking on Euclidean distance transform, Patt. Recogn. 28(3) (1995) 331-341.
29. F. Y. Shih and Y. T. Wu, Three-dimensional Euclidean distance transformation and its application to shortest path planning, Patt. Recogn. 37(1) (2004) 79-92.
30. L. Vicent and P. Soille, Watersheds in digital spaces: An efficient algorithm based on immersion simulations, IEEE Trans. Patt. Anal. Mach. Intell. 13(6) (1991) 583-598.
31. R. Xia, W. Liu, Y. Wang and X. Wu, Fast initialization of level set method and an improvement to chan-vese model, Int. Conf. Computer and Information Technology (2004), pp. 18-23.
32. H. Yamada, Complete Euclidean distance operation by parallel operation, Proc. Int. Conf. Patt. Recogn. (1984), pp. 69-71.
33. Q. Z. Ye, The signed Euclidean distance transform and its applications, Proc. Int. Conf. Patt. Recogn. (1988), pp. 495-499.