A new nonlinear reconstruction method based on total variation regularization of neutron penumbral imaging

2011 ◽  
Vol 82 (9) ◽  
pp. 093504 ◽  
Author(s):  
Weixin Qian ◽  
Shuangxi Qi ◽  
Wanli Wang ◽  
Jinming Cheng ◽  
Dongbing Liu
Information ◽  
2019 ◽  
Vol 10 (3) ◽  
pp. 115 ◽  
Author(s):  
Fan Lin ◽  
Yingpin Chen ◽  
Lingzhi Wang ◽  
Yuqun Chen ◽  
Wei Zhu ◽  
...  

The total variation (TV) regularization-based methods are proven to be effective in removing random noise. However, these solutions usually have staircase effects. This paper proposes a new image reconstruction method based on TV regularization with Lp-quasinorm and group gradient sparsity. In this method, the regularization term of the group gradient sparsity can retrieve the neighborhood information of an image gradient, and the Lp-quasinorm constraint can characterize the sparsity of the image gradient. The method can effectively deblur images and remove impulse noise to well preserve image edge information and reduce the staircase effect. To improve the image recovery efficiency, a Fast Fourier Transform (FFT) is introduced to effectively avoid large matrix multiplication operations. Moreover, by introducing accelerated alternating direction method of multipliers (ADMM) in the method to allow for a fast restart of the optimization process, this method can run faster. In numerical experiments on standard test images sourced form Emory University and CVG-UGR (Computer Vision Group, University of Granada) image database, the advantage of the new method is verified by comparing it with existing advanced TV-based methods in terms of peak signal-to-noise ratio (PSNR), structural similarity (SSIM), and operational time.


2021 ◽  
Vol 13 (13) ◽  
pp. 2514
Author(s):  
Qianwei Dai ◽  
Hao Zhang ◽  
Bin Zhang

The chaos oscillation particle swarm optimization (COPSO) algorithm is prone to binge trapped in the local optima when dealing with certain complex models in ground-penetrating radar (GPR) data inversion, because it inherently suffers from premature convergence, high computational costs, and extremely slow convergence times, especially in the middle and later periods of iterative inversion. Considering that the bilateral connections between different particle positions can improve both the algorithmic searching efficiency and the convergence performance, we first develop a fast single-trace-based approach to construct an initial model for 2-D PSO inversion and then propose a TV-regularization-based improved PSO (TVIPSO) algorithm that employs total variation (TV) regularization as a constraint technique to adaptively update the positions of particles. B by adding the new velocity variations and optimal step size matrices, the search range of the random particles in the solution space can be significantly reduced, meaning blindness in the search process can be avoided. By introducing constraint-oriented regularization to allow the optimization search to move out of the inaccurate region, the premature convergence and blurring problems can be mitigated to further guarantee the inversion accuracy and efficiency. We report on three inversion experiments involving multilayered, fluctuated terrain models and a typical complicated inner-interface model to demonstrate the performance of the proposed algorithm. The results of the fluctuated terrain model show that compared with the COPSO algorithm, the fitness error (MAE) of the TVIPSO algorithm is reduced from 2.3715 to 1.0921, while for the complicated inner-interface model the fitness error (MARE) of the TVIPSO algorithm is reduced from 1.9539 to 1.5674.


Author(s):  
Mitsuru Utsugi

Summary This paper presents a new sparse inversion method based on L1 norm regularization for 3D magnetic data. In isolation, L1 norm regularization yields model elements which are unconstrained by the input data to be exactly zero, leading to a sparse model with compact and focused structure. Here, we complement the L1 norm with a penalty minimizing total variation, the L1 norm of the model gradients; it is expected that the sharp boundaries of the subsurface structure are not compromised by incorporating this penalty. Although this penalty is widely used in the geophysical inversion studies, it is often replaced by an alternative quadratic penalty to ease solution of the penalized inversion problem; in this study, the original definition of the total variation, i.e., form of the L1 norm of the model gradients, is used. To solve the problem with this combined penalty of L1 norm and total variation, this study introduces alternative direction method of multipliers (ADMM), which is a primal-dual optimization algorithm that solves convex penalized problems based on the optimization of an augmented Lagrange function. To improve the computational efficiency of the algorithm to make this method applicable to large-scale magnetic inverse problems, this study applies matrix compression using the wavelet transform and the preconditioned conjugate gradient method. The inversion method is applied to both synthetic tests and real data, the synthetic tests demonstrate that, when subsurface structure is blocky, it can be reproduced almost perfectly.


2018 ◽  
Vol 39 (19) ◽  
pp. 6037-6060 ◽  
Author(s):  
Le Sun ◽  
Weidong Ge ◽  
Yunjie Chen ◽  
Jianwei Zhang ◽  
Byeungwoo Jeon

Sign in / Sign up

Export Citation Format

Share Document