基于seislet变换的反假频迭代数据插值方法

许多地震资料处理方法需要完整的数据信息,但是受野外施工条件等因素的影响,观测系统很难记录完整的地震波场,如空间采样率不足和地震道缺失等现象,尤其是缺失的叠前地震数据时常产生空间假频现象,给后续处理流程中很多重要环节带来严重的影响.传统数据插值方法通常很难同时解决数据缺失和空间假频问题,因此开发有效的反空间假频数据插值方法具有重要的意义.本文通过同时改变时间和空间方向采样比例,利用预测误差滤波器的尺度缩放不变性,计算反空间假频地震倾角模式,构建可有效压缩含空间假频不完整地震数据的反假频seislet变换方法,通过压缩感知Bregman迭代算法,对缺失地震数据进行反假频插值.理论模型和实际数据的处理结果验证了基于seislet变换的迭代插值方法可以有效地恢复含有假频的缺失地震信息.     

连续缺失地震数据的高阶流式预测滤波插值方法

由于观测系统实施以及经济因素的限制,采集到的勘探地震数据在空间方向上总是不规则分布的,并且往往会出现数据的大范围连续缺失情况.许多后续地震数据处理方法(例如：多次波压制和波动方程偏移等)都需要空间上规则分布的数据.插值技术是一种解决地震数据缺失问题的有效手段,但是传统的数据插值方法在进行连续缺失数据重建时往往会出现失效的情况,尤其在处理非平稳地震同相轴时精度不高,并且大多数的方法需要迭代计算,在处理高维大规模数据时效率较低.针对连续缺失地震数据的快速插值问题,本文提出了一种非迭代的时空域高阶流式预测滤波插值方法,通过使用高阶限制条件来提高连续缺失数据的滤波器估计精度,提高局部约束条件的稳定性,改善低阶流式计算由于滤波器系数无法连续更新所造成的插值失效情况.同时,空间非因果滤波器和蛇形插值路径的设计方案可以有效减小大范围连续缺失数据和数据边界对于预测滤波器的计算误差,本方法能够有效处理包括近炮检距缺失情况在内的连续缺失数据插值重建.通过与工业标准傅里叶凸集投影(POCS)方法进行比较,理论模型和实际数据处理结果表明,本文提出的高阶流式预测滤波插值方法对高维连续缺失地震数据有较好的重建效果...     

基于Bregman迭代的复杂地震波场稀疏域插值方法

在地震勘探中,野外施工条件等因素使观测系统很难记录到完整的地震波场,因此,资料处理中的地震数据插值是一个重要的问题。尤其在复杂构造条件下,缺失的叠前地震数据给后续高精度处理带来严重的影响。压缩感知理论源于解决图像采集问题,主要包含信号的稀疏表征以及数学组合优化问题的求解,它为地震数据插值问题的求解提供了有效的解决方案。在应用压缩感知求解复杂地震波场的插值问题中,如何最佳化表征复杂地震波场以及快速准确的迭代算法是该理论应用的关键问题。Seislet变换是一个特殊针对地震波场表征的稀疏多尺度变换,该方法能有效地压缩地震波同相轴。同时,Bregman迭代算法在以稀疏表征为核心的压缩感知理论中,是一种有效的求解算法,通过选取适当的阈值参数,能够开发地震波动力学预测理论、图像处理变换方法和压缩感知反演算法相结合的地震数据插值方法。本文将地震数据插值问题纳入约束最优化问题,选取能够有效压缩复杂地震波场的OC-seislet稀疏变换,应用Bregman迭代方法求解压缩感知理论框架下的混合范数反问题,提出了Bregman迭代方法中固定阈值选取的H曲线方法,实现地震波场的快速、准确重建。理论模型和实际数据的处理结果验证了基于H曲线准则的Bregman迭代稀疏域插值方法可以有效地恢复复杂波场的缺失信息。     

基于Bregman迭代的复杂地震波场稀疏域插值方法(英文)

在地震勘探中,野外施工条件等因素使观测系统很难记录到完整的地震波场,因此,资料处理中的地震数据插值是一个重要的问题。尤其在复杂构造条件下,缺失的叠前地震数据给后续高精度处理带来严重的影响。压缩感知理论源于解决图像采集问题,主要包含信号的稀疏表征以及数学组合优化问题的求解,它为地震数据插值问题的求解提供了有效的解决方案。在应用压缩感知求解复杂地震波场的插值问题中,如何最佳化表征复杂地震波场以及快速准确的迭代算法是该理论应用的关键问题。Seislet变换是一个特殊针对地震波场表征的稀疏多尺度变换,该方法能有效地压缩地震波同相轴。同时,Bregman迭代算法在以稀疏表征为核心的压缩感知理论中,是一种有效的求解算法,通过选取适当的阈值参数,能够开发地震波动力学预测理论、图像处理变换方法和压缩感知反演算法相结合的地震数据插值方法。本文将地震数据插值问题纳入约束最优化问题,选取能够有效压缩复杂地震波场的OC-seislet稀疏变换,应用Bregman迭代方法求解压缩感知理论框架下的混合范数反问题,提出了Bregman迭代方法中固定阈值选取的H曲线方法,实现地震波场的快速、准确重建。理论模型和实际数据的处理结果验证了基于H曲线准则的Bregman迭代稀疏域插值方法可以有效地恢复复杂波场的缺失信息。     

低信噪比地震资料FDOC-seislet变换阈值消噪方法研究

地震数据本质上是时变的,不仅有效同相轴表现出确定性信号的时变特征,而且复杂地表和构造条件以及深部探测环境总是引入时变的非平稳随机噪声.标准的频率-空间域预测滤波只适合压制平面波信号假设下的平稳随机噪声,而处理非平稳地震随机噪声时,需要将数据体分割为小窗口进行分析,但效果不够理想,而传统非预测类随机噪声压制方法往往适应性不高,因此开发能够保护地震信号时变特征的随机噪声压制方法具有重要的工业价值.压缩感知是近年出现的一个新的采样理论,通过开发信号的稀疏特性,已经在地震数据处理中的数据插值以及噪声压制中得到了应用.本文系统地分析了压缩感知理论框架下的地震随机噪声压制问题,建立了阈值消噪的数学反演目标函数;针对时变有效信息具有的可压缩性,利用有限差分算法求解炮检距连续方程,构建有限差分炮检距连续预测算子(FDOC),在seislet变换框架下,提出一种新的快速稀疏变换域———FDOC-seislet变换,实现地震数据的高度稀疏表征;结合非平稳随机噪声不可压缩的特征,提出了一种整形迭代消噪方法,该方法是一种广义的迭代收缩阈值(IST)算法,在无法计算稀疏变换伴随算子的条件下,仍然能够对强噪声环境中的时变有效信息进行有效恢复.通过对模型数据和实际数据的处理,验证了FDOC-seislet稀疏变换域随机噪声迭代压制方法能够在保护复杂构造地震波信息的前提下,有效地衰减原始数据中的强振幅随机噪声干扰.     

基于Seislet-TV双正则化约束的地震随机噪声压制方法

人工地震数据总是受到随机噪声的干扰,地震数据时-空变的特性使得常规去噪方法处理效果并不理想,容易导致有效信号的损失.目前广泛应用的预测滤波类方法存在处理时变数据能力不足的问题.随着压缩感知理论的不断完善,稀疏变换阈值算法能够解决时变地震数据噪声压制问题,但是常规的稀疏变换方法,如傅里叶变换,小波变换等,并不是特殊针对地震数据设计的,很难提供地震数据最佳的压缩特征,同时,常规阈值算法容易导致去噪结果过于平滑.因此开发更加有效的时-空变地震数据信噪分离方法具有重要的工业价值.本文将地震数据信噪分离问题归纳为数学基追踪问题,在压缩感知理论框架下,利用特殊针对地震数据设计的VD-seislet稀疏变换方法,结合全变差(TV)算法,构建seislet-TV双正则化条件,并利用分裂Bregman迭代算法求解约束最优化问题,实现地震数据的有效信噪分离.通过理论模型和实际数据测试本文方法,并且与工业标准FXdecon方法进行比较,结果表明基于seislet-TV双正则化约束条件的迭代方法能够更加有效地保护时-空变地震信号,压制地震数据中的强随机噪声.     

基于Bregman迭代的不同阈值模型地震数据重构方法分析

传统的地震数据采样必须严格遵循Nyquist采样定理,而野外实际数据的采集可能由于施工条件或者地表障碍物的限制,不一定能记录到完整的地震波场,所以地震资料处理中的数据重建是非常重要的问题.压缩感知理论最先来自信号处理领域,它所包括的问题类型有信号的稀疏表征和数学组合优化,它给地震数据重建这类问题指明了思考方向.而其中如何选择最优的迭代算法是数据重建中的关键问题.本文将地震数据插值问题归纳到约束最优化问题,选择能有效稀疏表征地震波场的傅里叶变换,对于压缩感知理论框架下的混合范数反问题,再用Bregman迭代方法去求解,在地震数据的重建过程中,传统的阈值参数收敛慢,为了降低迭代次数并且提高地震数据恢复的精度,总结出改进型指数衰减规律的阈值参数,选择用硬阈值算子来重建恢复地震数据．通过对理论模型和实际地震资料的处理结果表明该方法可以快速、有效的恢复地震波场的缺失数据．     

分形插值地震数据重建方法研究

对分形插值方法作了较详细的探讨,给出了分形插值函数的显式表达方式,同时给出了垂直比例因子的局部显式表达式,旨在提高地震道插值重建的精度及突出局部信息,并从单道地震图的角度分析其在地震道插值重建中的应用效果.利用该方法对理论模型和济阳坳陷实际地震台站资料进行了重建处理,结果表明,分形插值重建的地震道是原始地震道的良好近似,缺失道的振幅和相位都得到了很好的恢复.该法克服了随机分形插值方法必须进行多步迭代的弱点,提高了计算效率.通过对单道地震图插值重建结果的分析,说明了本文分形插值方法具有较高的精度和较高的效率,有深入研究的潜力.本文提出的显式分形插值方法既能够突出地震道数据的局部信息,又较好地保持了地震道数据的总体变化趋势.     

基于频率-结构双重加权阈值的地震数据插值

地震数据的插值是地震数据处理的关键环节,插值效果的优劣关系到后续反演、去噪、反褶积、偏移等工作的进行.基于稀疏反演的常规频率-波数(FK)域插值方法往往使用广义阈值,而由于缺失地震数据仅沿波数方向呈稀疏态,在沿频率方向呈类子波频谱形态分布的非稀疏态,直接应用基于Lp范数的广义阈值会难以补全缺失数据的高低频信息,不利于后续依赖低频信息的反演及依赖高频的高分辨率处理工作的开展;基于该问题,本文设计沿频率方向类子波频谱形态变化的频率加权阈值,同时考虑完整地震数据在波数域的聚集分布,引入沿波数方向的结构加权阈值,提出基于频率-结构的双重加权阈值,在补全缺失地震道的同时,保证其高低频信息的有效恢复.模型和实际数据表明,相比于广义阈值,基于频率-结构的双重加权阈值可以减少插值误差,最大限度保证缺失地震道位置插值结果高低频信息的完整性.     

基于非均匀曲波变换的高精度地震数据重建

在野外数据采集过程中,空间非均匀采样下的地震道缺失现象经常出现,为了不影响后续资料处理,必须进行高精度数据重建.然而大多数常规方法只能对空间均匀采样下的地震缺失道进行重建,而对于非均匀采样的地震数据则无能为力.为此本文在以往多尺度多方向二维曲波变换的基础上,首先引入非均匀快速傅里叶变换,建立均匀曲波系数与空间非均匀采样下地震缺失道数据之间的规则化反演算子,在L1最小范数约束下,使用线性Bregman方法进行反演计算得到均匀曲波系数,最后再进行均匀快速离散曲波反变换,从而形成基于非均匀曲波变换的高精度地震数据重建方法.该方法不仅可以重建非均匀带假频的缺失数据,而且具有较强的抗噪声能力,同时也可以将非均匀网格数据归为到任意指定的均匀采样网格.理论与实际数据的处理表明了该方法重建效果远优于非均匀傅里叶变换方法,可以有效地指导复杂地区数据采集设计及重建.     

Seismic data interpolation using generalised velocity‐dependent seislet transform

Data interpolation is an important step for seismic data analysis because many processing tasks, such as multiple attenuation and migration, are based on regularly sampled seismic data. Failed interpolations may introduce artifacts and eventually lead to inaccurate final processing results. In this paper, we generalised seismic data interpolation as a basis pursuit problem and proposed an iteration framework for recovering missing data. The method is based on non‐linear iteration and sparse transform. A modified Bregman iteration is used for solving the constrained minimisation problem based on compressed sensing. The new iterative strategy guarantees fast convergence by using a fixed threshold value. We also propose a generalised velocity‐dependent formulation of the seislet transform as an effective sparse transform, in which the non‐hyperbolic normal moveout equation serves as a bridge between local slope patterns and moveout parametres in the common‐midpoint domain. It can also be reduced to the traditional velocity‐dependent seislet if special heterogeneity parametre is selected. The generalised velocity‐dependent seislet transform predicts prestack reflection data in offset coordinates, which provides a high compression of reflection events. The method was applied to synthetic and field data examples, and the results show that the generalised velocity‐dependent seislet transform can reconstruct missing data with the help of the modified Bregman iteration even for non‐hyperbolic reflections under complex conditions, such as vertical transverse isotropic (VTI) media or aliasing.     

基于压缩感知的Curvelet域联合迭代地震数据重建

由于野外采集环境的限制,常常无法采集得到完整规则的野外地震数据,为了后续地震处理、解释工作的顺利进行,地震数据重建工作被广泛的研究.自压缩感知理论的提出,相继出现了基于该理论的多种迭代阈值方法,如CRSI方法（Curvelet Recovery by Sparsity-promoting Inversion method）、Bregman迭代阈值算法（the linearized Bregman method）等.CSRI方法利用地震波形在Curvelet的稀疏特性,通过一种基于最速下降的迭代算法在Curvelet变换域恢复出高信噪比地震数据,该迭代算法稳定,收敛,但其收敛速度慢.Bregman迭代阈值法与CRSI最大区别在于每次迭代时把上一次恢复结果中的阈值前所有能量都保留到本次恢复结果中,从而加快了收敛速度,但随着迭代的进行重构数据中噪声干扰越来越严重,导致最终恢复出的数据信噪比低.综合两种经典方法的优缺点,本文构造了一种新的联合迭代算法框架,在每次迭代中将CRSI和Bregman的恢复量加权并同时加回本次迭代结果中,从而加快了迭代初期的收敛速度,又避免了迭代后期噪声干扰的影响.合成数据和实际数据试算结果表明,我们提出的新方法不仅迭代快速收敛稳定,且能得到高信噪比的重建结果.     

A seismic interpolation and denoising method with curvelet transform matching filter

A new seismic interpolation and denoising method with a curvelet transform matching filter, employing the fast iterative shrinkage thresholding algorithm (FISTA), is proposed. The approach treats the matching filter, seismic interpolation, and denoising all as the same inverse problem using an inversion iteration algorithm. The curvelet transform has a high sparseness and is useful for separating signal from noise, meaning that it can accurately solve the matching problem using FISTA. When applying the new method to a synthetic noisy data sets and a data sets with missing traces, the optimum matching result is obtained, noise is greatly suppressed, missing seismic data are filled by interpolation, and the waveform is highly consistent. We then verified the method by applying it to real data, yielding satisfactory results. The results show that the method can reconstruct missing traces in the case of low SNR (signal-to-noise ratio). The above three problems can be simultaneously solved via FISTA algorithm, and it will not only increase the processing efficiency but also improve SNR of the seismic data.     

Simultaneous Denoising and Interpolation of Seismic Data via the Deep Learning Method

Utilizing data from controlled seismic sources to image the subsurface structures and invert the physical properties of the subsurface media is a major effort in exploration geophysics. Dense seismic records with high signal-to-noise ratio (SNR) and high fidelity helps in producing high quality imaging results. Therefore, seismic data denoising and missing traces reconstruction are significant for seismic data processing. Traditional denoising and interpolation methods rarely occasioned rely on noise level estimations, thus requiring heavy manual work to deal with records and the selection of optimal parameters. We propose a simultaneous denoising and interpolation method based on deep learning. For noisy records with missing traces, we adopt an iterative alternating optimization strategy and separate the objective function of the data restoring problem into two sub-problems. The seismic records can be reconstructed by solving a least-square problem and applying a set of pre-trained denoising models alternatively and iteratively.We demonstrate this method with synthetic and field data.     

Curvelet reconstruction of non-uniformly sampled seismic data using the linearized Bregman method

Seismic data reconstruction, as a preconditioning process, is critical to the performance of subsequent data and imaging processing tasks. Often, seismic data are sparsely and non-uniformly sampled due to limitations of economic costs and field conditions. However, most reconstruction processing algorithms are designed for the ideal case of uniformly sampled data. In this paper, we propose the non-equispaced fast discrete curvelet transform-based three-dimensional reconstruction method that can handle and interpolate non-uniformly sampled data effectively along two spatial coordinates. In the procedure, the three-dimensional seismic data sets are organized in a sequence of two-dimensional time slices along the source–receiver domain. By introducing the two-dimensional non-equispaced fast Fourier transform in the conventional fast discrete curvelet transform, we formulate an L1 sparsity regularized problem to invert for the uniformly sampled curvelet coefficients from the non-uniformly sampled data. In order to improve the inversion algorithm efficiency, we employ the linearized Bregman method to solve the L1-norm minimization problem. Once the uniform curvelet coefficients are obtained, uniformly sampled three-dimensional seismic data can be reconstructed via the conventional inverse curvelet transform. The reconstructed results using both synthetic and real data demonstrate that the proposed method can reconstruct not only non-uniformly sampled and aliased data with missing traces, but also the subset of observed data on a non-uniform grid to a specified uniform grid along two spatial coordinates. Also, the results show that the simple linearized Bregman method is superior to the complex spectral projected gradient for L1 norm method in terms of reconstruction accuracy.     

A fast joint seismic data reconstruction by sparsity‐promoting inversion

Seismic field data are often irregularly or coarsely sampled in space due to acquisition limits. However, complete and regular data need to be acquired in most conventional seismic processing and imaging algorithms. We have developed a fast joint curvelet‐domain seismic data reconstruction method by sparsity‐promoting inversion based on compressive sensing. We have made an attempt to seek a sparse representation of incomplete seismic data by curvelet coefficients and solve sparsity‐promoting problems through an iterative thresholding process to reconstruct the missing data. In conventional iterative thresholding algorithms, the updated reconstruction result of each iteration is obtained by adding the gradient to the previous result and thresholding it. The algorithm is stable and accurate but always requires sufficient iterations. The linearised Bregman method can accelerate the convergence by replacing the previous result with that before thresholding, thus promoting the effective coefficients added to the result. The method is faster than conventional one, but it can cause artefacts near the missing traces while reconstructing small‐amplitude coefficients because some coefficients in the unthresholded results wrongly represent the residual of the data. The key process in the joint curvelet‐domain reconstruction method is that we use both the previous results of the conventional method and the linearised Bregman method to stabilise the reconstruction quality and accelerate the recovery for a while. The acceleration rate is controlled through weighting to adjust the contribution of the acceleration term and the stable term. A fierce acceleration could be performed for the recovery of comparatively small gaps, whereas a mild acceleration is more appropriate when the incomplete data has a large gap of high‐amplitude events. Finally, we carry out a fast and stable recovery using the trade‐off algorithm. Synthetic and field data tests verified that the joint curvelet‐domain reconstruction method can effectively and quickly reconstruct seismic data with missing traces.