## Abstract One of the major difficulties arising in vector quantization (VQ) is high encoding time complexity. Based on the wellโknown partial distance search (PDS) method and a special order of codewords in VQ codebook, two simple and efficient methods are introduced in fast full search vector qu
Fast clustering algorithms for vector quantization
โ Scribed by J.S. Pan; F.R. McInnes; M.A. Jack
- Publisher
- Elsevier Science
- Year
- 1996
- Tongue
- English
- Weight
- 595 KB
- Volume
- 29
- Category
- Article
- ISSN
- 0031-3203
No coin nor oath required. For personal study only.
๐ SIMILAR VOLUMES
In this paper we consider the K-d tree-based backtracking search algorithm and study its performance in the context of vector quantization encoding of speech waveform. We discuss the basic algorithm in detail and highlight the features of optimization as observed from theoretical analysis and from t
We have developed a novel clustering and quantization algorithm that allows the user to create multiple one-to-one correspondences between the actual data and its transformed (clustered and quantized) values, based on the user's hypothesis regarding the nature of the classification task. The types o