Bidirectional associative memories
IEEE Transactions on Systems, Man and Cybernetics
Generalizing Operations of Binary Autoassociative Morphological Memories Using Fuzzy Set Theory
Journal of Mathematical Imaging and Vision
Reconstruction of Patterns from Noisy Inputs Using Morphological Associative Memories
Journal of Mathematical Imaging and Vision
IEEE Transactions on Computers
Associative memories applied to image categorization
CIARP'06 Proceedings of the 11th Iberoamerican conference on Progress in Pattern Recognition, Image Analysis and Applications
A bidirectional heteroassociative memory for binary and grey-level patterns
IEEE Transactions on Neural Networks
A Bidirectional Hetero-Associative Memory for True-Color Patterns
Neural Processing Letters
3D object recognition based on low frequency response and random feature selection
MICAI'07 Proceedings of the artificial intelligence 6th Mexican international conference on Advances in artificial intelligence
Face recognition using some aspects of the infant vision system and associative memories
CIARP'07 Proceedings of the Congress on pattern recognition 12th Iberoamerican conference on Progress in pattern recognition, image analysis and applications
Word learning by a extended BAM network
ICNC'09 Proceedings of the 5th international conference on Natural computation
A new learning strategy of general BAMs
MLDM'12 Proceedings of the 8th international conference on Machine Learning and Data Mining in Pattern Recognition
| Hi-index | 0.00 |
Hebbian hetero-associative learning is inherently asymmetric. Storing a forward association from pattern A to pattern B enables the recalling of pattern B given pattern A. This, in general, does not allow the recalling of pattern A given pattern B. The forward association between A and B will tend to be stronger than the backward association between B and A. In this paper it is described how the dynamical associative model proposed in [10] can be extended to create a bi-directional associative memory where forward association between A and B is equal to backward association between B and A. This implies that storing a forward association, from pattern A to pattern B, would enable the recalling of pattern B given pattern A and the recalling of pattern A given pattern B. We give some formal results that support the functioning of the proposal, and provide some examples were the proposal finds application.