The present disclosure relates to methods for separating contributions from two or more different sources in a common set of measured signals representing a wave field, particularly of seismic sources and of sets of recorded and/or processed seismic signals.
The current disclosure relates to marine seismic surveying, including in particular marine seismic data acquisition. The general practice of marine seismic surveying is described below in relation to
Prospecting for subsurface hydrocarbon deposits (701) in a marine environment (
Seismic sources typically employ a number of so-called airguns (709-711) which operate by repeatedly filling up a chamber in the gun with a volume of air using a compressor and releasing the compressed air at suitable chosen times (and depth) into the water column (712).
The sudden release of compressed air momentarily displaces the seawater, imparting its energy on it, setting up an impulsive pressure wave in the water column propagating away from the source at the speed of sound in water (with a typical value of around ˜1500 m/s) (713).
Upon incidence at the seafloor (or seabed) (714), the pressure wave is partially transmitted deeper into the subsurface as elastic waves of various types (715-717) and partially reflected upwards (718). The elastic wave energy propagating deeper into the subsurface partitions whenever discontinuities in subsurface material properties occur. The elastic waves in the subsurface are also subject to an elastic attenuation which reduces the amplitude of the waves depending on the number of cycles or wavelengths.
Some of the energy reflected upwards (720-721) is sensed and recorded by suitable receivers placed on the seabed (706-708), or towed behind one or more vessels. The receivers, depending on the type, sense and record a variety of quantities associated with the reflected energy, for example, one or more components of the particle displacement, velocity or acceleration vector (using geophones, mems [micro-electromechanical] or other devices, as is well known in the art), or the pressure variations (using hydrophones). The wave field recordings made by the receivers are stored locally in a memory device and/or transmitted over a network for storage and processing by one or more computers.
Waves emitted by the source in the upward direction also reflect downward from the sea surface (719), which acts as a nearly perfect mirror for acoustic waves.
One seismic source typically includes one or more airgun arrays (703-705): that is, multiple airgun elements (709-711) towed in, e.g., a linear configuration spaced apart several meters and at substantially the same depth, whose air is released (near-) simultaneously, typically to increase the amount of energy directed towards (and emitted into) the subsurface.
Seismic acquisition proceeds by the source vessel (702) sailing along many lines or trajectories (722) and releasing air from the airguns from one or more source arrays (also known as firing or shooting) once the vessel or arrays reach particular pre-determined positions along the line or trajectory (723-725), or, at fixed, pre-determined times or time intervals. In
Typically, subsurface reflected waves are recorded with the source vessel occupying and shooting hundreds of shots positions. A combination of many sail-lines (722) can form, for example, an areal grid of source positions with associated inline source spacings (726) and crossline source spacings. Receivers can be similarly laid out in one or more lines forming an areal configuration with associated inline receiver spacings (727) and crossline receiver spacings.
A common and long-standing problem in physical wave field experimentation is how to separate recorded signals from two or more simultaneously emitting sources. In particular, for more than a decade, the simultaneous source problem has (arguably) been the most pertinent problem to solve to efficiently acquire data for 3D reflection seismic imaging of complex Earth subsurface structures.
A method for separating wave fields generated by two or more sources contributing to a common set of measured or recorded signals are provided suited for seismic applications and other purposes, substantially as shown in and/or described in connection with at least one of the figures, and as set forth more completely in the claims.
Advantages, aspects and novel features of the present disclosure, as well as details of illustrated embodiments thereof, may be more fully understood from the following description and drawings.
In the following description reference is made to the attached figures, in which:
Modern digital data processing of wave fields (or signals) uses a discretized version of the original wave field, say g, that is obtained by sampling g on a discrete set. The Nyquist-Shannon sampling theorem shows how g can be recovered from its samples; for an infinite number of equidistant samples and given sample rate k−s, perfect reconstruction is guaranteed provided that the underlying signal was bandlimited to |k|≤k−N=k−s/2 (Shannon, 1949; Nyquist, 1928), where k−N is the so-called Nyquist wavenumber. The Nyquist-Shannon sampling theorem is equally relevant both to signals generated from a single source being recorded on multiple receivers (receiver-side sampling) as well as signals generated from multiple sources and recorded at a single receiver (source-side sampling).
Assume that the wave field g is measured at a specific recording location for a source that is excited at different source positions along an essentially straight line. The sampling theorem then dictates how the source locations must be sampled for a given frequency of the source and phase velocity of the wave field. One aspect of the sampling problem addressed in the current disclosure is as follows. Instead of using one source, we want to use two (or more) sources to, for instance, increase the rate at which data can be acquired. The second source is triggered simultaneously or close in time with the first source while moving along another arbitrarily oriented line to excite the wave field h. At the recording location the wave fields interfere and the sum of the two wave fields, f=g+h, is now measured. There is no known published exact solution to perfectly separate the wave fields g and h that were produced from each source from the combined measurement f (e.g., see Ikelle, 2010; Abma et al., 2015; Kumar et al, 2015; Mueller et al., 2015).
It may therefore be seen as an object of the disclosure, to provide new and improved methods for generating source-separated data. It may also be seen as an object of the present disclosure to extend such methods into fields, where they have not been applied before, such as estimation and removal of seismic interference.
The following examples may be better understood using a theoretical overview as presented below.
The slowest observable (apparent) velocity of a signal along a line of recordings in any kind of wave experimentation is identical to the slowest physical propagation velocity in the medium where the recordings are made. As a result, after a spatial and temporal Fourier transform, large parts of the frequency-wavenumber (ωk) spectrum inside the Nyquist frequency and wavenumber tend to be empty. In particular, for marine reflection seismic data (Robertsson et al., 2015), the slowest observable velocity of arrivals corresponds to the propagation velocity in water (around 1500 m/s).
In a wave field experiment it may be that a source is excited sequentially for multiple source locations along a line while recording the reflected wave field on at least one receiver. The source may be characterized by its temporal signature. In the conventional way of acquiring signals representing a wave field the source may be excited using the same signature from source location to source location, denoted by integer n. Next, consider the alternative way of acquiring such a line of data using a periodic sequence of source signatures: every second source may have a constant signature and every other second source may have a signature which can for example be a scaled or filtered function of the first source signature. Let this scaling or convolution filter be denoted by a(t), with frequency-domain transform A(ω). Analyzed in the frequency domain, using for example a receiver gather (one receiver station measuring the response from a sequence of sources) recorded in this way, can be constructed from the following modulating function m(n) applied to a conventionally sampled and recorded set of wave field signals:
m(n)=½[1+(−1)n]+½A[1−(−1)n],
which can also be written as
m(n)=½[1+eiπn]+½A[1−eiπn]. (0.1)
By applying the function m in Eq. 0.1 as a modulating function to data f(n) before taking a discrete Fourier transform in space (over n), F(k)=(f(n)), the following result can be obtained:
which follows from a standard Fourier transform result (wavenumber shift) (Bracewell, 1999).
Eq. 0.2 shows that the recorded data f will be mapped into two places in the spectral domain as illustrated in
Part of the data will remain at the signal cone centered around k=0 (denoted by H+ in
A particular application of interest that can be solved by using the result in Eq. (0.2) is that of simultaneous source separation. Assume that a first source with constant signature is moved along an essentially straight line with uniform sampling of the source locations where it generates the wave field g. Along another essentially straight line a second source is also moved with uniform sampling. Its signature is varied for every second source location according to the simple deterministic modulating sequence m(n), generating the wave field h. The summed, interfering data f=g+h are recorded at a receiver location.
In the frequency-wavenumber domain, where the recorded data are denoted by F=G+H, the H-part is partitioned into two components H+ and H− with H=H+H− where the H−-component is nearly “ghostly apparent” and isolated around the Nyquist-wavenumber [
The concept may be extended to the simultaneous acquisition of more than two source lines by choosing different modulation functions for each source.
Acquiring a source line where the first two source locations have the same signature, followed by another two with the same signature but modified from the previous two by the function A(ω) and then repeating the pattern again until the full source line has been acquired, will generate additional signal cones centered around ±kN/2.
This process may be referred to as “wave field apparition” or “signal apparition” in the meaning of “the act of becoming visible”. In the spectral domain, the wave field caused by the periodic source sequence is nearly “ghostly apparent” and isolated.
As is evident from Tab. I, the special case A=1 corresponds to regular acquisition and thus produces no signal apparition. Obviously, it is advantageous to choose A significantly different from unity so that signal apparition becomes significant and above noise levels. The case where A=−1 (acquisition of data where the source signature flips polarity between source locations) may appear to be the optimal choice as it fully shifts all energy from k=0 to kN (Bracewell, 1999). Although this is a valid choice for modeling, it is not practical for many applications (e.g., for marine air gun sources, see Robertsson et al., 2015) as it requires the ability to flip polarity of the source signal. The case where A=0 (source excited every second time only) may be a straightforward way to acquire simultaneous source data but has the limitation of reduced sub-surface illumination. A particularly attractive choice of A(ω) for wave experimentation seems to let every second source be excited a time shift T later compared to neighbouring recordings, that is, select A=eiωT.
The above description assumes a simple modulating sequence m(n), and thus generating the wave field h. Applications in which such a simple modulating sequence can be applied may however be limited in practice. In practice it is difficult to obtain perfectly periodic time shifts from a measurement setup. It is for example common practice for seismic vessels to shoot or trigger their sources at predetermined (essentially equidistant) positions, and due to practical variations (vessel velocity etc.) it will be difficult to realize shots at both predetermined locations and times.
In the following, there are therefore described further methods accommodating applications in which the modulation sequence includes variations or deviations, signal dither, or, in extreme circumstances, gives rise to aperiodic source signals. We refer herein to modulations sequences including any such variations as non-periodic.
First are presented methods for treating simultaneous source data using quasi-periodic time delays in the shots as well as position variations. Quasi-periodic time delays can be understood as delays with periodic carrying signal overlaid with a non-periodic (for instance random) pattern. The resulting combined variation can therefore be considered to be non-periodic. In the case where the recorded data is band-limited, and sufficiently densely sampled, this may provide a way to conduct separation or deblending of two or more source contributions for moderately sized non-periodic variations in the time shift.
Let us start by recapitulating some one-dimensional properties of the Fourier transform. We will use the notation
{grave over (ƒ)}(ξ)=∫−∞∞ƒ(x)e−2πixξdx
for the Fourier transform in one variable, and consequently {grave over (ƒ)}(ω,ξ) for the Fourier transform of two dimensional function ƒ(t,x) with a time (t) and spatial (x) dependence.
The Poisson sum formula
can be modified (by using the Fourier modulation rule) as
By the standard properties of the Fourier transform it is straightforward to show that
hold for the spatial sampling parameter Δx and some fixed spatial shift x0. Suppose that ƒ1=ƒ1(t,x) and ƒ2=ƒ2(t,x) are two spatially bandlimited functions. By rescaling of units we can thus assume that they satisfy
{grave over (ƒ)}1(ω,ξ)={grave over (ƒ)}2(ω,ξ)=0, if |ξ|>¼. (1.1)
The recorded data is now modelled as a sum of the two functions, but where one of them has been subjected to a periodic time shift. Denote the recorded data by d=d(t,x), this blending can thus be described by
where we assume that the data is spatially sampled at equally spaced points x=k.
In a more general version more general filtering operations than time shifts can be applied. Let ak be filter operators (acting on the time variable) where the k dependence is such it only depends on if k is odd or even, i.e., that ak=ak(mod2).
Applying the result described above, it then follows that a modulated sum of d over all even points (2k) in combination with a one-dimensional Fourier transform in the time variable yield the relation
A similar treatment of the odd terms (2k+1) gives
We now define D1(ω,ξ) as the sum that includes both odd and even terms. It thus holds that
Because of the support assumption (1.1), we see that if |ξ+½|<¼, then most of the terms above vanish, and it is therefore possible to obtain the values of {grave over (ƒ)}2 (ξ) from
D
1(ω,ξ)=(à0(ω)e−2πiΔ
The values of {grave over (ƒ)}1 can be obtained in a similar fashion by considering instead
The role of the filtering operations à0 and à1 are thus merely multiplicative, and for the sake of simplifying the presentation we therefore satisfy with considering the case where à0=à1=1 for which it holds that
D
1(ω+½′ξ)=−i sin(2πΔtω){grave over (f)}2(ω,ξ).
and
D
2(ω+½′ξ)=−i sin(2πΔtω){grave over (ƒ)}1(ω,ξ).
Like in the method above this procedure uses recovering the respective function at the cones that shifted away from the origin. While the values of {grave over (ƒ)}1 and {grave over (ƒ)}2 can be obtained in a very direct manner, the procedure is heavily relying on the periodicity of the alternating shifts in sampling, and may therefore be sensitive to perturbations of these time shifts.
It should be noted that a similar result can be obtained by modulating the amplitude instead of the time. In the most general case the modulation can be a filter with frequency dependent amplitude and phase.
Another way to recover {grave over (ƒ)}1 and {grave over (ƒ)}2 is to consider the case where |ξ|<¼, for which (1.2) simplifies to
and similarly for the shifted version
This implies that for each pair of values (ω,ξ) (with |ξ|<¼ and ωΔt∉), {grave over (ƒ)}1 (ωξ) and {grave over (f)}2(ω,ξ) can be obtained by solving the linear system
In this way the function can thus be recovered by considering the data in the central cone (e.g. as shown in
Let us now consider a more general sampling setup. Let t=tk and s=sk be two sequences and assume that data is modelled by
d(t,k)=ƒ1(t,sk)+akƒ2(t+tk,sk). (1.4)
In the case where
t
k=Δt(−1)k and sk=k, and ak=1, (1.5)
the setup of the previous section is obtained. Let us introduce the operators t,s*, and t,s by
respectively. Note that (1.4) can now be written as
d(t,k)=0,s*{grave over (ƒ)}1(t,sk)+t,s*{grave over (ƒ)}2(t,sk).
Note also that for instance F−t,st,s*{grave over (ƒ)}=0,s0,s*{grave over (ƒ)} since the two time shifts cancel out.
Given a support constraint similar to (1.1), we follow the reconstruction procedure in a similar fashion as in the previous section. The analogous system of equations becomes
Using a standard discretization in the frequency domain (and time), the operators may be realized using standard FFT in combination with shift operators in the case of equally spaced sampling in the spatial variable, or by using algorithms for unequally spaced FFT in the general case. The linear system (1.6) can for instance be solved by using an iterative solver. If (1.5) is approximately satisfied, the solution (1.3) may be used as a preconditioner. This means that a solution should be obtained in one iteration if (1.5) is satisfied and in case it is almost satisfied, only a few iterations should be required. The formulation above can be used in the case of irregular sampling in time; in space; or for both of the at the same time. Perturbations that are completely irregular (not following the tensor structure indicated here) can also be dealt with using the same framework.
For computational reasons it is important to be able to use fast solvers when applicable. By a fast solver we mean a method by which we can solve the problem of computing either forward or inverse operators in a method with low time complexity, for instance that of FFT.
The method set out above can be applied to various cases in which a separation of sources may be considered as advantageous. In the following the application of the problem of seismic interference cancellation is demonstrated.
Seismic interference (SI) occurs when two or more different seismic crews are acquiring seismic data in vicinity of each other. SI can be a major source of noise that can be difficult to remove particularly if it is arriving in the cross-line direction as the moveout of the signal is very similar to that of the interfering signal which can also be strong compared to deeper reflections that it may overlie. If the dominant azimuth of seismic interference is known, it is possible to shift the acquired data so that it appears as far as possible from the seismic interference noise in wk (e.g., noise centered at k=0 and signal at kNyquist). The application requires real-time knowledge of exact firing times of the interfering vessel.
Knowledge of the exact firing time is of course a major limitation as a competing seismic crew likely will not want to share this information. It may also be somewhat irregular if the crew shoots on position and not time. However, using for instance the quasi-periodic apparition method presented above we can not only solve the simultaneous source problem (as described above) but also that of seismic interference since we do not need to know the exact firing times of the interfering crew beforehand. As long as we utilize a periodic or quasi-periodic acquisition sequence ourselves we will record a data set where the interfering signal can be apparated and removed from the acquired data. Once the data have been recorded we can detect the exact arrival time of the seismic interference in the data (this can be as simple as a windowed autocorrelation/crosscorrelation process).
The interfering data will likely be shot on position and therefore have a slight variation in arrival time from shot to shot. However, all we have to do is to include these estimated perturbations in arrival time of the seismic interference to apparate (i.e., shift in wavenumber) the seismic interference away from the acquired data. As a side note we note that the interfering survey is likely also seeing interference from the first crew using the apparition firing sequence. The method applied gives the opportunity to generate a separate set of data for the interfering survey.
Synthetic data were computed using a finite-difference solution of the wave equation for a typical two-dimensional (2D) North Sea subsurface velocity and density model consisting of sub horizontal sediment layers overlying rotated fault blocks. The data consist of the waveforms recorded at a single stationary receiver (located on the seafloor) for shots along a line. The data are shown in
In the following variant of the method as described above is focusing on the cases of quasi-periodic and or pseudo-random timeshifts. Note, however, that the method can also be applied to the case of quasi-periodic or pseudo-random amplitude perturbations or to such perturbations of shot positions or of frequency-dependent amplitude and phase perturbations or arbitrary combinations thereof. This variant of the method, in its most general form, applies to any known (set of) modulation function(s).
Let d(n) represent some data acquired as a function of a spatial coordinate x, i.e., at discrete locations xn. The well-known convolution theorem states that the convolution in space of the data d(n) with some spatial filter ƒ(n) can be computed by multiplication of the (discrete) Fourier transforms of the data D(k)=(d(n)) and of the spatial filter, F(k)=(f(n)), followed by inverse (discrete) Fourier transform, i.e., ƒ(n)*d(n)=−1 (F(k)·D(k)). Here we exploit the lesser-known dual of the convolution theorem, which states that multiplication in the space domain of d(n) with a so-called modulation function/operator m(n), corresponds to cyclic convolution of the (discrete) Fourier transform of the data, D(k), with the (discrete) Fourier transform of the modulation operator M(k)= (m(n)), followed by inverse (discrete) Fourier transform. Furthermore, we exploit the fact that cyclic convolution can be expressed conveniently as a matrix multiplication with a Toeplitz matrix.
Moreover, such a matrix multiplication can be rapidly evaluated by means of fast solvers such as the FFT, since the discrete Fourier matrices diagonalize cyclic matrices. This property is not true for the inverse of Toeplitz matrices. However, both Toeplitz matrices and their inverses have displacement rank 2, which allows for rapid evaluation of the application of these operators. The time complexity for these operations are bounded by the complexity for FFT.
Without loss of generality, let's assume that the data have been acquired in the following manner: a first source, s1, sailing with a constant ground speed, fires with regular time intervals, and a second source, s2, sailing also with a constant ground speed (and along the same line), fires alternately at the same time as s1 and at Δtn after s1, where Δtn is drawn, e.g., from a normal distribution, N(μ,σ2) with mean, μ, and variance, σ2. Since s1 and s2 are fired at the same time or shortly after each other, a recording of subsurface reflected waves will comprise a superposition of waves due to these two sources.
As shown below, we can formulate the separation of such data as the (least-squares) solution of a system of equations in the frequency-wavenumber domain. Let the N shots be enumerated by n, and let Tn denote the relative timing of the n-th shots fired by s1 and s2. Thus, according to the paragraph above, Tn=0 for odd shots n=2·i+1 and Tn=Δtn for even shots=2·i+2 (i=0, 1, 2, . . . for n≤N). In the temporal frequency domain, the effect of the timeshift is multiplication with e±iωT
Since the timeshifts are formulated as relative to the s1 times, the effective modulation function for the part of the simultaneous data due to s1 is constant equal to 1 for each s1 shot and each frequency. Thus, the transform of the implied modulation function for s1 is a (discrete) delta function in wavenumber (at zero wavenumber) and the corresponding cyclic convolution matrix the identity matrix, I.
Consider without loss of generality that the number of simultaneous source recorded traces N is even. Let Δx denote the spatial (shot) sampling interval. Then the spatial Nyquist wavenumber, KN, is KN=1/(2Δx), and the wavenumber resolution, Δk, after a discrete Fourier transform over space is Δk=2KN/N. The discrete wavenumbers (after “FFT-shifting” the zero-wavenumber component to the center of the spectrum by swapping halves of the obtained decrete Fourier transform values) are (k)=−KN+(k−1)Δk (k=1, 2, . . . , N). In this case, the index corresponding to the zero wavenumber, k0, is
Let the unknowns be the data in the frequency wavenumber domain due to sources s1 and s2, i.e. D1(k) and D2(k), respectively, without relative timeshifts. Let kmin and kmax denote the indices of the discrete wavenumbers closest to the minimum and maximum wavenumbers Kmin and Kmax to be inverted, but smaller and larger, respectively. The data between −KN and Kmin and Kmax and KN are assumed to be zero (i.e., the support in the wavenumber domain of D1(k) and D2(k) is confined to Kmin and Kmax).
Thus, the (column) vector of unknowns can be denoted D=[D1(kmin:kmax)T D2(kmin:kmax)T]T where T denotes transpose and the colon denotes all or part of a range. Note, however, that because of the modulation function applied to s1 data, the range of observed wavenumbers is not restricted to from Kmin to Kmax. However, since the unknowns are restricted to that range, the forward modelling operator should be similarly restricted along the columns (i.e., on the model side) but not along the rows (i.e., on the measurement side). Thus, the forward modelling operator matrix G can be formed:
G=[I(:kmin:kmax)C(:kmin:kmax)]
Thus, if we denote Dtot(k) the FFT-shifted (discrete) Fourier transform of the observed aperiodic, (near-)simultaneous source data dtot(m) we have the following system of equations:
GD=D
tot
And we can compute, e.g., the least-squares solution DLS
D
LS=(GHG+λ2I)−1GHDtot,
Where the stabilisation λ2 is usually chosen to be a percentage (e.g. 0.1%) of the maximum of GHG and H denotes complex-conjugate (Hermitian) transpose.
As in the example above, this variant can be applied successfully to the separation of a dataset to which two sources have been contributing to with one of the sources being modulated in such a manner.
In
Note that the exactly the same methods can be used to separate or approximately separate sources for which the relative time delay varies non-periodically for every trace (i.e., every shot). Such variations, if intentionally, can be termed pseudo-random variations.
Note that the description above has focussed on the separation of at least two simultaneous or near-simultaneous sources. But the methods described herein can also be applied to wave fields where one source is physical and a second source is virtual as induced by the presence of a free surface which is the subjected of a separate patent application. In such a case the current disclosure allows for the separation of recorded wave fields into ghost and ghost-free wave fields. Further details to such an application can be found in the patent application by the same applicant entitled “Method for deghosting and redatuming operator estimation” and filed in the United Kingdom at the same priority date as this application.
Throughout the description of the present disclosure we have made use of Fourier transforms to transform the data separating and isolating wave fields. It will be appreciated by those skilled in the art that other transforms such as Radon transforms, tau-p transforms, etc., can also be used for the same purpose. Furthermore, those skilled in the art may also prefer to implement the methods presented directly in the space and/or time domain. In such cases the transforms presented herein are replaced by their respective representations or mathematical equivalents in such domains, which can take either explicit or approximated/truncated forms and applied to the wave field data representation in the respective domain.
A bounded support in a domain is the well-known mathematical generalisation of the better-known concept of being bandlimited (such as in equation (1.1)). Examples of limited support are presented above.
It is well known, for example, that due to the “uncertainty principle”, a function and its Fourier transform cannot both have bounded support. As (seismic) data are necessarily acquired over a finite spatial (and temporal) extent, the terms “bounded support” and “limited support” herein are used not in the strict mathematical sense, but rather to describe an “effective numerical support”, that can be characterised, e.g., by the (amplitude) spectrum being larger than a certain value. For instance, larger than a certain noise threshold, or larger than the quantization error of the analog-to-digital converters used in the measurement equipment. Further, it is understood that by explicitly windowing space and/or space-time domain data, the support of a function may be spread over a larger region of, e.g., the wavenumber-frequency domain and in such cases the term “bounded support” and “limited support” will also be understood as “effective numerical support” as it will still be possible to apply the methods described herein.
Furthermore, the terms “cone” and “cone-shaped” used herein are used to indicate the shape of the “bounded” or “effective numerical” support of the data of interest (e.g., the data that would be recorded firing the sources individually [i.e. non-simultaneously]) in the frequency-wavenumber domain. In many cases, it will still be possible to apply the methods described herein if the actual support is approximately conic or approximately cone-shaped. For example, at certain frequencies or across certain frequency ranges the support could be locally wider or less wide than strictly defined by a cone. Such variations are contemplated and within the scope of the appended claims. That is, the terms “cone” and “cone-shaped” should be understood to include approximately conic and approximately cone-shaped. In addition, in some cases we use the terms “bounded support” or “limited support” and “effective numerical support” to refer to data with “conic support” or “cone-shaped support” even though in the strict mathematical sense a “cone” is not bounded (as it extends to infinite temporal frequency). In such cases, the “boundedness” should be understood to refer to the support of the data along the wavenumber axis/axes, whereas “conic” refers to the overall shape of the support in the frequency-wavenumber domain.
Note that the term “cone-shaped support” or similar refers to the shape of the support of e.g. the data of interest (in the frequency-wavenumber domain), if it were regularly sampled along a linear trajectory in 2D or Cartesian grid in 3D. That is, it refers only to the existence of such a support and not to the actual observed support of the data of interest in the simultaneous source input data or of the separated data of interest sampled as desired. The support of both of these depends on the chosen regularly or irregularly sampled straight or curved input (activation) and output (separation) lines or grids. Such variations are within the scope of the appended claims.
For example consider a case where the input data are acquired using simultaneous curved shot lines. In this case, the methods described herein can either be applied directly to the input data, provided the curvature has not widened the support of the data interest such that it significantly overlaps with itself. In this case, the support used in the methods described herein can be different from cone-shaped. Alternatively, the methods described herein are used to reconstruct the data of interest in a transform domain which corresponds to, e.g., best-fitting regularly sampled and/or straight activation lines or Cartesian grids, followed by computing the separated data of interest in the non-transformed domain at desired regular or irregularly sampled locations.
As should be clear to one possessing ordinary skill in the art, the methods described herein apply to different types of wave field signals recorded (simultaneously or non-simultaneously) using different types of sensors, including but not limited to; pressure and/or one or more components of the particle motion vector (where the motion can be: displacement, velocity, or acceleration) associated with compressional waves propagating in acoustic media and/or shear waves in elastic media. When multiple types of wave field signals are recorded simultaneously and are or can be assumed (or processed) to be substantially co-located, we speak of so-called “multi-component” measurements and we may refer to the measurements corresponding to each of the different types as a “component”. Examples of multi-component measurements are the pressure and vertical component of particle velocity recorded by an ocean bottom cable or node-based seabed seismic sensor, the crossline and vertical component of particle acceleration recorded in a multi-sensor towed-marine seismic streamer, or the three component acceleration recorded by a microelectromechanical system (MEMS) sensor deployed e.g. in a land seismic survey.
The methods described herein can be applied to each of the measured components independently, or to two or more of the measured components jointly. Joint processing may involve processing vectorial or tensorial quantities representing or derived from the multi-component data and may be advantageous as additional features of the signals can be used in the separation. For example, it is well known in the art that particular combinations of types of measurements enable, by exploiting the physics of wave propagation, processing steps whereby e.g. the multi-component signal is separated into contributions propagating in different directions (e.g., wave field separation), certain spurious reflected waves are eliminated (e.g., deghosting), or waves with a particular (non-linear) polarization are suppressed (e.g., polarization filtering). Thus, the methods described herein may be applied in conjunction with, simultaneously with, or after such processing of two or more of the multiple components.
Furthermore, in case the obtained wave field signals consist of/comprise one or more components, then it is possible to derive local directional information from one or more of the components and to use this directional information in the reduction of aliasing effects in the separation.
While various embodiments of the present disclosure have been described above, it should be understood that they have been presented by way of example only, and not of limitation. For example it should be noted that where filtering steps are carried out in the frequency-wavenumber space, filters with the equivalent effect can also be implemented in many other domains such as tau-p or space-time.
Further, it should be understood that the various features, aspects and functionality described in one or more of the individual embodiments are not limited in their applicability to the particular embodiment with which they are described, but instead can be applied, alone or in various combinations, to one or more of the other embodiments of the disclosure.
For example, it is understood that the techniques, methods and systems that are disclosed herein may be applied to all marine, seabed, borehole, land and transition zone seismic surveys, that includes planning, acquisition and processing. This includes for instance time-lapse seismic, permanent reservoir monitoring, VSP and reverse VSP, and instrumented borehole surveys (e.g. distributed acoustic sensing). Moreover, the techniques, methods and systems disclosed herein may also apply to non-seismic surveys that are based on wave field data to obtain an image of the subsurface.
In
In
The methods described herein may be understood as a series of logical steps and (or grouped with) corresponding numerical calculations acting on suitable digital representations of the obtained wave field quantities, and hence can be implemented as computer programs or software comprising sequences of machine-readable instructions and compiled code, which, when executed on the computer produce the intended output in a suitable digital representation. More specifically, a computer program can comprise machine-readable instructions to perform the following tasks:
Computer programs may run with or without user interaction, which takes place using input and output devices such as keyboards or a mouse and display. Users can influence the program execution based on intermediate results shown on the display or by entering suitable values for parameters that are required for the program execution. For example, in one embodiment, the user could be prompted to enter information about e.g., the average inline shot point interval or source spacing. Alternatively, such information could be extracted or computed from metadata that are routinely stored with the seismic data, including for example data stored in the so-called headers of each seismic trace.
Next, a hardware description of a computer or computers used to perform the functionality of the above-described exemplary embodiments is described with reference to
Further, the claimed advancements may be provided as a utility application, background daemon, or component of an operating system, or combination thereof, executing in conjunction with CPU 1000 and an operating system such as Microsoft Windows 7, UNIX, Solaris, LINUX, Apple MAC-OS and other systems known to those skilled in the art.
The hardware elements in order to achieve the computer can be realized by various circuitry elements, known to those skilled in the art. For example, CPU 1000 can be a Xenon or Core processor from Intel of America or an Opteron processor from AMD of America, or may be other processor types that would be recognized by one of ordinary skill in the art. Alternatively, the CPU 1000 can be implemented on an FPGA, ASIC, PLD or using discrete logic circuits, as one of ordinary skill in the art would recognize. Further, CPU 1000 may be implemented as multiple processors cooperatively working in parallel to perform the instructions of the inventive processes described above.
Number | Date | Country | Kind |
---|---|---|---|
1603742.6 | Mar 2016 | GB | national |
1619034.0 | Nov 2016 | GB | national |
This application is a continuation of PCT Application No. PCT/IB2017/051061, filed Feb. 24, 2017, which claims priority to Great Britain Application No. 1603742.6, filed Mar. 4, 2016, and Great Britain Application No. 1619034.0, filed Nov. 10, 2016. The entire contents of the above-identified applications are incorporated herein by reference.
Number | Date | Country | |
---|---|---|---|
Parent | PCT/IB2017/051061 | Feb 2017 | US |
Child | 16119790 | US |