In this chapter, we present a comprehensive framework for tackling the classical problem of face recognition, based on theory and algorithms from sparse representation. Despite intense interest in the past several decades, traditional pattern recognition theory still stops short of providing a satisfactory solution capable of recognizing human faces in the presence of real-world nuisances such as occlusion and variabilities in pose and illumination. Our new approach, called sparse representation-based classification (SRC), is motivated by a very natural notion of sparsity, namely, one should always try to explain a query image using a small number of training images from a single subject category. This sparse representation is sought via ℓ1 minimization. We show how this core idea can be generalized and extended to account for various physical variabilities encountered in face recognition. The end result of our investigation is a full-fledged practical system aimed at security and access control applications. The system is capable of accurately recognizing subjects out of a database of several hundred subjects with state-of-the-art accuracy. Introduction. Automatic face recognition is a classical problem in the computer vision community. The communityʼs sustained interest in this problem is mainly due to two reasons. First, in face recognition, we encounter many of the common variabilities that plague vision systems in general: illumination, occlusion, pose, and misalignment. Inspired by the good performance of humans in recognizing familiar faces , we have reason to believe that effective automatic face recognition is possible, and that the quest to achieve this will tell us something about visual recognition in general.
|Original language||English (US)|
|Title of host publication||Compressed Sensing|
|Subtitle of host publication||Theory and Applications|
|Publisher||Cambridge University Press|
|Number of pages||25|
|State||Published - Jan 1 2009|
All Science Journal Classification (ASJC) codes