Multimedia compression system with additive temporal layers

• US 7,082,164 B2
• Filed: 05/20/2002
• Issued: 07/25/2006
• Est. Priority Date: 03/17/1997
• Status: Expired due to Fees

• Current Assignee: Microsoft Technology Licensing LLC (Microsoft Corporation)
• Original Assignee: Microsoft Corporation
• Inventors: Chaddha, Navin
• Primary Examiner(s): Philippe, Gims
• Application Number:
  US10/151,455
• Publication Number:
  US 20030012279A1
• Time in Patent Office: 1,527 Days
• Field of Search: 375/240.12, 375/240.11, 375/240.14, 375/240.16, 375/240.21, 375/240.24, 375/240.22, 382/253, 382/238, 348/388.1, 341/200
• US Class Current: 375/240.12
• CPC Class Codes: G06T 9/40 Tree coding, e.g. quadtree, octree
• CPC Class Codes: H04N 19/30 using hierarchical techniques, e.g. scalability H04N19/63 takes precedence
• CPC Class Codes: H04N 19/51 Motion estimation or motion compensation
• CPC Class Codes: H04N 19/527 Global motion vector estimation

Abstract

A multimedia compression system for generating frame rate scaleable data in the case of universally scaleable data. Universally scaleable data is scaleable across all of the relevant characteristics of the data (e.g., frame rate, resolution, and quality for video). The scaleable data generated by the compression system includes multiple additive layers for each characteristic across which the data is scaleable. For video, the frame rate layers are additive temporal layers, the resolution layers are additive base and enhancement layers, and the quality layers are additive index planes of embedded codes. Various techniques can be used for generating these layers (e.g., Laplacian pyramid decomposition or wavelet decomposition for generating the resolution layers; tree structured vector quantization or tree structured scalar quantization for generating the quality layers). The system further provides for embedded inter-frame compression in the context of frame rate scalability, and non-redundant layered multicast network delivery of the scaleable data.

Claims

1. A method used in compressing data, the method comprising:

converting data into a series of data vectors;

making a prediction of a current data vector based at least in part on one previous data vector;

segmenting the current data vector into a plurality of sub-vectors; and

mapping, using a hierarchical lookup table comprising a plurality of lookup tables, the plurality of sub-vectors to a set of codes by successive utilization of the plurality of lookup tables in stages so that one of the codes is generated in response to each of the sub-vectors wherein the set of codes comprise codes of different lengths.

2. A method used in compressing data, the method comprising:

converting data into a series of data vectors;

making a prediction of a current data vector based at least in part on one previous data vector;

segmenting the current data vector into a plurality of sub-vectors; and

mapping, using a hierarchical lookup table comprising a plurality of lookup tables, the plurality of sub-vectors to a set of codes by successive utilization of the plurality of lookup tables in stages so that one of the codes is generated in response to each of the sub-vectors wherein the set of codes comprise non-embedded codes.

3. A method used in compressing data the method comprising:

converting data into a series of data vectors;

making a prediction of a current data vector based at least in part on one previous data vector; and

segmenting the current data vector into a plurality of sub-vectors wherein the plurality of sub-vectors comprise at least two sub-vectors of different sizes.

4. A data compression system comprising:

a predictor configured to make a prediction of a current data vector based on at least one previous data vector; and

a segmentor coupled to receive the prediction and configured to segment the current data vector into a plurality of sub-vectors based on the prediction,

a hierarchical lookup table comprising a plurality of lookup tables, the hierarchical lookup table configured to map the plurality of sub-vectors to a set of codes by successive utilization of the plurality of lookup tables in stages so that one of the codes is generated in response to each of the sub-vectors, the hierarchical lookup table being coupled to the segmentor for receiving the plurality of sub-vectors wherein the set of codes comprise codes of different lengths.

5. A data compression system comprising:

a predictor configured to make a prediction of a current data vector based on at least one previous data vector; and

a segmentor coupled to receive the prediction and configured to segment the current data vector into a plurality of sub-vectors based on the prediction

a hierarchical lookup table comprising a plurality of lookup tables, the hierarchical lookup table configured to map the plurality of sub-vectors to a set of codes by successive utilization of the plurality of lookup tables in stages so that one of the codes is generated in response to each of the sub-vectors, the hierarchical lookup table being coupled to the segmentor for receiving the plurality of sub-vectors wherein the set of codes comprise non-embedded codes.

6. A data compression system comprising:

a predictor configured to make a prediction of a current data vector based on at least one previous data vector; and

a segmentor coupled to receive the prediction and configured to segment the current data vector into a plurality of sub-vectors based on the prediction wherein the plurality of sub-vectors comprise at least two sub-vectors of different sizes.

7. One or more computer readable media having stored thereon a data compression program including a plurality of instructions that, when executed by one or more processors, causes the one or more processors to:

make a prediction of a current data vector based on at least one previous data vector; and

segment the current data vector into a plurality of sub-vectors based at least in part on the prediction,

map, using a hierarchical lookup table comprising a plurality of lookup tables, the plurality of sub-vectors to a set of codes by successive utilization of the plurality of lookup tables in stages so that one of the codes is generated in response to each of the sub-vectors wherein the set of codes comprise codes of different lengths.

8. One or more computer readable media having stored thereon a data compression program including a plurality of instructions that, when executed by one or more processors, causes the one or more processors to:

make a prediction of a current data vector based on at least one previous data vector; and

segment the current data vector into a plurality of sub-vectors based at least in part on the prediction,

map, using a hierarchical lookup table comprising a plurality of lookup tables, the plurality of sub-vectors to a set of codes by successive utilization of the plurality of lookup tables in stages so that one of the codes is generated in response to each of the sub-vectors wherein the set of codes comprise non-embedded codes.

9. One or more computer readable media having stored thereon a data compression program including a plurality of instructions that, when executed by one or more processors, causes the one or more processors to:

make a prediction of a current data vector based on at least one previous data vector; and

segment the current data vector into a plurality of sub-vectors based at least in part on the prediction wherein the plurality of sub-vectors comprise at least two sub-vectors of different sizes.