Inversion of nuclear magnetic resonance echo data based on maximum entropy

Geophysics ◽  
2016 ◽  
Vol 81 (1) ◽  
pp. D1-D8 ◽  
Author(s):  
Youlong Zou ◽  
Ranhong Xie ◽  
Yejiao Ding ◽  
Alon Arad

Nuclear magnetic resonance (NMR) [Formula: see text] inversion is an ill-posed problem in which regularization techniques are usually adopted to suppress the oscillations caused by noise in the solutions. The maximum entropy concept provides an unbiased way to obtain information from incomplete data, and it implicitly imposes a positive constraint on probability distribution, so we used the maximum entropy method to invert NMR echo data. We have developed a simple and effective method for solving the objective function of the maximum entropy method. First, the solution was replaced by a positive function to achieve the positive constraint of the solution, the objective function was converted to an unconstrained one, and then the Levenberg-Marquardt method was used to solve the newly obtained unconstrained objective function. To suppress the highly tilted tail at the short relaxation time of the [Formula: see text] distribution, a modified or normalized Shannon entropy function was used to replace the standard Shannon entropy function as the penalty term. Furthermore, the S-curve method was used to select the regularization parameter and the formula of the slope of the S-curve was developed. We have determined that the maximum entropy method was better able to separate the peaks of short and long relaxation times in the [Formula: see text] distribution in comparison with the truncated singular value decomposition method. This was true for low signal-to-noise ratio data derived from numerical simulation and the NMR log. In addition, the short relaxation peak caused by the norm smoothing method can also be reduced.

1995 ◽  
Vol 30 (3) ◽  
pp. 150-155 ◽  
Author(s):  
GISBERT BRINKMANN ◽  
UWE H. MELCHERT ◽  
WOLFGANG DREHER ◽  
JOACHIM BROSSMANN ◽  
HENDRIK TRESSING ◽  
...  

1986 ◽  
Vol 14 (6) ◽  
pp. 1262-1263 ◽  
Author(s):  
JENNIFER C. J. BARNA ◽  
ERNEST D. LAUE ◽  
MICHAEL. R. MAYGER ◽  
JOHN SKILLING ◽  
SIMON J. P. WORRALL

2012 ◽  
Vol 532-533 ◽  
pp. 1011-1015 ◽  
Author(s):  
Qiu Hong Huang ◽  
De Xin Cao

A numerical method is proposed for solving a sort of constrained continuous minimax problem, in which both the objective function and the constraint functions are continuously differentiable about superior decision variables and are continuous about lower decision variables .Besides,the constraint functions include only superior or lower decision variables.The problem is transformed into unconstrained differentiable problem with the idea of the discrete maximum entropy function and the continuous maximum entropy function and the penalty function method.The basic algorithm is established.The convergence is proofed.Numerical examples are given and show the efficiency and the reliability of the algorithm.


2010 ◽  
Vol 58 (12) ◽  
pp. 6040-6051 ◽  
Author(s):  
Émilie Chouzenoux ◽  
Saïd Moussaoui ◽  
Jérôme Idier ◽  
François Mariette

Sign in / Sign up

Export Citation Format

Share Document