Blind deblurring using internal patch recurrence

328Citations
Citations of this article
142Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

Recurrence of small image patches across different scales of a natural image has been previously used for solving ill-posed problems (e.g. super- resolution from a single image). In this paper we show how this multi-scale property can also be used for "blind-deblurring", namely, removal of an unknown blur from a blurry image. While patches repeat 'as is' across scales in a sharp natural image, this cross-scale recurrence significantly diminishes in blurry images. We exploit these deviations from ideal patch recurrence as a cue for recovering the underlying (unknown) blur kernel. More specifically, we look for the blur kernel k, such that if its effect is "undone" (if the blurry image is deconvolved with k), the patch similarity across scales of the image will be maximized. We report extensive experimental evaluations, which indicate that our approach compares favorably to state-of-the-art blind deblurring methods, and in particular, is more robust than them. © 2014 Springer International Publishing.

Cite

CITATION STYLE

APA

Michaeli, T., & Irani, M. (2014). Blind deblurring using internal patch recurrence. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 8691 LNCS, pp. 783–798). Springer Verlag. https://doi.org/10.1007/978-3-319-10578-9_51

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