Fixed-slope universal lossy data compression

IEEE Transactions on Information Theory

Volumn 43, Issue 5, 1997, Pages 1465-1476

  Yang, En Hui ^b   Zhang, Zhen ^a,c   Berger, Toby ^a,d  

^a IEEE

^b NANKAI UNIVERSITY   (China)

^c University of Southern California ^*  (United States)

^d Cornell University   (United States)

Author keywords

Arithmetic code; Distortion rate (rate distortion) function; Ergodic sources; Fixed slope universal source coding; Lempel Ziv code; Search algorithms; Stationary; Universal lossy data compression

Indexed keywords

ALGORITHMS; BINARY CODES; COMPUTER SIMULATION; ENCODING (SYMBOLS); SIGNAL DISTORTION; TRELLIS CODES;

ARITHMETIC CODE; DISTORTION RATE FUNCTION; ERGODIC SOURCES; FIXED SLOPE UNIVERSAL SOURCE CODING; LEMPEL-ZIV CODE; SEARCH ALGORITHMS; UNIVERSAL LOSSY DATA COMPRESSION;

DATA COMPRESSION;

EID: 0031236921     PISSN: 00189448     EISSN: None     Source Type: Journal    
DOI: 10.1109/18.623145     Document Type: Article

References (33)

1. T. Berger, Rate Distortion Theory. Englewood Cliffs, NJ: Prentice-Hall, 1971.
2. K. Cheung and V. K. Wei, "A locally adaptive source coding scheme," in Communication, Control, and Signal Processing, Proc. Bilkent Conf. on New Trends in Communication, Control, and Signal Processing, 1990, pp. 1473-1482.
3. R. M. Gray, Entropy and Information Theory. New York: Springer-Verlag, 1990.
4. T. Hashimoto, "A list-type reduced constraint generalization of the Viterbi algorithm," IEEE Trans. Inform. Theory, vol. IT-33, pp. 866-876, 1987.
5. J. C. Kieffer, "A survey of the theory of source coding with a fidelity criterion," IEEE Trans. Inform. Theory, vol. 39, pp. 1473-1490, 1993.
6. _, "Extension of source coding theorems for block codes to sliding-block codes," IEEE Trans. Inform. Theory, vol. IT-26, pp. 679-692, 1980.
7. _, "Sample converses in source coding theory," IEEE Trans. Inform. Theory, vol. 37, pp. 263-268, 1991.
8. _, "Strong converses in source coding relative to a fidelity criterion," IEEE Trans. Inform. Theory, vol. 37, pp. 257-262, 1991.
9. H. Morita and K. Kobayashi, "On asymptotic optimality of a sliding window variation of Lempel-Ziv codes," IEEE Trans. Inform. Theory, vol. 39, pp. 1840-1846, 1993.
10. _, "An extension of LZW coding algorithm to source coding subject to a fidelity criterion," in Proc. 4th Joint Swedish-Soviet Int. Workshop on Inform. Theory (Gotland, Sweden, 1989), pp. 105-109.
11. J. Muramatsu and F. Kanaya, "Distortion-complexity and rate-distortion function," IEICE Trans. Fundamentals, vol. E77-A, pp. 1224-1229, 1994.
12. _, "Dual quantity of the distortion complexity and a universal database for fixed-rate data compression with distortion," IEICE Trans. Fundamentals, to be published.
13. D. S. Ornstein and P. C. Shields, "Universal almost sure data compression," Ann. Prob., vol. 18, pp. 441-452, 1990.
14. D. S. Ornstein and B. Weiss, "The Shannon-McMillan-Breiman theorem for a class of amenable groups," Israel J. Math., vol. 44, pp. 53-60, 1983.
15. J. Rissanen, "Complexity of strings in the class of Markov sources," IEEE Trans. Inform. Theory, vol. IT-32, pp. 526-532, 1986.
16. C. E. Shannon, "Coding theorems for a discrete source with a fidelity criterion," in IRE Nat. Conv. Rec., 1959, pt. 4, pp. 142-163.
17. P. C. Shields, "Universal almost sure data compression using Markov types," Probl. Contr. Inform. Theory, vol. 19, no. 4, pp. 269-277, 1990.
18. _, "The ergodic and entropy theorems revisit," IEEE Trans. Inform. Theory, vol. IT-33, pp. 263-266, 1987.
19. Y. Steinberg and M. Gutman, "An algorithm for source coding subject to a fidelity criterion based on string matching," IEEE Trans. Inform. Theory, vol. 39, pp. 877-886, 1993.
20. A. J. Viterbi and J. K. Omura, Principles of Digital Communication and Coding. New York: McGraw-Hill, 1979.
21. H. Yamamoto and B. Rimoldi, "A universal data compression scheme with distortion," submitted for publication.
22. E.-h. Yang, "Universal almost sure data compression for abstract alphabets and arbitrary fidelity criterions," Probl. Contr. Inform. Theory, vol. 20, no. 6, pp. 397-408, 1991.
23. _, "The proof of Levin's conjecture," Chinese Sci. Bull., vol. 34, pp. 1761-1765, Nov. 1989.
24. E.-h. Yang and J. C. Kieffer, "Simple universal lossy data compression schemes derived from Lempel-Ziv algorithm," IEEE Trans. Inform. Theory, vol. 42, pp. 239-245, Jan. 1996.
25. _, "On the performance of data compression algorithms based upon string matching," IEEE Trans. Inform. Theory, to be published.
26. E.-h. Yang and S.-Y. Shen, "Distortion program-size complexity with respect to a fidelity criterion and rate distortion function," IEEE Trans. Inform. Theory, vol. 39, pp. 288-292, 1993.
27. E.-h. Yang and Z. Zhang, "Fixed slope lossification technique and variable rate trellis source coding," submitted for publication, 1996.
28. Z. Zhang and V. K. Wei, "An on-line universal lossy data compression algorithm by continuous codebook refinement," IEEE Trans. Inform. Theory, vol. 42, pp. 803-821, May 1996.
29. Z. Zhang and E.-h. Yang, "An on-line universal lossy data compression algorithm by continuous codebook refinement-Part two: Optimality for phi-mixing source models," IEEE Trans. Inform. Theory, vol. 42, pp. 822-836, May 1996.
30. J. Ziv, "Distortion rate theory for individual sequences," IEEE Trans. Inform. Theory, vol. IT-26, pp. 137-143, 1980.
31. J. Ziv and A. Lempel, "Compression of individual sequences via variable rate coding," IEEE Trans. Inform. Theory, vol. IT-24, pp. 530-536, 1978.
32. _, "A universal algorithm for sequential data compression," IEEE Trans. Inform. Theory, vol. IT-23, pp. 337-343, 1977.
33. A. Zvonkin and L. Levin, "The complexity of finite objects and the development of the concept of information and randomness by means of the theory of algorithms," Russian Math. Surv., vol. 25, pp. 83-124, 1970.