Introduction to Data Compression

Introduction to data compression

Volumn , Issue , 2006, Pages

  Sayood, Khalid ^a  

^a UNIVERSITY OF NEBRASKA LINCOLN   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 85013706250     PISSN: None     EISSN: None     Source Type: Book    
DOI: 10.1016/B978-0-12-620862-7.X5000-7     Document Type: Book

References (112)

1. Bell T.C., Cleary J.G., Witten I.H. Text Compression. Advanced Reference Series 1990, Prentice Hall, Englewood Cliffs, NJ.
2. van der Waerden B.L. A History of Algebra 1985, Springer-Verlag.
3. Cover T.M., Thomas J.A. Elements of Information Theory. Wiley Series in Telecommunications 1991, John Wiley & Sons Inc.
4. Berger T. Rate Distortion Theory: A Mathematical Basis for Data Compression 1971, Prentice-Hall, Englewood Cliffs, NJ.
5. Gersho A., Gray R.M. Vector Quantization and Signal Compression 1991, Kluwer Academic Publishers.
6. McEliece R.J. The Theory of Information and Coding, volume 3 of Encyclopedia of Mathematics and Its Application 1977, Addison-Wesley.
7. Shannon C.E. A Mathematical Theory of Communication. Bell System Technical Journal 1948, 27:379-423.
8. Shannon C.E. A Mathematical Theory of Communication. Bull System Technical Journal 1948, 27:623-656.
9. Shannon C.E. Prediction and Entropy of Printed English. Bell System Technical Journal January 1951, 30:50-64.
10. Hamming R.W. Coding and Information Theory 1986, Prentice-Hall. 2nd edition.
11. Pennebaker W.B., Mitchell J.L. JPEG Still Image data Compression Standard 1993, Van Nostrand Reinhold.
12. Gallager R.G. Information Theory and Reliable Communication 1968, Wiley.
13. Sardinas A.A., Patterson G.W. A Necessary and Sufficient Condition for the Unique Decomposition of Coded Messages. IRE Convention Records 1953, 104-108. IRE.
14. Rissanen J. Modeling by the Shortest Data Description. Automatica 1978, 14:465-471.
15. Pierce J.R. Symbols, Signals, and Noise-The Nature and Process of Communications 1961, Harper.
16. Ash R.B. Information Theory 1990, (Originally published by Interscience Publishers in 1965.), Dover.
17. Fano R.M. Transmission of Information 1961, MIT Press, Cambridge, MA.
18. Gray R.M. Entropy and Information Theory 1990, Springer-Verlag.
19. Li M., Vitanyi P. An Introduction to Kolmogorov Complexity and Its Applications 1997, Springer.
20. Tate S. Complexity Measures. Lossless Compression Handbook 2003, 35-54. Academic Press. K. Sayood (Ed.).
21. Grunwald P., Myung I.J., Pitt M.A. Advances in Minimum Description Length 2005, MIT Press.
22. Grunwald P. Minimum Description Length Tutorial. Advances in Minimum Description Length 2005, 23-80. MIT Press. P. Grunwald, I.J. Myung, M.A. Pitt (Eds.).
23. Huffman D.A. A method for the construction of minimum redundancy codes. Proc. IRE 1951, 40:1098-1101.
24. Gallager R.G. Variations on a theme by Huffman. IEEE Transactions on Information Theor November 1978, IT-24(6):668-674.
25. Faller N. An Adaptive System for Data Compression. Record of the 7th Asilomar Conference on Circuits, Systems, and Computers 1973, 593-597. IEEE.
26. Knuth D.E. Dynamic Huffman coding. Journal of Algorthms 1985, 6:163-180.
27. Vitter J.S. Design and analysis of dynamic Huffman codes. Journal of ACM October 1987, 34(4):825-845.
28. Elias P. Universal codeword sets and representations of the integers. IEEE Transactions on Information Theory 1975, 21(2):194-203.
29. Golomb S.W. Run-length encodings. IEEE Transactions on Information Theory July 1966, IT-12:399-401.
30. Rice R.F. Some Practical Universal Noiseless Coding Techniques. Technical Report JPL Publication 79-22 March 1979, JPL.
31. Rice R.F., Yeh P.S., Miller W. Algorithms for a very high speed universal noiseless coding module. Technical Report 91-1 February 1991, Jet Propulsion Laboratory, California Institute of Technology, Pasadena, CA.
32. Yeh P.S., Rice R.F., Miller W. On the optimality of code options for a universal noiseless coder. Technical Report 91-2 February 1991, Jet Propulsion Laboratory, California Institute of Technology, Pasadena, CA.
33. Tunstall B.P. Synthesis of Noiseless Compression Codes. Ph.D. thesis September 1967, Georgia Institute of Technology.
34. Robinson T. SHORTEN: Simple Lossless and Near-Lossless Waveform Compression. Cambridge Univ. Eng. Dept., Cambridge, UK. Technical Report 156 1994.
35. Liebchen T., Reznik Y.A. MPEG-4 ALS: An Emerging Standard for Lossless Audio Coding. Proceedings of the Data Compression Conference, DCC '04 2004, IEEE.
36. Hans M., Schafer R.W. AudioPak-An Integer Arithmetic Lossless Audio Code. Proceedings of the Data Compression Conference, DCC '98 1998, IEEE.
37. Pigeon S. Huffman Coding. Lossless Compression Handbook 2003, 79-100. Academic Press. K. Sayood (Ed.).
38. Lelewer D.A., Hirschberg D.S. Data Compression. ACM Computing Surveys September 1987.
39. Storer J.A. Data Compression-Methods and theory 1988, Computer Science Press.
40. Abramson N. Information Theory and Coding 1963, McGraw-Hill.
41. Jelinek F. Probabilistic Information Theory 1968, McGraw-Hill.
42. Pasco R. Source Coding Algorithms for Fast Data Compression. Ph.D. thesis 1976, Stanford University.
43. Rissanen J.J. Generalized Kraft inequality and arithmetic coding. IBM Journal of Research and Development May 1976, 20:198-203.
44. Rissanen J.J., Langdon G.G. Arithmetic coding. IBM Journal of Research and Development March 1979, 23(2):149-162.
45. Rissanen J., Mohiuddin K.M. A Multiplication-Free Multialphabet Arithmetic Code. IEEE Transactions on Communications February 1989, 37:93-98.
46. Witten I.H., Neal R., Cleary J.G. Arithmetic Coding for Data Compression. Communications of the Association for Computing Machinery June 1987, 30:520-540.
47. Said A. Arithmetic Coding. Lossless Compression Handbook 2003, 101-152. Academic Press. K. Sayood (Ed.).
48. Langdon G.G. An introduction to arithmetic coding. IBM Journal of Research and Development March 1984, 28:135-149.
49. Rissanen J.J., Langdon G.G. Universal Modeling and coding. IEEE Transactions on Information Theory 1981, IT-27(1):12-22.
50. Langdon G.G., Rissanen J.J. Compression of black-white images with arithmetic coding. IEEE Transactions on Communications 1981, 29(6):858-867.
51. Bell T., Witten I.H., Cleary J.G. Modeling for Text Compression. ACM Computing Surveys December 1989, 21:557-591.
52. Pennebaker W.B., Mitchell J.L., Langdon G.G., Arps R.B. An overview of the basic principles of the Q-coder adaptive binary Arithmetic Coder. IBM Journal of Research and Development November 1988, 32:717-726.
53. Mitchell J.L., Pennebaker W.B. Optimal hardware and software arithmetic coding procedures for the Q-coder. IBM Journal of Research and Development November 1988, 32:727-736.
54. Pennebaker W.B., Mitchell J.L. Probability estimation for the Q-coder. IBM Journal of Research and Development November 1988, 32:737-752.
55. Ziv J., Lempel A. A universal algorithm for data compression. IEEE Transactions on Information Theory May 1977, IT-23(3):337-343.
56. Ziv J., Lempel A. Compression of individual sequences via variable-rate coding. IEEE Transactions on Information Theory September 1978, IT-24(5):530-536.
57. Storer J.A., Syzmanski T.G. Data compression via textual substitution. Journal of the ACM 1982, 29:928-951.
58. Bell T.C. Better OPM/L text compression. IEEE Transactions on Communications December 1986, COM-34:1176-1182.
59. Welch T.A. A technique for high-performance data compression. IEEE Computer June 1984, 8-19.
60. Deutsch P. RFC 1951-DEFLATE Compressed Data Format Specification Version 1.3 1996, http://www.faqs.org/rfcs/rfc1951.htm.
61. Nelson M., Gailly J.-L. The Data Compression Book 1996, M&T Books, CA.
62. Held G., Marshall T.R. Data Compression 1991, Wiley. 3rd edition.
63. Roelofs G. PNG Lossless Compresion. Lossless Compression Handbook 2003, 371-380. Academic Press. K. Sayood (Ed.).
64. Sahinalp S.C., Rajpoot N.M. Dictionary-Based Data Compression: An Algorithmic Perspective. Lossless Compression Handbook 2003, 153-168. Academic Press. K. Sayood (Ed.).
65. Chomsky N. The Minimalist Program 1995, MIT Press.
66. Cleary J.G., Witten I.H. Data compression using adaptive coding and partial string matching. IEEE Transactions on Communications 1984, 32(4):396-402.
67. Moffat A. Implementing the PPM Data Compression Scheme. IEEE Transactions on Communications November 1990, Vol. COM-38:1917-1921.
68. Cleary J.G., Teahan W.J. Unbounded length contexts for PPM. The Computer Journal February 1997, Vol. 40:x30-x74.
69. Burrows M., Wheeler D.J. A Block Sorting Data Compression Algorithm. Technical Report SRC 124 1994, Digital Systems Research Center.
70. Fenwick P. Symbol-Ranking and ACB Compression. Lossless Compression Handbook 2003, 195-204. Academic Press. K. Sayood (Ed.).
71. Salomon D. Data Compression: The Complete Reference 1998, Springer.
72. Cormack G.V., Horspool R.N.S. Data compression using dynamic Markov modelling. The Computer Journal June 1987, Vol. 30:541.
73. Fenwick P. Burrows-Wheeler Compression. Lossless Compression Handbook 2003, 169-194. Academic Press. K. Sayood (Ed.).
74. Wallace G.K. The JPEG still picture compression standard. Communications of the ACM April 1991, 34:31-44.
75. Wu X., Memon N.D., Sayood K. A Context Based Adaptive Lossless/Nearly-Lossless Coding Scheme for Continuous Tone Images. ISO Working Document ISO/IEC SC29/WG1/N256 1995.
76. Wu X., Memon N.D. CALIC-A context based adaptive lossless image coding scheme. IEEE Transactions on Communications May 1996.
77. Sayood K., Na S. Recursively indexed quantization of memoryless sources. IEEE Transactions on Information Theory November 1992, IT-38:1602-1609.
78. Na S., Sayood K. Recursive Indexing Preserves the Entropy of a Memoryless Geometric Source 1996.
79. Memon N.D., Wu X. Recent developments in context-based predictive techniques for lossless image compression. The Computer Journal 1997, Vol. 40:127-136.
80. Martucci S.A. Reversible compression of HDTV images using median adaptive prediction and arithmetic coding. IEEE International Symposium on Circuits and Systems 1990, 1310-1313. IEEE Press.
81. Rabbani M., Jones P.W. Digital Image Compression Techniques, volume TT7 of Tutorial Texts Series 1991, SPIE Optical Engineering Press.
82. Witten I.H., Moffat A., Bell T.C. Managing Gigabytes: Compressing and Indexing Documents and Images 1994, Van Nostrand Reinhold, New York.
83. Tanimoto S.L. Image transmission with gross information first. Computer Graphics and Image Processing January 1979, 9:72-76.
84. Sloan K.R., Tanimoto S.L. Progressive refinement of raster images. IEEE Tranasactions on Computers November 1979, C-28:871-874.
85. Burt P.J., Adelson E.H. The Laplacian pyramid as a compact image code. IEEE Transactions on Communications April 1983, COM-31:532-540.
86. Knowlton K. Progressive transmission of grey-scale and binary pictures by simple, efficient, and lossless encoding schemes. Proceedings of the IEEE July 1980, 68:885-896.
87. Dreizen H. Content-driven progressive transmission of grey-scale images. IEEE Transactions on Communications March 1987, COM-35:289-296.
88. Capon J. A Probabilistic Model for Run-Length Coding of Pictures. IRE Transactions on Information Theory 1959, 157-163.
89. Yasuda Y. Overview of digital facsimile coding techniques in Japan. IEEE Proceedings July 1980, 68:830-845.
90. Hunter R., Robinson A.H. International digital facsimile coding standards. IEEE Proceedings July 1980, 68:854-867.
91. Langdon G.G., Rissanen J.J. A Simple General Binary Source Code. IEEE Transactions on Information Theory, IT-28 September 1982, 800-803.
92. Arps R.B., Truong T.K. Comparison of international standards for lossless still image compression. Proceedings of the IEEE June 1994, 82:889-899.
93. Weinberger M., Seroussi G., Sapiro G. The LOCO-I Lossless compression Algorithm: Principles and Standardization into JPEG-LS. Technical Report HPL-98-193 November 1998, Hewlett-Packard Laboratory.
94. Pratt W.K. Digital Image Processing 1978, Wiley-Interscience.
95. Campbell F.W. The human eye as an optical filter. Proceedings of the IEEE June 1968, 56:1009-1014.
96. Mannos J.L., Sakrison D.J. The Effect of a Visual Fidelity Criterion on the Encoding of Images. IEEE Transactions on Information Theory, IT-20 July 1974, 525-536.
97. Fletcher H., Munson W.A. Loudness, its measurement, definition, and calculation. Journal of the Acoustical Society of America 1933, 5:82-108.
98. Moore B.C.J. An Introduction to the Psychology of Hearing 1989, Academic Press. 3rd edition.
99. Stevens S.S., Davis H. Hearing-Its Psychology and Physiology 1938, American Inst. of Physics.
100. Mansuripur M. Introduction to Information Theory 1987, Prentice-Hall.
101. Shannon C.E. Coding Theorems for a Discrete Source with a Fidelity Criterion. IRE International Convention Records 1959, Vol. 7:142-163. IRE.
102. Arimoto S. An Algorithm for Computing the Capacity of Arbitrary Discrete Memoryless Channels. IEEE Transactions on Information Theory, IT-18 January 1972, 14-20.
103. Blahut R.E. Computation of Channel Capacity and Rate Distortion Functions. IEEE Transaction on Information Theory, IT-18 July 1972, 460-473.
104. Law A.M., Kelton W.D. Simulation Modeling and Analysis 1982, McGraw-Hill.
105. Rabiner L.R., Schafer R.W. Digital Processing of Speech Signals. Spignal Processing 1978, Prentice-Hall.
106. Thomas Parsons Voice and Speech Processing 1987, McGraw-Hill.
107. Abaya E.F., Wise G.L. On the Existence of Optimal Quantizers. IEEE Transactions on Information Theory, IT-28 November 1982, 937-940.
108. Jayant N., Rabiner L. The application of dither to the quantization of speech signals. Bell System Technical Journal June 1972, 51:1293-1304.
109. Max J. Quantizing for Minimum Distortion. IRE Transactions on Information Theory, IT-6 January 1960, 7-12.
110. Adams W.C., Geisler C.E. Quantizing Characteristics for Signals Having Laplacian Amplitude Probability Density Function. IEEE Transactions on Communications, COM-26 August 1978, 1295-1297.
111. Jayant N.S. Adaptive quantization with one word memory. Bell System Technical Journal September 1974, 1119-1144.
112. Mitra D. Mathematical Analysis of an adaptive quantizer. Bell Systems Technical Journal May-June 1974, 867-898.