Near-optimal rates for limited-delay universal lossy source coding

IEEE International Symposium on Information Theory - Proceedings

Volumn , Issue , 2011, Pages 2218-2222

  György, András ^a   Neu, Gergely ^b  

^a INSTITUTE OF EXPERIMENTAL MEDICINE   (Hungary)

^b BUDAPEST UNIVERSITY OF TECHNOLOGY AND ECONOMICS   (Hungary)

Author keywords

[No Author keywords available]

Indexed keywords

CODING SCHEME; COMPRESSION SCHEME; INDIVIDUAL SEQUENCES; LIMITED DELAYS; LIMITED MEMORY; LOSSY CODING; LOSSY SOURCE CODING; LOWER BOUNDS; PREDICTION ALGORITHMS; SCALAR QUANTIZATION; SCALAR QUANTIZERS; UPPER AND LOWER BOUNDS; WEIGHTED AVERAGES;

ALGORITHMS; INFORMATION THEORY;

REDUNDANCY;

EID: 80054798353     PISSN: 21578104     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ISIT.2011.6033954     Document Type: Conference Paper

References (13)

1. T. Linder and G. Lugosi, "A zero-delay sequential scheme for lossy coding of individual sequences", IEEE Trans. Inform. Theory, vol. 47, pp. 2533-2538, Sep. 2001.
2. V. Vovk, "Aggregating strategies", in Proceedings of the Third Annual Workshop on Computational Learning Theory, (Rochester, NY), pp. 372-383, Morgan Kaufmann, Aug. 1990.
3. V. Vovk, "A game of prediction with expert advice", Journal of Computer and System Sciences, vol. 56, pp. 153-173, 1998.
4. N. Littlestone and M. K. Warmuth, "The weighted majority algorithm", Information and Computation, vol. 108, pp. 212-261, 1994.
5. T. Weissman and N. Merhav, "On limited-delay lossy coding and filtering of individual sequences", IEEE Trans. Inform. Theory, vol. 48, pp. 721-733, Mar. 2002.
6. S. Matloub and T. Weissman, "Universal zero delay joint source-channel coding", IEEE Transactions on Information Theory, vol. 52, pp. 5240-5250, 2006.
7. A. György, T. Linder, and G. Lugosi, "Tracking the best quantizer", IEEE Transactions on Information Theory, vol. 54, pp. 1604-1625, Apr. 2008.
8. A. Reani and N. Merhav, "Efficient on-line schemes for encoding individual sequences with side information at the decoder", in Proc. IEEE International Symposium on Information Theory (ISIT 2009), pp. 1025-1029, June 28-July 3 2009.
9. A. György, T. Linder, and G. Lugosi, "Efficient algorithms and minimax bounds for zero-delay lossy source coding", IEEE Transactions on Signal Processing, vol. 52, pp. 2337-2347, Aug. 2004.
10. A. György, T. Linder, and G. Lugosi, "A "follow the perturbed leader"-type algorithm for zero-delay quantization of individual sequences", in Proc. Data Compression Conference, (Snowbird, UT, USA), pp. 342-351, Mar. 2004.
11. S. Geulen, B. Voecking, and M. Winkler, "Regret minimization for online buffering problems using the weighted majority algorithm", in Proceedings of the 23rd Annual Conference on Learning Theory (COLT 2010), pp. 132-143, 2010.
12. L. Györfi and G. Ottucsák, "Sequential prediction of unbounded stationary time series", IEEE Transactions on Information Theory, vol. 53, pp. 866-1872, May 2007.
13. A. György and G. Neu, "Near-optimal rates for limited-delay universal lossy source coding." in preparation.