loading...
 This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
2004 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR'04) - Volume 2
Linear Projection Methods in Face Recognition under Unconstrained Illuminations: A Comparative Study
Washington, D.C., USA
June 27-July 02
ISBN: 0-7695-2158-4
Qi Li, University of Delaware
Jieping Ye, University of Minnesota
Chandra Kambhamettu, University of Delaware
Face recognition under unconstrained illuminations (FR/I) received extensive study because of the existence of illumination subspace. [2] presented a study on the comparison between Principal component analysis (PCA) and subspace Linear Discriminant Analysis (LDA) for this problem. PCA and subspace LDA are two well-known linear projection methods that can be characterized as trace optimization on scatter matrices. Generally, a linear projection method can be derived by applying a specific matrix analysis technique on specific scatter matrices under some optimization criterion. Several novel linear projection methods were proposed recently using Generalized Singular Value Decomposition or QR Decomposition matrix analysis techniques [10, 17, 11]. In this paper, we present a comparative study on these linear projection methods in FR/I. We further involve multiresolution analysis in the study. Our comparative study is expected to give a relatively comprehensive view on the performance of linear projection methods in FR/I problems.
Citation:
Qi Li, Jieping Ye, Chandra Kambhamettu, "Linear Projection Methods in Face Recognition under Unconstrained Illuminations: A Comparative Study," cvpr, vol. 2, pp.474-481, 2004 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR'04) - Volume 2, 2004
Usage of this product signifies your acceptance of the Terms of Use.