Universal discrete denoising:: Known channel

被引:147
作者
Weissman, T [1 ]
Ordentlich, E
Seroussi, G
Verdú, S
Weinberger, MJ
机构
[1] Stanford Univ, Dept Elect Engn, Stanford, CA 94305 USA
[2] Hewlett Packard Labs, Palo Alto, CA 94304 USA
[3] Princeton Univ, Dept Elect Engn, Princeton, NJ 08544 USA
基金
美国国家科学基金会;
关键词
context models; denoising; discrete filtering; discrete memoryless channels (DMCs); individual sequences; noisy channels; universal algorithms;
D O I
10.1109/TIT.2004.839518
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
A discrete denoising algorithm estimates the input sequence to a discrete memoryless channel (DMC) based on the observation of the entire output sequence. For the case in which the DMC is known and the quality of the reconstruction is evaluated with a given single-letter fidelity criterion, we propose a discrete denoising algorithm that does not assume knowledge of statistical properties of the input sequence. Yet, the algorithm is universal in the sense of asymptotically performing as well as the optimum denoiser that knows the input sequence distribution, which is only assumed to be stationary. Moreover, the algorithm is universal also in a semi-stochastic setting, in which the input is an individual sequence, and the randomness is due solely to the channel noise. The proposed denoising algorithm is practical, requiring a linear number of register-level operations and sublinear working storage size relative to the input data length.
引用
收藏
页码:5 / 28
页数:24
相关论文
共 82 条
[1]  
Angluin D., 1997, P 10 ANN C COMP LEAR
[2]  
[Anonymous], 1992, PROBABILITY
[3]  
[Anonymous], 1999, MORPHOLOGICAL IMAGE, DOI 10.1007/978-3-662-03939-7_3
[4]  
[Anonymous], P 2004 INF THEOR WOR
[5]  
[Anonymous], 1968, An introduction to probability theory and its applications
[6]  
BALLARD RJ, 1974, RM333 MICH STAT U ST
[7]  
BALLARD RJ, 1974, THESIS MICHIGAN STAT
[8]   A MAXIMIZATION TECHNIQUE OCCURRING IN STATISTICAL ANALYSIS OF PROBABILISTIC FUNCTIONS OF MARKOV CHAINS [J].
BAUM, LE ;
PETRIE, T ;
SOULES, G ;
WEISS, N .
ANNALS OF MATHEMATICAL STATISTICS, 1970, 41 (01) :164-&
[9]   Lossy source coding [J].
Berger, T ;
Gibson, JD .
IEEE TRANSACTIONS ON INFORMATION THEORY, 1998, 44 (06) :2693-2723
[10]   A SIMPLIFIED DERIVATION OF LINEAR LEAST SQUARE SMOOTHING AND PREDICTION THEORY [J].
BODE, HW ;
SHANNON, CE .
PROCEEDINGS OF THE INSTITUTE OF RADIO ENGINEERS, 1950, 38 (04) :417-425