Pattern matching and lossy data compression on random fields

IEEE Transactions on Information Theory

Volumn 49, Issue 4, 2003, Pages 1047-1051

  Kontoyiannis, Ioannis ^a  

^a Brown Univerity   (United States)

Author keywords

Large deviations; Lossy data compression; Pattern matching; Random fields; Rate distortion theory

Indexed keywords

ALGORITHMS; DATA COMPRESSION; DATABASE SYSTEMS; PROBLEM SOLVING;

LOSSY DATA COMPRESSION;

PATTERN MATCHING;

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

References (30)

1. M. Alzina, W. Szpankowski, and A. Grama, "2D-pattern matching image and video compression: Theory, algorithms, and experiments," IEEE Trans. Image Processing, vol. 11, pp. 318-331, Mar. 2002.
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. 618-627, July 1999.
3. T. Berger, S. Y. Shen, and Z. X. Ye, "Some communication problems of random fields," Int. J. Math. Statist. Sci., vol. 1, no. 1, pp. 47-77, 1992.
4. A. C. Bovik and J. D. Gibson, Handbook of Image and Video Compression. San Diego, CA: Academic, 2000.
5. Z. Chi, "Conditional large deviation principle for finite state Gibbs random fields," preprint, Oct. 2001.
6. C. Constantinescu and J. A. Storer, "On-line adaptive vector quantization with variable size codebook entries," Inform. Processing and Manag., vol. 30, no. 6, pp. 745-758, 1994.
7. _, "Application of single-pass adaptive VQ to BiLevel images," in Proc. IEEE Data Compression Conf. - DCC 95, Snowbird, UT, 1995, p. 423.
8. T. M. Cover and J. A. Thomas, Elements of Information Theory. New York: Wiley, 1991.
9. A. Dembo and I. Kontoyiannis, "Source coding, large deviations, and approximate pattern matching," IEEE Trans. Inform. Theory, vol. 48, pp. 1590-1615, June 2002.
10. P. Doukhan, Mixing: Properties and Examples. New York: Springer-Verlag, 1994.
11. P. Elias, "Universal codeword sets and representations of the integers," IEEE Trans. Inform. Theory, vol. IT-21, pp. 194-203, Mar. 1975.
12. H.-O. Georgii, Gibbs Measures and Phase Transitions. Berlin, Germay: W. de Gruyter, 1989.
13. J. D. Gibson, R. L. Baker, T. Berger, T. Lookabaugh, and D. Lindbergh, Digital Compression for Multimedia. San Francisco, CA: Morgan Kaufmann, 1998.
14. X. Guyon, Random Fields on a Network: Modeling, Statistics, and Applications. New York: Springer-Verlag, 1995.
15. I. Kontoyiannis, "Pointwise redundancy in lossy data compression and universal lossy data compression," IEEE Trans. Inform. Theory, vol. 46, pp. 136-152, Jan. 2000.
16. _, (2001, Nov.) Pattern matching and lossy data compression on random fields. Tech. Rep. APPTS 01-6, Div. Appl. Math., Brown Univ., Providence, RI. [Online]. Available: www.dam.brown.edu/people/yiannis.
17. U. Krengel, Ergodic Theorems. Berlin, Germany: de Gruyter, 1985.
18. H. Künsch, S. Geman, and A. Kehagias, "Hidden Markov random fields," Ann. Appl. Probab., vol. 5, no. 3, pp. 577-602, 1995.
19. T.-A. Lee, "On the rate distortion function of the Ising model," Master's thesis, Dept. Elec. Eng., Cornell Univ., Ithaca, NY, 1984.
20. Z. Lin and C. Lu, Limit Theory for Mixing Dependent Random Variables. Dordrecht, The Netherlands: Kluwer, 1996.
21. 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.
22. K. Sayood, Introduction to Data Compression, 2nd ed. San Francisco, CA: Morgan Kaufmann, 2000.
23. C. E. Shannon, "Coding theorems for a discrete source with a fidelity criterion," in IRE Nat. Com. Rec., 1959, pp. 142-163. Reprinted in D. Slepian, Ed., Key Papers in the Development of Information Theory. New York: IEEE Press, 1974.
24. Y. Steinberg and M. Gutman, "An algorithm for source coding subject to a fidelity criterion, based upon string matching," IEEE Trans. Inform. Theory, vol. IT-30, pp. 877-886, May 1993.
25. T. Wiegand and B. Girod, Multi-Frame Motion-Compensated Prediction for Video Transmission. Boston, MA: Kluwer Academic, 2001.
26. G. Winkler, Image Analysis, Random Fields and Dynamic Monte Carlo Methods: A Mathematical Introduction. Berlin, Germany: Springer-Verlag, 1995.
27. A. D. Wyner and J. Ziv, "Fixed data base version of the Lempel-Ziv data compression algorithm," IEEE Trans. Inform. Theory, vol. 37, pp. 878-880, May 1991.
28. 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.
29. Z. Ye and T. Berger, Information Measures for Discrete Random Fields. Beijing, China: Science, 1998.
30. R. Zamir and K. Rose, "Natural type selection in adaptive lossy compression," IEEE Trans. Inform. Theory, vol. 47, pp. 99-111, Jan. 2001.