Coded data generation or conversion – Digital code to digital code converters – To or from code based on probability
Patent
1997-02-07
1999-09-28
Young, Brian
Coded data generation or conversion
Digital code to digital code converters
To or from code based on probability
H03M 700
Patent
active
059595604
ABSTRACT:
A data compression method, system and program code are provided which optimize entropy-coding by reducing complexity through alphabet partitioning, and then employing sample-group partitioning in order to maximize data compression on groups of source numbers. The approach is to employ probabilities to renumber source numbers so that smaller numbers correspond to more probable source numbers. This is followed by group partitioning of the stream of resultant numbers into at least two groups, for example, defining regions of an image, ranges of time, or a linked list of data elements related by spatial, temporal or spatio-temporal dependence. A maximum number (N.sub.m) is found in a group of numbers of the at least two groups and then entropy-coded. A recursive entropy encoding of the numbers of the group is then employed using the maximum number N.sub.m. The process is repeated for each partitioned group. Decoding of the resultant codewords involves the inverse process. Transformation and/or quantization may all be employed in combination with the group-partitioning entropy encoding.
REFERENCES:
patent: 4075622 (1978-02-01), Lawrence et al.
patent: 4821119 (1989-04-01), Gharavi
patent: 5049881 (1991-09-01), Gibson et al.
patent: 5150209 (1992-09-01), Baker et al.
patent: 5271071 (1993-12-01), Waite
patent: 5377018 (1994-12-01), Rafferty
patent: 5535290 (1996-07-01), Allen
patent: 5539467 (1996-07-01), Song et al.
G.K. Wallace, "The JPEG Still Picture Compression Standard", Comm. ACM, vol. 34, pp. 30-44, Apr., 1991.
S. Todd, G.G. Langdon, Jr., J. Rissanen, "Parameter reduction and context selection for compression of gray-scale images", IBM J. Res. Develop., vol. 29, No. 2, pp. 188-193, Mar. 1985.
S.D. Stearns, "Arithmetic Coding in Lossless Waveform Compression", IEEE Trans. Signal Processing, vol. 43, No. 8, pp. 1874-1879, Aug. 1995.
A. Said, W.A. Pearlman, "Reversible image compression via multiresolution representation and predictive coding", Proc. SPIE, vol. 2094: Visual Commun. and Image Processing, pp. 664-674, Nov. 1993.
I.H. Witten, R.M. Neal, J.G. Cleary, "Arithmetic Coding For Data Compression", Commun. ACM, vol. 30, No. 6, pp. 520-540, Jun. 1987.
W.B. Pennebaker, J.L. Mitchell, G.G. Langdon, Jr., R.B. Arps, "An overview of the basic principles of the Q-Coder adaptive binary arithmetic coder", IBM J. Res. Develop., vol. 32, No. 6, pp. 717-726, Nov. 1988.
A. Said, W.A. Pearlman, "Reduced-Complexity Waveform Coding via Alphabet Partitioning", IEEE Int. Symposium on Information Theory, Whistler, B.C., Canada, p. 373, Sep. 1995.
A. Said, W.A. Pearlman, "A New, Fast, and Efficient Image Codec Based on Set Partitioning in Hierarchical Trees", IEEE Trans. on Circuits and Systems for Video Technology, vol. 6, No. 3, pp. 243-250, Jun. 1996.
A. Said, W.A. Pearlman, "An Image Multiresolution Representation for Lossless and Lossy Compression", IEEE Trans. on Image Processing, vol. 5, No. 9, pp. 1303-1310, Sep. 1996.
Pearlman William A.
Said Amir
LandOfFree
Data compression via alphabet partitioning and group partitionin does not yet have a rating. At this time, there are no reviews or comments for this patent.
If you have personal experience with Data compression via alphabet partitioning and group partitionin, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Data compression via alphabet partitioning and group partitionin will most certainly appreciate the feedback.
Profile ID: LFUS-PAI-O-708233