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

Applications of time‐domain high‐resolution Radon demultiple

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
4

Citation Types

0
4
0

Year Published

2011
2011
2024
2024

Publication Types

Select...
8

Relationship

0
8

Authors

Journals

citations
Cited by 18 publications
(4 citation statements)
references
References 5 publications
0
4
0
Order By: Relevance
“…Various multiple elimination approaches have been developed in the past few decades that can be classified into three classes in general. The first class is filtering-based methods, such as the predictive deconvolution method relying on the periodicity difference between primaries and multiples (Peacock and Treitel 1969;Taner 1980) and the transformation methods founded on the separability of primaries and multiples in a specific domain (Foster and Mosher 1992;Schonewille and Aaron 2007;Yilmaz 2001). Unlike the first class of techniques, the second class is wave-equation-based methods provided with higher precision and a wider range of applications.…”
Section: Introductionmentioning
confidence: 99%
“…Various multiple elimination approaches have been developed in the past few decades that can be classified into three classes in general. The first class is filtering-based methods, such as the predictive deconvolution method relying on the periodicity difference between primaries and multiples (Peacock and Treitel 1969;Taner 1980) and the transformation methods founded on the separability of primaries and multiples in a specific domain (Foster and Mosher 1992;Schonewille and Aaron 2007;Yilmaz 2001). Unlike the first class of techniques, the second class is wave-equation-based methods provided with higher precision and a wider range of applications.…”
Section: Introductionmentioning
confidence: 99%
“…In response to this constraint, the time domain sparse RT (TSRT) was introduced [27], offering a higher level of sparsity in the time domain and thereby achieving enhanced resolution. However, it is worth noting that TSRT comes with a substantial computational cost [28]. Combining the advantages of TSRT and FSRT, a novel RT was developed by Trad et al [6].…”
Section: Introductionmentioning
confidence: 99%
“…Since Hampson (1986) proposed the least squares RT (LSRT), scholars devote themselves extensively to how to address the sparse inverse problem. From this, two series of RT algorithms are proposed, namely frequency domain algorithms (Sacchi & Ulrych, 1995;Sacchi & Porsani, 1999) and time domain algorithms (Cary, 1998;Schonewille & Aaron, 2007;Fan et al, 2015). However, both frequency and time domain algorithms have their inherent flaws; the former is incapable of improving the resolution along the time direction due to the coupling between frequency and time, while the latter suffers a serious computational burden due to the large matrix inversion (Trad et al, 2003).…”
Section: Introductionmentioning
confidence: 99%