Fast tree-structured nearest neighbor encoding for vector quantization

Authors:
I. Katsavounidis;C. -C.J. Kuo;Zhen Zhang
Affiliations:
Dept. of Electr. Eng. Syst., Univ. of Southern California, Los Angeles, CA;-;-
Venue:
IEEE Transactions on Image Processing
Year:
1996

Citing 0
Cited 4

Hierarchical filtering method for content-based music retrieval via acoustic input

MULTIMEDIA '01 Proceedings of the ninth ACM international conference on Multimedia
A Fast Nearest-Neighbor Algorithm Based on a Principal Axis Search Tree

IEEE Transactions on Pattern Analysis and Machine Intelligence
Fast codebook search algorithms based on tree-structured vector quantization

Pattern Recognition Letters
Fine granularity scalable speech coding using embedded tree-structured vector quantization

Speech Communication

Quantified Score

Hi-index	0.01

Visualization

Abstract

This work examines the nearest neighbor encoding problem with an unstructured codebook of arbitrary size and vector dimension. We propose a new tree-structured nearest neighbor encoding method that significantly reduces the complexity of the full-search method without any performance degradation in terms of distortion. Our method consists of efficient algorithms for constructing a binary tree for the codebook and nearest neighbor encoding by using this tree. Numerical experiments are given to demonstrate the performance of the proposed method