Add to ORKGThe article is concerned with the development and comparison of three different algorithms for the computation of first-arrival traveltimes: the fast marching method (FMM), the group marching method (GMM), and a second-order finite difference eikonal solver. GMM is introduced as a variant of FMM. It proceed
First arrival traveltimes and associated amplitudes are essential components in Kirchhoff migration ...
International audienceIn \cite{CFFM06}, the authors have proposed a generalization of the classical ...
We employ a Monte Carlo-based optimization scheme called generalized simulated annealing to invert f...
The traditional Fast Marching Method (FMM) based on the finite-difference scheme can solve the trave...
Conventional finite difference eikonal solvers produce only the first arrival time. However suitable...
Fast methods are very popular algorithms to compute time-of-arrival maps (distance maps measured in ...
Abstract. We continue the work that was initiated in [7] on a marching method for simulating two-pha...
International audienceSeismic traveltimes and their spatial derivatives are the basis of many imagin...
The governing equation of the first arrival time of a monotonically propagating front (wavefront or ...
In these notes, we present an introduction to the classical Fast Marching Method (FMM). The FMM has ...
The determination of first-arrival seismic traveltimes radiating outward from a point-source in an a...
Abstract. A computational study of the fast marching and the fast sweeping methods for the eikonal e...
The problem of determining an optimal path for an object moving through some obstacle space presents...
The amplitude computation requires an accurate approximation for the traveltime gradient and Laplaci...
In [4], the authors have proposed a generalization of the classical Fast Marching Method of Sethian ...
First arrival traveltimes and associated amplitudes are essential components in Kirchhoff migration ...
International audienceIn \cite{CFFM06}, the authors have proposed a generalization of the classical ...
We employ a Monte Carlo-based optimization scheme called generalized simulated annealing to invert f...
The traditional Fast Marching Method (FMM) based on the finite-difference scheme can solve the trave...
Conventional finite difference eikonal solvers produce only the first arrival time. However suitable...
Fast methods are very popular algorithms to compute time-of-arrival maps (distance maps measured in ...
Abstract. We continue the work that was initiated in [7] on a marching method for simulating two-pha...
International audienceSeismic traveltimes and their spatial derivatives are the basis of many imagin...
The governing equation of the first arrival time of a monotonically propagating front (wavefront or ...
In these notes, we present an introduction to the classical Fast Marching Method (FMM). The FMM has ...
The determination of first-arrival seismic traveltimes radiating outward from a point-source in an a...
Abstract. A computational study of the fast marching and the fast sweeping methods for the eikonal e...
The problem of determining an optimal path for an object moving through some obstacle space presents...
The amplitude computation requires an accurate approximation for the traveltime gradient and Laplaci...
In [4], the authors have proposed a generalization of the classical Fast Marching Method of Sethian ...
First arrival traveltimes and associated amplitudes are essential components in Kirchhoff migration ...
International audienceIn \cite{CFFM06}, the authors have proposed a generalization of the classical ...
We employ a Monte Carlo-based optimization scheme called generalized simulated annealing to invert f...