Sparsity constraints using a Laplacian kernel to get geological structures from potential field data

2017 ◽  
Vol 16 (1) ◽  
pp. 39-52 ◽  
Author(s):  
Zhaohai Meng ◽  
Fengting Li ◽  
XueChun Xu ◽  
Wenyue Zhou ◽  
Danian Hang
2021 ◽  
Vol 54 (2E) ◽  
pp. 150-163
Author(s):  
Nguyen Kim Dung

The position of a maximum point of a function depends on its coefficients and order. The maximum horizontal gradient method is a popular method that greatly contributes to the detection of maximum points and approximation of geological structures edges. By adopting a mathematical logic, Blakely and Simpson established a quadratic function based on the characteristic of three points of a straight line in the fundamental directions. However, for potential field data like gravity and magnetic data, the coefficients of a quadratic function in each direction are not only dependent on the values of three points on a straight line, but also, they depend on the values of the surrounding points. This article proposes an algorithm which can detect maximum points more effectively in order to delineate geological structures boundaries from potential field data. The proposed algorithm uses a 3×3 neighborhood data grid to establish a two-variables function and to determine its coefficients by applying the Gaussian elimination method. After the two-variables function has been established, the algorithm estimates any extreme points and their positions from a set of four single-variable functions which correspond to the horizontal, vertical and the two diagonal directions by the cases x = 0, y = 0, y = -x and y = x of the main function. Finally, the conditions to detect the maximum point from the extreme points are defined. The validity of the algorithm was demonstrated on synthetic datasets generated by two different model structures. A real data application of the method has also been realized by estimating the geological boundaries by gravity data in the Vietnam’s continental shelf. The results obtained from the synthetic applications of the algorithm proved that it can determine more maximum points as compared to Blakely and Simpson method, and as a result, in all the test cases, it has drawn the real boundaries of the model structures more accurately. The application results of the method on real data revealed new boundary delineations in the research area, interpreted to be faults or fractures which lies between deep trench in the East Vietnam Sea.


2021 ◽  
Vol 14 (1) ◽  
Author(s):  
Luan Thanh Pham ◽  
Ozkan Kafadar ◽  
Erdinc Oksum ◽  
Ahmed M. Eldosouky

Geophysics ◽  
2014 ◽  
Vol 79 (1) ◽  
pp. IM1-IM9 ◽  
Author(s):  
Nathan Leon Foks ◽  
Richard Krahenbuhl ◽  
Yaoguo Li

Compressive inversion uses computational algorithms that decrease the time and storage needs of a traditional inverse problem. Most compression approaches focus on the model domain, and very few, other than traditional downsampling focus on the data domain for potential-field applications. To further the compression in the data domain, a direct and practical approach to the adaptive downsampling of potential-field data for large inversion problems has been developed. The approach is formulated to significantly reduce the quantity of data in relatively smooth or quiet regions of the data set, while preserving the signal anomalies that contain the relevant target information. Two major benefits arise from this form of compressive inversion. First, because the approach compresses the problem in the data domain, it can be applied immediately without the addition of, or modification to, existing inversion software. Second, as most industry software use some form of model or sensitivity compression, the addition of this adaptive data sampling creates a complete compressive inversion methodology whereby the reduction of computational cost is achieved simultaneously in the model and data domains. We applied the method to a synthetic magnetic data set and two large field magnetic data sets; however, the method is also applicable to other data types. Our results showed that the relevant model information is maintained after inversion despite using 1%–5% of the data.


2010 ◽  
Author(s):  
M. Shyeh Sahibul Karamah ◽  
M. N. Khairul Arifin ◽  
Mohd N. Nawawi ◽  
A. K. Yahya ◽  
Shah Alam

2014 ◽  
Vol 644-650 ◽  
pp. 2670-2673
Author(s):  
Jun Wang ◽  
Xiao Hong Meng ◽  
Fang Li ◽  
Jun Jie Zhou

With the continuing growth in influence of near surface geophysics, the research of the subsurface structure is of great significance. Geophysical imaging is one of the efficient computer tools that can be applied. This paper utilize the inversion of potential field data to do the subsurface imaging. Here, gravity data and magnetic data are inverted together with structural coupled inversion algorithm. The subspace (model space) is divided into a set of rectangular cells by an orthogonal 2D mesh and assume a constant property (density and magnetic susceptibility) value within each cell. The inversion matrix equation is solved as an unconstrained optimization problem with conjugate gradient method (CG). This imaging method is applied to synthetic data for typical models of gravity and magnetic anomalies and is tested on field data.


Sign in / Sign up

Export Citation Format

Share Document