2D地震数据规则化中随机稀疏采样方案(英文)

地震数据规则化是地震信号处理中一个重要步骤,近年来受到广泛关注的压缩感知技术已经被应用到地震数据规则化中。压缩感知技术突破了传统的Shannon-Nyqiust采样定理的限制,可以用采集的少量地震数据重构完整数据。基于压缩感知技术的地震数据规则化质量主要受三个因素影响,除了受地震信号在不同变换域的稀疏表达和11范数重构算法的影响外,极大地取决于地震道随机稀疏采样方式。尽管已有学者开展了2D地震数据离散均匀分布随机采样方式研究,但设计新的稀疏采样方案仍然很有必要。在本文中,我们提出满足Bernoulli分布规律的Bernoulli随机稀疏采样方式和它的抖动形式。对2D数值模拟数据进行四种随机稀疏采样方案和两种变换(Fourier变换和Curvelet变换)实验,对获取的不完整数据应用11范数谱投影梯度算法(SPGL1)进行重构。考虑到不同随机种子点产生不同约束矩阵R会有不同的规则化质量,对每种方案和每个稀疏采样因子进行10次规则化实验,并计算出相应信噪比(SNR)的平均值和标准偏差。实验结果表明,我们提出的新方案好于或等于已有的离散均匀分布采样方案。     

2D地震数据规则化中随机稀疏采样方案

地震数据规则化是地震信号处理中一个重要步骤,近年来受到广泛关注的压缩感知技术已经被应用到地震数据规则化中。压缩感知技术突破了传统的Shannon-Nyqiust采样定理的限制,可以用采集的少量地震数据重构完整数据。基于压缩感知技术的地震数据规则化质量主要受三个因素影响,除了受地震信号在不同变换域的稀疏表达和11范数重构算法的影响外,极大地取决于地震道随机稀疏采样方式。尽管已有学者开展了2D地震数据离散均匀分布随机采样方式研究,但设计新的稀疏采样方案仍然很有必要。在本文中,我们提出满足Bernoulli分布规律的Bernoulli随机稀疏采样方式和它的抖动形式。对2D数值模拟数据进行四种随机稀疏采样方案和两种变换（Fourier变换和Curvelet变换）实验,对获取的不完整数据应用11范数谱投影梯度算法（SPGL1）进行重构。考虑到不同随机种子点产生不同约束矩阵R会有不同的规则化质量,对每种方案和每个稀疏采样因子进行10次规则化实验,并计算出相应信噪比（SNR）的平均值和标准偏差。实验结果表明,我们提出的新方案好于或等于已有的离散均匀分布采样方案。     

基于超完备字典学习的缺失地震数据重构方法

地震勘探目标区域环境的复杂多变性导致采集的地震数据存在不完整或者不规则等问题,针对这一问题,本文在压缩感知相关理论的支撑下,提出了基于超完备字典学习的缺失地震数据重构方法.首先利用K-SVD字典学习技术对地震样本数据进行训练,建立超完备字典对地震数据进行稀疏表示,然后引入高斯随机采样矩阵作为测量矩阵对地震数据进行采样;在数据重构阶段采用分段正交匹配追踪算法实现缺失地震数据的重构.通过与传统的地震数据重构方法对比,本文算法的重构效果在峰值信噪比、信噪比等指标上均优于对比算法,证明了超完备字典学习方法能更好的根据地震数据特征进行稀疏表示,从而获得较好的重构效果.     

地震数据的稀疏高斯束分解方法

本文研究了地震数据的稀疏分解问题.提出了一种用高斯束稀疏分解表示地震数据的方法.这是一个拟0范数约束优化问题.在求解拟0范数极小化问题的过程中,通过扫描同相轴的方法实现高斯束稀疏分解,数值实现上提出了使用一种快速单调下降的梯度优化方法.本文提出的稀疏优化方法同时具有去噪的功能,数据模拟试验表明了本方法的可行性和可靠性.     

基于ASD-POCS框架的高阶TpV图像重建算法

总变差（TV）最小化模型目前已广泛应用于图像重建领域,其通过最小化一阶图像梯度大小变换的L1范数实现,能在稀疏投影采集下得到精确的重构。然而,TV模型是基于分段平滑的图像的假设提出的,有时会产生阶梯效应。研究发现,高阶总变差（HOTV）模型可以有效压制阶梯效应,提高重建精度。此外,TpV模型使用Lp范数来逼近L0范数,有望进一步提高稀疏重建能力。鉴于此,本文将HOTV模型与TpV模型结合,提出一种新的高阶TpV （HOTpV）重建模型,采用自适应梯度下降-投影到凸集（ASD-POCS）算法进行求解,分别在理想和有噪声条件下对灰度渐变仿真模体以及真实CT图像仿真模体进行稀疏重建实验。实验结果显示,相比于TV、TpV以及HOTV三种重建模型,HOTpV能得到精度最高的图像。      

基于jitter采样和曲波变换的三维地震数据重建

传统的地震勘探数据采样必须遵循奈奎斯特采样定理,而野外数据采样可能由于地震道缺失或者勘探成本限制,不一定满足采样定理要求,因此存在数据重建问题.本文基于压缩感知理论,利用随机欠采样方法将传统规则欠采样所带来的互相干假频转化成较低幅度的不相干噪声,从而将数据重建问题转为更简单的去噪问题.在数据重建过程中引入凸集投影算法(POCS),提出采用e^-√x(0≤x≤1)衰减规律的阈值参数,构建基于曲波变换三维地震数据重建技术.同时针对随机采样的不足,引入jitter采样方式,在保持随机采样优点的同时控制采样间隔.数值试验表明,基于曲波变换的重建效果优于傅里叶变换,jitter欠采样的重建效果优于随机欠采样,最后将该技术应用于实际地震勘探资料,获得较好的应用效果.     

基于SLA范数的高阶高分辨率λ-f域Radon变换多次波压制方法（英文）

传统的Radon变换是利用一次波与多次波的速度差异将其聚焦在Radon域内的不同"点"或"直线"上。然而有限的"偏移孔径"、"离散采样"和"地震数据的AVO特性"会使Radon变换的聚焦变差,降低了该方法的分辨率,影响多次波压制精度。此外传统Radon变换没有考虑地震数据的AVO特性,使用L_0范数的近似形式L1范数来提高Radon域的聚焦特性,计算量极大。本文就上述问题,本文将SL_0范数和正交多项式同时引入λ-f域Radon变换,提出基于SL_0范数的高阶高分辨率λ-f域Radon变换。在考虑地震数据的AVO特性基础上,将正交多项式和Radon变换相结合。首先推导出时间域高阶Radon正反变换形式,随后使用傅里叶变换将其变换到频率域,再引入变量,将频率和曲率相结合,对其进行整体采样,具备了较快的计算效率,最后使用平滑高斯函数替代L_1范数来近似L_0范数(SL_0范数),通过最速下降和梯度投影原理求得Radon变换在SL_0范数下的稀疏解。理论模型和实际资料试算表明,同基于L_1范数的Radon变换比较,本文方法既在Radon域内具有更好的聚焦特性,同时在有效压制多次波(NMO)后存在剩余时差)的同时能更好地保存一次波的AVO特性。     

基于稀疏约束的地震数据高效采集方法理论研究

随着地震勘探目标复杂化和精细化程度的提高以及"两宽一高"等采集技术的广泛应用,当前地震数据采集的时间越来越长、成本越来越高.针对此问题,本文基于压缩感知理论开展了地震数据高效采集方法的改进和探索研究.根据波动方程解的一般表示式,从波场传播的角度给出了地震数据具有稀疏性的数学物理依据及寻找适应地震数据稀疏变换的一般方案;在稀疏性先验信息的指导下,发展了具有"蓝色噪声"频谱特征的改进的分段采样方法,并基于最优化理论提出了地震数据重建方法.地震数据的稀疏性理论、稀疏约束下的高效采集方法以及地震数据的重建方法构成了相对完善的地震数据高效采集理论.把该理论用于指导地震数据采集,即利用稀疏约束的随机采样方法改变常规规则密集测网中炮点和检波点(或二者之一)的分布,设计了三种随机且均匀的高效采集测网,提出了利用相应测网获取的地震数据重建为常规规则密集测网地震数据的针对性方案,并使用重建精度、高效采集数据的直接成像和重建后再成像的结果对比证明了上述重建方案的有效性.基于Marmousi模型的高效采集试验检验了本文构建的基于稀疏约束的地震数据高效采集方法理论框架在提高当前地震数据采集效率、降低勘探成本上的优势以及方法的有效性和可行性.     

基于稀疏约束和多源激发的地震数据高效采集方法

地震勘探目标日趋复杂化和精细化,"两宽一高"等采集技术获得了广泛应用,从而导致当前地震数据采集周期越来越长、成本越来越高,如何解决日益增长的勘探成本问题成为当前地震采集领域的研究热点之一.针对上述问题,本文首先开展了基于稀疏性的地震数据高效采集方法理论研究,对地震数据稀疏性基本理论、稀疏约束下随机采样及其数据重建方法进行了深入探讨,提出使用改进的分段随机采样方法灵活地进行实际地震采集测网设计;详细阐述了多源地震激发方法,对多源地震数据分离方法开展了深入研究,提出了基于小窗口中值滤波与稀疏约束联合随机去噪的多源数据分离方法,并在数据分离处理中取得了较好的效果;将上述两种地震数据采集方案有机结合,提出了1)规则多源、随机检波点(DmsRg)、2)随机多源、规则检波点(RmsDg)和3)随机多源、随机检波点(RmsRg)等三种高效采集方案及相应的数据重建方案,满足了后续常规化数据处理的要求,并讨论了多源激发对数据成像的影响.基于Marmousi模型数据的数值试验表明,本文构建的基于稀疏约束和多源激发的高效采集方法理论对于提高地震数据采集效率、降低勘探成本具有重要的应用价值,建立的数据重建方法流程可以取得和常规数据接近的成像结果.本文方法虽然在数值试验中取得了较为理想的效果,但还需要得到野外实际数据采集的进一步检验.     

基于L1-L1范数稀疏表示的共偏移距道集地震数据重建方法

传统地震数据稀疏重建方法面临着:(1)叠前共炮点道集或CMP道集反射波为双曲线型同相轴,地震数据重建会损害有效波;(2)地震信号存在噪声和畸变,要求重建方法具有较好的噪声鲁棒性.针对这两个问题,提出一种基于L_1-L_1范数稀疏表示的共偏移距道集地震数据重建方法.该方法利用了共偏移距道集中地震波为水平同相轴,无道间时差,满足空间重建要求,和L_1-L_1范数稀疏表示具有较好的噪声鲁棒性.首先抽取共偏移距道集地震数据,并根据地震采集信息构造复合采样矩阵,然后采用L_1-L_1范数稀疏表示对数据稀疏重建后,再将数据反变换回共炮点道集或CMP道集,能够同时实现地震信号稀疏重建和随机噪声压制.理论模型和实际数据试算结果验证所提方法具有较好重建精度和噪声鲁棒性.     

Non-monotone spectral projected gradient method applied to full waveform inversion

The seismic inversion problem is a highly non‐linear problem that can be reduced to the minimization of the least‐squares criterion between the observed and the modelled data. It has been solved using different classical optimization strategies that require a monotone descent of the objective function. We propose solving the full‐waveform inversion problem using the non‐monotone spectral projected gradient method: a low‐cost and low‐storage optimization technique that maintains the velocity values in a feasible convex region by frequently projecting them on this convex set. The new methodology uses the gradient direction with a particular spectral step length that allows the objective function to increase at some iterations, guarantees convergence to a stationary point starting from any initial iterate, and greatly speeds up the convergence of gradient methods. We combine the new optimization scheme as a solver of the full‐waveform inversion with a multiscale approach and apply it to a modified version of the Marmousi data set. The results of this application show that the proposed method performs better than the classical gradient method by reducing the number of function evaluations and the residual values.     

Seismic data reconstruction based on CS and Fourier theory

Traditional seismic data sampling follows the Nyquist sampling theorem. In this paper, we introduce the theory of compressive sensing (CS), breaking through the limitations of the traditional Nyquist sampling theorem, rendering the coherent aliases of regular undersampling into harmless incoherent random noise using random undersampling, and effectively turning the reconstruction problem into a much simpler denoising problem. We introduce the projections onto convex sets (POCS) algorithm in the data reconstruction process, apply the exponential decay threshold parameter in the iterations, and modify the traditional reconstruction process that performs forward and reverse transforms in the time and space domain. We propose a new method that uses forward and reverse transforms in the space domain. The proposed method uses less computer memory and improves computational speed. We also analyze the antinoise and anti-aliasing ability of the proposed method, and compare the 2D and 3D data reconstruction. Theoretical models and real data show that the proposed method is effective and of practical importance, as it can reconstruct missing traces and reduce the exploration cost of complex data acquisition.     

Functional data clustering using K-means and random projection with applications to climatological data

In this paper, an efficient pattern recognition method for functional data is introduced. The proposed method works based on reproducing kernel Hilbert space (RKHS), random projection and K-means algorithm. First, the infinite dimensional data are projected onto RKHS, then they are projected iteratively onto some spaces with increasing dimension via random projection. K-means algorithm is applied to the projected data, and its solution is used to start K-means on the projected data in the next spaces. We implement the proposed algorithm on some simulated and climatological datasets and compare the obtained results with those achieved by K-means clustering using a single random projection and classical K-means. The proposed algorithm presents better results based on mean square distance (MSD) and Rand index as we have expected. Furthermore, a new kernel based on a wavelet function is used that gives a suitable reconstruction of curves, and the results are satisfactory.     

局部倾角约束最小二乘偏移方法研究

随着石油勘探难度的进一步加大,地震数据往往存在采样不规则、地震道缺失等现象,如果不对其进行处理,会对后续的地震成像产生影响,引入成像噪音.针对这一问题,一般是通过地震道插值或数据规则化对叠前数据进行处理,然后采用常规的偏移方法进行成像,本文则是将地震成像看作最小二乘反演问题,在共成像点道集引入平滑算子,在共偏移距/角度道集引入平面波构造算子(PWC)进行约束,通过预条件共轭梯度法使得反偏移后数据与输入数据之间的误差达到最小,最终得到信噪比更高、振幅属性更为可靠的成像结果.理论模型和实际资料处理表明,本文方法不仅可以有效压制数据不规则对成像产生的噪音,而且具有更高的成像精度.     

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

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

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.     

Frequency-domain double-plane-wave least-squares reverse time migration

Least-squares reverse time migration is often formulated as an iterative updating process, where estimating the gradient of the misfit function is necessary. Traditional time domain shot-profile least-squares reverse time migration is computationally expensive because computing the gradient involves solving the two-way wave equation several times in every iteration. To reduce the computational cost of least-squares reverse time migration, we propose a double-plane-wave least-squares reverse time migration method based on a misfit function for frequency-domain double-plane-wave data. In double-plane-wave least-squares reverse time migration, the gradient is computed by multiplying frequency-domain plane-wave Green's functions with the corresponding double-plane-wave data residual. Because the number of plane-wave Green's functions used for migration is relatively small, they can be pre-computed and stored in a computer's discs or memory. We can use the pre-computed plane-wave Green's functions to obtain the gradient without solving the two-way wave equation in each iteration. Therefore, the migration efficiency is significantly improved. In addition, we study the effects of using sparse frequency sampling and sparse plane-wave sampling on the proposed method. We can achieve images with correct reflector amplitudes and reasonable resolution using relatively sparse frequency sampling and plane-wave sampling, which are larger than that determined by the Nyquist theorem. The well-known wrap-around artefacts and linear artefacts generated due to under-sampling frequency and plane wave can be suppressed during iterations in cases where the sampling rates are not excessively large. Moreover, implementing the proposed method with sparse frequency sampling and sparse plane-wave sampling further improves the computational efficiency. We test the proposed double-plane-wave least-squares reverse time migration on synthetic models to show the practicality of the method.