SEG Technical Program Expanded Abstracts 1992 1992
DOI: 10.1190/1.1821933
|View full text |Cite
|
Sign up to set email alerts
|

Random noise reduction by 3‐D spatial prediction filtering

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
5
0

Year Published

2000
2000
2022
2022

Publication Types

Select...
6
1

Relationship

0
7

Authors

Journals

citations
Cited by 18 publications
(5 citation statements)
references
References 1 publication
0
5
0
Order By: Relevance
“…It has proven fruitful to extend noise suppression methods to two or more spatial dimensions, in part because it allows more data to be accessed from a more localized area (Chase, 1992;Ozdemir, et al, 1999;Soubaras, 2000). In general this allows harsher noise reduction and better signal preservation.…”
Section: Methodsmentioning
confidence: 99%
“…It has proven fruitful to extend noise suppression methods to two or more spatial dimensions, in part because it allows more data to be accessed from a more localized area (Chase, 1992;Ozdemir, et al, 1999;Soubaras, 2000). In general this allows harsher noise reduction and better signal preservation.…”
Section: Methodsmentioning
confidence: 99%
“…In the case of non‐linear events in tx, the assumption of dipping linear events can be approximated by applying proper windowing strategies to the data. This same technique can also be implemented in three dimensions using two‐dimensional convolutions under the assumption of planar events in time (Chase ). Furthermore, one can attenuate random noise in the case of multicomponent measurements via vector‐autoregressive (VAR) models (Naghizadeh and Sacchi ; Kamil et al .…”
Section: Theorymentioning
confidence: 99%
“…The extension of this method to incorporate multiple spatial dimensions is similar to the extension of f − x deconvolution to f − x − y deconvolution where rather than incorporating only one spatial dimension to predict the reflectivity series, two spatial dimensions are considered (Chase 1992; Gulunay et al 1993; Gulunay 2000). Thus, a two‐dimensional prediction filter P l , m is required rather than a one‐dimensional prediction filter P l to allow for spatial prediction among multiple azimuths.…”
Section: Spectral Decomposition With F−x−y Preconditioningmentioning
confidence: 99%
“…By representing the seismic trace as a multi‐wavelet convolutional process, its time‐frequency representation can be considered to be a set of wavelet dependent reflectivities (Bonar and Sacchi 2010). Through considering the time‐frequency representation as a set of reflectivities, concepts such as f − x or f − x − y deconvolution (Canales 1984; Chase 1992; Gulunay et al 1993; Wang 1999; Gulunay 2000) can be incorporated into the spectral decomposition algorithm via preconditioning of the inversion problem similar to the structure‐and‐amplitude‐preserving multichannel deconvolution algorithm proposed in Wang and Sacchi (2009). The incorporation of f − x or f − x − y deconvolution into the spectral decomposition algorithm allows for the structure of neighbouring seismic traces to influence the time‐frequency representation of a seismic trace during its generation through spatial prediction filtering, helping to eliminate the effects of noise.…”
Section: Introductionmentioning
confidence: 99%