next up previous print clean
Next: The dataset Up: M. Clapp and R. Previous: Introduction

Basic theory

Our inversion scheme is based on the downward-continuation migration explained by Prucha et al. (1999a). To summarize, this migration is carried out by downward continuing the wavefield in frequency space, slant stacking at each depth, and extracting the image at zero time. The result is an image in depth (z), space (x and y), and offset ray parameter (ph). Offset ray parameter is related to the reflection angle ($\theta$) and the dip angle of the reflector ($\phi$)in 2-D as:

{\partial t \over \partial h}=p_{h}=\frac{2 \sin \theta \cos\phi}{V\left(z,x\right)}.\end{displaymath} (1)

In complex areas, the image produced by downward-continuation migration will suffer from poor illumination. To compensate for this, we use the migration as an operator in a least-squares inversion. The inversion procedure used in this paper can be expressed as fitting goals as follows:

{\bf 0} & \approx & {\bf Lm}\ -\ {\bf d}
\\ {\bf 0} & \approx & \epsilon {\bf A m}. \nonumber\end{eqnarray} (2)

The first equation is the ``data fitting goal,'' meaning that it is responsible for making a model that is consistent with the data. The second equation is the ``model styling goal,'' meaning that it allows us to impose some idea of what the model should look like using the regularization operator ${\bf A}$. The model styling goal also helps to prevent a divergent result.

In the data fitting goal, ${\bf d}$ is the input data and ${\bf m}$ is the image obtained through inversion. ${\bf L}$ is a linear operator, in this case it is the adjoint of the downward-continuation migration scheme summarized above and explained by Prucha et al. (1999b). In the model styling goal, ${\bf A}$ is a regularization operator and $\epsilon$ controls the strength of the regularization.

Unfortunately, the inversion process described by fitting goals (2) can take many iterations to produce a satisfactory result. We can reduce the necessary number of iterations by making the problem a preconditioned one. We use the preconditioning transformation ${\bf m = A^{-1}p}$ Fomel et al. (1997); Fomel and Claerbout (2003) to give us the following fitting goals:

{\bf 0} & \approx & {\bf LA^{-1}p}\ -\ {\bf d}
\\ {\bf 0} & \approx & \epsilon {\bf p}. \nonumber\end{eqnarray} (3)
${\bf A^{-1}}$ is obtained by mapping the multi-dimensional regularization operator ${\bf A}$ to helical space and applying polynomial division Claerbout (1998). We call this least-squares minimization scheme Regularized Inversion with model Preconditioning (RIP).

The question now is what the regularization operator ${\bf A}$ is. In this paper, we will use geophysical regularization, which acts horizontally along the offset ray parameter axis Clapp (2003). It is designed to penalize sudden large changes in amplitudes, such as those caused by poor illumination.

next up previous print clean
Next: The dataset Up: M. Clapp and R. Previous: Introduction
Stanford Exploration Project