๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

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


On the fast search algorithms for vector
โœ Wen-Shiung Chen; Lili Hsieh; Shang-Yuan Yuan ๐Ÿ“‚ Article ๐Ÿ“… 2002 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 128 KB

## 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 isodata clustering algorithms
โœ N.B. Venkateswarlu; P.S.V.S.K. Raju ๐Ÿ“‚ Article ๐Ÿ“… 1992 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 678 KB
Fast Vector Quantization Encoding Based
โœ V. Ramasubramanian; K.K. Paliwal ๐Ÿ“‚ Article ๐Ÿ“… 1997 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 404 KB

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

Multisolutional clustering and quantizat
โœ I. Dvorchik; W. Marsh; V. Gurari; M. Subotin; H.R. Doyle ๐Ÿ“‚ Article ๐Ÿ“… 1996 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 936 KB

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