2011
DOI: 10.1190/1.3532079
|View full text |Cite
|
Sign up to set email alerts
|

A fast, modified parabolic Radon transform

Abstract: We propose a fast and efficient frequency-domain implementation of a modified parabolic Radon transform ͑modi-fied PRT͒ based on a singular value decomposition ͑SVD͒ with applications to multiple removal. The problem is transformed into a complex linear system involving a single operator after merging the curvature-frequency parameters into a new variable. A complex SVD is applied to this operator and the forward transform is computed by means of a complex back-substitution that is frequency independent. The n… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
4
1

Citation Types

0
8
0

Year Published

2013
2013
2023
2023

Publication Types

Select...
10

Relationship

1
9

Authors

Journals

citations
Cited by 29 publications
(8 citation statements)
references
References 27 publications
(24 reference statements)
0
8
0
Order By: Relevance
“…The number of rows and columns in the matrix L is nx and nq, with nx being the trace number of input data and nq being the sampling number of slowness in the Radon domain, respectively. Using the 1D forward Fourier transform f [•] and the inverse transform f −1 [•], Equation (3) can be written as [41]…”
Section: Sparse Radon Transform With the Elastic Half-norm Constraintmentioning
confidence: 99%
“…The number of rows and columns in the matrix L is nx and nq, with nx being the trace number of input data and nq being the sampling number of slowness in the Radon domain, respectively. Using the 1D forward Fourier transform f [•] and the inverse transform f −1 [•], Equation (3) can be written as [41]…”
Section: Sparse Radon Transform With the Elastic Half-norm Constraintmentioning
confidence: 99%
“…However, increasing the number of iterations also leads to lower computing efficiency. Abbad et al [6]. proposed a fast algorithm for solving the problem in frequency domain based on singular value decomposition technology.…”
Section: Introductionmentioning
confidence: 99%
“…(2019) iteratively updated the singular value decomposition of current spatial patches using the most recently added spatial sample, which can reduce the computational cost of classic singular spectrum analysis. Methods based on the sparse transform, like curvelet, seislet, τ – p , radon and wavelet, are also used for the denoising of microseismic data (Akram et al., 2018; Brahim et al., 2011; Forghani‐Arani et al., 2013; Jiang et al., 2012; Sabbione et al., 2013). However, these sparse transforms have the characteristics of close framework and fast numerical implementation, but they lack adaptability to capture the various sparse structures existing in seismic data.…”
Section: Introductionmentioning
confidence: 99%