    Time migration velocity analysis by velocity continuation  Next: Numerical velocity continuation in Up: Numerical velocity continuation in Previous: Finite-difference approach

## Fourier approach

The change of variable transforms equation (1) to the form (6)

whose coefficients do not depend on the time variables. Double Fourier transform in and further simplifies equation (6) to the ordinary differential equation (7)

where the frequency'' variable corresponds to the stretched time coordinate , and is the wavenumber in : (8)

Equation (7) has an explicit analytical solution (9)

which leads to a very simple algorithm for the numerical velocity continuation. The algorithm consists of the following steps:
1. Input the zero-offset (post-stack) data migrated with velocity (or unmigrated if ).
2. Transform the input from a regular grid in to a regular grid in .
3. Apply Fast Fourier Transform (FFT) in and .
4. Multiply by the all-pass phase-shift filter .
5. Inverse FFT in and .
6. Inverse transform to a regular grid in . t2
Figure 7.
Synthetic seismic data before (left) and after (right) transformation to the grid.   Figure 7 shows a simple synthetic model of seismic reflection data generated from the model in Figure 2 before and after transforming the grid, regularly spaced in , to a grid, regular in . The left plot of Figure 8 shows the Fourier transform of the data. Except for the nearly vertical event, which corresponds to a stack of parallel layers in the shallow part of the data, the data frequency range is contained near the origin in the space. The right plot of Figure 8 shows the phase-shift filter for continuation from zero imaging velocity (which corresponds to unprocessed data) to the velocity of 1 km/sec. The rapidly oscillating part (small frequencies and large wavenumbers) is exactly in the region, where the data spectrum is zero. It corresponds to physically impossible reflection events. t2-fft
Figure 8.
Left: the real part of the data Fourier transform. Right: the real part of the velocity continuation operator (continuation from 0 to 1 km/s) in the Fourier domain.   The described algorithm is very attractive from the practical point of view because of its efficiency (based on the FFT algorithm). The operation count is roughly the same as in the Stolt migration implemented with equation (4): two forward and inverse FFTs and forward and inverse grid transform with interpolation (one complex-number transform in the case of Stolt migration). The velocity continuation algorithm can be more efficient than the Stolt method because of the simpler structure of the innermost loop (step 4 in the algorithm).    Time migration velocity analysis by velocity continuation  Next: Numerical velocity continuation in Up: Numerical velocity continuation in Previous: Finite-difference approach

2013-03-03