next up previous
Up: PATTERN MATCHING IMAGE COMPRESSION Previous: 4 New Algorithm: PMIC

References

1
A. Habibi, Comparison of nth-order DPCM encoder with linear transformations and block quantization techniques, IEEE Trans. Commun. Tech., COM-19, 948-956 (1971).

2
M. Atallah, Y. Genin, and W. Szpankowski, A Pattern Matching Approach to Image Compression, Proc. International Conference on Image Processing, vol. II, 349-352, Lausanne (1996); see also Purdue University, CSD-TR-95-083 (1995).

3
T. Berger, Rate Distortion Theory: A Mathematical Basis for Data Compression, Englewood Cliffs, NJ: Prentice-Hall, 1971.

4
C. Constantinescu and J. Storer, Improved Techniques for Single-Pass Adaptive Vector Quantization, Proc. of the IEEE, 82, 933-939 (1994).

5
M. Crochemore and W. Rytter, Text Algorithms, Oxford University Press, New York (1995).

6
W. Finamore, M. Carvalho, and J. Kieffer, Lossy Compression with the Lempel-Ziv Algorithm, 11th Brasilian Telecommunication Conference, 141-146 (1993).

7
A. K. Jain, Fundamentals of Digital Image Processing, Prentice-Hall, Englewood (1989)

8
T. \L 
uczak and W. Szpankowski, A Lossy Data Compression Based on String Matching: Preliminary Analysis and Suboptimal Algorithms, Proc. Combinatorial Pattern Matching, Asilomar, LNCS 807, 102-112, Springer-Verla (1994).

9
T. \L 
uczak and W. Szpankowski, A Suboptimal Lossy Data Compression Based in Approximate Pattern Matching, IEEE International Symposium on Information Theory, Whistler, 1995; also under revision in IEEE Trans. Information Theory, and Purdue University, CSD-TR-94-072 (1994).

10
A. N. Netravali and J. O. Limb, Picture Coding : A Review, Proc. IEEE, 68, 366-406 (1980).

11
M. Rabbani and P. Jones, Digital Image Compression Techniques, SPIE Optical Engineering Press, Bellingham (1991).

12
D. K. Sharma and A. N. Netravali, Design of Quantizers for DPCM Coding of Picture Signals, Proc. IEEE Trans. Commun., COM-25, 1267-1274 (1978).

13
Y. Steinberg and M. Gutman, An Algorithm for Source Coding Subject to a Fidelity Criterion, Based on String Matching, IEEE Trans. Information Theory, 39, 877-886 (1993).

14
W. Szpankowski, A Generalized Suffix Tree and Its (Un)Expected Asymptotic Behaviors, SIAM J. Computing, 22, 1176-1198 (1993).

15
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, 35, 1250-1258 (1989).

16
E.H. Yang, and J. Kieffer, On the Performance of Data Compression Algorithms Based upon String Matching, preprint (1995).

17
J. Ziv and A. Lempel, A Universal Algorithm for Sequential Data Compression, IEEE Trans. Information Theory, 23, 3, 337-343 (1977).

18
J. Ziv and A. Lempel, Compression of Individual Sequences via Variable-rate Coding, IEEE Trans. Information Theory, 24, 530-536, 1978.


Denis Arnaud
11/19/1997