Abstract
Blind image deconvolution is one of the most challenging problems in image processing. The total variation (TV) regularization approach can effectively recover edges of image. In this paper, we propose a new TV blind deconvolution algorithm by employing split Bregman iteration (called as TV-BDSB). Considering the operator splitting and penalty techniques, we present also a new splitting objective function. Then, we propose an extended split Bregman iteration to address the minimizing problems, the latent image and the blur kernel are estimated alternately. The TV-BDSB algorithm can greatly reduce the computational cost and improve remarkably the image quality. Experiments are conducted on both synthetic and real-life degradations. Comparisons are also made with some existing blind deconvolution methods. Experimental results indicate the advantages of the proposed algorithm.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
More From: Journal of Visual Communication and Image Representation
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.