Quantization method for image data compression employing context

Details Quantization method for image data compression employing context Quantization method for image data compression employing context

1996-05-06

1997-06-17

Gaffin, Jeffrey A.

Coded data generation or conversion

Digital code to digital code converters

Adaptive coding

341107, H03M 500, H03M 700

Patent

active

056401590

ABSTRACT:
A method, system, and manufacture are provided, for use in connection with data processing and compression, for quantizing a string of data values, such as image data pixel values. The quantization is achieved by grouping the data values, based on their values, into a predetermined number of categories, each category containing the same total number of values. For each category, a value, preferably a mean value of those in the category, is selected as a quantization value. All of the data values in the category arc then represented by the selected quantization value. For data strings having a dependency (that is, the values of one or more of the data values provide information about values of other of the data values), the dependency is modeled by a method in which a modeling algorithm defines contexts in terms of a tree structure, and the basic method of grouping into categories and selecting a quantization value for each category is performed on a per node (i.e., per context) basis.

REFERENCES:
patent: 4652856 (1987-03-01), Mohiuddin et al.
patent: 5067152 (1991-11-01), Kisor et al.
patent: 5121191 (1992-06-01), Cassereau et al.
patent: 5122873 (1992-06-01), Golin
patent: 5124791 (1992-06-01), Israelsen et al.
patent: 5134478 (1992-07-01), Golin
patent: 5136374 (1992-08-01), Jayant et al.
patent: 5136663 (1992-08-01), Nishio
patent: 5323187 (1994-06-01), Park
patent: 5363099 (1994-11-01), Allen
patent: 5379355 (1995-01-01), Allen
patent: 5450132 (1995-09-01), Harris et al.
J. Rissanen, Complexity of Strings in the Class of Markov Sources, IEEE Transactions on Information Theory, vol. IT-32, No. 4, pp. 526-532, Jul. 1986.
J. Rissanen & G. G. Langdon, Universal Modeling and Coding, IEEE Transactions on Information Theory, vol. IT-27, No. 1, pp. 12-23, Jan. 1981.
J. Rissanen, Universal Coding, Information, Prediction, and Estimation, IEEE Transactions on Information Theory, vol. IT-30, No. 4, pp. 629-636, Jul. 1984.
J. Rissanen, A Universal Data Compression System, IEEE Transactions on Information Theory, vol. IT-29, No. 5, Sep. 1983.
J. M. F. Moura & N. Balram, Recursive Structure Noncausal Gauss-Markov Random Fields, IEEE Transactions on information Theory, vol. 38, No. 2 pp. 334-354, Mar. 1992.
Y. Linde, A. Buzo, R. M. Gray, An Algorithm for Vector Quantizer Design, IEEE Transactions on Communications, vol. Com-28, No. 1, pp. 84-95, Jan. 1980.
J. Ziv, On Universal Quantization, IEEE Transactions on Information Theory, vol. IT-31, No. 3, pp. 344-347, 1985.
Quantizing for Maximum Output Entropy (Abstract), IEEE Transactions on Information Theory, p. 612, Sep. 1971.
P. H. Ang, P. A. Ruetz & D. Auld, Video Compression Makes Big Gains, IEEE Spectrum, pp. 16-19, Oct. 1991.
C. E. Shannon, A Mathematical Theory of Communication, The Bell Sys. Tech. Journal, vol. XXVII, No. 3, pp. 379-423, Jul. 1948.

Affiliated with

Also associated with

Rating

Quantization method for image data compression employing context does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with Quantization method for image data compression employing context, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Quantization method for image data compression employing context will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFUS-PAI-O-2160998