An algorithm for universal lossless compression with side information

IEEE Transactions on Information Theory

Volumn 52, Issue 9, 2006, Pages 4008-4016

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

^a Princeton University   (United States)

Author keywords

Arithmetic coding; Conditional entropy; Context tree weighting method; Hidden Markov process; Source coding; Universal lossless data compression

Indexed keywords

ALGORITHMS; DECODING; ENTROPY; IMAGE CODING; IMAGE COMPRESSION; MARKOV PROCESSES; PROBABILITY;

COMPRESSION RATIO; CONTEXT-TREE-WEIGHTING (CWT) METHOD; UNIVERSAL LOSSLESS COMPRESSION;

CHARACTER RECOGNITION;

EID: 33748573657     PISSN: 00189448     EISSN: None     Source Type: Journal    
DOI: 10.1109/TIT.2006.880020     Document Type: Article

References (18)

1. N. Alon and A. Orlitsky, "Source coding and graph entropies," IEEE Trans. Inf. Theory, vol. 42, no. 5, pp. 1329-1339, Sep. 1996.
2. R. Begleiter and R. El Yaniv, "On prediction using variable order Markov models," J. Artificial Intell. Res., vol. 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 Process., vol. 12, no. 2, pp. 132-139, Feb. 2003.
4. G. Caire, S. Shamai (Shitz), and S. Verdú, "Practical schemes for interactive data exchange," in Proc. Int. Symp. Information Theory and Its Applications (ISITA 2004), Parma, Italy, Oct. 2004.
5. T. M. Cover, "A proof of the data compression theorem of Slepian and Wolf for ergodic sources," IEEE Trans. Inf. Theory, vol. IT-22, no. 2, pp. 226-228, Mar. 1975.
6. "CTW implementation v0.1," [Online]. Available: Http://www.ele.tue.nl/ ctw/
7. J. Kieffer and E.-h. Yang, "Grammar-based lossless universal refinement source coding," IEEE Trans. Inf. Theory, vol. 50, no. 7, pp. 1415-1424, Jul. 2004.
8. P. Koulgi, E. Tuncel, S. Regunathan, and K. Rose, "On zero-error source coding with decoder side information," IEEE Trans. Inf. Theory, vol. 49, no. 1, pp. 99-111, Jan. 2003.
9. A. Orlitsky, "Average-case interactive communication," IEEE Trans. Inf. Theory, vol. 38, no. 4, pp. 1534-1547, Jul. 1992.
10. D. Slepian and J. K. Wolf, "Noiseless coding of correlated information sources," IEEE Trans. Inf. Theory, vol. IT-19, no. 4, pp. 471-480, Jul. 1973.
11. R. Stites and J. Kieffer, "Resolution scalable lossless progressive image coding via conditional quadrisection," in Proc. Int. Conf. Image Processing (ICIP 2000}, Vancouver, BC, Canada, Sep. 2000, vol. 1, pp. 976-979.
12. P. Subrahmanya and T. Berger, "A sliding window Lempel-Ziv algorithm for differential layer encoding in progressive transmission," in Proc. 1995 IEEE Int. Symp. Information Theory,Whistler, BC, Canada, Jun. 1995, p. 266.
13. P. Volf, "Weighting techniques in data compression: Theory and algorithm," Ph.D. dissertation, Tech. Univ. Eindhoven, Eindhoven, The Netherlands, 2002.
14. F. M. J. Willems, Y. M. Shtarkov, and T. J. Tjalkens, "The context tree weighting method: Basic properties," IEEE Trans. Inf. Theory, vol. 41, no. 3, 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 Complexity reduction of the Context-Tree Weighting Algorithm: A Study for KPN Research, EIDMA rep.t ser.: EIDMA-RS.97.01, Jan. 1997.
16. F. M. J. Willems, "The context tree weighting method: Extensions," IEEE Trans. Inf. Theory, vol. 44, no. 2, pp. 792-798, Mar. 1998.
17. H. S. Witsenhausen, "The zero-error side information problem and chromatic numbers," IEEE Trans. Inf. Theory, vol. IT-22, no. 5, pp. 592-593, Sep. 1976.
18. E.-h. Yang, A. Kaltchenko, and J. Kieffer, "Universal lossless data compression with side information by using a conditional MPM Grammar Transform," IEEE Trans. Inf. Theory, vol. 47, no. 6, pp. 2130-2150, Sep. 2001.