A fast butterfly algorithm for generalized Radon transforms

Jingwei Hu, Sergey Fomel, Laurent Demanet, Lexing Ying

Research output: Contribution to journalArticlepeer-review

34 Scopus citations


Generalized Radon transforms, such as the hyperbolic Radon transform, cannot be implemented as efficiently in the frequency domain as convolutions, thus limiting their use in seismic data processing. We have devised a fast butterfly algorithm for the hyperbolic Radon transform. The basic idea is to reformulate the transform as an oscillatory integral operator and to construct a blockwise lowrank approximation of the kernel function. The overall structure follows the Fourier integral operator butterfly algorithm. For 2D data, the algorithm runs in complexity O(N2 log N), where N depends on the maximum frequency and offset in the data set and the range of parameters (intercept time and slowness) in the model space. From a series of studies, we found that this algorithm can be significantly more efficient than the conventional time-domain integration. © 2013 Society of Exploration Geophysicists.
Original languageEnglish (US)
Pages (from-to)U41-U51
Number of pages1
Issue number4
StatePublished - Jun 21 2013
Externally publishedYes


Dive into the research topics of 'A fast butterfly algorithm for generalized Radon transforms'. Together they form a unique fingerprint.

Cite this