Computationally efficient template based face recognition
Classically, face recognition depends on computing the similarity (or distance) between a pair of face images and/or their respective representations, where each subject is represented by one image. Template based face recognition was introduced by the release of IARPA's Janus Benchmark A (IJB A) dataset, in which each enrolled subject is represented by a group of one or more images, called a template. The group of images comprising a template might have been acquired using different head poses, illuminations, ages and facial expressions. Template images could come from still images or video frames. Therefore, measuring the similarity between templates representing two subjects significantly increases the number of pairwise image comparisons (i.e. O(NM) where N and M are the number of image templates being compared) As the number of enrolled subjects, K, increases, both computational and space requirements become computationally prohibitive. To address this challenge, we present a novel approximate nearest neighbor (ANN) search based solution. Given a query template, ANN methods are used to find similar face images. Retrieved images are used to construct a template pool that is used to find the correct identity of the query subject. The proposed approach largely reduces the number of imposter template pair comparisons. Experimental results on the IJB A dataset show that the proposed approach achieves significant speed up and storage savings, without sacrificing accuracy.
2016 23rd International Conference on Pattern Recognition (ICPR)