The DOI matches its Crossref record; 37 of the 37 references it cites were found in a registry or an index.
Understanding 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. We show that, using reasonable image priors, a naive simulations MAP estimation of both latent image and blur kernel is guaranteed to fail even with infinitely large images sampled from the prior. 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 is well constrained and is guaranteed to succeed to recover the true blur. The plethora of recent deconvolution techniques makes an experimental evaluation on ground-truth data important. As a first step toward this experimental evaluation, we have collected blur data with ground truth and compared recent algorithms under equal settings. Additionally, our data demonstrate 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.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
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
Cites
Fundamentals of Statistical Signal Processing: Estimation Theory
Sengijpta, S. K. (1995) · Technometrics · doi:10.1080/00401706.1995.10484391 · Cited by 11,076
Fundamentals of statistical signal processing: Estimation theory
Prasad, K. V. (1994) · Control Engineering Practice · doi:10.1016/0967-0661(94)90195-3 · Cited by 7,902
Phase retrieval algorithms: a comparison
Fienup, J. R. (1982) · Applied Optics · doi:10.1364/ao.21.002758 · Cited by 5,596
A practical algorithm for the determination of phase from image and diffraction plane pictures
Gerchberg, R. W. (1972) · Optik · Cited by 4,519
Self-Recovering Equalization and Carrier Tracking in Two-Dimensional Data Communication Systems
Godard, D. (1980) · IEEE Transactions on Communications · doi:10.1109/tcom.1980.1094608 · Cited by 2,530
Removing camera shake from a single photograph
Fergus, R., Singh, B., Hertzmann, A., Roweis, S. T., & Freeman, W. T. (2006) · ACM Transactions on Graphics · doi:10.1145/1141911.1141956 · Cited by 1,815
Self-citationJähne, B. (2002) · Springer eBooks · doi:10.1007/978-3-662-04781-1 · Cited by 1,662
High-quality motion deblurring from a single image
Shan, Q., Jia, J., & Agarwala, A. (2008) · ACM Transactions on Graphics · doi:10.1145/1360612.1360672 · Cited by 1,386
Kundur, D., & Hatzinakos, D. (1996) · IEEE Signal Processing Magazine · doi:10.1109/79.489268 · Cited by 1,275
Understanding and evaluating blind deconvolution algorithms
Levin, A., Weiss, Y., Durand, F., & Freeman, W. T. (2009) · 2009 IEEE Conference on Computer Vision and Pattern Recognition · doi:10.1109/cvpr.2009.5206815 · Cited by 1,208
Self-citation
Cited by
Blind Deconvolution Using Convex Programming
Ahmed, A., Recht, B., & Romberg, J. (2014) · IEEE Transactions on Information Theory · doi:10.1109/tit.2013.2294644 · Cited by 387
Total Variation Blind Deconvolution: The Devil Is in the Details
Perrone, D., & Favaro, P. (2014) · 2014 IEEE Conference on Computer Vision and Pattern Recognition · doi:10.1109/cvpr.2014.372 · Cited by 280
Stochastic Model-Based Minimization of Weakly Convex Functions
Davis, D., & Drusvyatskiy, D. (2019) · SIAM Journal on Optimization · doi:10.1137/18m1178244 · Cited by 258
A Clearer Picture of Total Variation Blind Deconvolution
Perrone, D., & Favaro, P. (2016) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2015.2477819 · Cited by 109
Accurate retrieval of region of interest for estimating point spread function and image deblurring
Mohd Shapri, A. H., & Abdullah, M. Z. (2017) · The Imaging Science Journal · doi:10.1080/13682199.2017.1341457 · Cited by 6
Understanding image priors in blind deconvolution
Sroubek, F., Smidl, V., & Kotera, J. (2014) · 2014 IEEE International Conference on Image Processing (ICIP) · doi:10.1109/icip.2014.7025911 · Cited by 4
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 Transactions on Pattern Analysis and Machine Intelligence
- Published
- 2011-12
- Volume
- 33
- Issue
- 12
- Pages
- 2354-2367
- ISSN
- 0162-8828 (ISSN-L)
- 2160-9292
- OpenAlex
- W2161804069
- Cited by
- 425
- References
- 37
- FWCI
- 21.39
- Type
- journal article
- 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.