Eigenfaces vs. Fisherfaces: Recognition Using Class Specific Linear Projection
IEEE Transactions on Pattern Analysis and Machine Intelligence
Face Recognition by Elastic Bunch Graph Matching
IEEE Transactions on Pattern Analysis and Machine Intelligence
The role of topographical constraints in face recognition
Pattern Recognition Letters
The FERET Evaluation Methodology for Face-Recognition Algorithms
IEEE Transactions on Pattern Analysis and Machine Intelligence
Generalizations of the Hamming Associative Memory
Neural Processing Letters
Fundamentals of Artificial Neural Networks
Fundamentals of Artificial Neural Networks
Pattern Classification (2nd Edition)
Pattern Classification (2nd Edition)
A main stem concept for image matching
Pattern Recognition Letters
Improved heterogeneous distance functions
Journal of Artificial Intelligence Research
Face authentication with Gabor information on deformable graphs
IEEE Transactions on Image Processing
Memory capacities for synaptic and structural plasticity
Neural Computation
Neural associative memory with optimal bayesian learning
Neural Computation
Hi-index | 0.00 |
Many models of neural network-based associative memory have been proposed and studied. However, most of these models do not have a rejection mechanism and hence are not practical for many real-world associative memory problems. For example, in human face recognition, we are given a database of face images and the identity of each image. Given an input image, the task is to associate when appropriate the image with the corresponding name of the person in the database. However, the input image may be that of a stranger. In this case, the system should reject the input. In this paper, we propose a practical associative memory model that has a rejection mechanism. The structure of the model is based on the restricted Coulomb energy (RCE) network. The capacity of the proposed memory is desibed by two measures: the ability of the system to correctly identify known individuals, and the ability of the system to reject individuals who are not in the database. Experimental results are given which show how the performance of the system varies as the size of the database increases up to 1000 individuals.