Self-organizing hierarchical feature maps
- 1 January 1990
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 279-284 vol.2
- https://doi.org/10.1109/ijcnn.1990.137727
Abstract
The topological feature map (TFM) algorithm introduced by T. Kohenen (1982) implements two important properties: a vector quantization (VQ) and a topology-preserving mapping. A tree-structured TFM (TSTFM) is presented as a computationally inexpensive alternative to the TFM algorithm. The computational complexity of the TSTFM is O (log N) rather than O(N) for the TFM. In addition, the TSTFM has some new properties that prove to be useful for VQ and in the context of visual perception: increased performance in VQ compared to the tree-structured VQ of A. Buzo et al. (1980) and hierarchical mapping of code vectorsKeywords
This publication has 7 references indexed in Scilit:
- Optimal pruning with applications to tree-structured source coding and modelingIEEE Transactions on Information Theory, 1989
- Fast self-organization by the probing algorithmPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1989
- Least squares quantization in PCMIEEE Transactions on Information Theory, 1982
- On the structure of vector quantizersIEEE Transactions on Information Theory, 1982
- Self-organized formation of topologically correct feature mapsBiological Cybernetics, 1982
- Speech coding based upon vector quantizationIEEE Transactions on Acoustics, Speech, and Signal Processing, 1980
- An Algorithm for Finding Best Matches in Logarithmic Expected TimeACM Transactions on Mathematical Software, 1977