This Article 
 Bibliographic References 
 Add to: 
Pattern Matching Image Compression: Algorithmic and Empirical Results
July 1999 (vol. 21 no. 7)
pp. 614-627

Abstract—We propose a nontransform image compression scheme based on approximate one-dimensional pattern matching that we name Pattern Matching Image Compression (PMIC). The main idea behind it is a lossy extension of the Lempel-Ziv data compression scheme in which one searches for the longest prefix of an uncompressed image that approximately occurs in the already processed image (e.g., in the sense of the Hamming distance or, alternatively, of the square error distortion). This main algorithm is enhanced with several new features such as searching for reverse approximate matching, recognizing substrings in images that are additively shifted versions of each other, introducing a variable and adaptive maximum distortion level $D$, and so forth. These enhancements are crucial to the overall quality of our scheme and their efficient implementation leads to algorithmic issues of interest in their own right. Both algorithmic and experimental results are presented. Our scheme turns out to be competitive with JPEG and wavelet compression for good quality graphical images. We also review related theoretical results.

[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, S nowbird, 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., S nowbird, 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. Oxford Univ. Press, 1994.
[12] R.A. DeVore, B. Jawerth, and B.J. Lucier, “Image Compression through Wavelet Transform Coding,” IEEE Trans. Information Theory, vol. 38, no. 2 (Part II)), 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.M. Gray, Vector Quantization and Signal Compression. Boston: Kluwer Academic, 1992.
[17] D. Gusfield, Algorithms on Strings, Trees and Sequences: Computer Science and Computational Biology, Cambridge Univ. Press, Cambridge, UK, 1997.
[18] A.K. Jain, Fundamentals of Digital Image Processing. 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 Lempel-Ziv Algorithm–Part I,” submitted to Optimality for Memoryless Sources, 1998.
[23] D. Knuth, The Art of Computer Programming, Vol. 2, Addison-Wesley, Reading, Mass., 1998.
[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, "A Space Economical Suffix Tree Construction Algorithm," J. ACM, vol. 23, no. 2, pp. 262-72, 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.M. Shapiro, "Embedded Image Coding Using Zerotrees of Wavelet Coefficients," IEEE Trans. Signal Processing, vol. 41, no. 12, pp. 3,445-3,462, Dec. 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 Schemes,” Proc. of Data Compression Conf., S nowbird, pp. 247-256, 1991.
[33] W. Szpankowski, “A Generalized Suffix Tree and Its (Un)Expected Asymptotic Behaviors,” SIAM J. Computing, vol. 22, pp. 1,176-1,198 1993.
[34] 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.
[35] A.D. Wyner and J. Ziv, "The Sliding-Window Lempel-Ziv Algorithm Is Asymptotically Optimal," Proc. IEEE, vol. 82, 1994, pp. 872-877.
[36] 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.
[37] 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.
[38] R. Zamir and K. Rose, submitted to Natural Type Selection in Approximate String Matching, 1999.
[39] 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.
[40] J. Ziv, “Distortion-Rate Theory for Individual Sequences,” IEEE Trans. Information Theory, vol. 26, pp. 137-143, 1980.
[41] J. Ziv and A. Lempel, "A Universal Algorithm for Sequential Data Compression," IEEE Trans. Information Theory, vol. 23, no. 3, pp. 337-343, 1977.
[42] J. Ziv and A. Lempel, "Compression of Individual Sequence via Variable-Rate Coding," IEEE Trans. Information Theory, vol. 24, no. 5, pp. 530-536, 1978.

Index Terms:
Lossy Lempel-Ziv scheme, approximate pattern matching, image compression, generalized Shannon entropy, Hamming and square root distortion, algorithms on words, Fast Fourier Transform.
Mikhail Atallah, Yann Génin, Wojciech Szpankowski, "Pattern Matching Image Compression: Algorithmic and Empirical Results," IEEE Transactions on Pattern Analysis and Machine Intelligence, vol. 21, no. 7, pp. 614-627, July 1999, doi:10.1109/34.777372
Usage of this product signifies your acceptance of the Terms of Use.