No abstract

A B S T R A C TTensor algebra provides a robust framework for multi-dimensional seismic data processing. A low-rank tensor can represent a noise-free seismic data volume. Additive random noise will increase the rank of the tensor. Hence, tensor rank-reduction techniques can be used to filter random noise. Our filtering method adopts the Candecomp/Parafac decomposition to approximates a N-dimensional seismic data volume via the superposition of rank-one tensors. Similar to the singular value decomposition for matrices, a low-rank Candecomp/Parafac decomposition can capture the signal and exclude random noise in situations where a low-rank tensor can represent the ideal noise-free seismic volume. The alternating least squares method is adopted to compute the Candecomp/Parafac decomposition with a provided target rank. This method involves solving a series of highly over-determined linear least-squares subproblems. To improve the efficiency of the alternating least squares algorithm, we uniformly randomly sample equations of the linear least-squares subproblems to reduce the size of the problem significantly. The computational overhead is further reduced by avoiding unfolding and folding large dense tensors. We investigate the applicability of the randomized Candecomp/Parafac decomposition for incoherent noise attenuation via experiments conducted on a synthetic dataset and field data seismic volumes. We also compare the proposed algorithm (randomized Candecomp/Parafac decomposition) against multi-dimensional singular spectrum analysis and classical f − xy prediction filtering. We conclude the proposed approach can achieve slightly better denoising performance in terms of signal-to-noise ratio enhancement than traditional methods, but with a less computational cost.

Least-squares reverse time migration (LSRTM) has become increasingly popular for complex wavefield imaging due to its ability to equalize image amplitudes, attenuate migration artifacts, handle incomplete and noisy data, and improve spatial resolution. The major drawback of LSRTM is the considerable computational cost incurred by performing migration/demigration at each iteration of the optimization. To ameliorate the computational cost, we introduced a fast method to solve the LSRTM problem in the image domain. Our method is based on a new factorization that approximates the Hessian using a superposition of Kronecker products. The Kronecker factors are small matrices relative to the size of the Hessian. Crucially, the factorization is able to honor the characteristic block-band structure of the Hessian. We have developed a computationally efficient algorithm to estimate the Kronecker factors via low-rank matrix completion. The completion algorithm uses only a small percentage of preferentially sampled elements of the Hessian matrix. Element sampling requires computation of the source and receiver Green’s functions but avoids explicitly constructing the entire Hessian. Our Kronecker-based factorization leads to an imaging technique that we name Kronecker-LSRTM (KLSRTM). The iterative solution of the image-domain KLSRTM is fast because we replace computationally expensive migration/demigration operations with fast matrix multiplications involving small matrices. We first validate the efficacy of our method by explicitly computing the Hessian for a small problem. Subsequent 2D numerical tests compare LSRTM with KLSRTM for several benchmark models. We observe that KLSRTM achieves near-identical images to LSRTM at a significantly reduced computational cost (approximately 5–15× faster); however, KLSRTM has an increased, yet manageable, memory cost.

No abstract

No abstract