# US 2006/0078208 A1 · System and method for progressively transform coding digital data

> Agents: this data is available as JSON from the patentgrep API and MCP server — see https://patentgrep.com/llms.txt

- Number: US 2006/0078208 A1
- Document ID: US20060078208A1
- Status: Published application
- Kind: A1
- Application number: 11/191,412
- Filed: 2005-07-27
- Published: 2006-04-13
- Earliest claimed: 2004-06-30
- Assignees: Microsoft Corporation
- Inventors: Henrique Malvar
- Web page: https://patentgrep.com/patent/US20060078208A1

## CPC

- G06F 17/147: {Discrete orthonormal transforms, e.g. discrete cosine transform, discrete sine transform, and variations therefrom, e.g. modified discrete cosine transform, integer transforms approximating the discrete cosine transform (G06F17/145 takes precedence)}
- H04N 19/12: Selection from among a plurality of transforms or standards, e.g. selection between discrete cosine transform [DCT] and sub-band transform or selection between H.263 and H.264
- H04N 19/129: Scanning of coding units, e.g. zig-zag scan of transform coefficients or flexible macroblock ordering [FMO]
- H04N 19/132: Sampling, masking or truncation of coding units, e.g. adaptive resampling, frame skipping, frame interpolation or high-frequency transform coefficient masking
- H04N 19/136: Incoming video signal characteristics or properties
- H04N 19/172: the region being a picture, frame or field
- H04N 19/176: the region being a block, e.g. a macroblock
- H04N 19/184: the unit being bits, e.g. of the compressed video stream
- H04N 19/30: using hierarchical techniques, e.g. scalability (H04N19/63 takes precedence)
- H04N 19/42: characterised by implementation details or hardware specially adapted for video compression or decompression, e.g. dedicated software implementation (H04N19/635 takes precedence)
- H04N 19/60: using transform coding
- H04N 19/61: in combination with predictive coding
- H04N 19/63: using sub-band based transform, e.g. wavelets
- H04N 19/647: {using significance based coding, e.g. Embedded Zerotrees of Wavelets [EZW] or Set Partitioning in Hierarchical Trees [SPIHT]}
- H04N 19/86: involving reduction of coding artifacts, e.g. of blockiness
- H04N 19/93: Run-length coding
- H04N 19/13: Adaptive entropy coding, e.g. adaptive variable length coding [AVLC] or context adaptive binary arithmetic coding [CABAC]
- G06F: ELECTRIC DIGITAL DATA PROCESSING (computer systems based on specific computational models G06N)
- H04N: PICTORIAL COMMUNICATION, e.g. TELEVISION

## Abstract

The present invention is embodied in a system and method for compressing image data using a lapped biorthogonal transform (LBT). The present invention encodes data by generating coefficients using a hierarchical LBT, reorders the coefficients in a data-independent manner into groups of similar data, and encodes the reordered coefficients using adaptive run-length encoding. The hierarchical LBT computes multiresolution representations. The use of the LBT allows the present invention to encode image data in a single pass at any desired compression ratio and to make use of existing discrete cosine transform (DCT) software and hardware modules for fast processing and easy implementation.

## Claims

### Claim at position 1

1-17. (canceled)

### Claim 18

A computer-implemented method of encoding transform coefficients corresponding to image data, comprising:
a transform generation step for generating the transform coefficients using a transform; and
a reordering step for reordering the transform coefficients in a data-independent manner to group similar image data.

### Claim 19 (depends on 18)

The computer-implement method of claim 18, wherein the transform coefficients are a hierarchical multiresolution representation of the image data.

### Claim 20 (depends on 19)

The computer-implemented method of claim 19, wherein the transform coefficients are generated using a lapped biorthogonal transform and a discrete cosine transform.

### Claim 21 (depends on 18)

The computer-implemented method of claim 18, further comprising generating the transform coefficients using a hierarchical transform.

### Claim 22 (depends on 18)

The computer-implemented method of claim 18, further comprising an encoding step for encoding the reordered transform coefficients.

### Claim 23 (depends on 22)

The computer-implemented method of claim 22, further comprising encoding the reordered transform coefficients using an adaptive run-length encoder.

### Claim 24 (depends on 23)

The computer-implemented method of claim 23, further comprising encoding the reordered transform coefficients using a backward-adaptive run-length encoder.

### Claim 25

A computer-readable medium having computer-executable instructions for encoding digital data, comprising:
generating coefficients corresponding to the digital data;
reordering the coefficients using a data-independent technique to generate groupings of coefficients having similar values.

### Claim 26 (depends on 25)

The computer-readable medium of claim 25, further comprising generating the coefficients using a hierarchical transform.

### Claim 27 (depends on 26)

The computer-readable medium of claim 26, further comprising encoding the reordered coefficients.

### Claim 28 (depends on 25)

The computer-readable medium of claim 25, wherein the data-independent technique further comprises fixing a scanning order of the coefficients.

### Claim 29 (depends on 28)

The computer-readable medium of claim 28, further comprising clustering coefficients having insignificant values.

### Claim 30

An encoder for compressing a digital signal, comprising:
a transform processor that generates transform coefficients of the signal using a hierarchical transform; and
a reordering processor that reorders the transform coefficients in a data-independent manner such that data-dependent data structures are not used.

### Claim 31 (depends on 30)

The encoder of claim 30, wherein the reordering processor clusters coefficients having insignificant values.

### Claim 32 (depends on 30)

The encoder of claim 30, wherein no wavelets are used in the compression of the digital signal.

### Claim 33 (depends on 30)

The encoder of claim 30, wherein the ordering processor reorders transform coefficients having large values and transform coefficients having small values into separate groups.

### Claim 34 (depends on 33)

The encoder of claim 33, further comprising a backward-adaptive run-length encoder that encodes the reordered transform coefficients.
