去噪以及任何两个最好的去噪器
Denoising as well as the best of any two denoisers
摘要:
给定两个任意序列的去噪块长度趋于无穷大,我们问是否有可能构建第三序列的去噪与渐近消失(块长度)超额预期损失相对于最佳预期损失的两个给定的去噪所有干净的通道输入序列。在DUDE [1]的设置中,当给定的去噪器是滑块去噪器时解决了这个问题,允许构造取决于两个给定的去噪器和信道转移概率。我们表明,在一定的限制下,两个给定的去噪器的问题可以解决使用一个简单的应用程序的一个已知的损失估计范例。然后,我们通过一个反例表明,损失估计方法在一般情况下失败。最后,我们表明,对于二进制对称信道,损失估计与随机化步骤相结合,导致所述问题的解决方案下,没有限制给定的去噪。
英文摘要:
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.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。