Pattern matching image compression: Algorithmic and empirical results

IEEE Transactions on Pattern Analysis and Machine Intelligence

Volumn 21, Issue 7, 1999, Pages 614-627

  Atallah, Mikhail ^a   Génin, Yann ^a   Szpankowski, Wojciech ^a  

^a Purdue University   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; FAST FOURIER TRANSFORMS; IMAGE ANALYSIS; IMAGE ENHANCEMENT; IMAGE QUALITY; INFORMATION THEORY; PATTERN MATCHING; STANDARDS;

JOINT PICTURE EXPERTS GROUP (JPEG) STANDARDS; PATTERN MATCHING IMAGE COMPRESSION (PMIC);

IMAGE COMPRESSION;

EID: 0032634012     PISSN: 01628828     EISSN: None     Source Type: Journal    
DOI: 10.1109/34.777372     Document Type: Article

References (43)

1. K. Abrahamson, "Generalized String Matching," SIAM J. Computing, vol. 16, pp. 1,039-1,051, 1987.
2. M. Alzina, W. Szpankowski, and A. Grama, "2D Pattern Matching Image and Video Compression: Preliminary Results," Proc. Data Compression Conf., pp. 424-433, Snowbird, 1999.
3. A. Apostolico and W. Szpankowski, "Self-Alignments in Words and Their Applications," J. Algorithms, vol. 13, pp. 446-467, 1992.
4. D. Arnaud and W. Szpankowski, "Pattern Matching Image Compression with Prediction Loop: Preliminary Experimental Results," Proc. Data Compression Conf., Snowbird, 1997, also see Purdue University, Technical Report, CSD-TR-96-069 1996.
5. R. Arratia and M. Waterman, "The Erdös-Rényi Strong Law for Pattern Matching with Given Proportion of Mismatches," Annals of Probability, vol. 17, pp. 1,152-1,169, 1989.
6. M. Atallah, Y. Genin, and W. Szpankowski, "A Pattern Matching Approach to Image Compression," Proc. Int'l Conf. on Image Processing, vol. II, pp. 349-352, Lausanne, Switzerland, 1996.
7. M. Atallah, P. Jacquet, and W. Szpankowski, "Pattern Matching with Mismatches: A Probabilistic Analysis and a Randomized Algorithm," Proc. Combinatorial Pattern Matching, pp. 27-40, Tucson, Ariz. 644, LNCS: Springer-Verlag, 1992.
8. T. Berger, Rate Distortion Theory: A Mathematical Basis for Data Compression. Englewood Cliffs, N.J.: Prentice-Hall, 1971.
9. C. Constantinescu and J. Storer, "Improved Techniques for Single-Pass Adaptive Vector Quantization," Proc. of the IEEE, vol. 82, pp. 933-939, 1994.
10. T. Cornsweet, Visual Perception. New York: Academic Press, 1970.
11. M. Crochemore and W. Rytter, Text Algorithms. New York: Oxford University Press, 1995.
12. R. DeVore, B. Jawerth, and B. Lucier, "Image Compression through Wavelet Transform Coding," IEEE Trans. Information Theory, vol. 38, pp. 719-746, 1992.
13. W. Finamore, M. Carvalho, and J. Kieffer, "Lossy Compression with the Lempel-Ziv Algorithm," 11th Brazilian Telecommunication Conf., pp. 141-146, 1993.
14. Y. Fisher, E. Jacobs, and R. Boss, "Fractal Image Compression Using Iterated Transforms," Image and Text Compression, J. Storer, ed., pp. 35-62. Boston: Kluwer Academic, 1992.
15. Z. Galil and R. Giancarlo, "Data Structures and Algorithms for Approximate String Matching," J. Complexity, vol. 4, pp. 33-72, 1988.
16. A. Gersho and R. Gray, Vector Quantization and Signal Compression. Kluwer Academic, 1992.
17. D. Gusfield, Algorithms on Strings, Trees, and Sequences. Cambridge, England: Univ. Press, 1997.
18. A.K. Jain, Fundamentals of Digital Image Processing. Englewood Cliffs, N.J.: Prentice Hall, 1989.
19. J.C. Kieffer, "A Survey of the Theory of Source Coding with a Fidelity Criterion," IEEE Trans. Information Theory, vol. 39, pp. 1,473-1,490, 1993.
20. J.C. Kieffer private correspondence.
21. H. Koga and S. Arimoto, "Asymptotic Properties of Algorithms of Data Compression with Fidelity Criterion Based on String Matching," Proc. IEEE Information Symp. on Information Theory, pp. 24-25, 1994.
22. I. Kontoyiannis, "An Implementable Lossy Version of the LempelZiv Algorithm- Part I," submitted to Optimality for Memoryless Sources, 1998.
23. D.E. Knuth, The Art of Computer Programming. Seminumerical Algorithms, vol. 2. Addison-Wesley, 1981.
24. T. Luczak and W. Szpankowski, "A Lossy Data Compression Based on String Matching: Preliminary Analysis and Suboptimal Algorithms," Proc. Combinatorial Pattern Matching, pp. 102-112. Springer-Verlag, 1994.
25. T. Luczak and W. Szpankowski, "A Suboptimal Lossy Data Compression Based in Approximate Pattern Matching," IEEE Trans. Information Theory, vol. 43, pp. 1,439-1,451, 1997.
26. E.M. McCreight and A. Space, "Economical Suffix Tree Construction Algorithm," J. ACM, vol. 23, pp. 262-272, 1976.
27. D. Ornstein and P. Shields, "Universal Almost Sure Data Compression," Annals of Probability, vol. 18, pp. 441-452, 1990.
28. M. Rabbani, P. Jones, Digital Image Compression Techniques. Bellingham, Wash.: SPIE Optical Engineering Press, 1991.
29. I. Sadeh, "On Approximate String Matching," Proc. of Data Compression Conf., pp. 148-157, 1993.
30. J. Shapiro, "Embedded Image Coding Using Zerotrees of Wavelet Coefficients," IEEE Trans. Signal Processing, vol. 41, pp. 3,445-3,462, 1993.
31. Y. Steinberg and M. Gutman, "An Algorithm for Source Coding Subject to a Fidelity Criterion, Based on String Matching," IEEE Trans. Information Theory, vol. 39, pp. 877-886, 1993.
32. W. Szpankowski, "A Typical Behavior of Some Data Compression
33. Schemes," Proc. of Data Compression Conf., Snowbird, pp. 247-256, 1991.
34. W. Szpankowski, "A Generalized Suffix Tree and Its (Un)Expected Asymptotic Behaviors," SIAM J. Computing, vol. 22, pp. 1,176-1,198 1993.
35. A. Wyner and J. Ziv, "Some Asymptotic Properties of the Entropy of a Stationary Ergodic Data Source with Applications to Data Compression," IEEE Trans. Information Theory, vol. 35, pp. 1,250-1,258 1989.
36. A. Wyner and J. Ziv, "The Sliding Window Lempel-Ziv Algorithm Is Asymptotically Optimal," Proc. IEEE, vol. 82, pp. 872-877, 1994.
37. E.H. Yang and J. Kieffer, "Simple Universal Lossy Data Compression Schemes Derived from Lempel-Ziv Algorithm," IEEE Trans. Information Theory, vol. 42, pp. 239-245, 1996.
38. E.H. Yang and J. Kieffer, "On the Performance of Data Compression Algorithms Based upon String Matching," IEEE Trans. Information Theory vol. 44, pp. 47-65, 1998.
39. R. Zamir and K. Rose, submitted to Natural Type Selection in Approximate String Matching, 1999.
40. Z.Zhang and V.Wei, "An On-Line Universal Lossy Data Compression Algorithm via Continuous Codebook Refinement-Part I: Basic Results," IEEE Trans. Information Theory, vol. 42, pp. 803-821, 1996.
41. J. Ziv, "Distortion-Rate Theory for Individual Sequences,"IEEE Trans. Information Theory, vol. 26, pp. 137-143, 1980.
42. J. Ziv and A. Lempel, "A Universal Algorithm for Sequential Data Compression," IEEE Trans. Information Theory vol. 23, no. 3, pp. 337-343, 1977.
43. J. Ziv and A. Lempel, "Compression of Individual Sequences via Variable-rate Coding," IEEE Trans. Information Theory vol. 24, pp. 530-536, 1978.