Robust image deblurring using hyper Laplacian model

4Citations
Citations of this article
10Readers
Mendeley users who have this article in their library.
Get full text

Abstract

In recent years, many image deblurring algorithms have been proposed, most of which assume the noise in the deblurring process satisfies the Gaussian distribution. However, it is often unavoidable in practice both in non-blind and blind image deblurring, due to the error on the input kernel and the outliers in the blurry image. Without proper handing these outliers, the recovered image estimated by previous methods will suffer severe artifacts. In this paper, we mainly deal with two kinds of non-Gaussian noise in the image deblurring process, inaccurate kernel and compressed blurry image, and find that handling the noise as Laplacian distribution can get more robust result in these cases. Based on this point, the new non-blind and blind image deblurring algorithms are proposed to restore the clear image. To get more robust deblurred result, we also use 8 direction gradients of the image to estimate the blur kernel. The new minimization problem can be efficiently solved by the Iteratively Reweighted Least Squares(IRLS) and the experimental results on both synthesized and real-world images show the efficiency and robustness of our algorithm. © 2013 Springer-Verlag.

Cite

CITATION STYLE

APA

Xu, Y., Hu, X., & Peng, S. (2013). Robust image deblurring using hyper Laplacian model. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 7729 LNCS, pp. 49–60). https://doi.org/10.1007/978-3-642-37484-5_5

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free