Digital signal compression: Principles and practice

Digital Signal Compression: Principles and Practice

Volumn 9780521899826, Issue , 2011, Pages 1-419

  Pearlman, William A ^a   Said, Amir ^b  

^a RENSSELAER POLYTECHNIC INSTITUTE   (United States)

^b HEWLETT PACKARD LABORATORIES   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

CODES (SYMBOLS); DIGITAL IMAGE STORAGE; IMAGE CODING; MATHEMATICAL TRANSFORMATIONS; STUDENTS; WAVELET TRANSFORMS;

ARITHMETIC CODING; DIGITAL SIGNALS; FUNDAMENTAL CONCEPTS; GRADUATE STUDENTS; LOSSLESS COMPRESSION; PRINCIPLES AND PRACTICES; SET PARTITION CODING; SIGNAL COMPRESSION;

IMAGE COMPRESSION;

EID: 84924117408     PISSN: None     EISSN: None     Source Type: Book    
DOI: 10.1017/CBO9780511984655     Document Type: Book

References (205)

1. J. F. Gantz, C. Chite, A. Manfrediz, S. Minton, D. Reinsel, W. Schliditing, and A. Torcheva, “The diverse and exploding digital universe,” International Data Corporation (IDC), Framingham, MA, White paper, Mar. 2008, (http://www.emc.com/digital_universe).
2. N. Negroponte, Being Digital. New York, NY: Alfred A. Knopf, Inc., 1995.
3. C. E. Shannon, “A mathematical theory of communication,” Bell Syst. Technol. J., vol. 27, pp. 379–423 and 632–656, July and Oct. 1948.
4. C. E. Shannon and W. Weaver, The Mathematical Theory of Communication. Urbana, IL: University of Illinois Press, 1949.
5. C. E. Shannon, “Coding theorems of a discrete source with a fidelity criterion,” in Information and Decision Processes, ed. R. E. Machol New York, NY: McGraw-Hill Publishing Co., 1960, pp. 93–126.
6. R. P. Rao and W. A. Pearlman, “On entropy of pyramid structures,” IEEE Trans. Inf. Theory, vol. 37, no. 2, pp. 407–413, Mar. 1991.
7. J. W. Woods and S. D. Oneil, “Subband coding of images,” IEEE Trans. Acoust. Speech Signal Process., vol. 34, no. 5, pp. 1278–1288, Oct. 1986.
8. R. E. Crochiere, S. A. Webber, and J. L. Flanagan, “Digital coding of speech in sub-bands,” in Proceedings of the IEEE International Conference on Acoustics Speech Signal Processing, Philadelphia, PA, Apr. 1976, pp. 233–236.
9. W. A. Pearlman, “Performance bounds for subband coding,” in Subband Image Coding, ed. J. W. Woods Norwell, MA: Kluwer Academic Publishers, 1991, ch. 1.
10. S. Rao and W. A. Pearlman, “Analysis of linear prediction, coding, and spectral estimation from subbands,” IEEE Trans. Inf. Theory, vol. 42, no. 4, pp. 1160–1178, July 1996.
11. B.-B. Chai, J. Vass, and X. Zhuang, “Significance-linked connected component analysis for wavelet image coding,” IEEE Trans. Image Process., vol. 8, no. 6, pp. 774–784, June 1999.
12. B. Girod, A. M. Aaron, S. Rane, and D. Rebollo-Monedero, “Distributed video coding,” Proc. IEEE, vol. 91, no. 1, pp. 71–83, Jan. 2005.
13. E. S. Hong and R. E. Ladner, “Group testing for image compression,” IEEE Trans. Image Process., vol. 11, no. 8, pp. 901–911, Aug. 2002.
14. W. A. Pearlman, A. Islam, N. Nagaraj, and A. Said, “Efficient, low-complexity image coding with a set-partitioning embedded block coder,” IEEE Trans. Circuits Syst. Video Technol., vol. 14, no. 11, pp. 1219–1235, Nov. 2004.
15. S. S. Pradhan, J. Kusuma, and K. Ramchandran, “Distributed compression in a dense microsensor network,” IEEE Signal Process. Mag., pp. 51–60, Mar. 2002.
16. A. Said and W. A. Pearlman, “A new, fast, and efficient image codec based on set partitioning in hierarchical trees,” IEEE Trans. Circuits Syst. Video Technol., vol. 6, no. 3, pp. 243–250, June 1996.
17. J. M. Shapiro, “Embedded image coding using zerotrees of wavelet coefficients,” IEEE Trans. Signal Process., vol. 41, no. 12, pp. 3445–3462, Dec. 1993.
18. D. S. Taubman, “High performance scalable image compression with EBCOT,” IEEE Trans. Image Process., vol. 9, no. 7, pp. 1158–1170, July 2000.
19. C. E. Shannon, “A mathematical theory of communication,” Bell Syst. Technol. J., vol. 27, pp. 379–423 and 632–656, July and Oct. 1948.
20. R. G. Gallager, Information Theory and Reliable Communication. New York, NY: JohnWiley & Sons, 1968.
21. T. M. Cover and J. A. Thomas, Elements of Information Theory. New York, NY: John Wiley & Sons, 1991, 2006.
22. D. A. Huffman, “A method for the construction of minimum redundancy codes,” Proc. IRE, vol. 40, pp. 1098–1101, Sept. 1952.
23. F. Jelinek, Probabilistic Information Theory. New York: McGraw-Hill, 1968.
24. A. Said, “Arithmetic coding,” in Lossless Compression Handbook, ed. K. Sayood. San Diego, CA: Academic Press, 2003, ch. 5.
25. A. Said, “On the reduction of entropy coding complexity via symbol grouping: I redundancy analysis and optimal alphabet partition,” HP Laboratories, Palo Alto, CA, Report HPL-2004-145, Aug. 2004.
26. S. W. Golomb, “Run-length encodings,” IEEE Trans. Inf. Theory, vol. IT-12, no. 3, pp. 399–401, July 1966.
27. R. G. Gallager and D. Van Voorhis, “Optimal source codes for geometrically distributed integer alphabets,” IEEE Trans. Inf. Theory, vol. 21, no. 2, pp. 228–230, Mar. 1975.
28. J. Ziv and A. Lempel, “A universal algorithm for data compression,” IEEE Trans. Inf. Theory, vol. IT-23, no. 3, pp. 337–343, May 1977.
29. J. Ziv and A. Lempel, “Compression of individual sequences via variable-rate coding,” IEEE Trans. Inf. Theory, vol. IT-24, no. 5, pp. 530–536, Sept. 1978.
30. T. A. Welch, “A technique for high-performance data compression,” IEEE Computer, vol. 17, no. 6, pp. 8–19, June 1984.
31. T. C. Bell, “Better OPM/L text compression,” IEEE Trans. Commun., vol. COM-34, no. 12, pp. 1176–1182, Dec. 1986.
32. K. Sayood, Introduction to Data Compression, 3rd edn. San Francisco, CA: Morgan Kaufmann Publishers (Elsevier), 2006.
33. D. Salomon, Data Compression: The Complete Reference, 3rd edn. New York: Springer, 2004.
34. H. Witten, R. M. Neel, and J. G. Cleary, “Arithmetic coding for data compression,” Commun. AcM, vol. 30, no. 6, June 1987. Pp. 520–540.
35. A. Gersho and R. M. Gray, Vector Quantization and Signal Compression, Boston, Dordrecht, London: Kluwer Academic Publishers, 1992.
36. T. M. Cover and J. A. Thomas, Elements of Information Theory. New York, NY: JohnWiley & Sons, 1991, 2006.
37. A. Said and W. Pearlman, “Low-complexity waveform coding via alphabet and sample-set partitioning,” in Proceedings of the SPIE: Visual Communications and Image Processing, vol. 3024, San Jose, CA, Feb. 1997, pp. 25–37.
38. Y. Q. Shi and H. Sun, Image and Video Compression for Multimedia Engineering. Boca Raton: CRC Press, Taylor & Francis Group, 2008.
39. P. E. Fleischer, “Sufficient conditions for achieving minimum distortion in a quantizer,” in IEEE International Convention Record – Part I, vol. Part I, 1964, pp. 104–111.
40. A. V. Trushkin, “Sufficient conditions for uniqueness of a locally optimal quantizer for a class of convex error weighting functions,” IEEE Trans. Inf. Theory, vol. 28, no. 2, pp. 187–198, Mar. 1982.
41. S. P. Lloyd, “Least squares quantization in PCM,” IEEE Trans. Inf. Theory, vol. 28, no. 2, pp. 129–137, Mar. 1982.
42. J. Max, “Quantizing for minimum distortion,” IRE Trans. Inform. Theory, vol. 6, no. 1, pp. 7–12, Mar. 1960.
43. W. R. Bennett, “Spectra of quantized signals,” Bell Syst. Tech. J., vol. 27, pp. 446–472, July 1948.
44. T. J. Goblick Jr. And J. L. Holsinger, “Analog source digitization: A comparison of theory and practice,” IEEE Trans. Inf. Theory, vol. 13, no. 2, pp. 323–326, Apr. 1967.
45. H. Gish and J. N. Pierce, “Asymptotically efficient quantizing,” IEEE Trans. Inf. Theory, vol. 14, no. 5, pp. 676–683, Sept. 1968.
46. A. N. Netravali and R. Saigal, “Optimum quantizer design using a fixed-point algorithm,” Bell Syst. Tech. J., vol. 55, pp. 1423–1435, Nov. 1976.
47. N. Farvardin and J. W. Modestino, “Optimum quantizer performance for a class of nongaussian memoryless sources,” IEEE Trans. Inf. Theory, vol. 30, no. 3, pp. 485–497, May 1984.
48. T. M. Cover and J. A. Thomas, Elements of Information Theory. New York, NY: John Wiley & Sons, 1991, 2006.
49. R. G. Gallager, Information Theory and Reliable Communication. New York, NY: John Wiley & Sons, 1968.
50. R. E. Blahut, “Computation of channel capacity and rate-distortion functions,” IEEE Trans. Inf. Theory, vol. 18, no. 4, pp. 460–473, July 1972.
51. A. Gersho and R. M. Gray, Vector Quantization and Signal Compression. Boston, Dordrecht, London: Kluwer Academic Publishers, 1992.
52. A. Alecu, A. Munteanu, J. Cornelis, S. Dewitte, and P. Schelkens, “On the optimality of embedded deadzone scalar-quantizers for wavelet-based l-infinite-constrained image coding,” IEEE Signal Process. Lett., vol. 11, no. 3, pp. 367–370, Mar. 2004.
53. D. A. Huffman, “A method for the construction of minimum redundancy codes,” Proc. IRE, vol. 40, pp. 1098–1101, Sept. 1952.
54. N. S. Jayant and P. Noll, Digital Coding of Waveforms. Englewood Cliffs, NJ: Prentice Hall, 1984.
55. M. Oger, S. Ragot, and M. Antonini, “Model-based deadzone optimization for stack-run audio coding with uniform scalar quantization,” in Proceedings of the IEEE International Conference on Acoustics Speech Signal Process., Las Vegas, NV, Mar. 2008, pp. 4761–4764.
56. W. A. Pearlman, “Polar quantization of a complex gaussian random variable,” in Quantization, ser. Benchmark Papers in Electrical Engineering and Computer Science, ed. P. Swaszek Van Nostrand Reinhold, 1985, vol. 29.
57. W. Pearlman, “Polar quantization of a complex Gaussian random variable,” IEEE Trans. Commun., vol. COM-27, no. 6, pp. 101–112, June 1979.
58. W. Pearlman and G. Senge, “Optimal quantization of the Rayleigh probability distribution,” IEEE Trans. Commun., vol. COM-27, no. 1, pp. 101–112, Jan. 1979.
59. C. E. Shannon, “A mathematical theory of communication,” Bell Syst. Tech. J., vol. 27, pp. 379–423 and 632–656, July and Oct. 1948.
60. C. E. Shannon and W. Weaver, The Mathematical Theory of Communication. Urbana, IL: University of Illinois Press, 1949.
61. G. J. Sullivan, “Efficient scalar quantization of exponential and Laplacian random variables,” IEEE Trans. Inf. Theory, vol. 42, no. 5, pp. 1365–1374, Sept. 1996.
62. A. D. Wyner and J. Ziv, “Bounds on the rate-distortion function for stationary sources with memory,” IEEE Trans. Inf. Theory, vol. 17, no. 5, pp. 508–513, Sept. 1971.
63. R. M. Gray, J. C. Kieffer, and Y. Linde, “Locally optimal block quantizer design,” Inform. Control, vol. 45, no. 2, pp. 178–198, May 1980.
64. Y. Linde, A. Buzo, and R. M. Gray, “An algorithm for vector quantizer design,” IEEE Trans. Commun., vol. 28, no. 1, pp. 84–95, Jan. 1980.
65. R. M. Gray, “Vector quantization,” IEEE ASSP Mag., vol. 1, no. 2, pp. 4–29, Apr. 1984.
66. S. P. Lloyd, “Least squares quantization in PCM,” IEEE Trans. Inf. Theory, vol. 28, no. 2, pp. 129–137, Mar. 1982.
67. P. A. Chou, T. Lookabaugh, and R.M. Gray, “Entropy-constrained vector quantization,” IEEE Trans. Acoust. Speech Signal Process., vol. 37, no. 1, pp. 31–42, Jan. 1989.
68. E. A. Riskin and R. M. Gray, “A greedy tree growing algorithm for the design of variable rate vector quantizers,” IEEE Trans. Signal Process., vol. 39, no. 11, pp. 2500–2507, Nov. 1991.
69. A. Gersho and R. M. Gray, Vector Quantization and Signal Compression. Boston, Dordrecht, London: Kluwer Academic Publishers, 1992.
70. W. A. Finamore and W. A. Pearlman, “Optimal encoding of discrete-time continuousamplitude, memoryless sources with finite output alphabets,” IEEE Trans. Inf. Theory, vol. IT-26, no. 2, pp. 144–155, Mar. 1980.
71. M. W. Marcellin and T. R. Fischer, “Trellis coded quantization of memoryless and Gauss-Markov sources,” IEEE Trans. Commun., vol. 38, no. 1, pp. 82–93, Jan. 1990.
72. G. Ungerboeck, “Channel coding with multilevel/phase signals,” IEEE Trans. Inform. Theory, vol. IT-28, no. 1, pp. 55–67, Jan. 1982.
73. T. R. Fischer, M. W. Marcellin, and M. Wang, “Trellis-coded vector quantiztion,” IEEE Trans. Inf. Theory, vol. 37, no. 6, pp. 1551–1566, Nov. 1991.
74. A. J. Viterbi, “Error bounds for convolutional codes and an asymptotically optimal decoding algorithm,” IEEE Trans. Inform. Theory, vol. IT-13, no. 4, pp. 260–269, Apr. 1967.
75. J. G. D. Forney, “The Viterbi algorithm,” Proc. IEEE, vol. 61, no. 3, pp. 268–278, Mar. 1973.
76. N. S. Jayant and P. Noll, Digital Coding of Waveforms. Englewood Cliffs, NJ: Prentice Hall, 1984.
77. D. S. Taubman and M. W. Marcellin, JPEG2000: Image Compression Fundamentals, Standards, and Practice. Norwell, MA: Kluwer Academic Publishers, 2002.
78. J. B. Anderson and J. B. Bodie, “Tree encoding of speech,” IEEE Trans. Inf. Theory, vol. 21, no. 4, pp. 379–387, July 1975.
79. L. Breiman, J. H. Friedman, R. A. Olshen, and C. J. Stone, Classification and Regression Trees. Monterey, CA: Wadsworth, 1984.
80. T. M. Cover and J. A. Thomas, Elements of Information Theory. New York, NY: JohnWiley & Sons, 1991, 2006.
81. H. G. Fehn and P. Noll, “Multipath search coding of stationary signals with applications to speech,” IEEE Trans. Commun., vol. 30, no. 4, pp. 687–701, Apr. 1982.
82. P. Kroon and E. F. Deprettere, “A class of analysis-by-synthesis predictive coders for high quality speech coding at rates between 4.8 and 16 Kbits/s,” IEEE J. Sel. Areas Commun., vol. 30, no. 4, pp. 687–701, Feb. 1988.
83. B. Mahesh and W. A. Pearlman, “Multiple-rate structured vector quantization of image pyramids,” J. Visual Commun. Image Represent, vol. 2, no. 2, pp. 103–113, Jan. 1991.
84. B. Mazor and W. A. Pearlman, “A trellis code construction and coding theorem for stationary Gaussian sources,” IEEE Trans. Inf. Theory, vol. 29, no. 6, pp. 924–930, Nov. 1983.
85. B. Mazor and W. A. Pearlman, “A tree coding theorem for stationary Gaussian sources and the squared-error distortion measure,” IEEE Trans. Inf. Theory, vol. 32, no. 2, pp. 156–165, Mar. 1986.
86. J. W. Modestino, V. Bhaskaran, and J. B. Anderson, “Tree encoding of images in the presence of channel errors,” IEEE Trans. Inf. Theory, vol. 27, no. 6, pp. 677–697, Nov. 1981.
87. W. A. Pearlman and P. Jakatdar, “A transform tree code for stationary Gaussian sources,” IEEE Trans. Inf. Theory, vol. 31, no. 6, pp. 761–768, Nov. 1985.
88. E. A. Riskin, “Optimal bit allocation via the generalized BFOS algorithm,” IEEE Trans. Inf. Theory, vol. 37, no. 2, pp. 400–402, Mar. 1991.
89. W. A. Fuller, Introduction to Statistical Time Series, 2nd edn. New York, NY: John Wiley & Sons, 1996.
90. J. Pearl, “On coding and filtering stationary signals by discrete Fourier transforms,” IEEE Trans. Inf. Theory, vol. 19, no. 2, pp. 229–232, Mar. 1973.
91. W. A. Pearlman, “A limit on optimum performance degradation in fixed-rate coding of the discrete Fourier transform,” IEEE Trans. Inf. Theory, vol. 22, no. 4, pp. 485–488, July 1976.
92. Y. Yemini and J. Pearl, “Asymptotic properties of discrete unitary transforms,” IEEE Trans. Pattern Anal. Mach. Intell., vol. 1, no. 4, pp. 366–371, Oct. 1979.
93. N. Ahmed, T. R. Natarajan, and K. R. Rao, “Discrete cosine transform,” IEEE Trans. Comput., vol. 23, no. 1, pp. 90–93, Jan. 1974.
94. M. J. Narasimha and A. M. Peterson, “On the computation of the discrete cosine transform,” IEEE Trans. Commun., vol. 26, no. 6, pp. 934–936, June 1978.
95. H. S. Malvar, Signal Processing with Lapped Transforms. Norwood, MA: Artech House, 1992.
96. D. S. Taubman and M. W. Marcellin, JPEG 2000: Image Compression Fundamentals, Standards, and Practice. Norwell, MA: Kluwer Academic Publishers, 2002.
97. A. Cohen, I. Daubechies, and J.-C. Feauveau, “Biorthogonal bases of compactly supported wavelets,” Commun. Pure Appl. Math., vol. 45, no. 5, pp. 485–560, June 1992.
98. M. Vetterli and J. KovaČević, Wavelets and Subband Coding. Englewood Cliffs, NJ: Prentice Hall, 1995.
99. R. M. Rao and A. S. Bopardikar, Wavelet Transforms: Introduction to Theory and Applications. Reading, MA: Addison-Wesley Publishing Co., 1998.
100. G. Strang and T. Nguyen, Wavelets and Filter Banks. Wellesley, MA: Wellesley-Cambridge Press, 1997.
101. W. Sweldens, “The lifting scheme: A custom-design construction of biorthogonal wavelets,” Appl. Comput. Harmon. Anal., vol. 3, no. 2, pp. 186–200, Apr. 1996.
102. A. Said and W. A. Pearlman, “An image multiresolution representation for lossless and lossy compression,” IEEE Trans. Image Process., vol. 5, no. 9, pp. 1303–1310, Sept. 1996.
103. A. Zandi, J. Allen, E. L. Schwartz, and M. Boliek, “CREW: Compression with reversible embedded wavelets,” in Proceedings of the IEEE Data Compression Conference, Snowbird, UT, Mar. 1995, pp. 212–221.
104. A. R. Calderbank, I. Daubechies, W. Sweldens, and B.-L. Yeo, “Wavelet transforms that map integers to integers,” Applied and Computational Harmonic Analysis, vol. 5, no. 3, pp. 332–369, July 1998.
105. W. K. Pratt, Digital Image Processing, 2nd edn. New York: J. Wiley & Sons, Inc., 1991.
106. A. N. Akansu and R. A. Haddad, Multidimensional Signal Decomposition: Transforms, Subbands, and Wavelets, 2nd edn. San Diego, CA: Academic Press (Elsevier), 2001.
107. R. E. Crochiere and L. R. Rabiner, Multirate Digital Signal Processing. Englewood Cliffs, NJ: Prentice-Hall, Inc., 1983.
108. A. N. Akansu and F. E. Wadas, “On lapped orthogonal transform,” IEEE Trans. Signal Process., vol. 40, no. 2, pp. 439–442, Feb. 1992.
109. R. Bellman, Introduction to Matrix Analysis, 2nd edn. New York, NY: McGraw-Hill Publishing Co., 1970.
110. P. S. R. Diniz, E. A. B. Da Silva, and S. L. Netto, Digital Signal Processing. Cambridge, England: Cambridge University Press, 2002.
111. N. S. Jayant and P. Noll, Digital Coding of Waveforms. Englewood Cliffs, NJ: Prentice Hall, 1984.
112. W. A. Pearlman, “Performance bounds for subband coding,” in Subband Image Coding, J. W. Woods, edn. Norwell, MA: Kluwer Academic Publishers, 1991, ch. 1.
113. W. Sweldens, “The lifting scheme: A construction of second generation wavelets,” SIAM J. Math. Anal., vol. 29, no. 2, pp. 511–546, Mar. 1998.
114. R. Bellman, Introduction to Matrix Analysis, 2nd edn. New York, NY: McGraw-Hill Publishing Co., 1970.
115. R. C. Wood, “On optimum quantization,” IEEE Trans. Inf. Theory, vol. IT-15, no. 2, pp. 248–252, Mar. 1969.
116. L. Breiman, J. H. Friedman, R. A. Olshen, and C. J. Stone, Classification and Regression Trees. Monterey, CA: Wadsworth, 1984.
117. B. Mahesh and W. A. Pearlman, “Multiple-rate structured vector quantization of image pyramids,” J. Visual Commun. Image Represent, vol. 2, no. 2, pp. 103–113, Jan. 1991.
118. W. A. Pearlman, “Performance bounds for subband coding,” in Subband Image Coding, ed. J. W. Woods. Norwell, MA: Kluwer Academic Publishers, 1991, ch. 1.
119. W. A. Pearlman, “Information theory and image coding,” in Handbook of Visual Communications, eds. H.-M. Hang and J. W. Woods. San Diego, CA: Academic Press, 1995, ch. 2.
120. R. P. Rao and W. A. Pearlman, “On entropy of pyramid structures,” IEEE Trans. Inf. Theory, vol. 37, no. 2, pp. 407–413, Mar. 1991.
121. S. Rao and W. A. Pearlman, “Analysis of linear prediction, coding, and spectral estimation from subbands,” IEEE Trans. Inf. Theory, vol. 42, no. 4, pp. 1160–1178, July 1996.
122. E. A. Riskin, “Optimal bit allocation via the generalized BFOS algorithm,” IEEE Trans. Inf. Theory, vol. 37, no. 2, pp. 400–402, Mar. 1991.
123. Y. Shoham and A. Gersho, “Efficient bit allocation for an arbitrary set of quantizers,” IEEE Trans. Acoust. Speech Signal Process., vol. 36, no. 9, pp. 1445–1453, Sept. 1988.
124. A. K. Soman and P. P. Vaidyanathan, “Coding gain in paraunitary analysis/synthesis systems,” IEEE Trans. Signal Process., vol. 5, no. 41, pp. 1824–1835, May 1993.
125. D. S. Taubman and M. W. Marcellin, JPEG2000: Image Compression Fundamentals, Standards, and Practice. Norwell, MA: Kluwer Academic Publishers, 2002.
126. J. W. Woods and T. Naveen, “A filter based bit allocation scheme for subband compression of HDTV,” IEEE Trans. Image Process., vol. 1, no. 3, pp. 436–440, July 1992.
127. J. W. Woods and S. D. Oneil, “Subband coding of images,” IEEE Trans. Acoust. Speech Signal Process., vol. 34, no. 5, pp. 1278–1288, Oct. 1986.
128. W. A. Pearlman, “Adaptive cosine transform image coding with constant block distortion,” IEEE Trans. Commun., vol. 38, no. 5, pp. 698–703, May 1990.
129. N. O. Anderson, “On the calculation of filter coefficients for maximum entropy spectral analysis,” Geophysics, vol. 39, pp. 69–72, Feb. 1974.
130. W.-H. Chen and C. H. Smith, “Adaptive coding of color and monochrome images,” IEEE Trans. Commun., vol. 25, no. 11, pp. 1285–1292, Nov. 1977.
131. W. B. Pennebaker and J. L. Mitchell, JPEG Still Image Data Compression Standard. New York: Van Nostrand Reinhold, 1993.
132. T. Wiegand, G. J. Sullivan, G. Bjontegaard, and A. Luthra, “Overview of the h.264/avc video coding standard,” IEEE Trans. Circuits Syst. Video Technol., vol. 13, no. 7, pp. 560–576, July 2003.
133. K. Sayood, Introduction to Data Compression, 3rd edn. San Francisco, CA: Morgan Kaufmann Publishers (Elsevier), 2006.
134. Y. Q. Shi and H. Sun, Image and Video Compression forMultimedia Engineering. Boca Raton: CRC Press, Taylor & Francis Group, 2008.
135. W.-H. Chen and W. K. Pratt, “Scene adaptive coder,” IEEE Trans. Commun., vol. 32, no. 3, pp. 225–232, Mar. 1984.
136. W. K. Pratt, W.-H. Chen, and L. R. Welch, “Slant transform image coding,” IEEE Trans. Commun., vol. 22, no. 8, pp. 1075–1093, Aug. 1974.
137. M. Rabbani and P. W. Jones, Digital Image Compression Techniques, ser. Tutorial Texts. Bellingham, WA: SPIE Optical Engineering Press, 1991, vol. TT7.
138. A. Said and W. A. Pearlman, “An image multiresolution representation for lossless and lossy compression,” IEEE Trans. Image Process., vol. 5, no. 9, pp. 1303–1310, Sept. 1996.
139. J. E. Fowler, “Shape-adaptive coding using binary set splitting with k-d trees,” in Proceedings of the IEEE International Conference on Image Processing, Singapore, Oct. 2004, pp. 1301–1304.
140. J. B. Boettcher and J. E. Fowler, “Video coding using a complex wavelet transform and set partitioning,” IEEE Signal Process Lett., vol. 14, no. 9, pp. 633–636, Sept. 2007.
141. Z. Xiong, O. G. Guleryuz, and M. T. Orchard, “A DCT-based embedded image coder,” IEEE Signal Process. Lett., vol. 3, no. 11, pp. 289–290, Nov. 1996.
142. A. Said and W. A. Pearlman, “A new, fast, and efficient image codec based on set partitioning in hierarchical trees,” IEEE Trans. Circuits Syst. Video Technol., vol. 6, no. 3, pp. 243–250, June 1996.
143. S. W. Golomb, “Run-length encodings,” IEEE Trans. Inf. Theory, vol. IT-12, no. 3, pp. 399–401, July 1966.
144. R. G. Gallager and D. Van Voorhis, “Optimal source codes for geometrically distributed integer alphabets,” IEEE Trans. Inf. Theory, vol. 21, no. 2, pp. 228–230, Mar. 1975.
145. Y. Yemini and J. Pearl, “Asymptotic properties of discrete unitary transforms,” IEEE Trans. Pattern Anal. Mach. Intell., vol. 1, no. 4, pp. 366–371, Oct. 1979.
146. A. Said and W. A. Pearlman, “Low-complexity waveform coding via alphabet and sample-set partitioning,” in Proc. SPIE Vol. 3024: Visual Commun. Image Process., San Jose, CA, Feb. 1997, pp. 25–37.
147. J. Andrew, “A simple and efficient hierarchical image coder,” in Proc. IEEE Int. Conf. Image Process., vol. 3, Santa Barbara, CA, Oct. 1997, pp. 658–661.
148. A. Islam and W. A. Pearlman, “Embedded and efficient low-complexity hierarchical image coder,” in Proceedings of the SPIE Vol. 3653: Visual Communications Image Processing, San Jose, CA, Jan. 1999, pp. 294–305.
149. J. M. Shapiro, “Embedded image coding using zerotrees of wavelet coefficients,” IEEE Trans. Signal Process., vol. 41, no. 12, pp. 3445–3462, Dec. 1993.
150. Y. Cho and W. A. Pearlman, “Quantifying the coding performance of zerotrees of wavelet coefficients: Degree-k zerotree,” IEEE Trans. Signal Process., vol. 55, no. 6, pp. 2425–2431, June 2007.
151. D. S. Taubman and M. W. Marcellin, JPEG2000: Image Compression Fundamentals, Standards, and Practice. Norwell, MA: Kluwer Academic Publishers, 2002.
152. E. S. Hong and R. E. Ladner, “Group testing for image compression,” IEEE Trans. Image Process., vol. 11, no. 8, pp. 901–911, Aug. 2002.
153. C. Chrysafis, A. Said, A. Drukarev, A. Islam, and W. A. Pearlman, “SBHP – a low complexity wavelet coder,” in Proceedings of the IEEE International Conference on Acoustics Speech Signal Processing, vol. 4, Istanbul, Turkey, June 2000, pp. 2035–2038.
154. S.-T. Hsiang and J. W. Woods, “Embedded image coding using zeroblocks of subband/wavelet coefficients and context modeling,” in Proceedings of the IEEE International Symposium on Circuits Systems, vol. 3, Geneva, Switzerland, May 2000, pp. 662–665.
155. A. Munteanu, J. Cornelis, G. V. Der Auwera, and P. Cristea, “Wavelet image compression – the quadtree coding approach,” IEEE Trans. Inf. Technol. Biomed., vol. 3, no. 3, pp. 176–185, Sept. 1999.
156. W. A. Pearlman, A. Islam, N. Nagaraj, and A. Said, “Efficient, low-complexity image coding with a set-partitioning embedded block coder,” IEEE Trans. Circuits Syst. Video Technol., vol. 14, no. 11, pp. 1219–1235, Nov. 2004.
157. C. Chrysafis, A. Said, A. Drukarev, A. Islam, and W. A. Pearlman, “SBHP – a low complexity wavelet coder,” in Proceedings of the IEEE International Conference on Acoustics Speech Signal Process., vol. 4, Istanbul, Turkey, June 2000, pp. 2035–2038.
158. Information Technology – JPEG2000 Image Coding System, Part 1: Core Coding System, ISO/IEC Int. Standard 15444-1, Geneva, Switzerland, 2000.
159. S.-T. Hsiang and J. W. Woods, “Embedded image coding using zeroblocks of subband/wavelet coefficients and context modeling,” in Proceedings of the IEEE International Symposium Circuits Systems, vol. 3, Geneva, Switzerland, May 2000, pp. 662–665.
160. S.-T. Hsiang, “Highly scalable subband/wavelet image and video coding,” Ph.D. Thesis, Electrical, Computer and Systems Engineering Dept., Rensselaer Polytechnic Institute, Troy, NY, USA, 2002.
161. D. S. Taubman, “High performance scalable image compression with EBCOT,” IEEE Trans. Image Process., vol. 9, no. 7, pp. 1158–1170, July 2000.
162. D. S. Taubman and M. W. Marcellin, JPEG2000: Image Compression Fundamentals, Standards, and Practice. Norwell, MA: Kluwer Academic Publishers, 2002.
163. T. Acharya and P.-S. Tsai, JPEG2000 Standard for Image Compression: Concepts, Algorithms and VLSI Architectures. Hoboken, NJ: Wiley-Interscience, Oct. 2004.
164. Information Technology – JPEG2000 Extensions, Part 2: Core Coding System, ISO/IEC Int. Standard 15444-2, Geneva, Switzerland, 2001.
165. A. Said and W. A. Pearlman, “A new, fast, and efficient image codec based on set partitioning in hierarchical trees,” IEEE Trans. Circuits Syst. Video Technol., vol. 6, no. 3, pp. 243–250, June 1996.
166. F.W. Wheeler and W. A. Pearlman, “SPIHT image compression without lists,” in Proceedings of the IEEE International Conference on Acoustics Speech Signal Process., vol. 4, Istanbul, Turkey, June 2000, pp. 2047–2050.
167. R. R. Shively, E. Ammicht, and P. D. Davis, “Generalizing SPIHT: A family of efficient image compression algorithms,” in Proceedings of the IEEE International Conference on Acoustics Speech Signal Processing, vol. 4, Istanbul, Turkey, June 2000, pp. 2059–2062.
168. A. A. Moinuddin and E. Khan, “Wavelet based embedded image coding using unified zeroblock-zero-tree approach,” in Proceedings of the IEEE International Conference on Acoustics Speech Signal Processing, vol. 2, Toulouse, France, May 2006, pp. 453–456.
169. E. Khan and M. Ghanbari, “Very low bit rate video coding using virtual SPIHT,” IEE Electron. Lett., vol. 37, pp. 40–42, Jan. 2001.
170. E. A. B. Da Silva, D. G. Sampson, and M. Ghanbari, “A successive approximation vector quantizer for wavelet transform image coding,” IEEE Trans. Image Process., vol. 5, no. 2, pp. 299–310, Feb. 1996.
171. S. M. Perlmutter, K. O. Perlmutter, and P. C. Cosman, “Vector quantization with zerotree significance map for wavelet image coding,” in Rec. Twenty-Ninth Asilomar Conference on Signals Systems and Computers, vol. 2, Pacific Grove, CA, Oct. 1995, pp. 1419–1423.
172. P. C. Cosman, S. M. Perlmutter, and K. O. Perlmutter, “Tree-structured vector quantization with significance map for wavelet image coding,” in IEEE Data Compression Conf., Snowbird, UT, Mar. 1995, pp. 33–41.
173. D. Mukherjee and S. K. Mitra, “Successive refinement lattice vector quantization,” IEEE Trans. Image Process., vol. 11, no. 12, pp. 1337–1348, Dec. 2002.
174. E. Christophe and W. A. Pearlman, “Three-dimensional SPIHT coding of volume images with random access and resolution scalability,” EURASIP J. Image Video Process., vol. 2008, no. Article ID 248905, 2008, 13 pages.
175. A. Islam and W. A. Pearlman, “Embedded and efficient low-complexity hierarchical image coder,” in Proceedings of the SPIE Vol. 3653: Visual Communication Image Processing, San Jose, CA, Jan. 1999, pp. 294–305.
176. W. A. Pearlman, A. Islam, N. Nagaraj, and A. Said, “Efficient, low-complexity image coding with a set-partitioning embedded block coder,” IEEE Trans. Circuits Syst. Video Technol., vol. 14, no. 11, pp. 1219–1235, Nov. 2004.
177. A. Said and W. A. Pearlman, “An image multiresolution representation for lossless and lossy compression,” IEEE Trans. Image Process., vol. 5, no. 9, pp. 1303–1310, Sept. 1996.
178. J. M. Shapiro, “Embedded image coding using zerotrees of wavelet coefficients,” IEEE Trans. Signal Process., vol. 41, no. 12, pp. 3445–3462, Dec. 1993.
179. M. Rabbani and P. W. Jones, Digital Image Compression Techniques, ser. Tutorial Texts. Bellingham, WA: SPIE Optical Engineering Press, 1991, vol. TT7.
180. M. J. Weinberger, G. Seroussi, and G. Sapiro, “The LOCO-I lossless image compression algorithm: Principles and standardization into JPEG-LS,” IEEE Trans. Image Processing, vol. 9, no. 8, pp. 1309–1324, Aug. 2000.
181. X. Wu and N. Memon, “Context-based, adaptive, lossless image coding,” IEEE Trans. Commun, vol. 45, no. 4, pp. 437–444, Apr. 1997.
182. X. Wu, N. Memon, and K. Sayood, “A context-based, adaptive, lossless/nearly-lossless coding scheme for continuous tone images,” ISO/JPEG Working Group, Tech. Rep. ISO/IEC SC29/WG1N256, 1995.
183. J. O. Limb, C. R. Rubinstein, and J. E. Thompson, “Digital coding of color video signals – a review,” IEEE Trans. Commun, vol. COM-25, no. 11, pp. 1349–1384, Nov. 1977.
184. D. L. MacAdam, “Visual sensitivities to color differences in daylight,” J. Opt. Soc. Am., vol. 32, no. 5, pp. 247–274, May 1942.
185. W. T. Wintringham, “Color television and colorimetry,” Proc. IRE, vol. 39, no. 10, pp. 1135–1172, Oct. 1951.
186. A. N. Netravali and B. G. Haskell, Digital Pictures. New York: Plenum Press, 1988.
187. W. K. Pratt, “Spatial transform coding of color images,” IEEE Trans. Commun. Technol., vol. COM-19, no. 6, pp. 980–992, Dec. 1971.
188. J. Xu, Z. Xiong, S. Li, and Y.-Q. Zhang, “3-D embedded subband coding with optimal truncation (3-D ESCOT),” Appl. Comput. Harmon. Anal.: Special Issue on Wavelet Applications in Engineering, vol. 10, no. 5, pp. 290–315, May 2001.
189. P. Schelkens, A. Munteanu, J. Barbarien, M. Galca, X. G. I Nieto, and J. Cornelis, “Wavelet coding of volumetric medical datasets,” IEEE Trans. Med Imaging, vol. 22, no. 3, pp. 441–458, Mar. 2003.
190. Information Technology JPEG 2000 Image Coding System: Extensions for Three-dimensional Data: ITU-T Recommendation T.809. Geneva, Switzerland: International Telecommunications Union, Aug. 2007.
191. P. Schelkens, C. Brislawn, J. Barbarien, A. Munteanu, and J. Cornelis, “Jpeg2000 – part 10:volumetric imaging,” in Proceedings of SPIE Annual Meeting, Applications of Digital Image Processing XXVI, San Diego CA, July 2003, pp. 296–305.
192. B.-J. Kim, Z. Xiong, and W. A. Pearlman, “Low bit-rate scalable video coding with 3D set partitioning in hierarchical trees (3D SPIHT),” IEEE Trans. Circuits Syst. Video Technol., vol. 10, pp. 1374–1387, Dec. 2000.
193. W. A. Pearlman, B.-J. Kim, and Z. Xiong, “Embedded video subband coding with 3D SPIHT,” in Wavelet Image and Video Compression, ed. P. N. Topiwala Boston/Dordrecht/London: Kluwer Academic Publishers, 1998, ch. 24, pp. 397–434.
194. S.-T. Hsiang and J. W. Woods, “Embedded image coding using invertible motion compensated 3-d subband/wavelet filter bank,” Signal Proc. Image Commun., vol. 16, no. 5, pp. 705–724, May 2001.
195. J.W. Woods, Multidimensional Signal, Image and Video Processing and Coding. Amsterdam: Academic Press (Elsevier), 2006.
196. K. Sayood, Introduction to Data Compression, 3rd edn. San Francisco, CA: Morgan Kaufmann Publishers (Elsevier), 2006.
197. Y. Q. Shi and H. Sun, Image and Video Compression for Multimedia Engineering. Boca Raton: CRC Press, Taylor & Francis Group, 2008.
198. D. Slepian and J. K. Wolf, “Noiseless coding of correlated information sources,” IEEE Trans. Inf. Theory, vol. IT-19, no. 4, pp. 471–480, July 1973.
199. T. M. Cover and J. A. Thomas, Elements of Information Theory. New York, NY: John Wiley & Sons, 1991, 2006.
200. A. Wyner, “Recent results in the Shannon theory,” IEEE Trans. Inf. Theory, vol. IT-20, no. 1, pp. 2–10, Jan. 1974.
201. A. Wyner and J. Ziv, “The rate–distortion function for source coding with side information at the decoder,” IEEE Trans. Inf. Theory, vol. IT-22, no. 1, pp. 1–10, Jan. 1976.
202. B. Girod, A. M. Aaron, S. Rane, and D. Rebollo-Monedero, “Distributed video coding,” Proc. IEEE, vol. 91, no. 1, pp. 71–83, Jan. 2005.
203. S. S. Pradhan, J. Kusuma, and K. Ramchandran, “Distributed compression in a dense microsensor network,” IEEE Signal Process. Mag., pp. 51–60, Mar. 2002.
204. S. S. Pradhan and K. Ramchandran, “Distributed source coding using syndromes (discus): Design and construction,” IEEE Trans. Inf. Theory, vol. 49, no. 3, pp. 626–643, Mar. 2003.
205. Z. Xiong, A. D. Liveris, and S. Cheng, “Distributed source coding for sensor networks,” IEEE Signal Process. Mag., pp. 80–94, Sept. 2004.