Subspace regularized linear discriminant analysis for small sample size problems

Authors:
Zhidong Wang;Wuyi Yang
Affiliations:
School of Computer Science and Engineering, Beihang University, Beijing, China;Key Laboratory of Underwater Acoustic Communication and Marine Information Technology of the Ministry of Education, Xiamen University, Xiamen, China
Venue:
PRICAI'12 Proceedings of the 12th Pacific Rim international conference on Trends in Artificial Intelligence
Year:
2012

Citing 5
Cited 0

Introduction to statistical pattern recognition (2nd ed.)

Introduction to statistical pattern recognition (2nd ed.)
A Generalized Representer Theorem

COLT '01/EuroCOLT '01 Proceedings of the 14th Annual Conference on Computational Learning Theory and and 5th European Conference on Computational Learning Theory
Discriminative Common Vectors for Face Recognition

IEEE Transactions on Pattern Analysis and Machine Intelligence
KPCA Plus LDA: A Complete Kernel Fisher Discriminant Framework for Feature Extraction and Recognition

IEEE Transactions on Pattern Analysis and Machine Intelligence
A study on three linear discriminant analysis based methods in small sample size problem

Pattern Recognition

Quantified Score

Hi-index	0.00

Visualization

Abstract

Linear discriminant analysis (LDA) can extract features that preserve class separability. For small sample size (SSS) problems, the number of data samples is smaller than the dimension of data space, and the within-class scatter matrix of data samples is singular. LDA cannot be directly applied to SSS problems, since LDA requires the within-class scatter matrix to be non-singular. Regularized linear discriminant analysis (RLDA) is a common way to deal with singularity problems. In this paper, a subspace RLDA (SRLDA) algorithm is presented for SSS problems, which is performed in a subspace containing the range space of the total scatter matrix. The use of different parameter values in the regularization of the within-class matrix connects SRLDA to several extensions of LDA including discriminative common vectors (DCV), complete LDA (CLDA) and pseudo-inverse LDA (PLDA). An efficient algorithm to perform SRLDA based on the QR decomposition is developed, which makes the algorithm feasible and efficient for SSS problems. Face recognition is a well-known SSS problem and extensive experiments on various datasets of face images are conducted to evaluate the proposed algorithm and compare SRLDA with other extended LDA algorithms. Experimental results show the proposed algorithm can fuse discriminative information in the range and the null space of the within-class scatter matrix to find optimal discriminant vectors.