Multidimensional seismic data processing

Multidimensional seismic data processing forms a major component of seismic profiling, a technique used in geophysical exploration.

Uses your system voice; voice and rate in settings.

Snapshot

≈ 4 min read

Names in other languages

No names in other languages are held for this entry yet.

Article bodies are English and are not machine-translated. A name in another language is not a translation of the article.

Multidimensional seismic data processing forms a major component of seismic profiling, a technique used in geophysical exploration. The technique itself has various applications, including mapping ocean floors, determining the structure of sediments, mapping subsurface currents and hydrocarbon exploration.

Since geophysical data obtained in such techniques is a function of both space and time, multidimensional signal processing techniques may be better suited for processing such data. F(\underline{k},\omega) = \int_{-\infty}^{\infty} \int_{-\infty}^{\infty} f(\underline{x},t)e^{-j(\omega t - \underline{k} \underline{x})}d\underline{x} dt where \underline{k} is the spatial frequency (also known as wavenumber) and \omega is the temporal frequency.

The two-dimensional equivalent of the frequency domain is also referred to as the \underline{k} -\omega domain. There are various techniques to design two-dimensional filters based on the Fourier transform, such as the minimax design method and design by transformation.

One disadvantage of Fourier transform design is its global nature; it may filter out some desired components as well. p = \frac{1}{v} = \frac{dt}{dx} Each value on the trace p is the sum of all the samples along the line t = \tau + px The transform is defined by: F(p,\tau) = \int_{-\infty}^{\infty} f(x, \tau + px) dx = \int_{-\infty}^{\infty} \int_{-\infty}^{\infty} f(x,t) \delta(t - \tau - px) dx dt The τ-p transform converts seismic records into a domain where all these events are separated. Simply put, each point in the τ-p domain is the sum of all the points in the x-t plane lying across a straight line with a slope p and intercept τ.

That also means a point in the x-t domain transforms into a line in the τ-p domain, hyperbolae transform into ellipses and so on. Similar to the Fourier transform, a signal in the τ-p domain can also be transformed back into the x-t domain. y(\underline{x},t) = f(\underline{x},t) ** r(\underline{x},t) where f(\underline{x},t) represents the source wavelet, r(\underline{x},t) is the reflectivity function, \underline{x} is the space vector and t is the time variable.

The iterative equation for deconvolution is of the form: f_0(\underline{x},t) = \lambda y(\underline{x},t) and f_{n+1}(\underline{x},t) = \lambda y(\underline{x},t) + q(x,t) ** f_n(\underline{x},t) , where q(x,t) = \delta (\underline{x},t) - r(\underline{x},t) Taking the Fourier transform of the iterative equation gives: F_{n+1}(\underline{k},\omega) = \lambda Y(\underline{k},\omega) + F_n(\underline{k},\omega) - \lambda F_n(\underline{k},\omega)R(\underline{k},\omega) This is a first-order one-dimensional difference equation with index n , input \lambda Y(\underline{k},\omega)u(n) , and coefficients that are functions of (\underline{k},\omega) . The impulse response is [1 - \lambda R(\underline{k},\omega)]^nu(n) , where u(n) represents the one-dimensional unit step function.

The output then becomes: F_n(\underline{k},\omega) = \frac{Y(\underline{k},\omega)}{R(\underline{k},\omega)}\lbrace1-[1 - \lambda R(\underline{k},\omega)]^{n+1}\rbrace u(n) The above equation can be approximated as F_n(\underline{k},\omega) = \frac{Y(\underline{k},\omega)}{R(\underline{k},\omega)} , if n \rightarrow \infty and |1 - \lambda R(\underline{k},\omega)| Note that the output is the same as the output of an inverse filter. An inverse filter does not actually have to be realized and the iterative procedure can be easily implemented on a computer. {\partial^2 s \over\partial x^2} + {\partial^2 s \over\partial z^2} = \frac{1}{c^2} {\partial^2 s \over\partial t^2} Migration refers to this wave's backward propagation.

The two-dimensional Fourier transform of the wave at depth z_0 is given by: S(k_x,z_0,\Omega) = \int \int s(x,z_0,t) e^{-j(\Omega t - k_xx)} dx dt To obtain the wave profile at z = z_0 , the wave field s(x,z,t) can be extrapolated to s(x,z_0 + \Delta z,t) using a linear filter with an ideal response given by: H(\omega_1, \omega_2) = \begin{cases} e^{j\sqrt{\alpha^2 {\omega_2}^2 - {\omega_1}^2}}, & \text{ for } |\omega_1| where \omega_1 is the x component of the wavenumber, k_x , \omega_2 is the temporal frequency \Omega and \alpha = \frac{1}{c} \frac{\Delta z}{\Delta t} For implementation, a complex fan filter is used to approximate the ideal filter described above. It must allow propagation in the region |\alpha \omega_2 | > |\omega_1 | (called the propagating region) and attenuate waves in the region |\alpha \omega_2 | (called the evanescent region).

The ideal frequency response is shown in the figure.

Text derived from https://en.wikipedia.org/w/index.php?oldid=1313231422 under CC BY-SA 4.0; modifications have been made.

Provenance

snapshot enwiki-001313231422 · captured 1758758078.0 · version history

Cite this page as: encyclopegia.org, “Multidimensional seismic data processing”, snapshot enwiki-001313231422. https://encyclopegia.org/a/multidimensional-seismic-data-processing

Sources cited in this revision

2 named source(s) extracted from the cited revision. A source with no author is shown by its publication; nothing is invented.