DocumentCode :
394175
Title :
A new unsupervised competitive learning algorithm for vector quantization
Author :
Lin, Tzu-Chao ; Yu, Pao-Ta
Volume :
2
fYear :
2002
fDate :
18-22 Nov. 2002
Firstpage :
944
Abstract :
In this paper, a novel unsupervised competitive learning algorithm, called the centroid neural network adaptive resonance theory (CNN-ART) algorithm, is to be proposed to relieve the dependence on the initial codewords of the codebook in contrast to the conventional algorithms with vector quantization in lossy image compression. The design of the CNN-ART algorithm is mainly based on the adaptive resonance theory (ART) structure, and then a gradient-descent based learning rule is derived so that the CNN-ART algorithm does not require a predetermined schedule for learning rate. The appropriate initial weights obtained from the CNN-ART algorithm can be applied as an initial codebook of the Linde-Buzo-Gray (LBG) algorithm such that the compression performance can be greatly improved. In this paper, the extensive simulations demonstrate that the CNN-ART algorithm does outperform other algorithms Re LBG, SOFM and DCL.
Keywords :
ART neural nets; data compression; encoding; gradient methods; image processing; unsupervised learning; CNN-ART algorithm; LBG algorithm; Linde-Buzo-Gray algorithm; adaptive resonance theory; centroid neural network; codebook; gradient-descent based learning rule; image compression; unsupervised competitive learning; Adaptive systems; Algorithm design and analysis; Clustering algorithms; Electronic mail; Image coding; Neural networks; Resonance; Scheduling algorithm; Subspace constraints; Vector quantization;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Neural Information Processing, 2002. ICONIP '02. Proceedings of the 9th International Conference on
Print_ISBN :
981-04-7524-1
Type :
conf
DOI :
10.1109/ICONIP.2002.1198200
Filename :
1198200
Link To Document :
بازگشت