Three fast search routines to be used in the encoding phase of vector quantization (VQ)
image compression systems are presented. These routines, which are based on geometric …

One of the most serious problems for vector quantisation is the high computational
complexity of searching for the closest codeword in the codebook design and encoding …

One of the most serious problems for vector quantization, especially for high dimensional
vectors, is the high computational complexity of searching for the closest codeword in the …

Some fast clustering algorithms for vector quantization (VQ) based on the LBG recursive
algorithm are presented and compared. Experimental results in comparison to the …

The authors present a very efficient minimum mean-squared error (MMSE) encoding method
useful for vector quantization. Using this method results in a considerable reduction in the …

This paper presents a fast search algorithm for vector quantisation (VQ)-based recognition of
isolated words. It incorporates the property of high correlation between speech feature …

A fast method for searching an unstructured vector quantization (VQ) codebook is introduced
and analyzed. The method, fine-coarse vector quantization (FCVQ), operates in two stages …

In the encoding of image sequences for transmission and storage, the coding algorithm must
have the ability to adapt to changing image characteristics from sequence to sequence and …

The paper presents a fast codebook training algorithm for vector quantisation. It uses an
elimination rule, based on triangular inequality criteria, as well as the partial distortion …

In this paper, we provide an overview of fast nearest-neighbor search algorithms based on
anapproximation–elimination'framework under a class of elimination rules, namely, partial …