Patent ID: 7315655

Claim:
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 T i =T 0 /2 i where T 0 is a basic threshold array, i is a threshold index, creating an array M whereas the value of M/T 0 ratio for each node is equal to maximum value of |D|/T 0 ratio among the all descendants of the given node, creating a set of arrays S i 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 T i component and equal to 1 if the corresponding value of array M component is equal or more than the value of threshold array T i component, creating a set of arrays B i which components are equal to the whole part of doubled fractional part of |D|/T i−1 ratio creating a V-set of vector-arrays V i including the components of the arrays, S i , B i corresponding to the descendants of the given node, and the components of the array Z i corresponding to those descendants of the given node which B i 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.