Competitive learning algorithms for vector quantization
โ Scribed by Stanley C. Ahalt; Ashok K. Krishnamurthy; Prakoon Chen; Douglas E. Melton
- Publisher
- Elsevier Science
- Year
- 1990
- Tongue
- English
- Weight
- 889 KB
- Volume
- 3
- Category
- Article
- ISSN
- 0893-6080
No coin nor oath required. For personal study only.
โฆ Synopsis
We compare a number of training algorithms for competitive learning networks applied to the problem of vector quantization for data compression. A new competitive-learning algorithm based on the "conscience" learning method is introduced. The performance of competitive learning neural networks and traditional nonneural algorithms for vector quantization is compared. The basic properties of the algorithms are discussed and we present a number of examples that illustrate their use. The new algorithm is shown to be efficient and yields near-optimal results. This algorithm is used to design a vector quantizer fi>r a speech database. We conclude with a discttssion of continuing work.
๐ SIMILAR VOLUMES
In this paper we present a necessary and sufficient condition for global optimality of unsupervised Learning Vector Quantization (LVQ) in kernel space. In particular, we generalize the results presented for expansive and competitive learning for vector quantization in Euclidean space, to the general
A novel encoding technique is proposed for the recognition of patterns using four different techniques for training artificial neural networks (ANNs) of the Kohonen type. Each template or model pattern is overlaid on a radial grid of appropriate size, and converted to a two-dimensional feature array