Tensor completion via nuclear norm minimization for 5D seismic data reconstruction

Author(s):  
Nadia Kreimer ◽  
Mauricio D. Sacchi
Geophysics ◽  
2019 ◽  
Vol 84 (2) ◽  
pp. V97-V109 ◽  
Author(s):  
Fernanda Carozzi ◽  
Mauricio D. Sacchi

Multidimensional seismic data reconstruction has emerged as a primary topic of research in the field of seismic data processing. Although there exists a large number of algorithms for multidimensional seismic data reconstruction, they often adopt the [Formula: see text] norm to measure the discrepancy between observed and reconstructed data. Strictly speaking, these algorithms assume well-behaved noise that ideally follows a Gaussian distribution. When erratic noise contaminates the seismic traces, a 5D reconstruction must adopt a robust criterion to measure the difference between observed and reconstructed data. We develop a new formulation to the parallel matrix factorization tensor completion method and adapt it for coping with erratic noise. We use synthetic and field-data examples to examine our robust reconstruction technique.


Geophysics ◽  
2020 ◽  
pp. 1-60
Author(s):  
Ouyang Shao ◽  
Lingling Wang ◽  
Xiangyun Hu ◽  
Zhidan Long

Because there are many similar geological structures underground, seismic profiles have an abundance of self-repeating patterns. Thus, we can divide a seismic profile into groups of blocks with similar seismic structure. The matrix formed by stacking together similar blocks in each group should be of low rank. Hence, we can transfer the seismic denoising problem to a serial of low-rank matrix approximation (LRMA) problem. The LRMA-based model commonly adopts the nuclear norm as a convex substitute of the rank of a matrix. However, the nuclear norm minimization (NNM) shrinks the different rank components equally and may cause some biases in practice. Recently introduced truncated nuclear norm (TNN) has been proven to more accurately approximate the rank of a matrix, which is given by the sum of the set of smallest singular values. Based on this, we propose a novel denoising method using truncated nuclear norm minimization (TNNM). The objective function of this method consists of two terms, the F-norm data fidelity and a truncated nuclear norm regularization. We present an efficient two-step iterative algorithm to solve this objective function. Then, we apply the proposed TNNM algorithm to groups of blocks with similar seismic structure, and aggregate all resulting denoised blocks to get the denoised seismic data. We update the denoised results during each iteration to gradually attenuate the heavy noise. Numerical experiments demonstrate that, compared with FX-Decon, the curvelet, and the NNM-based methods, TNNM not only attenuates noise more effectively even when the SNR is as low as -10 dB and seismic data have complex structures, but also accurately preserves the seismic structures without inducing Gibbs artifacts.


Geophysics ◽  
2013 ◽  
Vol 78 (5) ◽  
pp. V181-V192 ◽  
Author(s):  
Jianwei Ma

We have developed a new algorithm for the reconstruction of seismic traces randomly missing from a uniform grid of a 3D seismic volume. Several algorithms have been developed for such reconstructions, based on properties of the seismic wavefields and on signal processing concepts, such as sparse signal representation in a transform domain. We have investigated a novel approach, originally introduced for noise removal, which is based on the premise that for suitable representation of the seismic data as matrices or tensors, the rank of the seismic data (computed by singular value decomposition) increases with noise or missing traces. Thus, we apply low-rank matrix completion (MC) with a designed texture-patch transformation to 3D seismic data reconstruction. Low-rank components capture geometrically meaningful structures in seismic data that encompass conventional local features such as events and dips. The low-rank MC is based on nuclear-norm minimization. An efficient [Formula: see text]-norm minimizing algorithm, named approximate message passing, is extended to use for a general nonconvex nuclear-norm minimization problem. A fast MC algorithm named low-rank matrix fitting (LMaFit), which avoids the computation of singular value decomposition, was also considered for the 3D reconstruction. Empirical studies on synthetic and real data have shown promising performance of the method, in comparison with traditional projection onto convex sets.


2020 ◽  
Vol 14 (6) ◽  
pp. 985-1000
Author(s):  
Qun Liu ◽  
◽  
Lihua Fu ◽  
Meng Zhang ◽  
Wanjuan Zhang ◽  
...  

Sign in / Sign up

Export Citation Format

Share Document