A Viewpoint Invariant, Sparsely Registered, Patch Based, Face Verifier - Robotics Institute Carnegie Mellon University

A Viewpoint Invariant, Sparsely Registered, Patch Based, Face Verifier

Simon Lucey and Tsuhan Chen
Journal Article, International Journal of Computer Vision, Vol. 80, No. 1, pp. 58 - 71, October, 2008

Abstract

Sparsely registering a face (i.e., locating 2 fiducial points) is considered a much easier task than densely registering one; especially with varying viewpoints. Unfortunately, the converse tends to be true for the task of viewpoint-invariant face verification; the more registration points one has the better the performance. In this paper we present a novel approach to viewpoint invariant face verification which we refer to as the "patch-whole" algorithm. The algorithm is able to obtain good verification performance with sparsely registered faces. Good performance is achieved by not assuming any alignment between gallery and probe view faces, but instead trying to learn the joint likelihood functions for faces of similar and dissimilar identities. Generalization is encouraged by factorizing the joint gallery and probe appearance likelihood, for each class, into an ensemble of "patch-whole" likelihoods. We make an additional contribution in this paper by reviewing existing approaches to viewpoint-invariant face verification and demonstrating how most of them fall into one of two categories; namely viewpoint-generative or viewpoint-discriminative. This categorization is instructive as it enables us to compare our "patch-whole" algorithm to other paradigms in viewpoint-invariant face verification and also gives deeper insights into why the algorithm performs so well.

BibTeX

@article{Lucey-2008-9883,
author = {Simon Lucey and Tsuhan Chen},
title = {A Viewpoint Invariant, Sparsely Registered, Patch Based, Face Verifier},
journal = {International Journal of Computer Vision},
year = {2008},
month = {October},
volume = {80},
number = {1},
pages = {58 - 71},
}