# US 7,315,655 B2 · Method of data compression including compression of video data

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

- Number: US 7,315,655 B2
- Document ID: US7315655B2
- Status: Granted
- Kind: B2
- Application number: 11/170,830
- Filed: 2005-06-30
- Published: 2006-01-05
- Granted: 2008-01-01
- Earliest claimed: 2004-06-30
- Assignees: Comet Technologies, LLC
- Inventors: Andrey V. Zurov; Sergey V. Novikov; Alexander P. Tanchenko
- Web page: https://patentgrep.com/patent/US7315655B2

## CPC

- 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: PICTORIAL COMMUNICATION, e.g. TELEVISION

## Abstract

A data processing system includes a subband decomposition of a source signal by encoding of the significant pyramid-type subband representation. During the encoding process, M-array is used for initialization of set of arrays Si (arrays of solution bits), which define the order of creating output data streams. Output data streams contain an encoded significance map and values of (significant) non-zero subband decomposition coefficients adapted for successive quantization and entropy encoding.

## Claims

### Claim 1

A method of data compression, said method comprising the steps:
representing said data as an array D of wavelet decomposition coefficients,
creating a tree map of said coefficients formed with a root node and consequently connected nodes wherein each node except the root node is a descendant of the corresponding ancestor,
creating an array Z which components corresponding to said nodes are equal to 0 if the corresponding coefficient D has positive or zero value and they are equal to 1 if coefficient D has negative value,
creating a set of threshold arrays Ti=T0/2i where T0 is a basic threshold array, i is a threshold index,
creating an array M whereas the value of M/T0 ratio for each node is equal to maximum value of |D|/T0 ratio among the all descendants of the given node, creating a set of arrays Si which components are equal to 0 if the corresponding to given node value of array M component is less than the value of threshold array Ti component and equal to 1 if the corresponding value of array M component is equal or more than the value of threshold array Ti component,
creating a set of arrays Bi which components are equal to the whole part of doubled fractional part of |D|/Ti−1 ratio
creating a V-set of vector-arrays Vi including the components of the arrays, Si, Bi corresponding to the descendants of the given node, and the components of the array Zi
corresponding to those descendants of the given node which Bi component is equal to 1, and
creating data streams of V, S, B, Z components, for entropy coding procedures of said V, S, B, Z data streams.

### Claim 2 (depends on 1)

A method of claim 1 wherein the values of the components of basic threshold array T0 are increased twice for each sequent subband.

### Claim 3

A method of data compressions, said method comprising the steps:
representing said data as an array D of wavelet decomposition coefficients,
creating a tree map of said coefficients formed with a root node and consequently connected nodes wherein each node except the root node is a descendant of the corresponding ancestor,
creating an array Z which components corresponding to said nodes are equal to 0 if the corresponding coefficient D has positive or zero value and they are equal to 1 if coefficient D has negative value,
creating a set of threshold arrays Ti=T0/2i where T0 is a basic threshold array, i is a threshold index,
creating an array M whereas the value of M/T0 ratio for each node is equal to maximum value of |D|/T0 ratio among the all descendants of the given node, creating a set of arrays Si which components are equal to 0 if the corresponding to given node value of array M component is less than the value of threshed array Ti component and equal to 1 if the corresponding value of array M component is equal or more than the value of threshold array Ti component,
creating a set of arrays Bi which components are equal to the whole part of doubled fractional part of |D|/Ti−1, and
transmitting data of the set of arrays Bi, as compressed data.

### Claim 4 (depends on 3)

A method of claim 3 further comprising the steps of
creating a V-set of vector-arrays Vi including the components of the arrays Si, Bi corresponding to the descendants of the given node, and the components of the array Zi corresponding to those descendants of the given node which Bi component is equal to 1,
creating data streams of V, S, B, Z components, for entropy coding procedures of said V, S, B, Z data streams.

### Claim 5 (depends on 3)

A method of claim 3 wherein the values of the components of basic threshold array T0 are increased twice for each sequent subband.