On the redundancy of lossy source coding with abstract alphabets

IEEE Transactions on Information Theory

Volumn 45, Issue 4, 1999, Pages 1092-1110

  Yang, En Hui ^a   Zhang, Zhen ^b  

^a UNIVERSITY OF WATERLOO   (Canada)

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

Author keywords

[No Author keywords available]

Indexed keywords

BLOCK CODES; COMPUTATIONAL COMPLEXITY; DATA COMPRESSION; RANDOM PROCESSES; REDUNDANCY;

ABSTRACT ALPHABETS; LOSSY SOURCE CODING; RATE DISTORTION FUNCTIONS;

ENCODING (SYMBOLS);

EID: 0032641872     PISSN: 00189448     EISSN: None     Source Type: Journal    
DOI: 10.1109/18.761253     Document Type: Article

References (52)

1. T. Berger Rate distortion theory for sources with abstract alphabets and memory," Inform. Contr., vol. 13, pp. 254-273, 1968.
2. _, Rate Distortion Theory. Englewood Cliffs, NJ: Prentice-Hall, 1971.
3. J. Bucklew A large deviation theory proof of the abstract alphabet source coding theorem," IEEE Trans. Inform. Theory, vol. 34, pp. 1081-1083, Sept. 1988.
4. P. A. Chou, M. Effros, and R. M. Gray A vector quantization approach to universal noiseless coding and quantization," IEEE Trans. Inform. Theory, vol. 42, pp. 1109-1138, July 1996.
5. D. L. Cohen, Measure Theory. Boston, MA: Birkhäuser, 1980. [6] T. M. Cover and J. A. Thomas, Elements of Information Theory. New York: Wiley, 1991.
6. I. Csiszâr On the extremum problem of information theory," Studio Scient. Math. Hungarica, pp. 57-70, 1974.
7. I. Csiszâr and J. Körner, Information Theory: Coding Theorems for Discrete Memoryless Systems. New York: Academic, 1981.
8. L. D. Davisson Universal noiseless coding," IEEE Trans. Inform. Theory, vol. IT19, pp. 783-795, 1973.
9. A. Dembo and I. Kontoyiannis The asymptotics of waiting times between stationary processes," 1997, preprint.
10. P. Elias Universal codeword sets and representations of the integers," IEEE Trans. Inform. Theory, vol. IT21, pp. 194-203, 1975.
11. R. G. Gallager, Information Theory and Reliable Communication. New York: Wiley, 1968.
12. R. M. Gray, Entropy and Information Theory. New York: Springer-Verlag, 1990.
13. R. M. Gray and L. D. Davisson Source coding theorems without the ergodic assumption," IEEE Trans. Inform. Theory, vol. IT20, pp. 502-516, 1974.
14. P. Hall, Rates of Convergence in the Central Limit Theorem. Boston, MA: Pitman, 1982.
15. J. C. Kieffer A unified approach to weak universal source coding," IEEE Trans. Inform. Theory, vol. IT24, pp. 674-682, 1978.
16. _ A survey of the theory of source coding with a fidelity criterion," IEEE Trans. Inform. Theory, vol. 39, pp. 1473-1490, Sept. 1993.
17. _ Sample converses in source coding theory," IEEE Trans. Inform. Theory, vol. 37, pp. 263-268, Mar. 1991.
18. A. N. Kolmogorov Three approaches to the quantitative definition of information," Probl. Inform. Transm., vol. 1, pp. 1-7, 1965.
19. R. E. Krichevskii and V. K. Trofimov The performance of universal encoding," IEEE Trans. Inform. Theory, vol. IT27, pp. 199-207, 1981.
20. 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.
21. _ Fixed-rate universal lossy source coding and rates of convergence for memoryless sources," IEEE Trans. Inform. Theory, vol. 41, pp. 665-676, May 1995.
22. T. Linder and K. Zeger On the cost of finite block length in quantizing unbounded memoryless sources," IEEE Trans. Inform. Theory, vol. 42, pp. 480-487, Mar. 1996.
23. G. Louchard and W. Szpankowski On the average redundancy rate of the Lempel-Ziv code," IEEE Trans. Inform. Theory, vol. 43, pp. 2-8, Jan. 1997.
24. T. Luczak and W. Szpankowski A suboptimal lossy data compression based on approximate pattern matching," IEEE Trans. Inform. Theory, vol. 43, pp. 1439-1451, Sept. 1997.
25. K. M. Mackenthun and M. B. Pursley Variable-rate universal block source coding subject to a fidelity constraint," IEEE Trans. Inform. Theory, vol. IT24, pp. 349-360, 1978.
26. N. Merhav A comment on 'A rate of convergence result for a universal .D-semifaithful code'," IEEE Trans. Inform. Theory, vol. 41, pp. 1200-1202, July 1995.
27. D. L. Neuhoff, R. M. Gray, and L. D. Davisson Fixed rate universal block source coding with a fidelity criterion," IEEE Trans. Inform. Theory, vol. IT21, pp. 511-523, 1975.
28. D. S. Ornstein and P. C. Shields Universal almost sure data compression," Ann. Probab., vol. 18, pp. 441-452, 1990.
29. R. J. Pile The transmission distortion of a source as a function of the encoding block length," Bell Syst. Tech. J., vol. 47, pp. 827-885, 1968.
30. E. Plotnik, J. Weinberger, and J. Ziv Upper bounds on the probability of sequences emitted by finite-state source and on the redundancy of the Lempel-Ziv algorithm," IEEE Trans. Inform. Theory, vol. 38, pp. 66-72, Jan. 1992.
31. J. Rissanen Stochastic complexity and modeling," Ann. Statist., vol. 14, pp. 1080-1100, 1986.
32. _ Universal coding, information, prediction and estimation," IEEE Trans. Inform. Theory, vol. IT30, pp. 629-636, 1984.
33. _ Complexity of strings in the class of Markov sources," IEEE Trans. Inform. Theory, vol. 34, pp. 526-532, 1986.
34. R. T. Rochafellar, Convex Analysis. Princeton, NJ: Princeton Univ. Press, 1970.
35. S. A. Savari Redundancy of the Lempel-Ziv incremental parsing rule," IEEE Trans. Inform. Theory, vol. 43, pp. 9-21, Jan. 1997.
36. C. E. Shannon A mathematical theory of communication," Bell Syst. Tech. J., vol. 27, pp. 379-423, pp. 623-656, 1948.
37. P. C. Shields Universal almost sure data compression using Markov types," Probl. Contr. Inform. Theory, vol. 19, pp. 269-277, 1990.
38. A. D. Wyner Communication of analog data from a Gaussian source over a noisy channel," Bell Syst. Tech. J., vol. 47, pp. 801-812, May/June 1968.
39. _ On the transmission of correlated Gaussian data over a noisy channel with finite encoding block length," Inform. Contr., vol. 20, pp. 193-215, 1972.
40. A. D. Wyner and A. J. Wyner Improved redundancy of a version of the Lempel-Ziv algorithm," IEEE Trans. Inform. Theory, vol. 41, pp. 723-731, 1995.
41. 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.
42. E.-H. Yang Universal almost sure data compression for abstract alphabets and arbitrary fidelity criterions," Probl. Contr. Inform. Theory, vol. 20, pp. 397-408, 1991.
43. E.-H. Yang and J. C. Kieffer On the redundancy of the fixed database Lempel-Ziv algorithm for çi-mixing sources," IEEE Trans. Inform. Theory, vol. 43, pp. 1101-1111, July 1997.
44. _ On the performance of data compression algorithms based upon string matching," IEEE Trans. Inform. Theory, vol. 44, pp. 47-65, Jan. 1998.
45. E.-H. Yang and Z. Zhang An on-line universal lossy data compression algorithm by continuous codebook refinement-Part III: Redundancy analysis," IEEE Trans. Inform. Theory, vol. 44, pp. 1782-1801, Sept. 1998.
46. _ The redundancy of source coding with a fidelity criterion-Part II: Coding at a fixed rate level with unknown statistics," submitted for publication.
47. _ The redundancy of source coding with a fidelity criterion-Part III: Coding at a fixed distortion level with unknown statistics," in preparation.
48. B. Yu and T. P. Speed A rate of convergence result for a universal D-semifaithful code," IEEE Trans. Inform. Theory, vol. 39, pp. 813-820, 1993.
49. Z. Zhang, E.-H. Yang, and V. K. Wei The redundancy of source coding with a fidelity criterion-Part I: Known statistics," IEEE Trans. Inform. Theory, vol. 43, pp. 71-91, Jan. 1997.
50. Z. Zhang and V. K. Wei An on-line universal lossy data compression algorithm by continuous codebook refinement-Part I: Basic results," IEEE Trans. Inform. Theory, vol. 42, pp. 803-821, May 1996.
51. Z. Zhang and E.-H. Yang An on-line universal lossy data compression algorithm via continuous codebook refinement-Part II: Optimality for phi-mixing source models," IEEE Trans. Inform. Theory, vol. 42, pp. 822-836, May 1996.
52. J. Ziv Coding of sources with unknown statistics-Part II: Distortion relative to a fidelity criterion," IEEE Trans. Inform. Theory, vol. IT18, pp. 389-394, 1972.