An application of compressive sensing (CS) theory in image-based robust face recognition is considered. Motivated by CS, the problem has been recently cast in a sparse representation framework: The sparsest linear combination of a query image is sought using all prior training images as an overcomplete dictionary, and the dominant sparse coefficients reveal the identity of the query image. The ability to perform dense error correction directly in the image space also provides an intriguing solution to compensate pixel corruption and improve the recognition accuracy exceeding most existing solutions. Furthermore, a local iterative process can be applied to solve for an image transformation applied to the face region when the query image is misaligned. Finally, we discuss the state of the art in fast algorithms to improve the speed of the system. The paper also provides useful guidelines to practitioners working in similar fields, such as acoustic/speech recognition.
Bibliographic reference. Yang, Allen Y. / Zhou, Zihan / Ma, Yi / Sastry, S. Shankar (2010): "Towards a robust face recognition system using compressive sensing", In INTERSPEECH-2010, 2250-2253.