2019
DOI: 10.1111/1365-2478.12894
|View full text |Cite
|
Sign up to set email alerts
|

Random noise attenuation via the randomized canonical polyadic decomposition

Abstract: A B S T R A C TTensor algebra provides a robust framework for multi-dimensional seismic data processing. A low-rank tensor can represent a noise-free seismic data volume. Additive random noise will increase the rank of the tensor. Hence, tensor rank-reduction techniques can be used to filter random noise. Our filtering method adopts the Candecomp/Parafac decomposition to approximates a N-dimensional seismic data volume via the superposition of rank-one tensors. Similar to the singular value decomposition for m… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
2

Citation Types

0
6
0

Year Published

2021
2021
2022
2022

Publication Types

Select...
4

Relationship

0
4

Authors

Journals

citations
Cited by 4 publications
(6 citation statements)
references
References 39 publications
0
6
0
Order By: Relevance
“…The w opt i represents the thresholding and shrinkage operator on the singular values of χ. It should be noted that the optimization problem in (7) seems to be unobservable since it depends on an unknown matrix desired to be estimated; however, the optimal solution itself is computable. No structure was assumed to find the optimal solution except the low-rank characteristic in the signal matrix.…”
Section: B Sparse and Low-rank Component Extractionmentioning
confidence: 99%
See 2 more Smart Citations
“…The w opt i represents the thresholding and shrinkage operator on the singular values of χ. It should be noted that the optimization problem in (7) seems to be unobservable since it depends on an unknown matrix desired to be estimated; however, the optimal solution itself is computable. No structure was assumed to find the optimal solution except the low-rank characteristic in the signal matrix.…”
Section: B Sparse and Low-rank Component Extractionmentioning
confidence: 99%
“…However, it is known that the exploitable structure is present in the noise portion of the eigen-spectrum, i.e., the min(m, n) − r singular values of χ. The advantage of the proposed algorithm over the optimization problem in (7) is that the presented algorithm uses an estimate of the rank of the signal matrix as input data and will return the (re)weighted approximation, which efficiently mitigates the effect of rank overestimation. When σ 1 > σ 2 > .…”
Section: B Sparse and Low-rank Component Extractionmentioning
confidence: 99%
See 1 more Smart Citation
“…Rank reduction methods assume that the signal can be represented by a low‐rank matrix, whereas the noise can increase rank. The Cadzow filtering (Burroughs & Trickett, 2009; Cadzow, 1988), multichannel singular spectrum analysis (Oropeza & Sacchi, 2011) and canonical polyadic decomposition (Gao & Sacchi, 2020) are applied to reduce the rank of noisy data and retrieve the signal with low rank. For coherent noise suppression, such as DWs, surface waves and refracted waves, F–K filtering (Yilmaz, 2001) and τ–p transform (Russell et al., 1990) utilize the difference in apparent velocities between reflections and coherent noise.…”
Section: Introductionmentioning
confidence: 99%
“…These factors lead to either the leakage of signal energy or noise residuals (Almuhaidib & Toksöz, 2016). The rank reduction methods assume that the matrix of the seismic data with low‐rank represents noise‐free data, but the measurement of low rank needs subjective decisions (Gao & Sacchi, 2020); in addition, these algorithms require expensive computation (Gemechu et al., 2018). Therefore, so far it is difficult to build an accurate model to describe signal or noise for the suppressing of SDWs.…”
Section: Introductionmentioning
confidence: 99%