Seismic data restoration via data-driven tight frame

被引:93
作者
Liang, Jingwei [1 ]
Ma, Jianwei [2 ]
Zhang, Xiaoqun [3 ,4 ]
机构
[1] Univ Caen, GREYC, CNRS, ENSICAEN, F-14032 Caen, France
[2] Harbin Inst Technol, Dept Math, Harbin 150006, Peoples R China
[3] Shanghai Jiao Tong Univ, MOE LSC, Shanghai, Peoples R China
[4] Shanghai Jiao Tong Univ, Inst Nat Sci, Dept Math, Shanghai, Peoples R China
关键词
TRACE INTERPOLATION; DATA RECONSTRUCTION; FOURIER-TRANSFORM; SEISLET TRANSFORM; SPARSE; DECONVOLUTION; ALGORITHMS; RECOVERY;
D O I
10.1190/GEO2013-0252.1
中图分类号
P3 [地球物理学]; P59 [地球化学];
学科分类号
0708 ; 070902 ;
摘要
Restoration/interpolation of missing traces plays a crucial role in the seismic data processing pipeline. Efficient restoration methods have been proposed based on sparse signal representation in a transform domain such as Fourier, wavelet, curvelet, and shearlet transforms. Most existing methods are based on transforms with a fixed basis. We considered an adaptive sparse transform for restoration of data with complex structures. In particular, we evaluated a data-driven tight-frame-based sparse regularization method for seismic data restoration. The main idea of the data-driven tight frame (TF) is to adaptively learn a set of framelet filters from the currently interpolated data, under which the data can be more sparsely represented; hence, the sparsity-promoting l(1)-norm (SPL1) minimization methods can produce better restoration results by using the learned filters. A split inexact Uzawa algorithm, which can be viewed as a generalization of the alternating direction of multiplier method (ADMM), was applied to solve the presented SPL1 model. Numerical tests were performed on synthetic and real seismic data for restoration of randomly missing traces over a regular data grid. Our experiments showed that our proposed method obtains the state-of-the-art restoration results in comparison with the traditional Fourier-based projection onto convex sets, the tight-frame-based method, and the recent shearlet regularization ADMM method.
引用
收藏
页码:V65 / V74
页数:10
相关论文
共 53 条
[1]   3D interpolation of irregular data with a POCS algorithm [J].
Abma, Ray ;
Kabir, Nurul .
GEOPHYSICS, 2006, 71 (06) :E91-E97
[2]   K-SVD: An algorithm for designing overcomplete dictionaries for sparse representation [J].
Aharon, Michal ;
Elad, Michael ;
Bruckstein, Alfred .
IEEE TRANSACTIONS ON SIGNAL PROCESSING, 2006, 54 (11) :4311-4322
[3]  
[Anonymous], 2010, IAS Lecture Notes Series, Summer Program on The Mathematics of Image Processing
[4]  
[Anonymous], 2010, SEG TECHNICAL PROGRA
[5]   Distributed optimization and statistical learning via the alternating direction method of multipliers [J].
Boyd S. ;
Parikh N. ;
Chu E. ;
Peleato B. ;
Eckstein J. .
Foundations and Trends in Machine Learning, 2010, 3 (01) :1-122
[6]   A framelet-based image inpainting algorithm [J].
Cai, Jian-Feng ;
Chan, Raymond H. ;
Shen, Zuowei .
APPLIED AND COMPUTATIONAL HARMONIC ANALYSIS, 2008, 24 (02) :131-149
[7]   Data-driven tight frame construction and image denoising [J].
Cai, Jian-Feng ;
Ji, Hui ;
Shen, Zuowei ;
Ye, Gui-Bo .
APPLIED AND COMPUTATIONAL HARMONIC ANALYSIS, 2014, 37 (01) :89-105
[8]   SIMULTANEOUS CARTOON AND TEXTURE INPAINTING [J].
Cai, Jian-Feng ;
Chan, Raymond H. ;
Shen, Zuowei .
INVERSE PROBLEMS AND IMAGING, 2010, 4 (03) :379-395
[9]  
Cai JF, 2009, PROC CVPR IEEE, P104, DOI 10.1109/CVPRW.2009.5206743
[10]   Deconvolution: a wavelet frame approach [J].
Chai, Anwei ;
Shen, Zuowei .
NUMERISCHE MATHEMATIK, 2007, 106 (04) :529-587