Abstract

Wide-azimuth seismic data sets are generally acquired more sparsely than narrow-azimuth seismic data sets. This brings new challenges to seismic data regularization algorithms, which aim to reconstruct seismic data for regularly sampled acquisition geometries from seismic data recorded from irregularly sampled acquisition geometries. The Fourier-based seismic data regularization algorithm first estimates the spatial frequency content on an irregularly sampled input grid. Then, it reconstructs the seismic data on any desired grid. Three main difficulties arise in this process: the “spectral leakage” problem, the accurate estimation of Fourier components, and the effective antialiasing scheme used inside the algorithm. The antileakage Fourier transform algorithm can overcome the spectral leakage problem and handles aliased data. To generalize it to higher dimensions, we propose an area weighting scheme to accurately estimate the Fourier components. However, the computational cost dramatically increases with the sampling dimensions. A windowed Fourier transform reduces the computational cost in high-dimension applications but causes undersampling in wavenumber domain and introduces some artifacts, known as Gibbs phenomena. As a solution, we propose a wavenumber domain oversampling inversion scheme. The robustness and effectiveness of the proposed algorithm are demonstrated with some applications to both synthetic and real data examples.

You do not currently have access to this article.