scholarly journals Semiblind Image Deconvolution with Spatially Adaptive Total Variation Regularization

2014 ◽  
Vol 2014 ◽  
pp. 1-8 ◽  
Author(s):  
Yaduan Ruan ◽  
Houzhang Fang ◽  
Qimei Chen
Keyword(s):  
Total Variation ◽  
Spatial Information ◽  
Total Variation Regularization ◽  
Image Deconvolution ◽  
Split Bregman ◽  
Edge Information ◽  
Spatially Adaptive ◽  
Comparative Results ◽  
Simulated Images ◽  
Adaptive Total Variation

A semiblind image deconvolution algorithm with spatially adaptive total variation (SATV) regularization is introduced. The spatial information in different image regions is incorporated into regularization by using the edge indicator called difference eigenvalue to distinguish flat areas from edges. Meanwhile, the split Bregman method is used to optimize the proposed SATV model. The proposed algorithm integrates the spatial constraint and parametric blur-kernel and thus effectively reduces the noise in flat regions and preserves the edge information. Comparative results on simulated images and real passive millimeter-wave (PMMW) images are reported.

scholarly journals An efficient algorithm for adaptive total variation based image decomposition and restoration

2014 ◽  
Vol 24 (2) ◽  
pp. 405-415 ◽  
Author(s):  
Xinwu Liu ◽  
Lihong Huang
Keyword(s):  
Total Variation ◽  
Image Decomposition ◽  
Energy Functional ◽  
Total Variation Regularization ◽  
Split Bregman Method ◽  
Split Bregman ◽  
Edge Preserving ◽  
Sharp Edges ◽  
Adaptive Total Variation ◽  
Important Structure

Abstract With the aim to better preserve sharp edges and important structure features in the recovered image, this article researches an improved adaptive total variation regularization and H−1 norm fidelity based strategy for image decomposition and restoration. Computationally, for minimizing the proposed energy functional, we investigate an efficient numerical algorithm—the split Bregman method, and briefly prove its convergence. In addition, comparisons are also made with the classical OSV (Osher–Sole–Vese) model (Osher et al., 2003) and the TV-Gabor model (Aujol et al., 2006), in terms of the edge-preserving capability and the recovered results. Numerical experiments markedly demonstrate that our novel scheme yields significantly better outcomes in image decomposition and denoising than the existing models.

Spatially adaptive total variation deblurring with split Bregman technique

2018 ◽  
Vol 12 (6) ◽  
pp. 948-958 ◽  
Author(s):  
Mahdi Dodangeh ◽  
Isabel N. Figueiredo ◽  
Gil Gonçalves
Keyword(s):  
Total Variation ◽  
Split Bregman ◽  
Spatially Adaptive ◽  
Adaptive Total Variation

scholarly journals Performance of relaxed iterative methods for image deblurring problems

2019 ◽  
Vol 13 ◽  
pp. 174830261986173 ◽  
Author(s):  
Jae H Yun
Keyword(s):  
Fixed Point ◽  
Iterative Methods ◽  
Total Variation ◽  
Numerical Experiments ◽  
Krylov Subspace ◽  
Image Deblurring ◽  
Total Variation Regularization ◽  
L1 Norm ◽  
Split Bregman ◽  
Relaxation Parameters

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.

An Enhanced NAS-RIF Algorithm for Blind Image Restoration Based on Total Variation Regularization

2013 ◽  
Vol 423-426 ◽  
pp. 2522-2525
Author(s):  
Xin Ke Li ◽  
Chao Gao ◽  
Yong Cai Guo ◽  
Yan Hua Shao
Keyword(s):  
Image Restoration ◽  
Total Variation ◽  
Signal To Noise Ratio ◽  
Random Noise ◽  
Tikhonov Regularization Method ◽  
Total Variation Regularization ◽  
Inverse Filtering ◽  
Blind Image Restoration ◽  
Spatially Adaptive ◽  
Blind Image

In order to improve the quality of blind image restoration, we propose an algorithm which combines Non-negativity and Support constraint Recursive Inverse Filtering (NAS-RIF) and adaptive total variation regularization. In the proposed algorithm, the total variation regularization constraint term is added in the NAS-RIF algorithm cost function. The majorization-minimization approach and conjugate gradient iterative algorithm are adopted to improve the convergence speed. We do the simulation experiments for the blurred classic test image which is added additive random noise. Experimental results show that the restoration effect of our algorithm is better than the spatially adaptive Tikhonov regularization method and the NAS-RIF spatially adaptive regularization algorithm, while the value of improvement of signal to noise ratio (ISNR) has improved.

Sign in / Sign up

Export Citation Format

Share Document