No abstract

A new face recognition algorithm is proposed which is robust to variations in pose, expression and illumination. The framework is similar to the ubiquitous block matching algorithm used for motion estimation in video compression but has been adapted to compensate for illumination differences. One of the key differentiators of this approach is that unlike traditional face recognition algorithms, the image data representing the face or features extracted from the facial data is not used for classification. Instead, the mapping between the probe and gallery images given by the block matching algorithm is used to classify the faces for recognition. Once the mappings are found for each gallery image, the degree of bijectivity that each mapping produces is used to derive the similarity scores for recognition.