Deblurring by Solving a TVp-Regularized Optimization Problem Using Split Bregman Method. (16th December 2014)

• Record Type: Journal Article
• Authors: Xiao, Su
• Other Names: Rajan Deepu Academic Editor.
• Is Part Of: Advances in multimedia. Volume 2014(2014)
• Publication Date: 2014-12-16
• Subjects: Multimedia systems -- Periodicals; Computer networks -- Periodicals; Multimédia; Réseaux d'ordinateurs; Computer networks; Multimedia systems; Periodicals; 006.7
• DOI: 10.1155/2014/906464
• Languages: English
• ISSNs: 1687-5680

Abstract

Abstract : Image deblurring is formulated as an unconstrained minimization problem, and its penalty function is the sum of the error term and TV p -regularizers with 0 < p < 1 . Although TV p -regularizer is a powerful tool that can significantly promote the sparseness of image gradients, it is neither convex nor smooth, thus making the presented optimization problem more difficult to deal with. To solve this minimization problem efficiently, such problem is first reformulated as an equivalent constrained minimization problem by introducing new variables and new constraints. Thereafter, the split Bregman method, as a solver, splits the new constrained minimization problem into subproblems. For each subproblem, the corresponding efficient method is applied to ensure the existence of closed-form solutions. In simulated experiments, the proposed algorithm and some state-of-the-art algorithms are applied to restore three types of blurred-noisy images. The restored results show that the proposed algorithm is valid for image deblurring and is found to outperform other algorithms in experiments.