This paper presents a fast codebook search method for improving the quantization
complexity of full-search vector quantization (VQ). The proposed method is built on the …

In this paper we present a very simple and yet effective algorithm to generate codebook. The
algorithm uses sorting method to generate codebook and the codevectors are obtained by …

In this paper we propose partial yet efficient codebook search algorithm which uses sorting
technique and uses only comparison. Our proposed algorithm does not use Euclidean …

In this paper we propose segmentation approach based on Vector Quantization technique.
Here we have used Kekre's fast codebook generation algorithm for segmenting low-altitude …

INFORMATION TO USERS Page 1 INFORMATION TO USERS This manuscript has been
reproduced from the microfilm master. UMI films the text directly from the original or copy …

We present an improved codebook search algorithm in this paper. We call it thedouble test
of principal components (DTPC). This algorithm speeds up the codebook search by …

This paper presents a very simple and efficient algorithm for codebook search, which
reduces a great deal of computation as compared to the full codebook search. The algorithm …

Abstract The k-Nearest Neighbors (kNN) algorithm is a fundamental machine learning
classification technique with wide-ranging applications. Among various kNN implementation …

This paper presents a novel approach for accelerating the popular reciprocal nearest
neighbors (RNN) clustering algorithm, ie the fast-RNN. We speed up the nearest neighbor …

Partial distance search (PDS) is a method of reducing the amount of computation required
for vector quantization encoding. The method is simple and general enough to be …