An overcomplete pyramid representation for improved gsm image denoising

Damith J. Mudugamuwa, Wenjing Jia, Xiangjian He, Jie Yang

Research output: Chapter in Book/Conference proceedingConference contributionpeer-review

Abstract

Removing noise from a digital image is a challenging problem. Application of Gaussian Scale Mixtures (GSM) in the wavelet domain has been reported to be one of the most effective denoising algorithms, published to date. In this paper we investigate the impact of overcomplete wavelet image representations on the GSM image denoising algorithm. We explore the desirable local characteristics of wavelet coefficients that can enhance the efficiency of GSM denoising and based on the findings, we devise an improved over-complete pyramid representation to enhance the GSM denoising performance. We present the experimental denoising results using the proposed pyramid representation, and they outperform state-of-the-art GSM denoising results reported in the literature.

Original languageEnglish
Title of host publicationElectronic Proceedings of the 2011 IEEE International Conference on Multimedia and Expo, ICME 2011
DOIs
Publication statusPublished - 2011
Externally publishedYes
Event2011 12th IEEE International Conference on Multimedia and Expo, ICME 2011 - Barcelona, Spain
Duration: 11 Jul 201115 Jul 2011

Publication series

NameProceedings - IEEE International Conference on Multimedia and Expo
ISSN (Print)1945-7871
ISSN (Electronic)1945-788X

Conference

Conference2011 12th IEEE International Conference on Multimedia and Expo, ICME 2011
Country/TerritorySpain
CityBarcelona
Period11/07/1115/07/11

Keywords

  • Gaussian scale mixture
  • image denoising
  • overcomplete transforms
  • pyramid representations
  • Wavelet transforms

ASJC Scopus subject areas

  • Computer Networks and Communications
  • Computer Science Applications

Fingerprint

Dive into the research topics of 'An overcomplete pyramid representation for improved gsm image denoising'. Together they form a unique fingerprint.

Cite this