An iterative variational model for blind image deconvolution

Q: How can I download an article?

To download an article from SID, first log in to the site, search for the article title, and click on the 'Download Article' option.

Q: How can I download an ISI article?

To download an ISI article on SID, enter the keyword or article title in the search bar, view the relevant results, click on the desired article, and select the 'Download Article' option.

Q: How can I access the SID database?

To access the SID database, visit SID.ir, create an account, and log in to access scientific resources.

Q: Is downloading articles from SID free?

Some articles on SID are available for free, while others require payment. Details are specified on the article's page.

Laaziri Bouchra; Hakim Abdelilah; Raghay Said

مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic Resources

Journal Paper

Paper Information

Journal: Journal of Mathematical Modeling Year:2022 | Volume:10 | Issue:3 Page(s): 467-486

Download Full-Text

View:

Download:

Cites:

Information Journal Paper

Title

An iterative variational model for blind image deconvolution

Author(s)

Laaziri Bouchra | Hakim Abdelilah | Raghay Said | Issue Writer Certificate

Keywords

Blind image deconvolution

supervised Bayesian approach

regularization

Abstract

Classical image deconvolution seeks an estimate of the true image when the blur kernel or the point spread function (PSF) of the blurring system is known a priori. However, Blind image deconvolution addresses the much more complicated, but realistic problem where the PSF is unknown. Bayesian inference approach with appropriate priors on the image and the blur has been used successfully to solve this blind problem, in particular with a Gaussian prior and a joint maximum a posteriori (JMAP) estimation. However, this technique is unstable and suffers from significant ringing artifacts in various applications. To overcome these limitations, we propose a regularized version using $H^1$ regularization terms on both the sharp image and the blur kernel. We present also useful techniques for estimating the smoothing parameters. We were able to derive an efficient algorithm that produces high quality deblurred results compared to some well-known methods in the literature.

Multimedia

No record.

Cites

No record.

References

No record.

Cite

Related Journal Papers

No record.

Related Seminar Papers

No record.

Related Plans