Premium
Fast hyperbolic deconvolutive Radon transform using generalized Fourier slice theorem
Author(s) -
Mokhtari Ahmadreza,
Gholami Ali,
Siahkoohi Hamid Reza
Publication year - 2019
Publication title -
geophysical prospecting
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.735
H-Index - 79
eISSN - 1365-2478
pISSN - 0016-8025
DOI - 10.1111/1365-2478.12732
Subject(s) - radon transform , fourier transform , fractional fourier transform , hartley transform , algorithm , computation , computer science , discrete time fourier transform , discrete fourier transform (general) , s transform , mathematics , mathematical analysis , fourier analysis , wavelet transform , artificial intelligence , wavelet packet decomposition , wavelet
The hyperbolic Radon transform has a long history of applications in seismic data processing because of its ability to focus/sparsify the data in the transform domain. Recently, deconvolutive Radon transform has also been proposed with an improved time resolution which provides improved processing results. The basis functions of the (deconvolutive) Radon transform, however, are time‐variant, making the classical Fourier based algorithms ineffective to carry out the required computations. A direct implementation of the associated summations in the time–space domain is also computationally expensive, thus limiting the application of the transform on large data sets. In this paper, we present a new method for fast computation of the hyperbolic (deconvolutive) Radon transform. The method is based on the recently proposed generalized Fourier slice theorem which establishes an analytic expression between the Fourier transforms associated with the data and Radon plane. This allows very fast computations of the forward and inverse transforms simply using fast Fourier transform and interpolation procedures. These canonical transforms are used within an efficient iterative method for sparse solution of (deconvolutive) Radon transform. Numerical examples from synthetic and field seismic data confirm high performance of the proposed fast algorithm for filling in the large gaps in seismic data, separating primaries from multiple reflections, and performing high‐quality stretch‐free stacking.