Fast Non-Local Algorithm for Image Denoising

For the non-local denoising approach presented by Buades et al., remarkable denoising results are obtained at high expense of computational cost. In this paper, a new algorithm that reduces the computational cost for calculating the similarity of neighborhood windows is proposed. We first introduce an approximate measure about the similarity of neighborhood windows, then we use an efficient Summed Square Image (SSI) scheme and Fast Fourier Transform (FFT) to accelerate the calculation of this measure. Our algorithm is about fifty times faster than the original non-local algorithm both theoretically and experimentally, yet produces comparable results in terms of mean-squared error (MSE) and perceptual image quality.

• Type: Conference
• Year: 2006
• Where: ICIP
• Authors: Jin Wang, Yanwen Guo, Yiting Ying, Yanli Liu, Qunsheng Peng
• Keywords: Computational Cost, ICIP 2006, Image Processing, Neighborhood Windows, Non-local Denoising Approach, Original Non-local Algorithm, Summed Square Image