System and method for tree ordered coding of sparse data sets
US5893100A · kind A · utility
Assignee
Inventors
Key dates
| Filing date | Nov 27, 1996 |
| Grant date | Apr 6, 1999 |
| Priority date | — |
| Expiry date | Nov 27, 2016 |
Classification
- Technology area (CPC Y)Emerging Cross-Sectional Technologies
- CPC primaryY10S707/99945
- WIPO fieldAudio-visual technology
- WIPO sectorElectrical engineering
Abstract
A data encoder and method utilizes a node list for storing a list of nodes in the data array to be processed, a branch list for storing a list of tree branches in the data array to be processed and a set list for storing a list of data sets. The method begins by initially storing in the node list node identifiers representing a predefined set of nodes in the data array, corresponding to coefficients generated by a last iteration of a data decomposition procedure. Also, it initially stores in the branch list branch identifiers representing tree branches corresponding to a predefined subset of the nodes initially listed in the node list. Each such tree branch has an associated root node and a branch depth value indicating how many node layers intervene between the root node and the nodes of the tree branch closest to the root node. The set list is initially empty, and a parameter called the LayerLimit value is also initialized. For successively smaller values of m, where m is a positive integer, a set of data encoding steps are repeatedly performed so as to process all nodes, branches and sets in the lists. A magnitude flag is output for each node, branch and set to indicate whether …
Source: USPTO / EPO open patent data. Objective bibliographic and citation counts.