Face Recognition Using Topology Preserving Nonnegative Matrix Factorization

In this paper, a novel Topology Preserving Nonnegative Matrix Factorization (TPNMF) method is proposed for face recognition. The TPNMF is based on minimizing the constraint gradient distance, compared with L2 distance, the gradient distance is able to reveal latent manifold structure of face patterns. Compared with PCA, LDA and original NMF which search only the Euclidean structure of face space, TPNMF finds an embedding that preserves local topology information, such as edges and texture. In the way, the proposed TPNMF method is robust for variable in lighting and facial expression. Experimental results show that the proposed TPNMF approach provides a better representation of face patterns and achieves higher recognition rates in face recognition.

[1]  H. Sebastian Seung,et al.  Algorithms for Non-negative Matrix Factorization , 2000, NIPS.

[2]  Amnon Shashua,et al.  Manifold pursuit: a new approach to appearance based recognition , 2002, Object recognition supported by user interaction for service robots.

[3]  Mikhail Belkin,et al.  Laplacian Eigenmaps for Dimensionality Reduction and Data Representation , 2003, Neural Computation.

[4]  H. Sebastian Seung,et al.  Learning the parts of objects by non-negative matrix factorization , 1999, Nature.

[5]  M. Turk,et al.  Eigenfaces for Recognition , 1991, Journal of Cognitive Neuroscience.

[6]  Azriel Rosenfeld,et al.  Face recognition: A literature survey , 2003, CSUR.

[7]  Stan Z. Li,et al.  Learning spatially localized, parts-based representation , 2001, Proceedings of the 2001 IEEE Computer Society Conference on Computer Vision and Pattern Recognition. CVPR 2001.

[8]  Rogério Schmidt Feris,et al.  Manifold Based Analysis of Facial Expression , 2004, 2004 Conference on Computer Vision and Pattern Recognition Workshop.