SEG Technical Program Expanded Abstracts 2020 2020
DOI: 10.1190/segam2020-3425671.1
|View full text |Cite
|
Sign up to set email alerts
|

Iterative deblending with robust Fourier thresholding

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
1
0

Year Published

2021
2021
2024
2024

Publication Types

Select...
3
2

Relationship

0
5

Authors

Journals

citations
Cited by 5 publications
(1 citation statement)
references
References 17 publications
0
1
0
Order By: Relevance
“…Imposing a sparsity constraint, an inversion-based deblending algorithm utilizes sparse representations of signal components in auxiliary domains to retrieve desired signals, which is referred to as sparse inversion. A number of studies have shown high-quality deblending in various domains such as the Radon domain (Akerberg et al 2008;Moore 2010;Ibrahim and Sacchi 2013;Lin and Sacchi 2020), the Fourier domain (Abma et al 2015;Song et al 2019;Kumar et al 2020;Bahia et al 2020), the Curvelet domain (Zu et al, 2016) and the Seislet domain (Chen et al 2014).…”
Section: Introductionmentioning
confidence: 99%
“…Imposing a sparsity constraint, an inversion-based deblending algorithm utilizes sparse representations of signal components in auxiliary domains to retrieve desired signals, which is referred to as sparse inversion. A number of studies have shown high-quality deblending in various domains such as the Radon domain (Akerberg et al 2008;Moore 2010;Ibrahim and Sacchi 2013;Lin and Sacchi 2020), the Fourier domain (Abma et al 2015;Song et al 2019;Kumar et al 2020;Bahia et al 2020), the Curvelet domain (Zu et al, 2016) and the Seislet domain (Chen et al 2014).…”
Section: Introductionmentioning
confidence: 99%