Coherence measures applied to 3-D seismic data volumes have proven to be an effective method for imaging geological discontinuities such as faults and stratigraphic features. By removing the seismic wavelet from the data, seismic coherence offers interpreters a different perspective, often exposing subtle features not readily apparent in the seismic data. Several formulations exist for obtaining coherence estimates. The first three generations of coherence algorithms at Amoco are based, respectively, on cross correlation, semblance, and an eigendecomposition of the data covariance matrix. Application of these three generations to data from the Gulf of Mexico indicates that the implementation of the eigenstructure approach described in this paper produces the most robust results. This paper first introduces the basic eigenstructure approach for computing coherence followed by a comparison on data from the Gulf of Mexico. Next, Appendix A develops a theoretical connection between the well‐known semblance and the less well‐known eigenstructure measures of coherence in terms of the eigenvalues of the data covariance matrix. Appendix B further extends the analysis by comparing the semblance- and eigenstructure‐based coherence measures in the presence of additive uncorrelated noise.

We have used crosscorrelation, semblance, and eigenstructure algorithms to estimate coherency. The first two algorithms calculate coherency over a multiplicity of trial time lags or dips, with the dip having the highest coherency corresponding to the local dip of the reflector. Partially because of its greater computational cost, our original eigenstructure algorithm calculated coherency along an implicitly flat horizon. Although generalizing the eigenstructure algorithm to search over a range of test dips allowed us to image coherency in the presence of steeply dipping structures, we were somewhat surprised that this generalization concomitantly degenerated the quality of the fault images in flatter dip areas. Because it is a local estimation of reflector dip (including as few as five traces), the multidip coherency estimate provides an algorithmically correct, but interpretationally undesirable, estimate of the best apparent dip that explained the offset reflectors across a fault. We ameliorate this problem using two methods, both of which require the smoothing of a locally inaccurate estimate of regional dip. We then calculate our eigenstructure estimate of coherency only along the dip of the reflector, thereby providing maximum lateral resolution of reflector discontinuities. We are thus both better able to explain the superior results obtained by our earliest eigenstructure analysis along interpreted horizon slices, yet able to extend this resolution to steeply dipping reflectors on uninterpreted cubes of seismic data.

We give a detailed comparison of damping and difference smoothing as means of regularising inverse calculations. We show that damping is potentially disastrous in multiparameter inversions since the small singular values may control long-spatiai-wavelength features in the solution, whereas difference smoothing avoids this problem entirely by down-weighting the rough singular vectors wherever they happen to lie in the spectrum. Further, we show that regularisation can produce rather different results depending on whether the inversion is done via jumping or creeping. In particular, we find that if the inversion is regularised by difference smoothing, then jumping and creeping will give the same results only if the initial model is smooth. We illustrate these ideas by inverting refracted seismic arrivals to image the Earth's near-surface weathering layer. This 'refraction statics' problem has a fundamental long-wavelength ambiguity, so damping merely introduces undesirable long-wavelength perturbations to the solution.

Due to ill-conditioning of the linearised forward problem and the presence of noise in most data, inverse problems generally require some kind of 'regularisation' in order to generate physically plausible solutions. The most popular method of regularised inversion is damped least squares. Damping sometimes forces the solution to be smoother than it otherwise would be by raising all of the eigenvalues in an ad hoc fashion. An alternative is described, based upon the method of least-absolute deviation, which has a property known in the statistical literature as robustness. An account of robust inversion methods-their history and computational developments-is given. The key computational technique turns out to be preconditioned conjugate gradient, an algorithm which had as its genesis 'the method of orthogonal vectors' by Fox, Huskey and Wilkinson (1948). Applications are illustrated from seismic tomography and inverse scattering, two of the most computationally intensive tasks in inverse theory.

This paper describes the application of tomography t o seismic travel-time inversion. There are various implementations of travel-time tomography. In reflection tomography, sources and receivers are on the surface of the Earth and the principal seismic events are reflections from subsurface velocity discontinuities. In transmission tomography, sources and/or receivers may be buried beneath the surface and the events correspond to direct, or unreflected, arrivals; this is the analogue of medical tomography. There are also cases in which both direct as well as reflected arrivals are important, such as in Vertical Seismic Profiling. The latter is a direct application of the first two, but is not discussed in any detail here. It is also shown how the iterative use of travel-time tomography and depth migration can produce much enhanced subsurface images. Examples of both transmission tomography and reflection tomography combined with depth migration illustrate the methods.