An implementable lossy version of the Lempel-Ziv algorithm - Part I: Optimality for memoryless sources

IEEE Transactions on Information Theory

Volumn 45, Issue 7, 1999, Pages 2293-2305

  Kontoyiannis, Ioannis ^a,b  

^a IEEE   (United States)

^b PURDUE UNIVERSITY   (United States)

Author keywords

Fixed database; Lempel Ziv; Lossy data compression; Universal source coding

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; DATA COMPRESSION; DATABASE SYSTEMS;

FIXED DATABASE; LEMPEL-ZIV ALGORITHM; UNIVERSAL SOURCE CODING;

ENCODING (SYMBOLS);

EID: 0033356515     PISSN: 00189448     EISSN: None     Source Type: Journal    
DOI: 10.1109/18.796370     Document Type: Article

References (48)

1. D. Arnaud and W. Szpankowski, "Pattern matching image compression with prediction loop: Preliminary experimental results," in Proc. Data Compression Conf. - DCC 97. Los Alamitos, CA: IEEE Comput. Soc. Press, 1997.
2. M. Atallah, Y. Génin, and W. Szpankowski, "Pattern matching image compression: Algorithmic and empirical results," IEEE Trans. Pattern Anal. Machine Intell., vol. 21, pp. 614-627, July 1999.
3. J. G. Bell, T. C. Cleary, and I. H. Witten, Text Compression. Engle-wood Cliffs, NJ: Prentice-Hall, 1990.
4. T. Berger, Rate Distortion Theory: A Mathematical Basis for Data Compression. Englewood Cliffs, NJ: Prentice-Hall, 1971.
5. J. A. Bucklew, "The source coding theorem via Sanov's theorem," IEEE Trans. Inform. Theory, vol. IT-33, pp. 907-909, Nov. 1987.
6. _, "A large deviation theory proof of the abstract alphabet source coding theorem," IEEE Trans. Inform. Theory, vol. 34, pp. 1081-1083, Sept. 1988.
7. P. A. Chou, M. Effros, and R. M. Gray, "A vector quantization approach to universal noiseless coding and quantizations," IEEE Trans. Inform. Theory, vol. 42, pp. 1109-1138, July 1996.
8. T. M. Cover and J. A. Thomas, Elements of Information Theory. New York: Wiley, 1991.
9. M. Crochemore and T. Lecroq, "Pattern-matching and text-compression algorithms," ACM Comput. Surv., vol. 28, no. 1, pp. 39-41, 1996.
10. M. Crochemore and W. Rytter, Text Algorithms. New York: Oxford Univ. Press, 1994.
11. I. Csiszár and J. Körner, Information Theory: Coding Theorems for Discrete Memoryless Systems. New York: Academic, 1981.
12. A. Dembo and I. Kontoyiannis, "The asymptotics of waiting times between stationary processes, allowing distortion," Ann. Appl. Probab., vol. 9, pp. 413-429, 1999.
13. A. Dembo and O. Zeitouni, Large Deviations Techniques And Applications, 2nd ed. New York: Springer-Verlag, 1998.
14. P. Elias, "Universal codeword sets and representations of the integers," IEEE Trans. Inform. Theory, vol. IT-21, pp. 194-203, 1975.
15. R. M. Gray and D. L. Neuhoff, "Quantization," IEEE Trans. Inform. Theory, vol. 44, pp. 2325-2383, Oct. 1998.
16. D. Hankerson, G. A. Harris, and P. D. Johnson, Jr., Introduction to Information Theory and Data Compression. Boca Raton, FL: CRC, 1998.
17. J. C. Kieffer, "A survey of the theory of source coding with a fidelity criterion," IEEE Trans. Inform. Theory, vol. 39, pp. 1473-1490, Sept. 1993.
18. I. Kontoyiannis, "Second-order analysis of lossless and lossy versions of Lempel-Ziv codes," in 31st Asilomar Conf. Signals, Systems and Computers, (Monterey, CA, Nov. 1997).
19. _, "Asymptotic recurrence and waiting times for stationary processes," J. Theoret. Probab., vol. 11, pp. 795-811, 1998.
20. _, "Recurrence and waiting times in stationary processes, and their applications in data compression," Ph.D. dissertation, Dept. Elec. Eng., Stanford Univ.,Stanford, CA, May 1998.
21. _, "An implementable lossy version of the Lempel-Ziv algorithm-Optimality for sources with memory," in preparation, 1999.
22. T. Linder, G. Lugosi, and K. Zeger, "Rates of convergence in the source coding theorem, in empirical quantizer design, and in universal lossy source coding," IEEE Trans. Inform. Theory, vol. 40, pp. 1728-1740, Nov. 1994.
23. T. Łuczak and W. Szpankowski, "A suboptimal lossy data compression algorithm based on approximate pattern matching," IEEE Trans. Inform. Theory, vol. 43, pp. 1439-1451, Sept. 1997.
24. H. Morita and K. Kobayashi, "An extension of LZW coding algorithm to source coding subject to a fidelity criterion," in 4th Joint Sweedinsh-Soviet Int. Worksh. Information Theory (Gotland, Sweden, 1989), pp. 105-109.
25. J. Muramatsu and F. Kanaya, "Distortion-complexity and rate-distortion function," IEICE Trans. Fundamentals, vol. E77-A, pp. 1224-1229, 1994.
26. R. M. Neuhoff, D. L. Gray, and L. D. Davisson, "Fixed rate universal block source coding with a fidelity criterion," IEEE Trans. Inform. Theory, vol. IT-21, pp. 511-523, Sept. 1975.
27. D. Ornstein and P. C. Shields, "Universal almost sure data compression," Ann. Probab., vol. 18, pp. 441-452, 1990.
28. D. Ornstein and B. Weiss, "Entropy and data compression schemes," IEEE Trans. Inform. Theory, vol. 39, pp. 78-83, Jan. 1993.
29. Y. Steinberg and M. Gutman, "An algorithm for source coding subject to a fidelity criterion, based upon string matching," IEEE Trans. Inform. Theory, vol. 39, pp. 877-886, May 1993.
30. W. Szpankowski, "Asymptotic properties of data compression and suffix trees," IEEE Trans. Inform. Theory, vol. 39, pp. 1647-1659, Sept. 1993.
31. F. M. J. Willems, "Universal data compression and repetition times," IEEE Trans. Inform. Theory, vol. 35, pp. 54-58, Jan. 1989.
32. A. D. Wyner and A. J. Wyner, "Improved redundancy of a version of the Lempel-Ziv algorithm," IEEE Trans. Inform. Theory, vol. 35, pp. 723-731, May 1995.
33. A. D. Wyner and J. Ziv, "Some asymptotic properties of the entropy of a stationary ergodic data source with applications to data compression," IEEE Trans. Inform. Theory, vol. 35, pp. 1250-1258, Nov. 1989.
34. _, "Fixed data base version of the Lempel-Ziv data compression algorithm," IEEE Trans. Inform. Theory, vol. 37, pp. 878-880, May 1991.
35. _, "The sliding-window Lempel-Ziv algorithm is asymptotically optimal," Proc. IEEE, vol. 82, pp. 872-877, June 1994.
36. A. J. Wyner, "The redundancy and distribution of the phrase lengths of the Fixed-Database Lempel-Ziv algorithm," IEEE Trans. Inform. Theory, vol. 43, pp. 1452-1464, Sept. 1997.
37. E.-H. Yang and J. C. Kieffer, "Simple universal lossy data data compression schemes derived from the Lempel-Ziv algorithm," IEEE Trans. Inform. Theory, vol. 42, pp. 239-245, Jan. 1996.
38. _, "On the performance of data compression algorithms based upon string matching," IEEE Trans. Inform. Theory, vol. 44, pp. 47-65, Jan. 1998.
39. E.-H. Yang, Z. Zhang, and T. Berger, "Fixed-slope universal lossy data compression," IEEE Trans. Inform. Theory, vol. 43, pp. 1465-1476, Sept. 1997.
40. R. Zamir and K. Rose, "Toward lossy Lempel-Ziv: Natural type selection," in Proc. Information Theory Worksh. (Haifa, Israel, June 1996), p. 58.
41. _, "A type generator model for adaptive lossy compression," in Proc. IEEE Internation Symp. Information Theory (Ulm, Germany, June/July 1997), p. 186.
42. Z. Zhang and V. K. Wei, "An on-line universal lossy data compression algorithm by continuous codebook refinement - Part I: Basic reults," IEEE Trans. Inform. Theory, vol. 42, pp. 803-821, May 1996.
43. Z. Zhang and E.-H. Yang, "An on-line universal lossy data compression algorithm by continuous codebook refinement-Part II: Optimality for phi-mixing models," IEEE Trans. Inform. Theory, vol. 42, pp. 822-836, May 1996.
44. J. Ziv, "Coding of sources with unknown statistics - Part II: Distortion relative to a fidelity criterion," IEEE Trans. Inform. Theory, vol. IT-18, pp. 389-394, May 1972.
45. _, "Coding theorems for individual sequences," IEEE Trans. Inform. Theory, vol. IT-24, pp. 405-412, July 1978.
46. _, "Distortion-rate theory for individual sequences," IEEE Trans. Inform. Theory, vol. IY-26, pp. 137-143, Mar. 1980.
47. J. Ziv and A. Lempel, "A universal algorithm for sequential data compression," IEEE Trans. Inform. Theory, vol. IT-23, pp. 337-343, May 1977.
48. _, "Compression of individual sequences by variable rate coding," IEEE Trans. Inform. Theory, vol. IT-24, pp. 530-536, Sept. 1978.