Show simple item record

dc.contributor.authorDurand, Fredo
dc.contributor.authorLevin, Anat
dc.contributor.authorWeiss, Yair
dc.contributor.authorFreeman, William T.
dc.date.accessioned2010-11-04T18:11:54Z
dc.date.available2010-11-04T18:11:54Z
dc.date.issued2009-08
dc.date.submitted2009-06
dc.identifier.isbn978-1-4244-3992-8
dc.identifier.ismn1063-6919
dc.identifier.otherINSPEC Accession Number: 10836014
dc.identifier.urihttp://hdl.handle.net/1721.1/59815
dc.description.abstractBlind deconvolution is the recovery of a sharp version of a blurred image when the blur kernel is unknown. Recent algorithms have afforded dramatic progress, yet many aspects of the problem remain challenging and hard to understand. The goal of this paper is to analyze and evaluate recent blind deconvolution algorithms both theoretically and experimentally. We explain the previously reported failure of the naive MAP approach by demonstrating that it mostly favors no-blur explanations. On the other hand we show that since the kernel size is often smaller than the image size a MAP estimation of the kernel alone can be well constrained and accurately recover the true blur. The plethora of recent deconvolution techniques makes an experimental evaluation on ground-truth data important. We have collected blur data with ground truth and compared recent algorithms under equal settings. Additionally, our data demonstrates that the shift-invariant blur assumption made by most algorithms is often violated.en_US
dc.description.sponsorshipIsraeli Science Foundationen_US
dc.description.sponsorshipRoyal Dutch/Shell Groupen_US
dc.description.sponsorshipUnited States. National Geospatial-Intelligence Agency (NEGI-1582- 04-0004)en_US
dc.description.sponsorshipNational Science Foundation (U.S.) (MURI Grant N00014-06-1-0734)en_US
dc.description.sponsorshipNational Science Foundation (U.S.) (NSF CAREER award 0447561)en_US
dc.description.sponsorshipMicrosoft Research New Faculty Fellowshipen_US
dc.description.sponsorshipAlfred P. Sloan Foundation (Sloan Fellowship)en_US
dc.language.isoen_US
dc.publisherInstitute of Electrical and Electronics Engineersen_US
dc.relation.isversionofhttp://dx.doi.org/10.1109/CVPRW.2009.5206815en_US
dc.rightsArticle is made available in accordance with the publisher's policy and may be subject to US copyright law. Please refer to the publisher's site for terms of use.en_US
dc.sourceIEEEen_US
dc.titleUnderstanding and evaluating blind deconvolution algorithmsen_US
dc.typeArticleen_US
dc.identifier.citationLevin, A. et al. “Understanding and evaluating blind deconvolution algorithms.” Computer Vision and Pattern Recognition, 2009. CVPR 2009. IEEE Conference on. 2009. 1964-1971. ©2009 Institute of Electrical and Electronics Engineers.en_US
dc.contributor.departmentMassachusetts Institute of Technology. Computer Science and Artificial Intelligence Laboratoryen_US
dc.contributor.departmentMassachusetts Institute of Technology. Department of Electrical Engineering and Computer Scienceen_US
dc.contributor.approverDurand, Fredo
dc.contributor.mitauthorDurand, Fredo
dc.contributor.mitauthorLevin, Anat
dc.contributor.mitauthorWeiss, Yair
dc.contributor.mitauthorFreeman, William T.
dc.relation.journalIEEE Conference on Computer Vision and Pattern Recognition, 2009. CVPR 2009en_US
dc.eprint.versionFinal published versionen_US
dc.type.urihttp://purl.org/eprint/type/JournalArticleen_US
eprint.statushttp://purl.org/eprint/status/PeerRevieweden_US
dspace.orderedauthorsLevin, A.; Weiss, Y.; Durand, F.; Freeman, W.T.en
dc.identifier.orcidhttps://orcid.org/0000-0001-9919-069X
dc.identifier.orcidhttps://orcid.org/0000-0002-2231-7995
mit.licensePUBLISHER_POLICYen_US
mit.metadata.statusComplete


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record