• DocumentCode
    640114
  • Title

    Denoising as well as the best of any two denoisers

  • Author

    Ordentlich, Erik

  • Author_Institution
    Hewlett-Packard Labs., Palo Alto, CA, USA
  • fYear
    2013
  • fDate
    7-12 July 2013
  • Firstpage
    1377
  • Lastpage
    1381
  • Abstract
    Given two arbitrary sequences of denoisers for block lengths tending to infinity we ask if it is possible to construct a third sequence of denoisers with an asymptotically vanishing (in block length) excess expected loss relative to the best expected loss of the two given denoisers for all clean channel input sequences. As in the setting of DUDE [1], which solves this problem when the given denoisers are sliding block denoisers, the construction is allowed to depend on the two given denoisers and the channel transition probabilities. We show that under certain restrictions on the two given denoisers the problem can be solved using a straightforward application of a known loss estimation paradigm. We then show by way of a counter-example that the loss estimation approach fails in the general case. Finally, we show that for the binary symmetric channel, combining the loss estimation with a randomization step leads to a solution to the stated problem under no restrictions on the given denoisers.
  • Keywords
    probability; signal denoising; binary symmetric channel; block lengths; channel transition probabilities; clean channel input sequences; loss estimation paradigm; randomization step; sliding block denoisers; straightforward application; Context; Decoding; Estimation; Noise measurement; Noise reduction; Zinc;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Information Theory Proceedings (ISIT), 2013 IEEE International Symposium on
  • Conference_Location
    Istanbul
  • ISSN
    2157-8095
  • Type

    conf

  • DOI
    10.1109/ISIT.2013.6620452
  • Filename
    6620452