An Optimal Subspace Analysis for Face Recognition

Author(s):  
Haitao Zhao ◽  
Pong C. Yuen ◽  
Jingyu Yang
2005 ◽  
Vol 38 (4) ◽  
pp. 617-621 ◽  
Author(s):  
Liwei Wang ◽  
Xiao Wang ◽  
Jufu Feng

Author(s):  
Zhongping Zhang ◽  
Iiaojiao Liu ◽  
Yuting Zhang ◽  
Jiyao Zhang ◽  
Mingru Tian

Author(s):  
David Zhang ◽  
Fengxi Song ◽  
Yong Xu ◽  
Zhizhen Liang

In this chapter, we describe two tensor-based subspace analysis approaches (tensor ICA and tensor NMF) that can be used in many fields like face recognition and other biometric recognition. Section 10.1 gives the background and development of the two tensor-based subspace analysis approaches. Section 10.2 introduces tensor independent component analysis. Section 10.3 presents tensor nonnegative factorization. Section 10.4 discusses some potential applications of these two subspace analysis approaches in biometrics. Finally, we summarize this chapter in Section 10.5.


Author(s):  
Huiyu Zhou ◽  
Yuan Yuan ◽  
Chunmei Shi

The authors present a face recognition scheme based on semantic features’ extraction from faces and tensor subspace analysis. These semantic features consist of eyes and mouth, plus the region outlined by three weight centres of the edges of these features. The extracted features are compared over images in tensor subspace domain. Singular value decomposition is used to solve the eigenvalue problem and to project the geometrical properties to the face manifold. They compare the performance of the proposed scheme with that of other established techniques, where the results demonstrate the superiority of the proposed method.


Author(s):  
JIANGUO WANG

Subspace analysis is an effective approach for face recognition. In this paper, a novel subspace method, called kernel supervised discriminant projection (KSDP), is proposed for face recognition. In the proposed method, not only discriminant information with intrinsic geometric relations is preserved in subspace, but also complex nonlinear variations of face images are represented by nonlinear kernel mapping. Extensive experiments are performed to test and evaluate the new algorithm. Experimental results on three popular benchmark databases, FERET, Yale and AR, demonstrate the effectiveness of the proposed method, KSDP.


2013 ◽  
Vol 72 (6) ◽  
pp. 1-8 ◽  
Author(s):  
Benouis Mohamed ◽  
Tlmesani Redwan ◽  
Senouci Mohamed

2011 ◽  
Vol 74 (12-13) ◽  
pp. 2142-2156 ◽  
Author(s):  
Su-Jing Wang ◽  
Chun-Guang Zhou ◽  
Na Zhang ◽  
Xu-Jun Peng ◽  
Yu-Hsin Chen ◽  
...  

Sign in / Sign up

Export Citation Format

Share Document