Abstract:To solve the problems in feature extraction algorithms, an algorithm based on linear discriminant analysis (LDA), called classification probability preserving discriminant analysis (CPPDA), is proposed for face recognition. Firstly, the classification probability of each sample is computed by CPPDA, and both the between-class scatter matrix and the within-class scatter matrix are redefined by the classification probability. Secondly, through maximizing the between-class scatter and minimizing the within-class scatter simultaneously, an optimal projection matrix can be preserved in the low-dimensional feature space, such as the distribution information contained in the original data. Finally, the experimental results on the ORL,Yale and FERET face databases demonstrate the superiority of the proposed algorithm compared with other algorithms.
杨章静,刘传才,黄璞,朱俊. 分类概率保持鉴别分析及其在人脸识别中的应用[J]. 模式识别与人工智能, 2014, 27(1): 77-81.
YANG Zhang-Jing, LIU Chuan-Cai, HUANG Pu, ZHU Jun. Classification Probability Preserving Discriminant Analysis and Its Application to Face Recognition. , 2014, 27(1): 77-81.
[1] Zhao Wenyi, Chellappa R, Phillips P J, et al. Face Recognition: A Literature Survey. ACM Computing Surveys, 2003, 35(4): 399-458 [2] Li Wujun, Wang Chongjun, Zhang Wei, et al. A Survey of Face Recognition. Pattern Recognition and Artificial Intelligence, 2006, 19(1): 58-66 (in Chinese) (李武军,王崇骏,张 炜,等.人脸识别研究综述.模式识别与人工智能, 2006, 19(1): 58-66) [3] Turk M, Pentland A. Eigenfaces for Recognition. Journal of Cognitive Neuroscience, 1991, 3(1): 71-86 [4] Belhumeur P N, Hespanha J P, Kriegman D J. Eigenfaces vs. Fisherfaces: Recognition Using Class Specific Linear Projection. IEEE Trans on Pattern Analysis and Machine Intelligence, 1997, 19(7): 711-720 [5] Roweis S T, Saul L K. Nonlinear Dimensionality Reduction by Locally Linear Embedding. Science, 2000, 290(5500): 2323-2326 [6] Tenenbaum J B, de Silva V, Langford J C. A Global Geometric Framework for Nonlinear Dimensionality Reduction. Science, 2000, 290(5500): 2319-2323 [7] Belkin M, Niyogi P. Laplacian Eigenmaps for Dimensionality Reduction and Data Representation. Neural Computation, 2003, 15(6): 1373-1396 [8] He Xiaofei, Yan Shuicheng, Hu Yuxiao, et al. Face Recognition Using Laplacianfaces. IEEE Trans on Pattern Analysis and Machine Intelligence, 2005, 27(3): 328-340 [9] Li Junbao, Pan J S, Chu Shuchuan. Kernel Class-Wise Locality Preserving Projection. Information Science, 2008, 178(7): 1825-1835 [10] He Xiaofei, Yan Shuicheng, Hu Yuxiao, et al. Learning a Locality Preserving Subspace for Visual Recognition // Proc of the 9th IEEE International Conference on Computer Vision. Nice, France, 2003, I: 385-392 [11] Yan Shuicheng, Xu Dong, Zhang Benyu, et al. Graph Embedding: A General Framework for Dimensionality Reduction. IEEE Trans on Pattern Analysis and Machine Intelligence, 2007, 29(1): 40-51 [12] Beveridge J R, Bolme D S, Draper B A, et al. The CSU Face Identification Evaluation System: Its Purpose, Features, and Structure. Machine Vision and Applications, 2005, 16(2): 128-138 [13] Sugiyama M. Dimensionality Reduction of Multimodal Labeled Data by Local Fisher Discriminant Analysis. Journal of Machine Learning Research, 2007, 8: 1027-1061 [14] Lai Zhihui, Zhao Cairong, Chen Yi, et al. Maximal Local Interclass Embedding with Application to Face Recognition. Machine Vision and Applications , 2011, 22(4): 619-627 [15] Zhao Haitao, Sun Shaoyuan, Jing Zhongliang, et al. Local Structure Based Supervised Feature Extraction. Pattern Recognition, 2006, 39(8): 1546-1550 [16] Li Bo, Wang Chao, Huang Deshuang. Supervised Feature Extraction Based on Orthogonal Discriminant Projection. Neurocomputing, 2009, 73(1/2/3): 191-196 [17] Zhang Shangwen, Lei Yingke, Wu Yanhua, et al. Modified Orthogonal Discriminant Projection for Classification. Neurocomputing, 2011, 74(17): 3690-3694 [18] Goldberger J, Roweis S, Hinton G, et al. Neighbourhood Components Analysis // Lawrence K. Saul, Yair Weiss, Léon Bottou, eds. Advances in Neural Information Processing Systems 17. Vancouver, Canada: MIT Press, 2004: 513-520