Denoising as well as the best of any two denoisers

07/12/2020
by   Erik Ordentlich, et al.
0

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.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
03/10/2023

Design and analysis of a microplate assay in the presence of multiple restrictions on the randomization

Experiments using multi-step protocols often involve several restriction...
research
03/05/2020

Unsupervised Neural Universal Denoiser for Finite-Input General-Output Noisy Channel

We devise a novel neural network-based universal denoiser for the finite...
research
10/30/2020

In Searching of Long Skew-symmetric Binary Sequences with High Merit Factors

In this paper we present best-known merit factors of longer binary seque...
research
07/12/2023

On the Binary Symmetric Channel with a Transition Probability Determined by a Poisson Distribution

The classical Binary Symmetric Channel has a fixed transition probabilit...
research
07/13/2021

Complexity and Second Moment of the Mathematical Theory of Communication

The performance of an error correcting code is evaluated by its error pr...
research
05/26/2020

Communicating over the Torn-Paper Channel

We consider the problem of communicating over a channel that randomly "t...
research
02/24/2019

Iterative Channel Estimation for Discrete Denoising under Channel Uncertainty

We propose a novel iterative channel estimation (ICE) algorithm that ess...

Please sign up or login with your details

Forgot password? Click here to reset