Abstract
A vector quantization fast search algorithm using hyperplane based k-dimensional multi-node search tree is presented. Misclassification problem associated with hyperplane decision is eliminated by a multi-level back-tracing algorithm. The vector quantization complexity is further lowered by a novel relative distance quantization rule. Triangular inequality is applied to lower bound the search distance, thus eliminated all the sub-tree in the k-dimensional search tree during back-tracing. Vector quantization image coding results are presented which showed the proposed algorithm outperform other algorithms in literature both in PSNR and computation time.
| Original language | English |
|---|---|
| Article number | 7071990 |
| Journal | European Signal Processing Conference |
| Volume | 2002-March |
| Publication status | Published - 27 Mar 2002 |
| Event | 11th European Signal Processing Conference, EUSIPCO 2002 - Toulouse, France Duration: 3 Sept 2002 → 6 Sept 2002 |
Bibliographical note
Publisher Copyright:© 2002 EUSIPCO.
Fingerprint
Dive into the research topics of 'Vector quantization fast search algorithm using hyperplane based k-dimensional multi-node search tree'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver