Abstract
In this paper, we develop a necessary and sufficient condition for a local minimum to be a global minimum to the vector quantization problem and present a competitive learning algorithm based on this condition which has two learning terms; the first term regulates the force of attraction between the synaptic weight vectors and the input patterns in order to reach a local minimum while the second term regulates the repulsion between the synaptic weight vectors and the input’s gravity center, favoring convergence to the global minimum. This algorithm leads to optimal or near optimal solutions and it allows the network to escape from local minima during trainning. Experimental results in image compression demonstrate that it outperforms the simple competitive learning algorithm, giving better codebooks.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Gray, R. M.: Vector quantization. IEEE ASSP Magazine, Vol. 1 (1980) 4–29.
Linde, Y., Buzo A., Gray, R. M.: An Algorithm for Vector Quantizer Design. IEEE Trans. on Communications, Vol. 28, no 1 (1980) 84–95.
Ahalt, S. C., Krishnamurphy, A. K., Chen P., Melton, D. E.: Competitive Learning Algorithms for Vector Quantization. Neural Networks, Vol. 3 (1990) 277–290.
Pal, N. R., Bezdek, J. C., Tsao, E. C.: Generalized Clustering Networks and Kohonen’s Self-Organizing Scheme. IEEE Trans. Neural Networks, Vol. 4, no 4 (1993) 549–557.
Xu, L., Krzyzak, A., Oja, E.: Rival Penalized Competitive Learning for Clustering Analysis. IEEE Trans. Neural Networks, Vol. 4, no 4 (1993) 636–649.
Ueda, N., Nakano, R.: A New Competitive Learning Approach Based on an Equidistortion Principle for Designing Optimal Vector Quantizers. Neural Networks, Vol. 7, no 8 (1994) 1211–1227.
Uchiyama, T., Arbib, M. A.: Color image segmentation using competitive learning. IEEE Trans. on Pattern Analysis and Machine Intelligence, Vol. 16, no 12 (1994) 1197–1206.
Hertz, J., Krogh, A., Palmer, R. G.: Introduction to the Theory of Neural Computation. Addison-Wesley, New York (1991).
Gray, R. M., Karnim, E. D.: Multiple local optima in vector quantizers. IEEE Trans. Inform. Theory, Vol. IT-28, no 2 (1982) 256–261.
Spath, H.: Cluster Analysis Algorithms for Data Reduction and Classification of Objects. Wiley, New York (1980).
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2001 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Gomez-Ruiz, J.A., Muñoz-Perez, J., Lopez-Rubio, E., Garcia-Bernal, M.A. (2001). Expansive and Competitive Neural Networks. In: Mira, J., Prieto, A. (eds) Connectionist Models of Neurons, Learning Processes, and Artificial Intelligence. IWANN 2001. Lecture Notes in Computer Science, vol 2084. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45720-8_41
Download citation
DOI: https://doi.org/10.1007/3-540-45720-8_41
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-42235-8
Online ISBN: 978-3-540-45720-6
eBook Packages: Springer Book Archive