Patch Complexity, Finite Pixel Correlations and Optimal Denoising
Name
Levin2012.pdf
Description
Accepted version
Size
646.91 KB
Format
Adobe PDF
Checksum (MD5)
7f119bafc7481532b1c6ce9cecb810a7
Author(s)
Levin, Anat
Nadler, Boaz
Durand, Fredo
Freeman, William T.
Date Issued
2012
Publisher
Springer Nature
Citation
Levin, Anat, Nadler, Boaz, Durand, Fredo and Freeman, William T. 2012. "Patch Complexity, Finite Pixel Correlations and Optimal Denoising."
Version
Author's final manuscript
Abstract
Image restoration tasks are ill-posed problems, typically solved with priors. Since the optimal prior is the exact unknown density of natural images, actual priors are only approximate and typically restricted to small patches. This raises several questions: How much may we hope to improve current restoration results with future sophisticated algorithms? And more fundamentally, even with perfect knowledge of natural image statistics, what is the inherent ambiguity of the problem? In addition, since most current methods are limited to finite support patches or kernels, what is the relation between the patch complexity of natural images, patch size, and restoration errors? Focusing on image denoising, we make several contributions. First, in light of computational constraints, we study the relation between denoising gain and sample size requirements in a non parametric approach. We present a law of diminishing return, namely that with increasing patch size, rare patches not only require a much larger dataset, but also gain little from it. This result suggests novel adaptive variable-sized patch schemes for denoising. Second, we study absolute denoising limits, regardless of the algorithm used, and the converge rate to them as a function of patch size. Scale invariance of natural images plays a key role here and implies both a strictly positive lower bound on denoising and a power law convergence. Extrapolating this parametric law gives a ballpark estimate of the best achievable denoising, suggesting that some improvement, although modest, is still possible. © 2012 Springer-Verlag.
MIT Department
Massachusetts Institute of Technology. Computer Science and Artificial Intelligence Laboratory
Terms of Use
Creative Commons Attribution-Noncommercial-Share Alike
Persistent DSpace Link
DOI of Published Version
https://doi.org/10.1007/978-3-642-33715-4_6
