A fast iterative method for Eikonal equations

SIAM Journal on Scientific Computing

Volumn 30, Issue 5, 2007, Pages 2512-2534

  Jeong, Won Ki ^a   Whitaker, Ross T ^a  

^a University of Utah   (United States)

Author keywords

Eikonal equation; Graphics processing unit (GPU); Hamilton jacobi equation; Label correcting method; Parallel algorithm; Viscosity solution

Indexed keywords

COMPUTER GRAPHICS; COMPUTER GRAPHICS EQUIPMENT; GEOMETRICAL OPTICS; INFORMATION MANAGEMENT; ITERATIVE METHODS; PARALLEL ALGORITHMS; PARALLEL ARCHITECTURES; PROGRAM PROCESSORS;

ACTIVE NODE; COMPUTATIONAL TECHNIQUE; EIKONAL EQUATION; GRAPHIC PROCESSING UNIT; HAMILTON - JACOBI EQUATIONS; LABEL-CORRECTING; LABEL-CORRECTING METHOD; ORDERED DATA; VISCOSITY SOLUTIONS; WORST-CASE PERFORMANCE;

GRAPHICS PROCESSING UNIT;

EID: 55349143482     PISSN: 10648275     EISSN: None     Source Type: Journal    
DOI: 10.1137/060670298     Document Type: Article

References (41)

1. D. BERTSEKAS. F. GUERRIERO, AND R. MUSMANNO, Parallel asynchronous label correcting methods for shortest paths, J. Optim. Theory Appl., 88 (1996), pp. 297-320.
2. D. P. BERTSEKAS, Dynamic Programming and Optimal Control, Vol. 1, 3rd ed., Athena Scientific, Nashua, NH, 2005.
3. F. BORNEMANN AND C. RASCH, Finite-element discretization of static Hamilton-Jacobi equations based on a local variational principle, Comput. Vis. Sci., 9 (2006), pp. 57-69.
4. A. M. BRONSTEIN, M. M. BRONSTEIN, Y. S. DEVIR, R. KIMMEL, AND O. WEBER, Parallel algorithms for approximation of distance maps on parametric surfaces, Technical report CIS-2007-03, Technion, Haifa, Israel, 2007.
5. A. M. BRONSTEIN, M. M. BRONSTEIN, AND R. KIMMEL, Weighted distance maps computation on parametric three-dimensional manifolds, J. Comput. Phys., 225 (2007), pp. 771-784.
6. A. BRUSS, The eikonal equation: Some results applicable to computer vision, J. Math. Phys., 23 (1982), pp. 890-896.
7. I. BUCK, T. FOLEY, D. HORN, J. SUGERMAN, K. FATAHALIAN, M. HOUSTON, AND P. HANRAHAN, Brook for GPUs: Stream computing on graphics hardware, ACM Trans. Graph., 23 (2004), pp. 777-786.
8. CELL BROADBAND ENGINE RESOURCE CENTER, http://www.ibm.com/developerworks/power/cell/.
9. P.-E. DANIELSSON, Euclidean distance mapping, Comput. Graphics and Image Processing, 14 (1980), pp. 227-248.
10. M. FALCONE, A numerical approach to the infinite horizon problem of deterministic control theory, Appl. Math. Optim., 15 (1987), pp. 1-13.
11. M. FALCONE, The minimum time problem and its applications to front propagation, in Motion by Mean Curvature and Related Topics (Trento, 1992), de Gruyter, Berlin, 1994, pp. 70-88.
12. M. FALCONE AND P. LANUCARA, Parallel algorithms for Hamilton-Jacobi equations, in ICIAM/GAMMJ95 Special Issue on Zeitschrift für Angewandte Mathematik und Mechanik (ZAMM), Appl. Stochastics Optim. 3, O. Mahrenholtz, K. Marti, and R. Mennicken, eds., Akademie Verlag, Berlin, 1996, pp. 355-359.
13. I. FISCHER AND C. GOTSMAN, Fast Approximation of High Order Voronoi Diagrams and Distance Transforms on the GPU, Technical report CS TR-07-05, Harvard University, Cambridge, MA, 2005.
14. P. A. GREMAUD AND C. M. KUSTER, Computational study of fast methods for the eikonal equation, SIAM J. Sci. Comput., 27 (2006), pp. 1803-1816.
15. K. E. HOFF III, J. KEYSER, M. LIN, D. MANOCHA, AND T. CULVER, Fast computation of generalized Voronoi diagrams using graphics hardware, in Proceedings of SIGGRAPH 1999, ACM, New York, 1999, pp. 277-286.
16. W.-K. JEONG, P. T. FLETCHER, R. TAO, AND R. WHITAKER, Interactive visualization of volumetric white matter connectivity in DT-MRI using a parallel-hardware Hamilton-Jacobi solver, IEEE Trans. Visualization and Computer Graphics, 13 (2007), pp. 1480-1487.
17. U. KAPASI, W. J. DALLY, S. RIXNER, J. D. OWENS, AND B. KHAILANY, The Imagine stream processor, in Proceedings of the 2002 IEEE International Conference on Computer Design, IEEE Computer Society, Washington, DC, 2002, pp. 282-288.
18. S. KIM, An O(N) level set method for eikonal equations, SIAM J. Sci. Comput., 22 (2001), pp. 2178-2193.
19. R. KIMMEL AND J. SETHIAN, Computing geodesic paths on manifolds, Proc. Nat. Acad. Sci. USA, 95 (1998), pp. 8431-8435.
20. A. LEFOHN, J. KNISS, C. HANSEN, AND R. WHITAKER, Interactive deformation and visualization of level set surfaces using graphics hardware, in Proceedings of the IEEE Visualization Conference, IEEE, Washington, DC, 2003, pp. 75-82.
21. R. MALLADI AND J. SETHIAN, A unified approach to noise removal, image enhancement, and shape recovery, IEEE Trans. Image Processing, 5 (1996), pp. 1554-1568.
22. J. MITCHELL, D. MOUNT, AND C. PAPADIMITRIOU, The discrete geodesic problem, SIAM J. Comput., 16 (1987), pp. 647-668.
23. NVIDIA, CUDA Programming Guide, http://developer.nvidia.com/ object/cuda.html, 2007.
24. L. C. POLYMENAKOS, D. P. BERTSEKAS, AND J. N. TSITSIKLIS, Implementation of efficient algorithms for globally optimal trajectories, IEEE Trans. Automat. Control, 43 (1998), pp. 278-283.
25. F. QIN, Y. LUO, K. OLSEN, W. CAI, AND G. SCHUSTER, Finite-difference solution of the eikonal equation along expanding wavefronts, Geophysics, 57 (1992), pp. 478-487.
26. N. RAWLINSON AND M. SAMBRIDGE, The fast marching method: An effective tool for tomographics imaging and tracking multiple phases in complex layered media, Exploration Geophysics, 36 (2005), pp. 341-350.
27. G. RONG AND T.-S. TAN, Jump flooding in GPU with applications to Voronoi diagram and distance transform, in Proceedings of the 2006 Symposium on Interactive 3D Graphics and Games, ACM, New York, 2006, pp. 109-116.
28. E. ROUY AND A. TOURIN, A viscosity solutions approach to shape-from-shading, SIAM J. Numer. Anal., 29 (1992), pp. 867-884.
29. J. SETHIAN, A fast marching level set method for monotonically advancing fronts, Proc. Nat. Acad. Sci. USA, 93 (1996), pp. 1591-1595.
30. J. SETHIAN, Fast marching methods, SIAM Rev., 41 (1999), pp. 199-235.
31. J. SETHIAN, Level Set Methods and Fast Marching Methods, Cambridge University Press, Cambridge, UK, 2002.
32. J. A. SETHIAN AND A. VLADIMIRSKY, Ordered upwind methods for static Hamilton-Jacobi equations: Theory and algorithms, SIAM J. Numer. Anal., 41 (2003), pp. 325-363.
33. R. SHERIFF AND L. GELDART, Exploration Seismology, Cambridge University Press, Cambridge, UK, 1995.
34. K. SIDDIQI, S. BOUIX, A. TANNENBAUM, AND S. ZUCKER, The Hamilton-Jacobi skeleton, in Proceedings of the IEEE International Conference on Computer Vision, IEEE Computer-Society, Washington, DC, 1999, pp. 828-834.
35. C. SIGG, R. PEIKERT, AND M. GROSS, Signed distance transform using graphics hardware, in Proceedings of the 2003 IEEE Visualization Conference, IEEE Computer Society, Washington, DC, 2003, pp. 83-90.
36. A. SPIRA AND R. KIMMEL, An efficient solution to the eikonal equation on parametric manifolds, Interfaces Free Bound., 6 (2004), pp. 315-327.
37. A. SUD, M. A. OTADDY, AND D. MANOCHA, Difi: Fast 3d distance field computation using graphics hardware, Computer Graphics Forum, 23 (2004), pp. 557-566.
38. Y.-H. R. TSAI, L.-T. CHENG, S. OSHER, AND H.-K. ZHAO, Fast sweeping algorithms for a class of Hamilton-Jacobi equations, SIAM J. Numer. Anal., 41 (2003), pp. 673-694.
39. J. TSITSIKLIS, Efficient algorithms for globally optimal trajectories, IEEE Trans. Automat. Control, 40 (1995), pp. 1528-1538.
40. H. ZHAO, A fast sweeping method for eikonal equations, Math. Comput., 74 (2004), pp. 603-627.
41. H. ZHAO, Parallel implementations of the fast sweeping method, J. Comput. Math., 25 (2007), pp. 421-429.