Kernel relevance weighted discriminant analysis for face recognition

Abstract

In this paper, we propose a new kernel discriminant analysis called kernel relevance weighted discriminant analysis (KRWDA) which has several interesting characteristics. First, it can effectively deal with the small sample size problem by using a QR decomposition on scatter matrices. Second, by incorporating a weighting function into discriminant criterion, it overcomes overemphasis on well-separated classes and hence can work under more realistic situations. Finally, using kernel theory, it handle non linearity efficiently. In order to improve performance of the proposed algorithm, we introduce two novel kernel functions and compare them with some commonly used kernels on face recognition field. We have performed multiple face recognition experiments to compare KRWDA with other dimensionality reduction methods showing that KRWDA consistently gives the best results.