Abstract

Image non-blind deblurring is still an ill-posed problem. Uncertainty in solutions occurs when singular vectors of forward model matrix spanning the noise subspace have rather small singular values. This letter proposes a new image deblurring algorithm, called MNBC-Gibbs (multiple norms and boundary constraint enforced Gibbs sampling). To be more specific, the quadratic and sparseness-inducing norms are combined to construct regularization term, and the objective function is gradually minimized without requirement of regularization parameter choice. In particular, we propose an efficient Markov chain Monte Carlo (MCMC) method equipped with closed-form solution, artifacts processing and non-negative constraint to approximate the posterior distribution and estimate uncertainty for the unknown. Satisfactory deblurring results with sharp edges can be generated while maintaining smoothness without raising extra noise. The quantitative evaluations on different blur kernels and comparison with state-of-the-art image deblurring methods demonstrate the superiority of the proposed method. In addition, we show that our method can effectively deal with real blurry images.

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.