New sequential exact Euclidean distance transform algorithms based on convex analysis

Image and Vision Computing

Volumn 27, Issue 1-2, 2009, Pages 37-44

  Lucet, Yves ^a  

^a UNIVERSITY OF BRITISH COLUMBIA   (Canada)

Author keywords

Computational convex analysis; Distance transform; Euclidean distance; Fast Legendre transform; Feature transform; Fenchel conjugate; Legendre Fenchel transform; Moreau envelope; Moreau Yosida approximate

Indexed keywords

COMPUTATIONAL CONVEX ANALYSIS; DISTANCE TRANSFORM; EUCLIDEAN DISTANCE; FAST LEGENDRE TRANSFORM; FEATURE TRANSFORM; FENCHEL CONJUGATE; LEGENDRE-FENCHEL TRANSFORM; MOREAU ENVELOPE; MOREAU-YOSIDA APPROXIMATE;

MATHEMATICAL TRANSFORMATIONS;

EID: 54549090988     PISSN: 02628856     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.imavis.2006.10.011     Document Type: Article

References (43)

1. Rosenfeld A., and Pfaltz J.L. Sequential operations in digital picture processing. J. ACM 13 4 (1966) 471-494
2. P.-E. Danielsson, Euclidean distance mapping, Comput. Graph. Image Process. 14 (1980) 227-248.
3. Borgefors G. Distance transformations in digital images. Comput. Vis. Graph. Image Process. 34 3 (1986) 344-371
4. Borgefors G. Distance transformations on hexagonal grids. PRL 9 (1989) 97-105
5. O. Cuisenaire, Distance transformations: fast algorithms and applications to medical image processing, Ph.D. thesis, Université Catholique de Louvain, Louvain-la-Neuve, Belgium (Oct. 1999).
6. J. Toriwaki, K. Mori, Distance transformation and skeletonization of 3d pictures and their applications to medical images, in: R.K.E.G. Bertrand, A. Imiya (Eds.), Digital and Image Geometry: Advanced Lectures, Lecture Notes in Computer Science, vol. 2243/2001, Springer-Verlag Heidelberg, 2001, pp. 412-429.
7. S. Prohaska, H.C. Hege, Fast visualization of plane-like structures in voxel data, in: VIS '02: Proceedings of the Conference on Visualization '02, IEEE Computer Society, Boston, MA, 2002, pp. 29-36..
8. Breu H., Gil J., Kirkpatrick D., and Werman M. Linear time Euclidean distance transform algorithms. IEEE Trans. Pattern Anal. Mach. Intell. 17 5 (1995) 529-533
9. Chen L., and Chuang H.Y.H. A fast algorithm for Euclidean distance maps of a 2-d binary image. Inform. Process. Lett. 51 1 (1994) 25-29
10. Maurer Jr. C.R., Qi R., and Raghavan V.V. A linear time algorithm for computing exact euclidean distance transforms of binary images in arbitrary dimensions. IEEE Trans. Pattern Anal. Mach. Intell. 25 2 (2003) 265-270
11. Shih F.Y., and Wu Y.-T. Fast Euclidean distance transformation in two scans using a 3 × 3 neighborhood. Comput. Vis. Image Underst. 93 2 (2004) 195-205
12. L. Deniau, J. Blanc-Talon, Fractal analysis with Hausdorff distance under affine transformations, Tech. rep., ETCA-CREA-SP (1995).
13. P.F. Felzenszwalb, D.P. Huttenlocher, Distance transforms of sampled functions, Tech. Rep. TR2004-1963, Cornell Computing and Information Science (Sep. 2004).
14. M. Gavrilova, M.H. Alsuwaiyel, Two algorithms for computing the Euclidean distance transform, Tech. Rep. 2000-661-13, Computer Science Technical Reports, University of Calgary (2000).
15. O. Cuisenaire, B. Macq, Fast and exact signed Euclidean distance transformation with linear complexity, in: Proc. of ICASSP'99, vol. 6, IEEE, Phoenix, AZ, USA, 1999, pp. 3293-3296, Int. Conference on Acoustics, Speech and Signal Processing.
16. D.G. Bailey, An efficient Euclidean distance transform, in: R. Klette, J. Žunić (Eds.), Combinatorial Image Analysis: 10th International Workshop, IWCIA 2004, Auckland, New Zealand, December 1-3, 2004. Proceedings, Lecture Notes in Computer Science, vol. 3322, Springer-Verlag GmbH, 2004, pp. 394-408.
17. W. Hesselink, A linear-time algorithm for euclidean feature transform sets, http://www.cs.rug.nl/~wim/pub/mans.html/ (May 2005).
18. S. Mauch, A fast algorithm for computing the closest point and distance transform, http://www.acm.caltech.edu/seanm/projects/cpt/cpt.pdf/ (Dec. 2000).
19. C. Sigg, R. Peikert, M. Gross, Signed distance transform using graphics hardware, in: Proceedings of IEEE Visualization '03, ETH Zürich, 2003.
20. Y. Lucet, Fast Moreau envelope computation I: Numerical algorithms, Tech. rep., University of British Columbia Okanagan (2005).
21. Rockafellar R.T., and Wets R.J.-B. Variational Analysis (1998), Springer-Verlag, Berlin
22. Rockafellar R.T. Convex Analysis (1970), Princeton University Press, Princeton, New york
23. J.-B. Hiriart-Urruty, C. Lemaréchal, Convex Analysis and Minimization Algorithms, vol. 305-306 of Grundlehren der Mathematischen Wissenschaften [Fundamental Principles of Mathematical Sciences], Springer-Verlag, Berlin, 1993, vol I: Fundamentals, vol II: Advanced theory and bundle methods.
24. K. Yosida, Functional analysis, Classics in Mathematics, Springer-Verlag, Berlin, 1995, reprint of the sixth (1980) edition.
25. Moreau J.-J. Propriétés des applications "prox". C. R. Acad. Sci. Paris 256 (1963) 1069-1071
26. Moreau J.-J. Proximité et dualité dans un espace Hilbertien. Bull. Soc. Math. France 93 (1965) 273-299
27. Moreau J.-J. Convexity and duality. Functional Analysis and Optimization (1966), Academic Press, New York 145-169
28. Brenier Y. Un algorithme rapide pour le calcul de transformées de Legendre-Fenchel discrètes. C. R. Acad. Sci. Paris Sér. I Math. 308 (1989) 587-589
29. Corrias L. Fast Legendre-Fenchel transform and applications to Hamilton-Jacobi equations and conservation laws. SIAM J. Numer. Anal. 33 4 (1996) 1534-1558
30. Lucet Y. A fast computational algorithm for the Legendre-Fenchel transform. Comput. Optimizat. Appl. 6 1 (1996) 27-57
31. Noullez A., and Vergassola M. A fast Legendre transform algorithm and applications to the adhesion model. J. Scient. Comput. 9 3 (1994) 259-281
32. She Z.-S., Aurell E., and Frisch U. The inviscid Burgers equation with initial data of brownian type. Comm. Math. Phys. 148 3 (1992) 623-641
33. Lucet Y. Faster than the fast legendre transform, the linear-time legendre transform. Numer. Algorithms 16 2 (1997) 171-185
34. Bec J., Frisch U., and Khanin K. Kicked Burger turbulence. J. Fluid Mech. 416 (2000) 239-267
35. Frisch U., and Bec J. Burgulence. In: Lesieur A.M., and David E.F. (Eds). Les Houches 2000: New Trends in Turbulence (2001), Springer EDP-Sciences 341-383
36. Frisch U., Bec J., and Villone B. Singularities and the distribution of density in the Burgers/adhesion model. Phys. D 152-153 (2001) 620-635
37. A. Noullez, S.N. Gurbatov, E. Aurell, S.I. Simdyankin, The global picture of self-similar and not self-similar decay in Burgers turbulence, Tech. Rep. nlin.CD/0409022, arXiv.org eprint archive (Sep. 2004).
38. B. Koopen, Contact of bodies in 2D-space: Implementing the Discrete Legendre Transform, AI Master's thesis, Intelligent Autonomous Systems Group, University of Amsterdam (Feb. 2002).
39. T. Hisakado, K. Okumura, V. Vukadinovic, L. Trajkovic, Characterization of a simple communication network using Legendre transform, in: Proc. IEEE Int. Symp. Circuits and Systems, vol. 3, 2003, pp. 738-741.
40. Lucet Y. A linear Euclidean distance transform algorithm based on the Linear-time Legendre Transform. Proceedings of the Second Canadian Conference on Computer and Robot Vision (CRV 2005) (2005), IEEE Computer Society Press, Victoria BC
41. P. Helluy, Simulation numérique des écoulements multiphasiques : De la théorie aux applications, Ph.D. thesis, Institut des Sciences de l'Ingenieur de Toulon et du Var, Laboratoire Modélisation Numérique et Couplages, BP 56, 83162 La Valette CEDEX, France, habilitation à Diriger des Recherches (Jan. 2005).
42. Legras B., Pisso I., Berthet G., and Lefvre F. Variability of the Lagrangian turbulent diffusion in the lower stratosphere. Atmospheric Chem. Phys. 5 (2005) 1605-1622
43. R. Fabbri, Scilab image processing toolbox, 2005. http://siptoolbox.sourceforge.net/.