A non local total variation based on L1 norm for image recovery

2017 ◽  
Vol 32 (8) ◽  
pp. 635-641
Author(s):  
杨平先 YANG Ping-xian ◽  
陈明举 CHEN Ming-ju
2016 ◽  
Vol 61 (18) ◽  
pp. 6878-6891 ◽  
Author(s):  
Hojin Kim ◽  
Josephine Chen ◽  
Adam Wang ◽  
Cynthia Chuang ◽  
Mareike Held ◽  
...  

2021 ◽  
Vol 13 (1) ◽  
pp. 130-137
Author(s):  
Hugo Hidalgo-Silva ◽  
Enrique Gómez-Treviño

Abstract The problem of model recovering in the presence of impulse noise on the data is considered for the magnetotelluric (MT) inverse problem. The application of total variation regularization along with L1-norm penalized data fitting (TVL1) is the usual approach for the impulse noise treatment in image recovery. This combination works poorly when a high level of impulse noise is present on the data. A nonconvex operator named smoothly clipped absolute deviation (TVSCAD) was recently applied to the image recovery problem. This operator is solved using a sequence of TVL1 equivalent problems, providing a significant improvement over TVL1. In practice, TVSCAD requires the selection of several parameters, a task that can be very difficult to attain. A more simple approach to the presence of impulse noise in data is presented here. A nonconvex function is also considered in the data fitness operator, along with the total variation regularization operator. The nonconvex operator is solved by following a half-quadratic procedure of minimization. Results are presented for synthetic and also for field data, assessing the proposed algorithm’s capacity in model recovering under the influence of impulse noise on data for the MT problem.


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.


2019 ◽  
Vol 13 ◽  
pp. 174830261986173 ◽  
Author(s):  
Jae H Yun

In this paper, we consider performance of relaxation iterative methods for four types of image deblurring problems with different regularization terms. We first study how to apply relaxation iterative methods efficiently to the Tikhonov regularization problems, and then we propose how to find good preconditioners and near optimal relaxation parameters which are essential factors for fast convergence rate and computational efficiency of relaxation iterative methods. We next study efficient applications of relaxation iterative methods to Split Bregman method and the fixed point method for solving the L1-norm or total variation regularization problems. Lastly, we provide numerical experiments for four types of image deblurring problems to evaluate the efficiency of relaxation iterative methods by comparing their performances with those of Krylov subspace iterative methods. Numerical experiments show that the proposed techniques for finding preconditioners and near optimal relaxation parameters of relaxation iterative methods work well for image deblurring problems. For the L1-norm and total variation regularization problems, Split Bregman and fixed point methods using relaxation iterative methods perform quite well in terms of both peak signal to noise ratio values and execution time as compared with those using Krylov subspace methods.


2020 ◽  
Vol 14 (1) ◽  
Author(s):  
Phaneendra K. Yalavarthy ◽  
Sandeep Kumar Kalva ◽  
Manojit Pramanik ◽  
Jaya Prakash

Sign in / Sign up

Export Citation Format

Share Document