Coding of sources with two-sided geometric distributions and unknown parameters

IEEE Transactions on Information Theory

Volumn 46, Issue 1, 2000, Pages 229-236

  Merhav, Neri ^a,b,c   Seroussi, Gadiel ^a,c   Weinberger, Marcelo J ^a,c  

^a IEEE

^b TECHNION ISRAEL INSTITUTE OF TECHNOLOGY   (Israel)

^c HEWLETT PACKARD LABORATORIES   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTATIONAL GEOMETRY; IMAGE COMPRESSION; MATHEMATICAL MODELS; PARAMETER ESTIMATION; PROBABILITY DISTRIBUTIONS; SET THEORY; STATISTICS; TREES (MATHEMATICS);

EXPONENTIAL DISTRIBUTION; GEOMETRIC DISTRIBUTION; GOLOMB CODES; INFINITE ALPHABET SOURCE; LOSSLESS IMAGE COMPRESSION; PREDICTION RESIDUAL; SEQUENTIAL CODING; UNIVERSAL CODING; UNIVERSAL MODELING;

ENCODING (SYMBOLS);

EID: 0033907609     PISSN: 00189448     EISSN: None     Source Type: Journal    
DOI: 10.1109/18.817520     Document Type: Article

References (27)

1. J. Rissanen, "A universal data compression system," IEEE Trans. Inform. Theory, vol. IT-29, pp. 656-664, Sept. 1983.
2. M. J. Weinberger, J. Rissanen, and M. Feder, "A universal finite memory source," IEEE Trans. Inform. Theory, vol. 41, pp. 643-652, May 1995.
3. S. Todd, G. G. Langdon Jr., and J. Rissanen, "Parameter reduction and context selection for compression of the gray-scale images,"IBM J. Res. Develop., vol. 29, no. 2, pp. 188-193, Mar. 1985.
4. M. J. Weinberger, J. Rissanen, and R. Arps, "Applications of universal context modeling to lossless compression of gray-scale images," IEEE Trans. Image Processing, vol. 5, pp. 575-586, Apr. 1996.
5. M. J. Weinberger, G. Seroussi, and G. Sapiro, "The LOCO-I lossless image compression algorithm: Principles and standardization into JPEG-LS," Hewlet Packard Co., Hewlett Packard Laboratories Tech. Rep., 1998.
6. X. Wu and N. D. Memon, "Context-based, adaptive, lossless image coding," IEEE Trans. Commun., vol. 45, pp. 437-444, Apr. 1997.
7. J. Rissanen, "Universal coding, information, prediction, and estimation," IEEE Trans. Inform. Theory, vol. IT-30, pp. 629-636, July 1984.
8. A. Netravali and J. O. Limb, "Picture coding: A review," Proc. IEEE, vol. 68, pp. 366-406, 1980.
9. J. O'Neal, "Predictive quantizing differential pulse code modulation for the transmission of television signals," Bell Syst. Tech. J., vol. 45, pp. 689-722, May 1966.
10. M. J. Weinberger, G. Seroussi, and G. Sapiro, "LOCO-I: A low complexity, context-based, lossless image compression algorithm," in Proc. 1996 Data Compression Conf., Snowbird, UT, Mar. 1996, pp. 140-149.
11. Information Technology - Lossless and Near-Lossless Compression of Continuous-Tone Still Images, Final Draft Int. Std. FDIS14495-1 (JPEG-LS), 1998.
12. D. E. Knuth, "Dynamic Huffman coding," J. Algorithms, vol. 6, pp. 163-180, 1985.
13. S. W. Golomb, "Run-length encodings," IEEE Trans. Inform. Theory, vol. IT-12, pp. 399-401, July 1966.
14. R. Gallager and D. V. Voorhis, "Optimal source codes for geometrically distributed integer alphabets," IEEE Trans. Inform. Theory, vol. IT-21, pp. 228-230, Mar. 1975.
15. R. F. Rice, "Some practical universal noiseless coding techniques-Parts I-III," Jet Propulsion Laboratory, Pasadena, CA, Tech. Rep. JPL-79-22, JPL-83-17, and JPL-91-3, Mar., Mar., and Nov.; 1979, 1981, and 1991.
16. K.-M. Cheung and P. Smyth, "A high-speed distortionless predictive image compression scheme," in Proc. 1990 Int. Symp. Information Theory and Its Applications, Honolulu, HI, Nov. 1990, pp. 467-470.
17. N. Merhav, G. Seroussi, and M. J. Weinberger, "Optimal prefix codes for two-sided geometric distributions," IEEE Trans. Inform. Theory, vol. 46, pp. 121-135, Jan. 2000.
18. L. D. Davisson, "Universal noiseless coding," IEEE Trans. Inform. Theory, vol. IT-19, pp. 783-795, Nov. 1973.
19. R. E. Krichevskii and V. K. Trofimov, "The performance of universal encoding," IEEE Trans. Inform. Theory, vol. IT-27, pp. 199-207, Mar. 1981.
20. N. Merhav and M. Feder, "A strong version of the redundancy-capacity theorem of universal coding," IEEE Trans. Inform. Theory, vol. 41, pp. 714-722, May 1995.
21. M. J. Weinberger, N. Merhav, and M. Feder, "Optimal sequential probability assignment for individual sequences," IEEE Trans. Inform. Theory, vol. 40, pp. 384-396, Mar. 1994.
22. J. Rissanen, "Complexity of strings in the class of Markov sources," IEEE Trans. Inform. Theory, vol. IT-32, pp. 526-532, July 1986.
23. _, "Stochastic complexity and modeling," Ann. Statist., vol. 14, pp. 1080-1100, Sept. 1986.
24. I. Csiszár and J. Körner, Information Theory: Coding Theorems for Discrete Memoryless Systems. New York: Academic, 1981.
25. P. G. Howard and J. S. Vitter, "Fast and efficient lossless image compression," in Proc. 1993 Data Compression Conf., Snowbird, UT, Mar. 1993, pp. 351-360.
26. G. Seroussi and M. J. Weinberger, "On adaptive strategies for an extended family of Golomb-type codes," in Proc. 1997 Data Compression Conf., Snowbird, UT, Mar. 1997, pp. 131-140.
27. J. F. Hannan, "Approximation to Bayes risk in repeated plays," in Contributions to the Theory of Games, Vol. III, Annals of Mathematics Studies, Princeton, NJ, 1957, pp. 97-139.