**Authors**

Institute of Geophysics - University of Tehran

**Abstract**

Velocity analysis is one of the most important step in seismic data processing. It affects not only many processing steps directly and indirectly, but also is known as a primary interpretation of the data. However, it can also be assumed as one of the most time consuming processing step. The conventional velocity analysis method measures the energy amplitude along hyperbolic trajectories within a velocity interval and creates a velocity model. In this procedure, the data from time-offset domain is mapped to time-velocity or time-slowness domain. For a number of , and time, offset and velocity samples respectively, computations is necessary to obtain a velocity model. However, in the presence of large size data and model parameters, computing the velocity spectrum using conventional method would be a time consuming task. On the other hand, in order to improve the initial velocity model obtained in the processing steps, usually velocity analysis is conducted several times during the processing of the seismic data. Hence, there should be a better way to compute the velocity model in a much less time computation. In this paper, we introduce the Butterfly algorithm for fast computation of hyperbolic Radon transform (HRT), as a kind of time variant operator, with an application in seismic velocity analysis. In seismic data processing, Radon transforms map the overlapping data in seismic gathers to another domain which they can be separated. Among different types of Radon transforms, the HRT has the most similarity to the seismic events and hence, produce the most accurate approximation in the velocity spectrum. However, its time-variant kernel prohibits its fast computation especially for large size data. Unlike time-invariant operators which use the convolution theorem in the Fourier domain to compute the velocity domain for each frequency separately and therefore efficiently, Fourier transform of time-variant operators is a function of both frequency and time and using the convolution theorem is not applicable. The Butterfly algorithm can be used as a fast solver for the Fourier Integral Operators (FIO), so reformulating the HRT integral in the Fourier domain as FIO makes it possible to use this algorithm to overcome the problem of the time-variant kernel. The basis of this solution is the existence of low-rank approximations of the kernel when it is restricted to subdomains in data and model spaces. Subdividing the model and data domain properly to smaller subdomains admits low-rank approximations of the kernel. These low-rank approximations enable us to obtain functions of only one variable, time or frequency, which approximate the kernel. This decoupling of time and frequency variables allows fast computation of the HRT integral. In order to do the subdivision properly, a pair of quad trees, one for each data and model domains, is used to restrict the domains in a level-base structure in which the size of data domain subsets are increasing while the size of model domain subsets are decreasing in each level. The Butterfly algorithm is used to compute the kernel equivalent functions in each level of these quad trees for each subdomain. Finally, at the last level, the Radon panel or velocity model is obtained. The complexity of this method for two dimensional data is in which depends on data and model variables range. As it was demonstrated in the synthetic and the real numerical examples, complexity results in reduction of computation time in several orders relative to the conventional method.

**Keywords**

**Main Subjects**

Candes, E., Demanet, L. and Ying, L., 2009, A fast buttery algorithm for the computation of Fourier integral operators, Multiscale Modeling and Simulation, 7, 1727-175.

Darche, G., 1990, Spatial interpolation using a fast parabolic transform: 60^{th} Annual Internet Mtg., Soc. Geophys., Expanded Abstracts, 1647-1650.

Demanet, L., Ferrara, M., Maxwell, N., Poulson, J. and Ying, L., 2012, A butterfly algorithm for synthetic aperture radar imaging, SIAM J. Img. Sci., 5, 203-243.

Dongarra, J. and Sullivan, F., 2000, The top ten algorithms of the century, Computing in Science and Engineering, 2(1), 22-23.

Gardner, G. H. F. and Lu, L., eds., 1991, Slant-stack processing: society of exploration geophysicists, Issue 14 of Geophysics reprint series.

Greengard, L. and Rokhlin, V., 1987, A fast algorithm for particle simulations, J. Comput. Phys., 73, 325-348.

Hampson, D., 1986, Inverse velocity stacking for multiple elimination, J. Can. Soc. Exploration Geophysics, 22, 44-55.

Hu, J., Fomel, S., Demanet, L. and Ying, L., 2013, A fast buttery algorithm for generalized Radon transforms, Geophysics, 78(4), U41-U51

Kostov, C., 1990, Toeplitz structure in slant-stack inversion, 60^{th} Annual Internat. Mtg., Soc. Exploration Geophysics, Expanded Abstracts, 1618-1621.

Michielssen, E. and Boag, A., 1996, A multilevel matrix decomposition algorithm for analyzing scattering from large structures, IEEE Transactions on Antennas and Propagation, 44, 1086-1093.

O'Neil, M. and Rokhlin, V., 2007, A new class of analysis-based fast transforms. Technical report, Yale University, YALE/DCS/TR1384.

Sacchi, M. D. and Ulrych, T., J., 1995, High-resolution velocity gathers and offset space reconstruction, Geophysics, 60(4), 1169-1177.

Sacchi, M. D., 2002, Statistical and transform methods in geophysical signal processing.

Thorson, J. R. and Claerbout, J. F., 1985, Velocity-stack and slant-stack stochastic inversion, Geophysics, 50, 2727-2741.

Trad, D., Ulrych, T. and Sacchi, M. D., 2002, Accurate interpolation with high resolution time-variant Radon transforms, Geophysics, 67, 644-656.

Ying, L., 2009, Sparse Fourier transform via butterfly algorithm, SIAM Journal on Scientific Computing, 31, 1678.

Yilmaz, Ö., 1989, Velocity-stack processing, Geophysical Prospecting., 37, 357-382.

Yilmaz, Ö., 1987, Seismic data processing, 2, Soc. Exploration Geophysics.

December 2016

Pages 513-522