Universal Minimax Discrete Denoising under Channel Uncertainty

Details Universal Minimax Discrete Denoising under Channel Uncertainty Universal Minimax Discrete Denoising under Channel Uncertainty

2005-04-13

arxiv.org/abs/cs/0504060v2

Computer Science

Information Theory

Submitted to IEEE Transactions of Information Theory

Scientific paper

The goal of a denoising algorithm is to recover a signal from its noise-corrupted observations. Perfect recovery is seldom possible and performance is measured under a given single-letter fidelity criterion. For discrete signals corrupted by a known discrete memoryless channel, the DUDE was recently shown to perform this task asymptotically optimally, without knowledge of the statistical properties of the source. In the present work we address the scenario where, in addition to the lack of knowledge of the source statistics, there is also uncertainty in the channel characteristics. We propose a family of discrete denoisers and establish their asymptotic optimality under a minimax performance criterion which we argue is appropriate for this setting. As we show elsewhere, the proposed schemes can also be implemented computationally efficiently.

Affiliated with

Also associated with

No associations

Rating

Universal Minimax Discrete Denoising under Channel Uncertainty does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Universal Minimax Discrete Denoising under Channel Uncertainty, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Universal Minimax Discrete Denoising under Channel Uncertainty will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-249403