A universal lossless compressor with side information based on context tree weighting

IEEE International Symposium on Information Theory - Proceedings

Volumn 2005, Issue , 2005, Pages 2340-2344

  Cai, Haixiao ^a   Kulkarni, Sanjeev R ^a   Verdú, Sergio ^a  

^a Princeton University   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPRESSION RATIO; CONTEXT TREE WEIGHTING; ENTROPY RATE; FINITE-ALPHABET SEQUENCE;

ALGORITHMS; ENTROPY; FINITE ELEMENT METHOD; IMAGE CODING; INFORMATION RETRIEVAL; PROBABILITY;

TREES (MATHEMATICS);

EID: 33749427178     PISSN: 21578099     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ISIT.2005.1523766     Document Type: Conference Paper

References (19)

1. N. Alon and A. Orlitsky. "Source coding and graph entropies," IEEE Trans. Inform. Theory, vol. 42, pp 1329-1339, Sept. 1996.
2. R. Begleiter and R. El-Yaniv. "On Prediction Using Variable Order Markov Models," Journal of Artificial Intelligence Research 22, pp. 385-421, 2004.
3. D. Brunello, G. Calvagno, G. Mian and R. Rinaldo. "Lossless compression of video using temporal information," IEEE Trans. Image Processing, vol. 12, pp. 132-139, Feb. 2003.
4. G. Caire, S. Shamai and S. Verdú. "Practical Schemes for Interactive Data Exchange," in Proc. ISITA 2004, Parma, Italy, Oct. 10-13, 2004.
5. T. M. Cover. "A proof of the data compression theorem of Slepian and Wolf for ergodic sources," IEEE Trans. Inform. Theory, vol. 22, pp. 226-228, Mar. 1975.
6. CTW implementation v0.1 http://www.ele.tue.nl/ctw/
7. J. Kieffer and En-hui Yang. "Grammar-based lossless universal refinement source coding," IEEE Trans. Inform. Theory, vol. 50, pp. 1415-1424, July 2004.
8. A. Orlitsky. "Average-case interactive communication," IEEE Trans. Inform. Theory, vol. 38, pp. 1534-1547, July 1992.
9. D. Slepian and J. K. Wolf. "Noiseless coding of correlated information sources," IEEE Trans. Inform. Theory, vol. 19, pp. 471-480, 1973.
10. R. Stites and J. Kieffer. "Resolution scalable lossless progressive image coding via conditional quadrisection," in Proc. ICIP 2000, Vancouver, B.C., Canada.
11. P. Subrahmanya and T. Berger. "A sliding window Lempel-Ziv algorithm for differential layer encoding in progressive transmission," in Proc. IEEE Int. Symp. Inform. Theory, Whistler, B.C., Canada, p. 266, 1995.
12. P. Volf. "Weighting Techniques in Data Compression: Theory and Algorithm," Ph.D. thesis, Technisch Universiteit Eindhoven, 2002.
13. T. Weissman, E. Ordentlich, G. Seroussi, S. Verdú and M. Weinberger. "Universal discrete denoising: known channel," IEEE Trans. Inform. Theory, vol. 51, pp. 5-28, Jan. 2005.
14. F. M. J. Willems, Y. M. Shtarkov and T. J. Tjalkens. "The context tree weighting method: basic properties," IEEE Trans. Inform. Theory, vol. 41, pp. 653-664, May 1995.
15. F. M. J. Willems and T. J. Tjalkens. "Complexity reduction of the Context-Tree Weighting Algorithm: A Study for KPN Research," EIDMA report series: EIDMA-RS.97.01, Euler Institute of Discrete Mathematics and its Applications, Jan. 1997.
16. F. M. J. Willems. "The Context Tree Weighting Method: Extensions," IEEE Trans. Inform. Theory, vol. 44, pp. 792-798, Mar. 1998.
17. H. S. Witsenhausen. "The zero-error side information problem and chromatic numbers," IEEE Trans. Inform. Theory, vol. 22, pp. 592-593, Sept. 1976.
18. En-hui Yang, A. Kaltchenko and J. Kieffer. "Universal lossless data compression with side information by using a conditional MPM Grammar Transform," IEEE Trans. Inform. Theory, vol. 47, no. 6, pp. 2130-2150, Sept. 2001.
19. J. Yu and S. Verdú. "Schemes for bi-directional modeling of discrete stationary sources," in Proc. 2005 Conference on Information Sciences and Systems, John Hopkins University, Mar. 2005.