Discrete universal filtering through incremental parsing

Data Compression Conference Proceedings

Volumn , Issue , 2004, Pages 352-361

  Ordentlich, Erik ^a   Weissman, Tsachy ^b   Weinberger, Marcelo J ^a   Somekh Baruch, Anelia ^c   Merhav, Neri ^b  

^a HEWLETT PACKARD LABORATORIES   (United States)

^b Stanford University   (United States)

^c TECHNION ISRAEL INSTITUTE OF TECHNOLOGY   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

FINITE-MEMORY FILTERS; FINITE-STATE COMPRESSORS; PARSING;

ALGORITHMS; COMMUNICATION CHANNELS (INFORMATION THEORY); DATA COMPRESSION; PROBLEM SOLVING; RANDOM PROCESSES; SEQUENTIAL MACHINES; SIGNAL FILTERING AND PREDICTION;

FINITE AUTOMATA;

EID: 2642510939     PISSN: 10680314     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (12)

1. A. Baruch and N. Merhav. Universal filtering and prediction of individual sequences corrupted by noise. Proceedings, 37-th Annual Allerton Conference on Communication, Control, and Computing, Monticello, IL, September 22-24, 1999.
2. M. Feder. Gambling using a finite state machine. IEEE Trans. Inform. Theory, 37(5):1459-1465, September 1991.
3. M. Feder, N. Merhav, and M. Gutman. Universal prediction of individual sequences. IEEE Trans. Inform. Theory, 38:1258-1270, July 1992.
4. J. F. Hannan. Approximation to Bayes risk in repeated play. Contributions to the Theory of Games, (3):97-139, 1957. Princeton University Press.
5. N. Merhav and M. Feder. Universal schemes for sequential decisions from individual data sequences. IEEE Trans. Inform. Theory, 39:1280-1292, July 1993.
6. J. Van Ryzin, The sequential compound decision problem with m × n finite loss matrix, Ann. Math. Stat., vol. 37, 1966, pp. 954-975.
7. M. J. Weinberger and E. Ordentlich, On-line decision making for a class of loss functions via Lempel-Ziv parsing, Proceedings, Data Compression Conference, March 28-30, 2000, Snowbird, Utah.
8. T. Weissman and N. Merhav, Universal prediction of individual binary sequences in the presence of noise, IEEE Trans. Inform. Theory, 47(6):2151-2173, September 2001.
9. T. Weissman, N. Merhav, and A. Baruch, Twofold universal prediction schemes for achieving the finite-state predictability of a noisy individual binary sequence, IEEE Trans. Inform. Theory, 47(5):1849-1866, July 2001.
10. T. Weissman and N. Merhav. Finite-delay lossy coding and filtering of individual sequences, IEEE Trans. Inform. Theory, 48(3):721-733, March 2002.
11. T. Weissman, E. Ordentlich, G. Seroussi, S. Verdú, M. J. Weinberger, Universal discrete denoising: known channel, HP Labs. Tech. Rep., HPL-2003-29, February 2003. Submitted to IEEE Trans. Inform. Theory.
12. J. Ziv and A. Lempel, Compression of individual sequences via variable-rate coding, IEEE Trans. Inform. Theory, 24:530-536, September 1978.