By Topic

Rank-Lifting Strategy Based Kernel Regularized Discriminant Analysis Method for Face Recognition

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Wen-Sheng Chen ; Coll. of Math. & Comput. Sci., Shenzhen Univ., Shenzhen, China ; Pong Chi Yuen ; Xuehui Xie

To address Small Sample Size (S3) problem and nonlinear problem of face recognition, this paper proposes a novel rank-lifting based kernel regularized discriminant analysis method (RL-KRDA). It first proves a rank-lifting theorem using algebraic theory. Combining a new ranklifting strategy with standby three-to-one regularization technique, the complete regularized technology is developed on the within-class scatter matrix Sw. Our regularized scheme not only adjusts the projection directions but tunes their corresponding weights as well. It is also shown that the final regularized within-class scatter matrix approaches to the original one as the regularized parameters tend to zeros. The public available database, i.e. CMU PIE face database, is selected for evaluation. Comparing with some existing kernel-based LDA methods for solving S3 problem, the proposed RL-KRDA approach gives the best performance.

Published in:

Pattern Recognition (CCPR), 2010 Chinese Conference on

Date of Conference:

21-23 Oct. 2010