Abstract

Abstract The problem of blind image deblurring is more challenging than that of non-blind image deblurring, due to the lack of knowledge about the point spread function in the imaging process. In this paper, a learning-based method of estimating blur kernel under the l 0 regularization sparsity constraint is proposed for blind image deblurring. Specifically, we model the patch-based matching between the blurred image and its sharp counterpart via a coupled sparse representation. Once the blur kernel is obtained, a non-blind deblurring algorithm can be applied to the final recovery of the sharp image. Our experimental results show that the visual quality of restored sharp images is competitive with the state-of-the-art algorithms for both synthetic and real images.

Full Text
Published version (Free)

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