## Universal filtering via prediction (2007)

### Cached

### Download Links

- [webee.technion.ac.il]
- [www.stanford.edu]
- [webee.technion.ac.il]
- [www.stanford.edu]
- [www.hpl.hp.com]
- DBLP

### Other Repositories/Bibliography

Venue: | IEEE TRANS. INFORM. THEORY |

Citations: | 6 - 3 self |

### BibTeX

@ARTICLE{Weissman07universalfiltering,

author = {Tsachy Weissman and Erik Ordentlich and Marcelo J. Weinberger and Anelia Somekh-Baruch and Neri Merhav},

title = {Universal filtering via prediction},

journal = {IEEE TRANS. INFORM. THEORY},

year = {2007},

volume = {53},

pages = {1253--1264}

}

### OpenURL

### Abstract

We consider the filtering problem, where a finite-alphabet individual sequence is corrupted by a discrete memoryless channel, and the goal is to causally estimate each sequence component based on the past and present noisy observations. We establish a correspondence between the filtering problem and the problem of prediction of individual sequences which leads to the following result: Given an arbitrary finite set of filters, there exists a filter which performs, with high probability, essentially as well as the best in the set, regardless of the underlying noiseless individual sequence. We use this relationship between the problems to derive a filter guaranteed of attaining the “finite-state filterability” of any individual sequence by leveraging results from the prediction problem.