Kernel machine-based rank-lifting regularized discriminant analysis method for face recognition

Wen Sheng Chen*, Pong Chi YUEN, Xuehui Xie

*Corresponding author for this work

Research output: Contribution to journalJournal articlepeer-review

15 Citations (Scopus)


To address two problems, namely nonlinear problem and singularity problem, of linear discriminant analysis (LDA) approach in face recognition, this paper proposes a novel kernel machine-based rank-lifting regularized discriminant analysis (KRLRDA) method. A rank-lifting theorem is first proven using linear algebraic theory. Combining the rank-lifting strategy with three-to-one regularization technique, the complete regularized methodology is developed on the within-class scatter matrix. The proposed regularized scheme not only adjusts the projection directions but tunes their corresponding weights as well. Moreover, it is shown that the final regularized within-class scatter matrix approaches to the original one as the regularized parameter tends to zero. Two public available databases, namely FERET and CMU PIE face databases, are selected for evaluations. Compared with some existing kernel-based LDA methods, the proposed KRLRDA approach gives superior performance.

Original languageEnglish
Pages (from-to)2953-2960
Number of pages8
Issue number17
Publication statusPublished - Oct 2011

Scopus Subject Areas

  • Computer Science Applications
  • Cognitive Neuroscience
  • Artificial Intelligence

User-Defined Keywords

  • Face recognition
  • Kernel method
  • Nonlinear problem
  • Rank-lifting scheme
  • Singularity problem


Dive into the research topics of 'Kernel machine-based rank-lifting regularized discriminant analysis method for face recognition'. Together they form a unique fingerprint.

Cite this