1. Field of the Invention
The present invention relates generally to processing of geological data and more particularly to a system for reducing effects of aliasing in sampled data.
2. Description of the Related Art
Seismic surveys tend to produce sparsely and/or unevenly sampled data. This can result from uneven source and receiver position, system and navigation imperfection, culture obstacles and prohibitive cost of large instrument arrays. On the other hand, many data processing and visualization systems and methods require data that is densely and regularly sampled as input. As a result, it is often necessary to transform data such that it has an appropriate sampling basis.
Aspects of embodiments of the present invention provide a method of method of processing a sampled seismic trace representing information relating to a subsurface region, including estimating Fourier coefficients of the seismic trace using a discrete Fourier transform, selecting the estimated Fourier coefficients by applying a coherence criterion to the estimated Fourier coefficients to reduce an amount of aliased energy represented, by the Fourier coefficients, re-orthogonalizing, in k-space, the Fourier coefficients, and using the re-orthogonalized Fourier coefficients to produce a seismic image of the subsurface region.
Aspects of embodiments of the present invention include a method of imaging a subsurface feature, including receiving a sampled seismic trace including information relating to the subsurface feature, estimating Fourier coefficients of the seismic trace using a discrete Fourier transform, selecting the estimated Fourier coefficients by applying a coherence criterion to the estimated Fourier coefficients to reduce an amount of aliased energy represented by the Fourier coefficients, re-orthogonalizing, in k-space, the Fourier coefficients, and applying an inverse Fourier transform to produce regularized seismic data.
Aspects of embodiments of the invention may include a computer-readable medium encoded with computer-executable instructions for performing the foregoing method or for controlling the foregoing system.
Aspects of embodiments of the invention may include a system incorporating the foregoing system and configured and arranged to provide control of the system in accordance with the foregoing method. Such a system may incorporate, for example, a computer programmed to allow a user to control the device in accordance with the method, or other methods.
These and other objects, features, and characteristics of the present invention, as well as the methods of operation and functions of the related elements of structure and the combination of parts and economies of manufacture, will become more apparent upon consideration of the following description and the appended claims with reference to the accompanying drawings, all of which form a part of this specification, wherein like reference numerals designate corresponding parts in the various Figures. It is to be expressly understood, however, that the drawings are for the purpose of illustration and description only and are not intended as a definition of the limits of the invention. As used in the specification and in the claims, the singular form of “a”, “an”, and “the” include plural referents unless the context clearly dictates otherwise.
Seismic data may be compiled into a two dimensional section, or gather. An example is illustrated in
For data that are well sampled (i.e., sufficient sampling frequency, and sufficiently regularly in time) a Fourier transform may be computed using the fast Fourier transform (FFT) in accordance with Equation 1
P(ω,t)=FTt{P(t,x)} (1)
where FTt is the temporal Fourier transform operator.
For each frequency ω, taking the data as a function of x, Equation 2 may be written:
h(x)=P(ω,x) (2)
As noted above, the assumption may be made that the data are evenly sampled, so that an evenly sampled sequence of this function may be expressed as Equation 3:
hn=h(nΔx)n=0,1, . . . N−1, (3)
The forward discrete Fourier transform (DFT) can be expressed as:
and its inverse (IDFT) as:
On the other hand, for an unevenly sampled sequence of this function:
h(xm)m=0,1, . . . ,M−1, (6)
with 0≦xm<NΔx. The Fourier spectrum may be estimated by:
However, as noted above, irregularities of sampling and boundary effects can cause energy leakage when employing this method.
The inventor has determined that an anti-aliasing method can be employed to estimate the Fourier coefficients even for irregular and/or sparsely sampled data sets such as that illustrated in
For a given gather of unevenly sampled traces:
P(t,xm)m=0,1, . . . ,M−1. (9)
it is possible to use Equations (1) and (7) for each frequency to compute estimated Fourier coefficients:
{circumflex over (P)}(ω,k)k=0,1, . . . ,N−1. (10)
In order to reduce the contribution of aliased energy to the spectrum, an inhibiting function is defined. At the same time, the inhibiting function should retain the energy of the actual events that are under study. Equation 11 provides one example of such an inhibiting function:
In this example, the inhibiting function is a covariance function, and its overall effect is to measure coherence of the signal along a line segment that crosses the origin in ω-k-space. Other measurements of coherence, for example, stacking in accordance with equation 12:
may be used as necessary or desired. As can be see in
For three-dimensional analyses, k represents a radial component of wave-number. In general, this function will produce small values at spectral locations that represent aliased energy. In accordance with an embodiment of the present invention, the inhibiting function is used in conjunction with the Fourier spectra, as described above. This procedure improves the selection of true energy against aliased energy even when they are relatively indistinguishable in terms of power spectra.
One prior art method for reducing Fourier coefficient leakage involves an iterative loop in which Fourier coefficients are calculated, then those coefficients with maximum magnitude are selected. The contribution of those maximum magnitude coefficients is subtracted to re-orthogonalize:
which leads to:
Hk
Note that this method does not address the issue of high-power aliased energy. As can be seen in
Furthermore, because there may tend to be a high computational cost for such an iterative procedure, certain steps may be taken to reduce such costs. In particular, it is possible to move the slow Fourier transform out of the iterative loop so that the data are processed within the wave-number domain within the entire loop. It can be shown that the re-orthogonalization process described above is equivalent to:
where G(k) is a pre-computed function. As a result, the computational cost within the loop is now o(N), instead of o└N2┘. As a special case, when spatial sampling is even, G(k) becomes a periodic δ function.
In an algorithm in accordance with an embodiment of the invention, a first step involves computation of all estimated Fourier coefficients {circumflex over (P)}(0)(ω,k) from P(ω,xm). As an initial starting point set P(ω,k)=0. Once initialized, an iterative loop over l. The above-described inhibiting function Ŵ(l)(ω,k) is computed from {circumflex over (P)}(l)(ω,k), then for each ω, the Fourier coefficient at kl with the maximal Ŵ(l)(ω,k) and |P(l)(ω,l)| and is selected. The loop concludes with re-orthogonalization using equation (15), resulting in equation 16:
P(ω,k)=P(ω,k)+{circumflex over (P)}(l)(ω,k) (16)
whereupon the loop is iterated from the computation of the inhibiting function for the remaining loops l.
Once the aliased energy has been removed, the inverse Fourier transform may be applied to the f-k spectra, resulting in the plot illustrated in
A system for performing the method is schematically illustrated in
Although the invention has been described in detail for the purpose of illustration based oh what is currently considered to be the most practical and preferred embodiments, it is to be understood that such detail is solely for that purpose and that the invention is not limited to the disclosed embodiments, but, on the contrary, is intended to cover modifications and equivalent arrangements that are within the spirit and scope of the appended claims. For example, though reference is made herein to sparsely and irregularly sampled data, the method may likewise be applied to regularly and/or densely sampled data as well. Further, where reference is made to a computer, this may include a general purpose computer, a purpose-built computer, an ASIC programmed to execute the methods, a computer array or network, or other appropriate computing device. As a further example, it is to be understood that the present invention contemplates that, to the extent possible, one or more features of any embodiment can be combined with one or more features of any other embodiment.
Number | Name | Date | Kind |
---|---|---|---|
5850622 | Vassiliou et al. | Dec 1998 | A |
6668228 | Ozbeck et al. | Dec 2003 | B1 |
7751277 | Schonewille | Jul 2010 | B2 |
20030225524 | Iranpour | Dec 2003 | A1 |
Number | Date | Country | |
---|---|---|---|
20090319190 A1 | Dec 2009 | US |