 |
 |
Abstract:Most existing state-of-the-art image denoising algorithms are based on exploiting similarity between a relatively modest number of patches. These patch-based methods are strictly dependent on patch matching, and their performance is hamstrung by the ability to reliably find sufficiently similar patches. As the number of patches grows, a point of diminishing returns is reached where the performance improvement due to more patches is offset by the lower likelihood of finding sufficiently close matches. The net effect is that while patchbased methods such as BM3D are excellent overall, they are ultimately limited in how well they can do on (larger) images with increasing complexity. In this work, we address these shortcomings by developing a paradigm for truly global filtering where each pixel is estimated from all pixels in the image. Our objectives in this paper are two-fold. First, we give a statistical analysis of our proposed global filter, based on a spectral decomposition of its corresponding operator, and we study the effect of truncation of this spectral decomposition. Second, we derive an approximation to the spectral (principal) components using the Nystrom extension. Using these, we demonstrate that this global filter can be implemented efficiently by sampling a fairly small percentage of the pixels in the image. Experiments illustrate that our strategy can effectively globalize any existing denoising filters to estimate each pixel using all pixels in the image, hence improving upon the best patch-based methods. |
Manuscript:H. Talebi and P. Milanfar, Global Image Denoising, IEEE Transactions on Image Processing, vol 23, No. 2, pp. 755-768, February 2014. (PDF) |
MATLAB Code:This software is provided for non-commercial research purposes only. Use at your own risk. No warranty is implied by this distribution. Copyright © 2013 by University of California. (Download) |
Examples:
|