semicircle versus hyperbola

Author has no known email address

## ABSTRACTThe correctness of an adjoint operator entirely depends on the correctness of the corresponding forward modeling operator. In migration, the input-oriented algorithm implies more correct forward modeling than the output-oriented algorithm does. One big difference between the two algorithms is the domain of interpolation, and this is one of the major sources of migration artifacts. Whereas the input-oriented algorithm requires interpolation in the model space, the output-oriented algorithm requires interpolation in the data space. For Kirchhoff migration, the method of semicircle superposition and the method of hyperbola summation correspond to the input-oriented and output-oriented algorithms, respectively. The same analogy can be applied to Stolt migration. Levin (1994) suggested the input-oriented algorithm that is the counterpart to the output-oriented algorithm suggested by the SEP ``in-time" group (Popovici et al., 1993; Lin et al.,1993; Blondel and Muir, 1993) |

An adjoint operator to a forward modeling operator is often a good processing operator for estimating approximate model parameters from data that are assumed to follow the presumed forward modeling operator (Claerbout, 1992). Two of the most widely used approaches for finding the adjoint operator can be explained in three steps as follows:

- Approach 1
- 1.
- Formulate the forward operator in the continuous sense.
- 2.
- Write down the adjoint operator to the continuous forward operator.
- 3.
- Discretize the continuous adjoint operator.

- Approach 2
- 1.
- Formulate the forward operator in the continuous sense.
- 2.
- Discretize the continuous forward operator.
- 3.
- Take the Hermitian adjoint of this discrete operator.

The difference between the adjoint operators acquired by theese two approaches is a weighting factor. The adjoint operator obtained by the first approach has a weighting factor that is the Jacobian, but the one found by the second approach does not have it. The Jacobian appears while finding the adjoint operator in the continuous sense.

With each approach, there are two types of adjoint operators that depends on the discretizing space. While the discretization of an operator along the data space results in an algorithm that requires looping over the data space, the discretization of an operator along the model space results in an algorithm that requires looping over model space. An example is hyperbolic summation versus semicircular superposition in the Kirchhoff migration.

Even though the discretization of an operator along the data space is more correct than the other approach in simulating the real experiment, we are used to discretizing along the model space because of the ease of numerical implementation. Claerbout has reported, however, some advantages of the algorithm that uses looping over model space in NMO (Claebout, 1990) and velocity scanning (Claebout, 1989).

This paper compares the two algorithms that require looping over the data space and over the model space, in terms of the implied forward modeling operator and tests both algorithms with and without Jacobian in Kirchhoff migration and Stolt migration

FORWARD MODELING Even though the model space of the real world, ,is continuous space, the data, ,acquired are usually regularly discretized samples. In order to formulate a forward modeling operator that relates the continuous model space and the discrete data space, let us assume that is the operator which relates continuous model space into continuous data space, and that is a sampling operator. Then the entire forward modeling operator, ,can be obtained by cascading both operators, as follows:

(1) |

frd-oprtheight=2.in,width=3.in The shape of the forward modelling operator (). The dotted line represents the discrete data space, and the solid line represents the continuous model space. Notice that the operator is continuous in the model space and discrete in the data space.

There are two possible adjoint operators to the forward operator shown in equation (1). One case is when we assume the forward operator to be two cascaded operators such as .Then the adjoint operator has the form like .Here, is a simple transposed matrix of ,but is not a simple transposed matrix because an adjoint operator in a continuous domain cannot be straightforwardly defined by transposing a corresponding matrix (we simply do not have the matrix). Instead another equivalent property can be used for dot-product definition (Claerbout, 1992); Jedlicka (1989) suggested the Euclidean norms. If we find with respect to the Euclidean norms, the Jacobian appears in the process of variable substitution.

The other case is when we assume the forward operator to be a whole operator like .Then the adjoint operator has a form like . Even though this adjoint cannot be shown in an explicit matrix form because the model space is continuous (Figure frd-oprt), we can implement this easily by looping over the data space or, in other words, using the input-oriented algorithm.

Since the operators and are not commutative,

the order of the two operators is very important in defining the forward modeling operator.Defining our operator, ,to have the form of instead of ,results in a different forward modeling operator,

(2) |

Again we have two possible adjoint operators to the forward operator shown in equation (2), which can be derived the same way as I explained before.

frd-oprt-conheight=2.in,width=3.in The shape of the forward modelling operator (). The dotted line represents the discrete model space, and the solid line represents the continuous data space. Notice that the operator is continuous in the data space and discrete in the model space.

Even though the continuous forward operators implied by both equations (1) and (2) are same, the algorithms for corresponding adjoint operators are different. Equation (1) leads us to the input-oriented algorithm, equation (2) to the output-oriented algorithm. In SEP-65 Claerbout (1989) reported differences between the two algorithms in velocity scanning. In the following two sections, I compare the two formulations for the Kirchhoff and Stolt migrations.

KIRCHHOFF MODELING AND MIGRATION The simplest zero-offset Kirchhoff modeling and migration algorithm connects the data space and the model space using the relation between travel time and distance

(3) |

If we assume the forward modeling has the form of equation (2), the corresponding Kirchhoff migration turns out to be the hyperbolic summation algorithm, which is especially popular these days. If we assume the forward modeling has the form of equation (1), however, the corresponding Kirchhoff migration turns out to be the semicircle-superposition, which is the classical approach (Schneider, 1971).

In the continuous formulation in both data and model spaces the hyperbolic and semicircle approaches produce same results. In the real world, however, the data space is discrete and the model space is also required to be discrete for the purpose of representation. Thus, the hyperbolic and semicircle approaches differ because equation (3) doesn't allow mapping from regularly discretized data space to model space and vice versa.

If we use the hyperbolic summation approach, the interpolation in the data space is required because a point in the model space never produces a hyperbola that fits into a regular grid in the data space. In contrast, if we use the semicircle-superposition approach, the interpolation in the model space is required for the same reason as with the hyperbola approach. If we recall the implied forward modeling operator, the semicircle approach seems to be the appropriate one. However, because of the efficiency of the hyperbolic approach in computer implementation, there has been a tendency to ignore the semicircle approach.

In order to investigate the possible advantage
of the semicircle approach,
I tested it and compared the results
with those of the hyperbola approach.
Figure kir-img-data shows a model and synthesized data.
The model was generated using Claerbout's **Sigmoid** code
with a fine sampling interval to avoid aliasing in the model space,
and the data were generated using Claerbout's **kirchslow** algorithm.
The sampling interval of the model used is so small
that we can assume the modeled data is very
close to the continuous situation.

Figure 1

In order to simulate the discretized data along the surface, I subsampled the data (Figure kir-img-data) with sampling interval two, five, and ten times larger than the original one. First, the hyperbola summation was tested with and without the Jacobian for these subsampled data; the results appear in Figure kir-img-com-hp. In this case, the Jacobian does not seem to be helpful at all. Next the semicircle-superposition algorithm was tested with and without the Jacobian for the same subsampled data, and the results are shown in Figure kir-img-com-sc. Again the Jacobian does not seem to be helpful at all.

The results from both approaches are quite similar except for some artifacts in the image obtained by the hyperbolic summation. These artifacts are concentrated mainly in the portion where high dip events are located in the model space, which can be explained by the operator aliasing in the hyperbolic summation.

Figure 2

Figure 3

STOLT MODELING AND MIGRATION The Stolt (1978) modeling and migration algorithm relates the data spectrum space and the model spectrum space using the dispersion relation

(4) |

In Stolt modeling and migration, unlike Kirchhoff methods,
the interpolation is
very important because the mapping from model and data is done in
the spectrum domain.
Recent SEP articles ( Popovici et al., 1993; Lin et al., 1993;
Blondel and Muir, 1993) report on the testing of
a Stolt migration and modeling method
using the slow Fourier transform to reduce
interpolation artifacts.
Their algorithm implies the interpolation in the data space
by slow Fourier transform along the irregularly located ,which is related to the regularly sampled in *k*_{z}.
This method assumes that the forward modeling has
the form of equation (2),
and the corresponding Stolt migration
turns out to be spectrum mapping following the hyperbolic equation.

As with the relation between the semicircle-superposition and hyperbolic-summation, there is an alternative to the slow Fourier transform along time axis. It is slow Fourier transform along the depth axis, as suggested by Levin (1994). This implies that the forward modeling has the form of equation (1), and the corresponding Stolt migration turns out to be spectrum mapping following the semicircle equation.

To show the spectrum mapping strategy in both approaches, each point in the model and data spectra are mapped and shown in Figures stolt-com2 and stolt-com3, which also contain impulse responses. The impulse responses indicate that the interpolation in the data space shows fewer artifacts than the interpolation in the model space. However, the impulse response sometimes hides the defects of the operator, which is the case in these examples.

For a more accurate comparison, the migration operators of the both approaches were tested on the Sigmoid model of Figure kir-img-data; the results are shown in Figures stolt-sig-com-hp and stolt-sig-com-sc. In these results, similar patterns of artifacts appear, and generally the input-orient algorithm produces a better image than the output-orient algorithm.

Unlike the Kirchhoff case, in this case, the Jacobian seems to help reduce the artifacts with both approaches (see Figures stolt-sig-com-hp and stolt-sig-com-sc.)

Figure 4

Figure 5

Figure 6

Figure 7

The correctness of an adjoint operator depends entirely on the correctness of the corresponding forward modeling operator. In migration, the input-oriented algorithm implies more correct forward modeling than the output-oriented algorithm. One big difference between two algorithms is the domain of interpolation, which is one of the major sources of migration artifacts. The input-oriented algorithm requires interpolation in the model space, but the output-oriented algorithm requires interpolation in the data space. In both algorithms, the Jacobian may or may not appear according to the definition of the implied forward operators. The usefulness of the existence of the Jacobian is not yet clear. The tests seem to indicate that the Jacobian helps in Stolt migration but did not in Kirchhoff migration.

- Blondel, P., and Muir, F., 1993, Parallel computing exhumes slow Fourier transform: SEP-
**79**, 265-268.

- Claerbout, J. F., 1990, Hyperbola tricks: SEP-
**65**, 241-246.

- Claerbout, J. F., 1992, Earth Soundings Analysis: Processing versus Inversion: Blackwell Scientific Publications.

- Jedlicka, J., 1989, Velocity analysis by inversion:
SEP-
**61**, 41-68.

- Levin, A. S., 1994, Stolt without artifacts? - dropping the Jacobian: SEP-
**80**, 513-532.

- Lin, J. Y., Teng, L., and Muir. F., 1993, Comparison of different interpolation methods for Stolt migration: SEP-
**79**, 255-260.

- Ottolini, R., 1990, Pixel-precise transforms as dip filters: SEP-
**67**, 51-56.

- Popovici, A. M., Blondel, P., and Muir, F., 1993, Interpolation in Stolt migration: SEP-
**79**, 261-264.

- Schneider, W. A., 1971, Developments in seismic data processing and analysis (1968-1970): Geophysics
**36**, 1043-1073.

- Stolt, R. H., 1978, Migration by Fourier transform:
Geophysics
**43**, 23-48.

The definition of an adjoint operator in a continuous domain cannot be done straightforwardly by transposing a corresponding matrix (we simply do not have the matrix). Instead another equivalent property is used for definition:

(5) |

The definition of the simplest Kirchhoff modeling operator is

(6) |

(7) | ||

(8) |

(9) | ||

(10) | ||

(11) |

Finally we have the Kirchhoff migration operator is

(12) |

5/15/2001