9 September 2017 Convex composite wavelet frame and total variation-based image deblurring using nonconvex penalty functions
Author Affiliations +
Total variation (TV)-based image deblurring method can bring on staircase artifacts in the homogenous region of the latent images recovered from the degraded images while a wavelet/frame-based image deblurring method will lead to spurious noise spikes and pseudo-Gibbs artifacts in the vicinity of discontinuities of the latent images. To suppress these artifacts efficiently, we propose a nonconvex composite wavelet/frame and TV-based image deblurring model. In this model, the wavelet/frame and the TV-based methods may complement each other, which are verified by theoretical analysis and experimental results. To further improve the quality of the latent images, nonconvex penalty function is used to be the regularization terms of the model, which may induce a stronger sparse solution and will more accurately estimate the relative large gradient or wavelet/frame coefficients of the latent images. In addition, by choosing a suitable parameter to the nonconvex penalty function, the subproblem that splits by the alternative direction method of multipliers algorithm from the proposed model can be guaranteed to be a convex optimization problem; hence, each subproblem can converge to a global optimum. The mean doubly augmented Lagrangian and the isotropic split Bregman algorithms are used to solve these convex subproblems where the designed proximal operator is used to reduce the computational complexity of the algorithms. Extensive numerical experiments indicate that the proposed model and algorithms are comparable to other state-of-the-art model and methods.
© 2017 SPIE and IS&T
Zhengwei Shen, Zhengwei Shen, Lishuang Cheng, Lishuang Cheng, } "Convex composite wavelet frame and total variation-based image deblurring using nonconvex penalty functions," Journal of Electronic Imaging 26(5), 053005 (9 September 2017). https://doi.org/10.1117/1.JEI.26.5.053005 . Submission: Received: 28 February 2017; Accepted: 11 August 2017
Received: 28 February 2017; Accepted: 11 August 2017; Published: 9 September 2017

Back to Top