A tutorial on hierarchical lossless data compression

International Series in Operations Research and Management Science

Volumn 46, Issue , 2016, Pages 711-733

  Kieffer, John C ^a  

^a University of Minnesota   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 84954494127     PISSN: 08848289     EISSN: None     Source Type: Book Series    
DOI: None     Document Type: Chapter

References (19)

1. Barnsley, M. and L. Hurd. (1993). Fractal Image Compression. Wellesley, MA: AK Peters, Ltd.
2. Burt, P. and E. Adelson. (1983). “The Laplacian Pyramid as a Compact Image Code,” IEEE Trans. Commun., Vol. 31, pp. 532-540.
3. Cameron, R. (1988). “Source Encoding Using Syntactic Information Source Models,” IEEE Trans. Inform. Theory, Vol. 34, pp. 843-850.
4. Chui, C. (1992). (ed.), Wavelets: A Tutorial in Theory and Applications. New York: Academic Press.
5. Cover, T. and J. Thomas. (1991). Elements of Information Theory. New York: Wiley.
6. Fisher, Y. (1995). (ed.), Fractal Image Compression: Theory and Application. New York: Springer-Verlag.
7. Kawaguchi, E. and T. Endo. (1980). “On a Method of Binary-Picture Representation and its Application to Data Compression,” IEEE Trans. Pattern Anal. Machine Intell., Vol. 2, pp. 27-35.
8. Kieffer, J. and E.-H. Yang. (2000). “Grammar-Based Codes: A New Class of Universal Lossless Source Codes,” IEEE Trans. Inform. Theory, Vol. 46, pp. 737-754.
9. Kieffer, J., E.-H. Yang, G. Nelson, and P. Cosman. (2000). “Universal Lossless Compression Via Multilevel Pattern Matching,” IEEE Trans. Inform. Theory, Vol. 46, pp. 1227-1245, 2000.
10. Knuth, D. (1973). The Art of Computer Programming: Volume 1/Fundamental Algorithms. Reading, MA: Addison-Wesley.
11. Kourapova, E. and B. Ryabko. (1995). “Application of Formal Grammars for Encoding Information Sources,” Probl. Inform. Transm., Vol. 31, pp. 23-26.
12. Liaw, H-T. and C-S. Liu. (1992). “On the OBDD-Representation of General Boolean Functions,” IEEE Trans. Computers, Vol. 41, pp. 661-664.
13. Nevill-Manning, C. and I. Witten. (1997a). “Identifying Hierarchical Structure in Sequences: A Linear-Time Algorithm,” Jour. Artificial Intell. Res., Vol. 7, pp. 67-82.
14. Nevill-Manning, C. and I. Witten. (1997b). “Compression and Explanation Using Hierarchical Grammars,” Computer Journal, Vol. 40, pp. 103-116.
15. Said, A. and W. Pearlman. (1996). “A New Fast and Efficient Image Codec Based on Set Partitioning in Hierarchical Trees,” IEEE Trans. Circuits Sys. Video Technol., Vol. 6, pp. 243-250.
16. Shapiro, J. (1993). “Embedded Image Coding Using Zerotrees of Wavelet Coefficients," IEEE Trans. Signal Proc., Vol. 41, pp. 3445-3462.
17. Strang, G. and T. Nguyen. (1996). Wavelets and Filter Banks. Wellesley, MA: Wellesley-Cambridge Press.
18. Yang, E.-H. and J. Kieffer. (2000). “Efficient Universal Lossless Data Compression Algorithms Based on a Greedy Sequential Grammar Transform-Part One: Without Context Models,” IEEE Trans. Inform. Theory, Vol. 46, pp. 755-777.
19. Ziv, J. and A. Lempel. (1978). “Compression of individual sequences via variablerate coding,” IEEE Trans. Inform. Theory, Vol. 24, pp. 530-536.