DocumentCode
2990051
Title
A Novel Subspace Discriminant Locality Preserving Projections for Face Recognition
Author
He, Wei ; Chen, Wen-Sheng ; Fang, Bin
Author_Institution
Coll. of Comput. & Software, Shenzhen Univ., Shenzhen, China
fYear
2011
fDate
3-4 Dec. 2011
Firstpage
1057
Lastpage
1061
Abstract
This paper addresses Small Sample Size (3S) problem of Locality Preserving Projection (LPP) approach in face recognition. It is well-known that the dimension of pattern vector obtained by vectorizing a facial image is very high and usually greater than the number of training samples. Under this situation, 3S problem always occurs and direct utilizing LPP algorithm is infeasible. To deal with this limitation, a novel subspace discriminant LPP approach (SDLPP) is proposed in this paper based on modified LPP criterion and supervised graph. Furthermore, our SDLPP approach has low computational complexity. Two face databases, namely ORL and FERET databases, are selected for evaluations. Compared with some existing sate-of-the-art LPP based methods, the proposed SDLPP method gives the best performance.
Keywords
computational complexity; face recognition; graph theory; FERET database; ORL database; computational complexity; face recognition; pattern vector; small sample size problem; subspace discriminant locality preserving projections; supervised graph; Accuracy; Databases; Face; Face recognition; Matrix decomposition; Null space; Training; Face Recognition; Locality preserving projections; Small sample size; Supervised learning;
fLanguage
English
Publisher
ieee
Conference_Titel
Computational Intelligence and Security (CIS), 2011 Seventh International Conference on
Conference_Location
Hainan
Print_ISBN
978-1-4577-2008-6
Type
conf
DOI
10.1109/CIS.2011.235
Filename
6128287
Link To Document