Abstract

The inverse-scattering series internal multiple prediction and attenuation algorithm predicts multiples using certain combinations of input seismic reflection data events, which are computed in the wavenumber/pseudodepth or plane-wave/vertical traveltime (i.e., [Formula: see text]) domains. Significant differences can arise in the algorithms’ output and computational expense depending on which domain is used. Many of these are traceable to the response of the algorithm to the users’ choice of the search-limiting parameter [Formula: see text]. The question of which domain is optimal can be addressed with benchmark synthetics. The compactness of the input to the plane-wave domain algorithm leads to the expectation that it will have a reduced computational expense. Also, the lack of increase in the dominant period (i.e., the “width”) of input events as the horizontal slowness increases leads to the expectation that it will respond well to a constant [Formula: see text]. Both of these expectations are borne out with a 1.5D benchmark example. A 2D plane-wave prediction requires the data to be transformed to the [Formula: see text], or coupled plane-wave, domain, involving source- and receiver-side horizontal slownesses. An implementation of this transform leads to the first numerical examples of full 2D inverse series [Formula: see text] prediction. The arrival times, relative amplitudes, and moveout patterns of multiples from dipping horizons are seen in a benchmark synthetic example to be faithfully determined in the plane-wave formulation; waveform mismatches are, however, observed, which are traceable to the numerics of the forward and inverse transforms. High-resolution Radon transforms are a good candidate to improve the match.

Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.