We propose a numerical algorithm for solving first arrival transmission traveltime tomography problems where the underlying slowness is piecewise continuous. The idea is based upon our previously efficient approach for smooth slowness inversion (Leung & Qian) using the fast sweeping method and the adjoint state method. In this work, we further incorporate the level set method to implicitly represent the discontinuity in the velocity. One main advantage of such implicit representation is that there is no assumption on the number of disjoint components in the inverted structure. The evolution of the level set function will naturally take care of the change in the topology. Like in the previous work, the gradient of the mismatch functional is ...
The inverse problem of tomography is an iterative procedure. It requires the computation of the grad...
Methods are developed for design of linear tomographic reconstruction algorithms with specified prop...
The original publication can be found at www.springerlink.com Copyright © 2005 Birkhauser Verlag, Ba...
International audienceClassical algorithms used for traveltime tomography are not necessarily well s...
International audienceWe compare the standard procedure of delayed first-arrival time tomography bas...
International audienceWavelet decomposition of the slowness model has been proposed as a multiscale ...
International audienceClassical algorithms used for travel time tomography are not necessarily well-...
ei sm ol og y Joint transmission and reflection traveltime tomography using the fast sweeping method...
Fermat's principle shows that a definite convex set of feasible slowness models -- depending on...
Standard refraction travel-time tomography based on ray tracing techniques has difficulties to handl...
The inverse problem of tomography is an iterative procedure. It requires the computation of the grad...
International audienceClassical 3-D refraction traveltime tomography algorithms may suffer from comp...
Traditional straight ray- and curved ray-based tomography algorithms need to perform ray tracing to ...
We propose a double obstacle phase field methodology for binary recovery of the slowness function of...
Conventional finite difference eikonal solvers produce only the first arrival time. However suitable...
The inverse problem of tomography is an iterative procedure. It requires the computation of the grad...
Methods are developed for design of linear tomographic reconstruction algorithms with specified prop...
The original publication can be found at www.springerlink.com Copyright © 2005 Birkhauser Verlag, Ba...
International audienceClassical algorithms used for traveltime tomography are not necessarily well s...
International audienceWe compare the standard procedure of delayed first-arrival time tomography bas...
International audienceWavelet decomposition of the slowness model has been proposed as a multiscale ...
International audienceClassical algorithms used for travel time tomography are not necessarily well-...
ei sm ol og y Joint transmission and reflection traveltime tomography using the fast sweeping method...
Fermat's principle shows that a definite convex set of feasible slowness models -- depending on...
Standard refraction travel-time tomography based on ray tracing techniques has difficulties to handl...
The inverse problem of tomography is an iterative procedure. It requires the computation of the grad...
International audienceClassical 3-D refraction traveltime tomography algorithms may suffer from comp...
Traditional straight ray- and curved ray-based tomography algorithms need to perform ray tracing to ...
We propose a double obstacle phase field methodology for binary recovery of the slowness function of...
Conventional finite difference eikonal solvers produce only the first arrival time. However suitable...
The inverse problem of tomography is an iterative procedure. It requires the computation of the grad...
Methods are developed for design of linear tomographic reconstruction algorithms with specified prop...
The original publication can be found at www.springerlink.com Copyright © 2005 Birkhauser Verlag, Ba...