TL;DR
This paper introduces a fast marching algorithm tailored for the factored eikonal equation, improving accuracy near sources and enabling efficient travel time tomography in 2D and 3D applications.
Contribution
It develops the first fast marching method for the factored eikonal equation, compatible with first and second order schemes, and demonstrates its effectiveness in travel time tomography.
Findings
Efficiently solves the factored eikonal equation in 2D and 3D.
Achieves high accuracy in travel time computation.
Enables inversion of heterogeneous media using the new FM method.
Abstract
The eikonal equation is instrumental in many applications in several fields ranging from computer vision to geoscience. This equation can be efficiently solved using the iterative Fast Sweeping (FS) methods and the direct Fast Marching (FM) methods. However, when used for a point source, the original eikonal equation is known to yield inaccurate numerical solutions, because of a singularity at the source. In this case, the factored eikonal equation is often preferred, and is known to yield a more accurate numerical solution. One application that requires the solution of the eikonal equation for point sources is travel time tomography. This inverse problem may be formulated using the eikonal equation as a forward problem. While this problem has been solved using FS in the past, the more recent choice for applying it involves FM methods because of the efficiency in which sensitivities can…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Code & Models
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
