Accurate tracking of monotonically advancing fronts

Proceedings of the IEEE Computer Society Conference on Computer Vision and Pattern Recognition

Volumn 1, Issue , 2006, Pages 355-362

  Hassouna, M Sabry ^a   Farag, Aly A ^a  

^a University of Louisville   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

CARTESIAN DOMAINS; FAST MARCHING METHOD (FMM); HAMILTON-JACOBI (HJ) EQUATIONS; NATURAL COORDINATE SYSTEMS;

COMPUTATIONAL COMPLEXITY; COMPUTER VISION; ERROR ANALYSIS; FINITE DIFFERENCE METHOD;

TRACKING (POSITION);

EID: 33845579729     PISSN: 10636919     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/CVPR.2006.46     Document Type: Conference Paper

References (19)

1. D. Adalsteinsson and J. Sethian. A fast level set method for propagating interfaces. Journal of Computational Physics, 118:269-277, 1995.
2. A. M. Bronstein, M. M. Bronstein, and R. Kimmel. Three-dimensional face recognition. International Journal of Computer Vision (IJCV), 64(1):5-30, August 2005.
3. V. Cerveny. Ray synthetic seismograms for complex two- and three-dimensional structures. Journal of Geophysics, 58:2-26, 1985.
4. S. Chen, B. Merriman, S. Osher, and P. Smereka. A simple level set method for solving Stefan problem. Journal of Computational Physics, 138(1);8-29, 1997.
5. D. L. Chopp. Some improvements on the fast marching method. SIAM J. of Scientic Computing, 23(1):230-244, 2001.
6. P.-E. E. Danielsson and Q. Lin. A modified fast marching method. In SCIA, pages 1154-1161, 2003.
7. E. W. Dijkstra. A note on two problems in connexion with graphs. Numerische Mathematik, 1:269-271, 1959.
8. S. Godunov. Finite difference method for numerical computation of discontinuous solutions of the equations of fluid dynamics. Matematicheskii Sbornik, pages 47-271, 1959.
9. S. Kim. Eno-dno-ps: a stable, second-order accuracy eikonal solver. Society of Exploration Geophysicists, pages 1747-1750, 1999.
10. S. Kim. An o(n) level set method for eikonal equations. SIAM J. on Scientific Computing, 22(6):2178-2193, 2001.
11. R. Kimmel and J. Sethian. Computing geodesic paths on manifolds. In Proceedings of National Academy of Sciences, USA, volume 95, pages 8431-8435, 1998.
12. R. Kimmel and J. Sethian. Fast marching methods on trian-gulated domains. PNAS, 95(11):8341-8435, 1998.
13. P. Podvin and I. Lecomte. Finite difference computation of traveltimes in very contrasted velocity models: A massively parallel approach and its associated tools. Geophysical Journal International, 105:271284, 1991.
14. J. Sethian. Level Sets Methods and Fast Marching Methods. Cambridge University Press, 2nd edition, 1999.
15. J. A. Sethian and A. Vladimirsky. Fast methods for the Eikonal and related Hamilton- Jacobi equations on unstructured meshes. PNAS, 97(11):5699-5703, 2000.
16. J. Tsitsiklis. Efficient algorithms for globally optimal trajectories. IEEE Trans. on Automatic Control, 40(9): 1528-1538, 1995.
17. J. van Trier and W. Symes. Upwind finite-difference calculation of traveltimes. Journal of Geophysics, 56:812821, 1991.
18. J. Vidale. Finite-difference calculation of traveltimes in three dimensions. J. of Geophysics, 55:521526, 1990.
19. L. Yatziv, A. Bartesaghi, and G. Sapiro. A fast o(n) implementation of the fast marching algorithm. Journal of Computation Physics, 2005, under print.