previous up next print clean
Next: Data equalization Up: Theory Previous: Data-space inverse for irregular

The cross-product filter

The inverse of the cross product operator LLT acts as a filter for the data space. Each element Aij of (LLT)-1 measures the correlation between a data element di and another data element dj. The computation of each element Aij requires the evaluation of an inner product in the model space. Since the model space is regularly sampled, the inner products for several imaging operators can be computed analytically which leads to a fast and affordable evaluation of the elements of LLT. This is the case for the solution we present in this paper.

Let's consider an irregularly sampled input of n seismic traces and let Lm,di be the operator that maps trace di into the model space m. The operator that performs the inverse mapping is therefore LTm,di. In matrix notation, we write the cross-product matrix LLT as

 
 \begin{displaymath}
LL^T = \left[ 
 \begin{array}
{cccc}
\left[ L_{(m,d_1)}L^T_{...
 .... &\left[ L_{(m,d_n)}L^T_{(m,d_n)}\right] 
 \end{array} \right]\end{displaymath} (6)
Each inner product $\left[ L_{(m,d_i)}L^T_{(m,d_j)}\right]$ is therefore a reconstruction of a data trace with input offset hi to a new trace with offset hj. We recognize this mapping as our previously-defined AMO transformation. Therefore, we call this cross product filter A, and we write it in terms of its AMO elements as

 
 \begin{displaymath}
{\bf A}= \left[ 
 \begin{array}
{ccccc}
I & A_{(h_1,h_2)} & ...
 ... A_{(h_n,h_2)} & A_{(h_n,h_3)} &...... & I
 \end{array} \right]\end{displaymath} (7)

where A(hi,hj) is AMO from input offset hi to output offset hj and, I is the identity operator (mapping from hi to hi). Comforming to the definition of AMO Biondi et al. (1996), A(hi,hj) is the adjoint of A(hj,hi); therefore, the filter ${\bf A}$ is Hermitian with diagonal elements being the identity and off-diagonal elements being AMO transforms.

This is the fundamental definition of A that will allow a fast and efficient numerical approximation of its inverse, and thus of the whole prestack imaging inverse problem. Being a narrow operator, the cost of applying AMO to prestack data is almost negligible compared to other imaging operators such as prestack migration. When the azimuth rotation or the offset continuation is small, as is the case for geometry regularization problems, the size of the operator is very small, but also has a strong curvature. Biondi et al 1996 discussed the design of an efficient implementation of the AMO operator that avoids aliasing and simultaneously takes advantage of the opportunity for saving computation by properly limiting the spatial extent of the numerical integration.


previous up next print clean
Next: Data equalization Up: Theory Previous: Data-space inverse for irregular
Stanford Exploration Project
11/11/1997