This migration operator is used in a Tikhonov regularized Tikhonov and Arsenin (1977) conjugate-gradient least-squares minimization:

(1) |

This inversion procedure can be expressed as fitting goals as follows:

(2) | ||

In the data fitting goal, is the input data and is the image obtained through inversion. is a linear operator, in this case it is the adjoint of the angle-domain wave-equation migration scheme summarized above and explained thoroughly by Prucha et al. (1999b). In the model styling goal, is, as has already been mentioned, a regularization operator. is a weighting operator. controls the strength of the model styling.

Unfortunately, the inversion process described by fitting goals (2) can take many iterations to produce a satisfactory result. I can reduce the necessary number of iterations by making the problem a preconditioned one. I use the preconditioning transformation Fomel et al. (1997); Fomel and Claerbout (2002) to give us these fitting goals:

(3) | ||

is obtained by mapping the multi-dimensional regularization operator to helical space and applying polynomial division Claerbout (1998).

The question now is what the regularization operator is.
I built my regularization operator based on the same assumptions as
Prucha et al. (2000). First, I assume that the correct
velocity is being used in the inversion, therefore there should be no
moveout along the offset ray parameter (*p*_{h}) axis. Second, I assume
that the amplitudes of individual events should vary smoothly and any
drastic changes in amplitude are caused by illumination problems, which
are what we wish to overcome. These assumptions allow me to say that
needs to act to minimize amplitude differences horizontally along
the *p*_{h} axis. Rather than using the derivative operator
used by Kuehl and Sacchi (2001) or the steering filter used by
Prucha et al. (2000), I have created a symmetrical filter by
cascading two steering filters that are mirror images of each other.

10/14/2003