The subspace learning algorithm as a formalism for pattern recognition and neural networks
- 1 January 1988
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 277-284 vol.1
- https://doi.org/10.1109/icnn.1988.23858
Abstract
Vector subspaces have been suggested for representations of structured information. In the theory of associative memory and associative information processing, the projection principle and subspaces are used in explaining the optimality of associative mappings and novelty filters. These formalisms seem to be very pertinent to neural networks, too. Based on these operations, the subspace method has been developed for a practical pattern-recognition algorithm. The method is reviewed, and some recent results on image analysis are given.Keywords
This publication has 6 references indexed in Scilit:
- Self-Organization and Associative MemoryPublished by Springer Nature ,1988
- Texture SubspacesPublished by Springer Nature ,1987
- The ALSM algorithm — an improved subspace method of classificationPattern Recognition, 1983
- An analysis of convergence for a learning version of the subspace methodJournal of Mathematical Analysis and Applications, 1983
- Fast adaptive formation of orthogonalizing filters and associative memory in recurrent networks of neuron-like elementsBiological Cybernetics, 1976
- Visual Pattern DiscriminationIEEE Transactions on Information Theory, 1962