SEG Technical Program Expanded Abstracts 2012 2012
DOI: 10.1190/segam2012-0675.1
|View full text |Cite
|
Sign up to set email alerts
|

An iterative SVD method for deblending: theory and examples

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
1
0

Year Published

2020
2020
2023
2023

Publication Types

Select...
4
1

Relationship

0
5

Authors

Journals

citations
Cited by 5 publications
(1 citation statement)
references
References 9 publications
0
1
0
Order By: Relevance
“…They do, however, require sorting the elements of the solution into a tensor that exhibits the low‐rank property. A popular choice is to form a Hankel matrix out of monochromatic frequency slices of data in the frequency‐space domain (Cheng & Sacchi, 2013, 2015; Maraschini et al., 2012). Another approach is to sort the data based on mid‐point/half offset coordinates and construct a hierarchically semi‐separable matrix from frequency slices (Wason et al., 2014; Kumar et al., 2015).…”
Section: Introductionmentioning
confidence: 99%
“…They do, however, require sorting the elements of the solution into a tensor that exhibits the low‐rank property. A popular choice is to form a Hankel matrix out of monochromatic frequency slices of data in the frequency‐space domain (Cheng & Sacchi, 2013, 2015; Maraschini et al., 2012). Another approach is to sort the data based on mid‐point/half offset coordinates and construct a hierarchically semi‐separable matrix from frequency slices (Wason et al., 2014; Kumar et al., 2015).…”
Section: Introductionmentioning
confidence: 99%