single-jc.php

JACIII Vol.9 No.6 pp. 590-598
doi: 10.20965/jaciii.2005.p0590
(2005)

Paper:

Competitive Learning with Fast Neuron-Insertion

Noritaka Shigei*, Hiromi Miyajima*, and Michiharu Maeda**

*Kagoshima University, Kagoshima-shi 890-0065, Japan

**Kurume National College of Technology, Kurume-shi 830-8555, Japan

Received:
February 25, 2005
Accepted:
June 12, 2005
Published:
November 20, 2005
Keywords:
adaptive vector quantization, competitive learning, neuron-insertion,computational cost, image compression
Abstract

Adaptive Vector Quantization (AVQ) is to find a small set of weight vectors that well approximates a larger set of input vectors. This paper presents a fast AVQ method Competitive Learning with Approximate Neuron-Insertion (CLANI). Though neuron-insertion techniques can much enhance the accuracy in AVQ, a naive implementation requires a large computational cost proportional to the number of input vectors. Approximate neuron-insertion has an advantage that its computational cost is independent of the number of input vectors. We theoretically estimate the computational costs of CLANI and the other conventional methods. The effectiveness of CLANI is demonstrated in vector quantization simulations and an image compression application.

Cite this article as:
Noritaka Shigei, Hiromi Miyajima, and Michiharu Maeda, “Competitive Learning with Fast Neuron-Insertion,” J. Adv. Comput. Intell. Intell. Inform., Vol.9, No.6, pp. 590-598, 2005.
Data files:

*This site is desgined based on HTML5 and CSS3 for modern browsers, e.g. Chrome, Firefox, Safari, Edge, Opera.

Last updated on Oct. 27, 2021