Pointwise redundancy in lossy data compression and universal lossy data compression

IEEE Transactions on Information Theory

Volumn 46, Issue 1, 2000, Pages 136-152

  Kontoyiannis, Ioannis ^a,b  

^a IEEE   (United States)

^b PURDUE UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

CODING THEOREM; DISTORTION LEVEL; LARGE DEVIATIONS; LOSSY DATA DEVIATIONS; UNIVERSAL CODING;

CODES (SYMBOLS); INFORMATION THEORY; NUMERICAL METHODS; PROBABILITY; RANDOM PROCESSES; REDUNDANCY; SIGNAL DISTORTION;

DATA COMPRESSION;

EID: 0033888669     PISSN: 00189448     EISSN: None     Source Type: Journal    
DOI: 10.1109/18.817514     Document Type: Article

References (40)

1. P. H. Algoet, "Log-optimal investment," Ph.D. dissertation, Dept. Elec. Eng., Stanford Univ., Stanford, CA, 1985.
2. A. R. Barron, "Logically smooth density estimation," Ph.D. dissertation, Dept. Elec. Eng., Stanford Univ., Stanford, CA, 1985.
3. R. Bell and T. M. Cover, "Game-theoretic optimal portfolios," Management Sci., vol. 34, no. 6, pp. 724-733, 1988.
4. T. Berger, Rate Distortion Theory: A Mathematical Basis for Data Compression. Englewood Cliffs, NJ: Prentice-Hall, 1971.
5. T. Berger and J. D. Gibson, "Lossy source coding," IEEE Trans. Inform. Theory, vol. 44, pp. 2693-2723, Oct. 1998.
6. L. Breiman, Probability , ser. SIAM Classics in Applied Mathematics, vol. 7. Philadelphia, PA: SIAM, 1992.
7. Z. Chi, "The first order asymptotics of waiting times with distortion between stationary processes," preprint, 1999.
8. 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.
9. T. M. Cover and J. A. Thomas, Elements of Information Theory. New York, NY: J. Wiley, 1991.
10. A. Dembo and I. Kontoyiannis, "The asymptotics of waiting times between stationary processes, allowing distortion," Ann. Appl. Probab., vol. 9, pp. 413-429, 1999.
11. A. Dembo and O. Zeitouni, Large Deviations Techniques and Applications, 2nd ed. New York, NY: Springer-Verlag, 1998.
12. R. Durrett, Probability: Theory and Examples, 2nd ed. Belmont, CA: Duxbury, 1996.
13. P. Elias, "Universal codeword sets and representations of the integers," IEEE Trans. Inform. Theory, vol. IT-21, pp. 194-203, 1975.
14. J. C. Kieffer, "Sample converses in source coding theory," IEEE Trans. Inform. Theory, vol. 37, pp. 263-268, Mar. 1991.
15. I. Kontoyiannis, "Second-order noiseless source coding theorems," IEEE Trans. Inform. Theory, vol. 43, pp. 1339-1341, July 1997.
16. _, "Asymptotic recurrence and waiting times for stationary processes," J. Theor. Probab., vol. 11, pp. 795-811, 1998.
17. _, "An implementable lossy version of the Lempel-Ziv algorithm-Part I: Optimality for memoryless sources," IEEE Trans. Inform. Theory, vol. 45, pp. 2293-2305, Nov. 1999.
18. R. E. Krichevsky and V. K. Trofimov, "The performance of universal coding," IEEE Trans. Inform. Theory, vol. IT-27, pp. 199-207, Mar. 1981.
19. 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.
20. _, "Fixed-rate universal lossy source coding and rates of convergence for memoryless sources," IEEE Trans. Inform. Theory, vol. 41, pp. 665-676, May 1995.
21. 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.
22. 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.
23. D. Ornstein and P. C. Shields, "Universal almost sure data compression," Ann. Probab., vol. 18, pp. 441-452, 1990.
24. 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.
25. M. S. Pinsker, Information and Information Stability of Random Variables and Processes. San Francisco, CA: Holden-Day, 1964.
26. H. L. Royden, Real Analysis. New York, NY: Macmillan, 1988.
27. W. Rudin, Real and Complex Analysis. New York, NY: McGraw-Hill, 1987.
28. C. E. Shannon, "Coding theorems for a discrete source with a fidelity criterion," in IRE Nat. Conv. Rec., vol. 4, 1959, pp. 142-163.
29. P. C. Shields, "String matching bounds via coding," Ann. Probab., vol. 25, pp. 329-336, 1997.
30. J. Shtarkov, "Coding of discrete sources with unknown statistics," in Topics in Information Theory, I. Csiszár and P. Elias, Eds. Amsterdam, The Netherlands: North Holland (Coll. Math. Soc. J. Bolyai), 1977, vol. 16, pp. 559-574.
31. M. Sion, "On general minimax theorems," Pac. J. Math., vol. 8, pp. 171-176, 1958.
32. A. D. Wyner, "Communication of analog data from a Gaussian source over a noisy channel," Bell Syst. Tech. J., vol. 47, pp. 801-812, 1968.
33. A. D. Wyner and J. Ziv, "The sliding-window Lempel-Ziv algorithm is asymptotically optimal," Proc. IEEE, vol. 82, pp. 872-877, June 1994.
34. E.-H. Yang and J. C. Kieffer, "On the performance of data compression algorithms based upon string matching," IEEE Trans. Inform. Theory, vol. 44, pp. 47-65, Jan. 1998.
35. E.-H. Yang and Z. Zhang, "On the redundancy of lossy source coding with abstract alphabets," IEEE Trans. Inform. Theory, vol. 45, pp. 1092-1110, May 1999.
36. _, "The redundancy of source coding with a fidelity criterion-Part II: Coding at a fixed rate level with unknown statistics," preprint, 1999.
37. _, "The redundancy of source coding with a fidelity criterion-Part III: Coding at a fixed distortion level with unknown statistics," preprint, 1999.
38. 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, May 1993.
39. 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.
40. 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.