System for binary tree searched vector quantization data compression processing each tree node containing one vector and one scalar to compare with an input vector
US5396625A · kind A · utility
241Cited by
6References
23Claims
0Family size
Assignee
Inventor
Key dates
| Filing date | Apr 1, 1994 |
| Grant date | Mar 7, 1995 |
| Priority date | — |
| Expiry date | Apr 1, 2014 |
Classification
- Technology area (CPC Y)Emerging Cross-Sectional Technologies
- CPC primaryY10S707/99931
- WIPO fieldAudio-visual technology
- WIPO sectorElectrical engineering
Abstract
Data compression processing is carried out using binary Tree-Searched Vector Quantization in which the direction of branching at each node of the tree is decided by comparison of an input vector (6) with a single code vector (B(n)) and an associated Scalar value (A).
Source: USPTO / EPO open patent data. Objective bibliographic and citation counts.