Universal discrete denoising

Tsachy Weissman, Erik Ordentlich, Gadiel Seroussi, Sergio Verdu, Marcelo Weinberger

Research output: Chapter in Book/Report/Conference proceedingConference contribution

4 Scopus citations

Abstract

We propose a discrete denoising algorithm, that, based on the observation of the output of a known discrete memoryless channel (DMC), estimates the input sequence to minimize a given fidelity criterion. The algorithm is universal in the sense that it requires no knowledge of the input sequence or its statistical properties. Yet, asymptotically it performs as well as the optimum denoiser that knows the input sequence distribution. The proposed denoising algorithm is practical, and can be implemented in O(n log n) time and O(n2/3log n) storage complexity. Extensions to the case of delay-constrained denoising, and to the case of channel uncertainty, are briefly discussed.

Original languageEnglish (US)
Title of host publicationProceedings of the 2002 IEEE Information Theory Workshop, ITW 2002
PublisherInstitute of Electrical and Electronics Engineers Inc.
Pages11-14
Number of pages4
ISBN (Electronic)0780376293, 9780780376298
DOIs
StatePublished - Jan 1 2002
Event2002 IEEE Information Theory Workshop, ITW 2002 - Bangalore, India
Duration: Oct 20 2002Oct 25 2002

Publication series

NameProceedings of the 2002 IEEE Information Theory Workshop, ITW 2002

Other

Other2002 IEEE Information Theory Workshop, ITW 2002
CountryIndia
CityBangalore
Period10/20/0210/25/02

All Science Journal Classification (ASJC) codes

  • Information Systems
  • Electrical and Electronic Engineering
  • Computer Networks and Communications
  • Computational Theory and Mathematics

Fingerprint Dive into the research topics of 'Universal discrete denoising'. Together they form a unique fingerprint.

Cite this