Abstract

The semi-blind image deblurring problem aims to simultaneously estimate the clean image and the point spread function (PSF), which results in a (jointly) nonconvex optimization problem. In this paper, we develop an efficient algorithm to tackle the corresponding minimization problem based on the framework of the proximal alternating minimization (PAM). We also establish the convergence of the proposed algorithm under a mild assumption. Numerical experiments demonstrate our approach could obtain a more robust performance than the related state-of-the-art semi-blind image deblurring method.

Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

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.