首页 | 本学科首页   官方微博 | 高级检索  
相似文献
 共查询到20条相似文献,搜索用时 781 毫秒
1.
Classical least‐squares techniques (Moore–Penrose pseudoinverse) are covariance based and are therefore unsuitable for the solution of very large‐scale linear systems in geophysical inversion due to the need of diagonalisation. In this paper, we present a methodology to perform the geophysical inversion of large‐scale linear systems via the discrete wavelet transform. The methodology consists of compressing the linear system matrix using the interesting properties of covariance‐free orthogonal transformations, to design an approximation of the Moore–Penrose pseudoinverse. We show the application of the discrete wavelet transform pseudoinverse to well‐conditioned and ill‐conditioned linear systems. We applied the methodology to a general‐purpose linear problem where the system matrix has been generated using geostatistical simulation techniques and also to a synthetic 2D gravimetric problem with two different geological set‐ups, in the noise‐free and noisy cases. In both cases, the discrete wavelet transform pseudoinverse can be applied to the original linear system and also to the linear systems of normal equations and minimum norm. The results are compared with those obtained via the Moore–Penrose and the discrete cosine transform pseudoinverses. The discrete wavelet transform and the discrete cosine transform pseudoinverses provide similar results and outperform the Moore–Penrose pseudoinverse, mainly in the presence of noise. In the case of well‐conditioned linear systems, this methodology is more efficient when applied to the least‐squares system and minimum norm system due to their higher condition number that allows for a more efficient compression of the system matrix. Also, in the case of ill‐conditioned systems with very high underdetermined character, the application of the discrete cosine transform to the minimum norm solution provides very good results. Both solutions might differ on their regularity, depending on the wavelet family that is adopted. These methods have a general character and can be applied to solve any linear inverse problem arising in technology, particularly in geophysics, and also to non‐linear inversion by linearisation of the forward operator.  相似文献   

2.
Least squares Fourier reconstruction is basically a solution to a discrete linear inverse problem that attempts to recover the Fourier spectrum of the seismic wavefield from irregularly sampled data along the spatial coordinates. The estimated Fourier coefficients are then used to reconstruct the data in a regular grid via a standard inverse Fourier transform (inverse discrete Fourier transform or inverse fast Fourier transform). Unfortunately, this kind of inverse problem is usually under‐determined and ill‐conditioned. For this reason, the least squares Fourier reconstruction with minimum norm adopts a damped least squares inversion to retrieve a unique and stable solution. In this work, we show how the damping can introduce artefacts on the reconstructed 3D data. To quantitatively describe this issue, we introduce the concept of “extended” model resolution matrix, and we formulate the reconstruction problem as an appraisal problem. Through the simultaneous analysis of the extended model resolution matrix and of the noise term, we discuss the limits of the Fourier reconstruction with minimum norm reconstruction and assess the validity of the reconstructed data and the possible bias introduced by the inversion process. Also, we can guide the parameterization of the forward problem to minimize the occurrence of unwanted artefacts. A simple synthetic example and real data from a 3D marine common shot gather are used to discuss our approach and to show the results of Fourier reconstruction with minimum norm reconstruction.  相似文献   

3.
Electrical resistivity tomography is a non-linear and ill-posed geophysical inverse problem that is usually solved through gradient-descent methods. This strategy is computationally fast and easy to implement but impedes accurate uncertainty appraisals. We present a probabilistic approach to two-dimensional electrical resistivity tomography in which a Markov chain Monte Carlo algorithm is used to numerically evaluate the posterior probability density function that fully quantifies the uncertainty affecting the recovered solution. The main drawback of Markov chain Monte Carlo approaches is related to the considerable number of sampled models needed to achieve accurate posterior assessments in high-dimensional parameter spaces. Therefore, to reduce the computational burden of the inversion process, we employ the differential evolution Markov chain, a hybrid method between non-linear optimization and Markov chain Monte Carlo sampling, which exploits multiple and interactive chains to speed up the probabilistic sampling. Moreover, the discrete cosine transform reparameterization is employed to reduce the dimensionality of the parameter space removing the high-frequency components of the resistivity model which are not sensitive to data. In this framework, the unknown parameters become the series of coefficients associated with the retained discrete cosine transform basis functions. First, synthetic data inversions are used to validate the proposed method and to demonstrate the benefits provided by the discrete cosine transform compression. To this end, we compare the outcomes of the implemented approach with those provided by a differential evolution Markov chain algorithm running in the full, un-reduced model space. Then, we apply the method to invert field data acquired along a river embankment. The results yielded by the implemented approach are also benchmarked against a standard local inversion algorithm. The proposed Bayesian inversion provides posterior mean models in agreement with the predictions achieved by the gradient-based inversion, but it also provides model uncertainties, which can be used for penetration depth and resolution limit identification.  相似文献   

4.
位场向下延拓的波数域广义逆算法   总被引:4,自引:5,他引:4       下载免费PDF全文
位场向下延拓是位场数据处理和反演中的重要运算,但是它的不稳定性影响了它在许多处理和反演方法技术中的应用.本文通过把位场向下延拓视为向上延拓的反问题,得到向下延拓的褶积型线性积分方程,再利用Fourier变换矩阵的正交对称特性,并结合矩阵的奇异值分解和广义逆原理,提出了一种稳定的不需要进行求逆运算的位场向下延拓广义逆方法——波数域广义逆算法,解决了位场大深度向下延拓的不稳定性问题.把这种方法用于三维理论模型数据和实际磁场数据的向下延拓获得了理想的结果.  相似文献   

5.
Markov chain Monte Carlo algorithms are commonly employed for accurate uncertainty appraisals in non-linear inverse problems. The downside of these algorithms is the considerable number of samples needed to achieve reliable posterior estimations, especially in high-dimensional model spaces. To overcome this issue, the Hamiltonian Monte Carlo algorithm has recently been introduced to solve geophysical inversions. Different from classical Markov chain Monte Carlo algorithms, this approach exploits the derivative information of the target posterior probability density to guide the sampling of the model space. However, its main downside is the computational cost for the derivative computation (i.e. the computation of the Jacobian matrix around each sampled model). Possible strategies to mitigate this issue are the reduction of the dimensionality of the model space and/or the use of efficient methods to compute the gradient of the target density. Here we focus the attention to the estimation of elastic properties (P-, S-wave velocities and density) from pre-stack data through a non-linear amplitude versus angle inversion in which the Hamiltonian Monte Carlo algorithm is used to sample the posterior probability. To decrease the computational cost of the inversion procedure, we employ the discrete cosine transform to reparametrize the model space, and we train a convolutional neural network to predict the Jacobian matrix around each sampled model. The training data set for the network is also parametrized in the discrete cosine transform space, thus allowing for a reduction of the number of parameters to be optimized during the learning phase. Once trained the network can be used to compute the Jacobian matrix associated with each sampled model in real time. The outcomes of the proposed approach are compared and validated with the predictions of Hamiltonian Monte Carlo inversions in which a quite computationally expensive, but accurate finite-difference scheme is used to compute the Jacobian matrix and with those obtained by replacing the Jacobian with a matrix operator derived from a linear approximation of the Zoeppritz equations. Synthetic and field inversion experiments demonstrate that the proposed approach dramatically reduces the cost of the Hamiltonian Monte Carlo inversion while preserving an accurate and efficient sampling of the posterior probability.  相似文献   

6.
In this paper, we present the uncertainty analysis of the 2D electrical tomography inverse problem using model reduction and performing the sampling via an explorative member of the Particle Swarm Optimization family, called the Regressive‐Regressive Particle Swarm Optimization. The procedure begins with a local inversion to find a good resistivity model located in the nonlinear equivalence region of the set of plausible solutions. The dimension of this geophysical model is then reduced using spectral decomposition, and the uncertainty space is explored via Particle Swarm Optimization. Using this approach, we show that it is possible to sample the uncertainty space of the electrical tomography inverse problem. We illustrate this methodology with the application to a synthetic and a real dataset coming from a karstic geological set‐up. By computing the uncertainty of the inverse solution, it is possible to perform the segmentation of the resistivity images issued from inversion. This segmentation is based on the set of equivalent models that have been sampled, and makes it possible to answer geophysical questions in a probabilistic way, performing risk analysis.  相似文献   

7.
8.
一种新的地球物理反演方法——模拟原子跃迁反演法   总被引:12,自引:5,他引:12       下载免费PDF全文
详细研究了一般地球物理反问题的迭代优化求解过程与物理学中原子跃迁过程的对应关系,建立了反演问题中模型空间、初始模型、局部极值模型、最优化模型等与原子的态空间、定态、激发态、基态等的对应关系. 在此基础上,模拟了物理学中原子从激发态向基态跃迁的物理过程,建立了一种与原子跃迁过程相对应的非线性随机跃迁数学模型和模型解跃迁搜索准则,导出了适用于一般地球物理资料的模拟原子跃迁的非线性反演算法. 用理论测试函数对这种新的反演方法进行了数值试验,结果表明该方法具有解不依赖于初始模型、收敛速度快等优点.  相似文献   

9.
This paper introduces an efficiency improvement to the sparse‐grid geometric sampling methodology for assessing uncertainty in non‐linear geophysical inverse problems. Traditional sparse‐grid geometric sampling works by sampling in a reduced‐dimension parameter space bounded by a feasible polytope, e.g., a generalization of a polygon to dimension above two. The feasible polytope is approximated by a hypercube. When the polytope is very irregular, the hypercube can be a poor approximation leading to computational inefficiency in sampling. We show how the polytope can be regularized using a rotation and scaling based on principal component analysis. This simple regularization helps to increase the efficiency of the sampling and by extension the computational complexity of the uncertainty solution. We demonstrate this on two synthetic 1D examples related to controlled‐source electromagnetic and amplitude versus offset inversion. The results show an improvement of about 50% in the performance of the proposed methodology when compared with the traditional one. However, as the amplitude versus offset example shows, the differences in the efficiency of the proposed methodology are very likely to be dependent on the shape and complexity of the original polytope. However, it is necessary to pursue further investigations on the regularization of the original polytope in order to fully understand when a simple regularization step based on rotation and scaling is enough.  相似文献   

10.
电阻率二维神经网络反演   总被引:32,自引:4,他引:28       下载免费PDF全文
由于非线性特性地球物理反演一直以来都是一个比较困难的问题. 近十年来,非线性反演方法如人工神经网络、遗传算法在地球物理数据解释中得到越来越多的应用,但目前基本仍限于一维反演问题. 对于二维反问题,反演参数较多,神经网络反演运用较少. 本文利用BP神经网络优化方法,实现了电阻率二维非线性反演. 与传统线性化的迭代反演比较,神经网络反演能够克服传统方法的不足、获得更好的反演结果.  相似文献   

11.
We present preconditioned non‐linear conjugate gradient algorithms as alternatives to the Gauss‐Newton method for frequency domain full‐waveform seismic inversion. We designed two preconditioning operators. For the first preconditioner, we introduce the inverse of an approximate sparse Hessian matrix. The approximate Hessian matrix, which is highly sparse, is constructed by judiciously truncating the Gauss‐Newton Hessian matrix based on examining the auto‐correlation and cross‐correlation of the Jacobian matrix. As the second preconditioner, we employ the approximation of the inverse of the Gauss‐Newton Hessian matrix. This preconditioner is constructed by terminating the iteration process of the conjugate gradient least‐squares method, which is used for inverting the Hessian matrix before it converges. In our preconditioned non‐linear conjugate gradient algorithms, the step‐length along the search direction, which is a crucial factor for the convergence, is carefully chosen to maximize the reduction of the cost function after each iteration. The numerical simulation results show that by including a very limited number of non‐zero elements in the approximate Hessian, the first preconditioned non‐linear conjugate gradient algorithm is able to yield comparable inversion results to the Gauss‐Newton method while maintaining the efficiency of the un‐preconditioned non‐linear conjugate gradient method. The only extra cost is the computation of the inverse of the approximate sparse Hessian matrix, which is less expensive than the computation of a forward simulation of one source at one frequency of operation. The second preconditioned non‐linear conjugate gradient algorithm also significantly saves the computational expense in comparison with the Gauss‐Newton method while maintaining the Gauss‐Newton reconstruction quality. However, this second preconditioned non‐linear conjugate gradient algorithm is more expensive than the first one.  相似文献   

12.
反演问题的时空间分辨率或称时空分辨长度是评估模型精细程度的重要参数,决定了该模型应用的范围和价值,但是分辨长度估算却是比反演更复杂和麻烦的数学问题。除了层析成像中广泛利用理论模型恢复试验定性提取空间分辨长度外,通过求解分辨率矩阵可定量获得分辨长度。通过矩阵操作给出的分辨率矩阵包括三类:直接分辨率矩阵、正则化分辨率矩阵和混合分辨率矩阵。这三类矩阵包含了反演本身不同侧面的信息,因此在一个反演应用中,同时提供这三类分辨率矩阵可更全面地评估反演模型分辨率分布。最近An(2012)提出了从大量随机理论模型及其解中统计出分辨率矩阵的方法。这种分辨率矩阵是从模拟真实反演实验的输入和输出模型中通过反演得到的,因此这种分辨率矩阵更能反映整个反演所涉及到的更多因素和过程;同时由于这种分辨率矩阵计算过程无需进行矩阵操作且不依赖于具体正演和反演方法,因此可以被应用于更普遍的反演问题。实际应用证明统计分辨率分析方法适用于对二维和三维层析成像反演模型进行分辨率分析。  相似文献   

13.
Practical decisions are often made based on the subsurface images obtained by inverting geophysical data. Therefore it is important to understand the resolution of the image, which is a function of several factors, including the underlying geophysical experiment, noise in the data, prior information and the ability to model the physics appropriately. An important step towards interpreting the image is to quantify how much of the solution is required to satisfy the data observations and how much exists solely due to the prior information used to stabilize the solution. A procedure to identify the regions that are not constrained by the data would help when interpreting the image. For linear inverse problems this procedure is well established, but for non‐linear problems the procedure is more complicated. In this paper we compare two different approaches to resolution analysis of geophysical images: the region of data influence index and a resolution spread computed using point spread functions. The region of data influence method is a fully non‐linear approach, while the point spread function analysis is a linearized approach. An approximate relationship between the region of data influence and the resolution matrix is derived, which suggests that the region of data influence is connected with the rows of the resolution matrix. The point‐spread‐function spread measure is connected with the columns of the resolution matrix, and therefore the point‐spread‐function spread and the region of data influence are fundamentally different resolution measures. From a practical point of view, if two different approaches indicate similar interpretations on post‐inversion images, the confidence in the interpretation is enhanced. We demonstrate the use of the two approaches on a linear synthetic example and a non‐linear synthetic example, and apply them to a non‐linear electromagnetic field data example.  相似文献   

14.
15.
Regularization methods are used to recover a unique and stable solution in ill-posed geophysical inverse problems. Due to the connection of homogeneous operators that arise in many geophysical inverse problems to the Fourier basis, for these operators classical regularization methods possess some limitations that one may try to circumvent by wavelet techniques.
In this paper, we introduce a two-step wavelet-based regularization method that combines classical regularization methods with wavelet transform to solve ill-posed linear inverse problems in geophysics. The power of the two-step wavelet-based regularization for linear inversion is twofold. First, regularization parameter choice is straightforward; it is obtained from a priori estimate of data variance. Second, in two-step wavelet-based regularization the basis can simultaneously diagonalize both the operator and the prior information about the model to be recovered. The latter is performed by wavelet-vaguelette decomposition using orthogonal symmetric fractional B-spline wavelets.
In the two-step wavelet-based regularization method, at the first step where fully classical tools are used, data is inverted for the Moore-Penrose solution of the problem, which is subsequently used as a preliminary input model for the second step. Also in this step, a model-independent estimate of data variance is made using nonparametric estimation and L-curve analysis. At the second step, wavelet-based regularization is used to partially recover the smoothness properties of the exact model from the oscillatory preliminary model.
We illustrated the efficiency of the method by applying on a synthetic vertical seismic profiling data. The results indicate that a simple non-linear operation of weighting and thresholding of wavelet coefficients can consistently outperform classical linear inverse methods.  相似文献   

16.
This paper describes least‐squares reverse‐time migration. The method provides the exact adjoint operator pair for solving the linear inverse problem, thereby enhancing the convergence of gradient‐based iterative linear inversion methods. In this formulation, modified source wavelets are used to correct the source signature imprint in the predicted data. Moreover, a roughness constraint is applied to stabilise the inversion and reduce high‐wavenumber artefacts. It is also shown that least‐squares migration implicitly applies a deconvolution imaging condition. Three numerical experiments illustrate that this method is able to produce seismic reflectivity images with higher resolution, more accurate amplitudes, and fewer artefacts than conventional reverse‐time migration. The methodology is currently feasible in 2‐D and can naturally be extended to 3‐D when computational resources become more powerful.  相似文献   

17.
The inversion of resistivity profiling data involves estimation of the spatial distribution of resistivities and thicknesses of rock layers from the apparent resistivity data values measured in the field as a function of electrode separation. The drawbacks of using traditional curve-matching techniques to solve this inverse problem have been overcome by iterative linear techniques but these require good starting models even if the shape of the causative body is asssumed known. In spite of the recent developments in inversion techniques, no robust method exists for the inversion of resistivity profiling data for the simple model of dikes and spheres which are the classical models of geophysical prospecting. We apply three different non-linear inversion schemes to invert synthetic resistivity profiling data for the classical models embedded in a uniform matrix of contrasting resistivity. The three non-linear algorithms used are called the Metropolis simulated annealing (SA), very fast simulated annealing (VFSA) and a genetic algorithm (GA). We compare the performance of the three algorithms using synthetic data for an outcropping vertical dike model. Although all three methods were successful in obtaining optimal solutions for arbitrary starting models, VFSA proved to be computationally the most efficient.  相似文献   

18.
We developed a frequency‐domain acoustic‐elastic coupled waveform inversion based on the Gauss‐Newton conjugate gradient method. Despite the use of a high‐performance computer system and a state‐of‐the‐art parallel computation algorithm, it remained computationally prohibitive to calculate the approximate Hessian explicitly for a large‐scale inverse problem. Therefore, we adopted the conjugate gradient least‐squares algorithm, which is frequently used for geophysical inverse problems, to implement the Gauss‐Newton method so that the approximate Hessian is calculated implicitly. Thus, there was no need to store the Hessian matrix. By simultaneously back‐propagating multi‐components consisting of the pressure and displacements, we could efficiently extract information on the subsurface structures. To verify our algorithm, we applied it to synthetic data sets generated from the Marmousi‐2 model and the modified SEG/EAGE salt model. We also extended our algorithm to the ocean‐bottom cable environment and verified it using ocean‐bottom cable data generated from the Marmousi‐2 model. With the assumption of a hard seafloor, we recovered both the P‐wave velocity of complicated subsurface structures as well as the S‐wave velocity. Although the inversion of the S‐wave velocity is not feasible for the high Poisson's ratios used to simulate a soft seafloor, several strategies exist to treat this problem. Our example using multi‐component data showed some promise in mitigating the soft seafloor effect. However, this issue still remains open.  相似文献   

19.
物理大地测量学与地球物理学结合中的有关问题评注   总被引:2,自引:0,他引:2  
本文依据大地重力学反问题的有关研究,对重力场边界扰动量的本征含义进行分析,由此揭示出它们在逼近地球实际重力场源过程中所具有的物理意义及存在的不足。然后进一步论及正常场源的非物理性上,并对其解决途径进行了探讨,最后对大地得力学反问题研究中的物理核--正交分解定理描述的场源量所具有的实际意义及其在地球物理反演中的具有的作用进行了分析和评注。  相似文献   

20.
基于混合差分进化算法的地球物理线性反演   总被引:4,自引:0,他引:4       下载免费PDF全文
地球物理反问题线性化处理之后, 各种反演算法归结为对病态线性方程组的求解. 为了快速准确地计算出地球物理参数, 本文提出了一种全新的基于LSQR算法的混合差分进化算法(Hybrid Differential Evolution Algorithm, HDE). 该算法利用LSQR算法给出DE算法的初始种群, 提高DE算法的计算速度和稳定性. 在不同噪声水平下, 对四种正则化方法Tikhonov、TSVD、LSQR和HDE的反演结果进行详细比较. 理论模型和实际数据反演的结果都表明: 改进的HDE算法应用于地球物理反问题的求解是成功的: 反演结果与原设定模型具有较高的相关性, 在稳定性和准确性上较常规的反演算法都具有一定的优势; 而且不需要给定正则化参数, 具有更强的实用性.  相似文献   

设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号