| US 7,580,585 B2 | ||
| Lossless adaptive Golomb/Rice encoding and decoding of integer data using backward-adaptive rules | ||
| Henrique S. Malvar, Sammamish, Wash. (US) | ||
| Assigned to Microsoft Corporation, Redmond, Wash. (US) | ||
| Filed on Oct. 29, 2004, as Appl. No. 10/977,701. | ||
| Prior Publication US 2006/0103556 A1, May 18, 2006 | ||
| This patent is subject to a terminal disclaimer. | ||
| Int. Cl. G06K 9/46 (2006.01); G06K 9/36 (2006.01); G06K 9/48 (2006.01); H03M 7/00 (2006.01); H03M 7/12 (2006.01); H03M 7/46 (2006.01); H03M 7/40 (2006.01); H04N 7/12 (2006.01) | ||
| U.S. Cl. 382—245 [382/232; 382/239; 382/246; 341/59; 341/63; 341/65; 341/67; 375/240.02; 375/240.07; 375/240.12; 375/240.23; 375/240.24] | 28 Claims |
| 1. A computer-implemented method for processing digital data, comprising:
using a general-purpose computing device to perform the following method:
encoding an input value of the digital data using a Golomb/Rice (G/R) parameter to generate a codeword for the input value;
updating the G/R parameter using a backward-adaptive technique having adaptation rules after the codeword is generated;
defining an adaptation value;
decreasing the G/R parameter by an integer constant if the adaptation value equals zero;
leaving the G/R parameter unchanged if the adaptation value equals one;
repeating the encoding and updating for each value of the digital data to generate encoded data; and
storing the encoded data such that the encoded data occupies less storage space than the digital data.
|