Adaptive run-length/golomb-rice encoding of quantized generalized gaussian sources with unknown statistics

Data Compression Conference Proceedings

Volumn , Issue , 2006, Pages 23-32

  Malvar, Henrique S ^a  

^a MICROSOFT RESEARCH   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

CODEWORD; CODING EFFICIENCY; DEAD-ZONE; ENCODING PARAMETERS; ENTROPY CODERS; FAST LEARNING; GENERALIZED GAUSSIAN; RUN LENGTH; SCALAR QUANTIZERS; SIMPLE RULES; SOURCE MODELS; SOURCE PARAMETERS;

EDUCATION; ENCODING (SYMBOLS); GRAIN (AGRICULTURAL PRODUCT); LEARNING ALGORITHMS;

DATA COMPRESSION;

EID: 34547645024     PISSN: 10680314     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/DCC.2006.5     Document Type: Conference Paper

References (12)

1. K. Sayood, Introduction to Data Compression. Morgan Kaufmann, 1996.
2. 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, pp. 1309-1324, Aug. 2000.
3. I. E. G. Richardson, H.264 and MPEG-4 Video Compression, Video Coding for Next- Generation Multimedia. Wiley, 2003.
4. R. L. Joshi and T. R. Fischer, "Comparison of generalized Gaussian and Laplacian modeling in DCT image coding," IEEE Signal Processing Letters, vol. 2, pp. 81-82, May 1995.
5. R. Yu, X. Lin, S. Rahardja, and C. C. Ko, "A statistics study of the MDCT coefficient distribution for audio," Proc. IEEE Int. Conf. on Multimedia and Expo, Taipei, Taiwan, vol. 2, pp. 1483-1486, June 2004.
6. H. S. Malvar, "Fast progressive wavelet coding," Proc. Data Compression Conf., Snowbird, UT, pp. 336-343, Mar. 1999.
7. N. Merhav, G. Seroussi, and M. J. Weinberger, "Optimal prefix codes for sources with two-sided geometric distributions," IEEE Trans. on Information Theory, vol. 46, pp. 121-135, Jan. 2000. (Pubitemid 30565191)
8. G. J. Sullivan, "On embedded scalar quantization," Proc. IEEE Int. Conf. on Acoustics, Speech, and Signal Processing, Montreal, Canada, vol. 4, pp. 605-608, May 2004.
9. R. G. Gallager and D. C. van Voorhis, "Optimal source codes for geometrically distributed integer alphabets," IEEE Trans. Information Theory, vol. IT-21, pp. 228-230, Mar. 1975.
10. J. Teuhola, "A compression method for clustered bit-vectors," Information Processing Letters, vol. 7, pp. 308-311, Oct. 1978. (Pubitemid 9399262)
11. S. Xue and B. Oelmann "Hybrid Golomb codes for a group of quantised GG sources," IEE Proc. - Vision, Image and Signal Processing, vol. 150, pp. 256-260, Aug. 2003.
12. J. Wen and J. D. Villasenor, "Structured prefix codes for quantized low-shape-parameter generalized Gaussian sources," IEEE Trans. on Information Theory, vol. 45, pp. 1307-1314, May 1999.