
This Article  
 
Share  
Bibliographic References  
Add to:  
Digg Furl Spurl Blink Simpy Del.icio.us Y!MyWeb  
Search  
 
ASCII Text  x  
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. 614627, July, 1999.  
BibTex  x  
@article{ 10.1109/34.777372, author = {Mikhail Atallah and Yann Génin and Wojciech Szpankowski}, title = {Pattern Matching Image Compression: Algorithmic and Empirical Results}, journal ={IEEE Transactions on Pattern Analysis and Machine Intelligence}, volume = {21}, number = {7}, issn = {01628828}, year = {1999}, pages = {614627}, doi = {http://doi.ieeecomputersociety.org/10.1109/34.777372}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, }  
RefWorks Procite/RefMan/Endnote  x  
TY  JOUR JO  IEEE Transactions on Pattern Analysis and Machine Intelligence TI  Pattern Matching Image Compression: Algorithmic and Empirical Results IS  7 SN  01628828 SP614 EP627 EPD  614627 A1  Mikhail Atallah, A1  Yann Génin, A1  Wojciech Szpankowski, PY  1999 KW  Lossy LempelZiv scheme KW  approximate pattern matching KW  image compression KW  generalized Shannon entropy KW  Hamming and square root distortion KW  algorithms on words KW  Fast Fourier Transform. VL  21 JA  IEEE Transactions on Pattern Analysis and Machine Intelligence ER   
Abstract—We propose a nontransform image compression scheme based on approximate onedimensional pattern matching that we name
[1] K. Abrahamson, “Generalized String Matching,” SIAM J. Computing, vol. 16, pp. 1,0391,051, 1987.
[2] M. Alzina, W. Szpankowski, and A. Grama, “2D Pattern Matching Image and Video Compression: Preliminary Results,” Proc. Data Compression Conf., pp. 424433, S nowbird, 1999.
[3] A. Apostolico and W. Szpankowski, “SelfAlignments in Words and Their Applications,” J. Algorithms, vol. 13, pp. 446467, 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, CSDTR96069 1996.
[5] R. Arratia and M. Waterman, “The ErdösRényi Strong Law for Pattern Matching with Given Proportion of Mismatches,” Annals of Probability, vol. 17, pp. 1,1521,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. 349352, 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. 2740, Tucson, Ariz. 644, LNCS: SpringerVerlag, 1992.
[8] T. Berger, Rate Distortion Theory: A Mathematical Basis for Data Compression. Englewood Cliffs, N.J.: PrenticeHall, 1971.
[9] C. Constantinescu and J. Storer, “Improved Techniques for SinglePass Adaptive Vector Quantization,” Proc. of the IEEE, vol. 82, pp. 933939, 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. 719746, 1992.
[13] W. Finamore, M. Carvalho, and J. Kieffer, “Lossy Compression with the LempelZiv Algorithm,” 11th Brazilian Telecommunication Conf., pp. 141146, 1993.
[14] Y. Fisher, E. Jacobs, and R. Boss, “Fractal Image Compression Using Iterated Transforms,” Image and Text Compression, J. Storer, ed., pp. 3562. Boston: Kluwer Academic, 1992.
[15] Z. Galil and R. Giancarlo, “Data Structures and Algorithms for Approximate String Matching,” J. Complexity, vol. 4, pp. 3372, 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,4731,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. 2425, 1994.
[22] I. Kontoyiannis, “An Implementable Lossy Version of the LempelZiv Algorithm–Part I,” submitted to Optimality for Memoryless Sources, 1998.
[23] D. Knuth, The Art of Computer Programming, Vol. 2, AddisonWesley, 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. 102112. SpringerVerlag, 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,4391,451, 1997.
[26] E.M. McCreight, "A Space Economical Suffix Tree Construction Algorithm," J. ACM, vol. 23, no. 2, pp. 26272, 1976.
[27] D. Ornstein and P. Shields, “Universal Almost Sure Data Compression,” Annals of Probability, vol. 18, pp. 441452, 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. 148157, 1993.
[30] J.M. Shapiro, "Embedded Image Coding Using Zerotrees of Wavelet Coefficients," IEEE Trans. Signal Processing, vol. 41, no. 12, pp. 3,4453,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. 877886, 1993.
[32] W. Szpankowski, “A Typical Behavior of Some Data Compression Schemes,” Proc. of Data Compression Conf., S nowbird, pp. 247256, 1991.
[33] W. Szpankowski, “A Generalized Suffix Tree and Its (Un)Expected Asymptotic Behaviors,” SIAM J. Computing, vol. 22, pp. 1,1761,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,2501,258 1989.
[35] A.D. Wyner and J. Ziv, "The SlidingWindow LempelZiv Algorithm Is Asymptotically Optimal," Proc. IEEE, vol. 82, 1994, pp. 872877.
[36] E.H. Yang and J. Kieffer, “Simple Universal Lossy Data Compression Schemes Derived from LempelZiv Algorithm,” IEEE Trans. Information Theory, vol. 42, pp. 239245, 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. 4765, 1998.
[38] R. Zamir and K. Rose, submitted to Natural Type Selection in Approximate String Matching, 1999.
[39] Z. Zhang, and V. Wei, “An OnLine Universal Lossy Data Compression Algorithm via Continuous Codebook Refinement—Part I: Basic Results,” IEEE Trans. Information Theory, vol. 42, pp. 803821, 1996.
[40] J. Ziv, “DistortionRate Theory for Individual Sequences,” IEEE Trans. Information Theory, vol. 26, pp. 137143, 1980.
[41] J. Ziv and A. Lempel, "A Universal Algorithm for Sequential Data Compression," IEEE Trans. Information Theory, vol. 23, no. 3, pp. 337343, 1977.
[42] J. Ziv and A. Lempel, "Compression of Individual Sequence via VariableRate Coding," IEEE Trans. Information Theory, vol. 24, no. 5, pp. 530536, 1978.