The DOI matches its OpenAlex record.
Understanding and evaluating blind deconvolution algorithms
Abstract
Blind 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.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cited by
2008 IEEE Conference on Computer Vision and Pattern Recognition
(2008) · doi:10.1109/cvpr12618.2008 · Cited by 4,212
2013 IEEE Conference on Computer Vision and Pattern Recognition
(2013) · doi:10.1109/cvpr19808.2013 · Cited by 2,396
2014 IEEE Conference on Computer Vision and Pattern Recognition
(2014) · doi:10.1109/cvpr20399.2014 · Cited by 1,774
2007 IEEE Conference on Computer Vision and Pattern Recognition
(2007) · doi:10.1109/cvpr12085.2007 · Cited by 1,688
Two-Phase Kernel Estimation for Robust Motion Deblurring
Xu, L., & Jia, J. (2010) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-15549-9_12 · Cited by 1,027
Denoising Prior Driven Deep Neural Network for Image Restoration
Dong, W., Wang, P., Yin, W., Shi, G., Wu, F., & Lu, X. (2019) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2018.2873610 · Cited by 515
Blind Deblurring Using Internal Patch Recurrence
Michaeli, T., & Irani, M. (2014) · Lecture Notes in Computer Science · doi:10.1007/978-3-319-10578-9_51 · Cited by 403
Real-World Blur Dataset for Learning and Benchmarking Deblurring Algorithms
Rim, J., Lee, H., Won, J., & Cho, S. (2020) · Lecture Notes in Computer Science · doi:10.1007/978-3-030-58595-2_12 · Cited by 373
Single Image Deblurring Using Motion Density Functions
Gupta, A., Joshi, N., Lawrence Zitnick, C., Cohen, M., & Curless, B. (2010) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-15549-9_13 · Cited by 345
PSF accuracy measure for evaluation of blur estimation algorithms
Kotera, J., Zitova, B., & Sroubek, F. (2015) · 2015 IEEE International Conference on Image Processing (ICIP) · doi:10.1109/icip.2015.7351167 · Cited by 3
Metadata
- Authors
- Levin, A., Weiss, Y., Durand, F., & Freeman, W. T.
- Venue
- IEEE Computer Society Conference on Computer Vision and Pattern Recognition/Proceedings - IEEE Computer Society Conference on Computer Vision and Pattern Recognition/Proceedings
- Publisher
- Institute of Electrical and Electronics Engineers
- Published
- 2009-06-01
- ISSN
- 1063-6919 (ISSN-L)
- OpenAlex
- W4229828140
- Cited by
- 239
- References
- 0
- FWCI
- 4.63
- Type
- conference paper
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.