Patent ID: 6839003
Filing Date: 2005-01-04
Classification: G06T,H03M

Abstract:
1. Process for compressing data, including the operations: receiving and storing a possibly higher dimensional sequence of (possibly higher dimensional) raw data with at least two datapoints, storage of the datapoints [formally designated as decat built-in structure of the (−1)-st order] as the record to be processed momentarily, first decomposition of the data received by the computation of coefficients of a 0 order decat built-in structure (overview tree/compression zero order tree) on the basis of the data received, and determination of the layers of the 0-th tree structure (overview tree), at least one further decomposition (k-th decomposition, with 2≦k≦n and n≧2) of the coefficients calculated with an immediately preceding decomposition [(k−1)-th decomposition] by the computation of coefficients of at least a further decat built-in structure of the 1-st to (n−1)-th order, as well as the determination of layers of the second tree structures [compression trees of the 1-st to (n−1)-th order], sorting and/or filtering of the coefficients of the layers of at least the second tree structures of the (n−1)-th order (compression trees), preferably without having to decompress the tree structures computed again explicitly or implicitly, storage of those coefficients of at least the decat built-in structure of (n−1)th order (n-th decomposition) that are suited for reconstruction of the data received on the basis of sorting and/or filtering.