Split Bregman iteration algorithm for total bounded variation regularization based image deblurring (Q994320)

A novel total bounded variation regularization based image deblurring model is presented in the paper. The necessary definitions and preliminaries about the proposed model are described. A brief overview of some related iterative algorithms is given. Existence and uniqueness of the proposed extended split Bregman iteration is proven. Based on this, a rigorous convergence analysis of the corresponded iterative algorithm is provided. Numerical experiments intended for demonstrating the proposed method are accomplished. Three numerical results are presented to illustrate the efficiency and feasibility of the proposed algorithm. It is compared with the standard total variation based regularization scheme of \textit{L. I. Rudin}, \textit{S. Osher} and \textit{E. Fatemi} [Physica D 60, No. 1--4, 259--268 (1992; Zbl 0780.49028)] (the ROF model). The computations are performed in \texttt{MATLAB}. The obtained results are very promising particularly from the preserved details point of view compared with the standard scheme of the ROF method. It is believed that the proposed model and algorithm can be extended to further application in image processing and computer vision.