Cost-Sensitive Sparsity Preserving Projections for Face Recognition

Abstract:

As one of the most popular research topics, sparse representation (SR) technique has been successfully employed to solve face recognition task. Though current SR based methods prove to achieve high classification accuracy, they implicitly assume that the losses of all misclassifications are the same. However, in many real-world face recognition applications, this assumption may not hold as different misclassifications could lead to different losses. Driven by this concern, in this paper, we propose a cost-sensitive sparsity preserving projections (CSSPP) for face recognition. CSSPP considers the cost information of sparse representation while calculating the sparse structure of the training set. Then, CSSPP employs the sparsity preserving projection method to achieve the projection transform and keeps the sparse structure in the low-dimensional space. Experimental results on the public AR and FRGC face databases are presented to demonstrate that both of the proposed approaches can achieve high recognition rate and low misclassification loss, which validate the efficacy of the proposed approach.

• Periodical: Advanced Materials Research (Volumes 760-762)
• Pages: 1615-1620
• DOI: https://doi.org/10.4028/www.scientific.net/AMR.760-762.1615
• Online since: September 2013
• Authors: Xiao Yuan Jing, Wen Qian Li, Hao Gao, Yong Fang Yao, Jiang Yue Man
• Keywords: Cost-Sensitive Classifier, Cost-Sensitive Learning, Face Recognition, Feature Extraction, Sparse Representation

References

[1] D. Marr, Vision: A Computational Investigation into the Human Representation and Processing of Visual Information, W.H. Freeman, San Francisco, (1982).

[2] M. Turk and A. Pentland, Eigenfaces for Recognition, J. Cognitive Neuroscience, vol. 3, no. 1, (1991).

[3] P. N. Belhumeur , J. P. Hespanha and D. J. Kriengman, Eigenfaces vs. Fisherfaces: Recognition Using Class Specific Linear Projection, IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 19, pp.711-720, (1997).

DOI: 10.1109/34.598228

[4] S. Roweis and L. Saul, Nonlinear dimensionality reduction by locally linear embedding, Science, vol. 290, pp.2323-2326, (2000).

DOI: 10.1126/science.290.5500.2323

[5] X. He , S. Yan , Y. Hu , P. Niyogi and H. Zhang, Face Recognition Using Laplacianfaces, IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 27, pp.328-340, (2005).

DOI: 10.1109/tpami.2005.55

[6] L. Qiao , S. Chen and X. Tan, Sparsity preserving projections with applications to face recognition, Pattern Recognition, vol. 43, pp.331-341, (2010).

DOI: 10.1016/j.patcog.2009.05.005

[7] B. Cheng, J. Yang, S. Yan, Y. Fu and T. Huang, Learning With L1-Graph for Image Analysis, IEEE Trans. Image Processing, vol. 19, pp.858-866, (2010).

DOI: 10.1109/tip.2009.2038764

[8] Y. Zhang and Z. H. Zhou, Cost-sensitive face recognition, IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 32, (2010).

[9] J. Lu and Y. Tan, Cost-sensitive subspace learning for face recognition, IEEE Conf. Computer Vision and Pattern Recognition, pp.2661-2666, (2010).

DOI: 10.1109/cvpr.2010.5539983

[10] S. Chen, D. L. Donoho, and M. A. Saunders, Atomic decomposition by basis pursuit, SIAM J. Sci Comp., vol. 20, pp.33-61, (1999).

DOI: 10.1137/s1064827596304010

[11] A. M. Martinez and R. Benavente, The AR Face Database, (1998).

[12] P. J. Phillips , P. J. Flynn , T. Scruggs , K. W. Bowyer , J. Chang , K. Hoffman , J. Marques , J. Min and W. Worek, Overview of the Face Recognition Grand Challenge, Proc. IEEE CS Conf. Computer Vision and Pattern Recognition, pp.947-954, (2005).

DOI: 10.1109/cvpr.2005.268

[13] J. Wright , A. Yang , A. Ganesh , S. Sastry and Y. Ma, Robust face recognition via sparse representation, IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 30, pp.210-227, (2009).

DOI: 10.1109/tpami.2008.79