Image denoising using neighbouring wavelet coefficients

  • Authors:
  • G. Y. Chen;T. D. Bui;A. Krzyzak

  • Affiliations:
  • Department of Computer Science, Concordia University, 1455 De Maisonneuve West, Montreal, Quebec, Canada H3G 1M8. E-mail: {guang_c, bui, krzyzak}@cs.concordia.ca;Department of Computer Science, Concordia University, 1455 De Maisonneuve West, Montreal, Quebec, Canada H3G 1M8. E-mail: {guang_c, bui, krzyzak}@cs.concordia.ca;Department of Computer Science, Concordia University, 1455 De Maisonneuve West, Montreal, Quebec, Canada H3G 1M8. E-mail: {guang_c, bui, krzyzak}@cs.concordia.ca

  • Venue:
  • Integrated Computer-Aided Engineering
  • Year:
  • 2005

Quantified Score

Hi-index 0.00

Visualization

Abstract

The denoising of a natural image corrupted by Gaussian noise is a classical problem in signal or image processing. Donoho and his coworkers at Stanford pioneered a wavelet denoising scheme by thresholding the wavelet coefficients arising from the standard discrete wavelet transform. This work has been widely used in science and engineering applications. However, this denoising scheme tends to kill too many wavelet coefficients that might contain useful image information. In this paper, we propose one wavelet image thresholding scheme by incorporating neighbouring coefficients for both translation-invariant (TI) and non-TI cases. This approach is valid because a large wavelet coefficient will probably have large wavelet coefficients at its neighbour locations. Experimental results show that our algorithm is better than VisuShrink and the TI image denoising method developed by Yu et al. We also investigate different neighbourhood sizes and find that a size of 3 × 3 or 5 × 5 is the best among all window sizes.