Vector quantization fast search algorithm using hyperplane based k-dimensional multi-node search tree

Kam Fai Chan Alton, Kam Tim Woo, Chi Wah Kok

Research output: Contribution to journalConference article published in journalpeer-review

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 languageEnglish
Article number7071990
JournalEuropean Signal Processing Conference
Volume2002-March
Publication statusPublished - 27 Mar 2002
Event11th European Signal Processing Conference, EUSIPCO 2002 - Toulouse, France
Duration: 3 Sept 20026 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