Rapid and brief communications: Kernel direct discriminant analysis and its theoretical foundation

Authors:
Zhizheng Liang;Pengfei Shi
Affiliations:
Institute of Image Processing and Pattern Recognition, Shanghai Jiaotong University, Huashan Road 1608, Shanghai 200030, PR China;Institute of Image Processing and Pattern Recognition, Shanghai Jiaotong University, Huashan Road 1608, Shanghai 200030, PR China
Venue:
Pattern Recognition
Year:
2005

Citing 4
Cited 6

Introduction to statistical pattern recognition (2nd ed.)

Introduction to statistical pattern recognition (2nd ed.)
Nonlinear component analysis as a kernel eigenvalue problem

Neural Computation
Generalized Discriminant Analysis Using a Kernel Approach

Neural Computation
Face recognition using kernel direct discriminant analysis algorithms

IEEE Transactions on Neural Networks

Rapid and brief communication: Laplacian linear discriminant analysis

Pattern Recognition
Handwritten Bangla numeral recognition system and its application to postal automation

Pattern Recognition
Sparse multinomial kernel discriminant analysis (sMKDA)

Pattern Recognition
Face recognition using difference vector plus KPCA

Digital Signal Processing
Short communication: An improved discriminative common vectors and support vector machine based face recognition approach

Expert Systems with Applications: An International Journal
Indoor positioning via nonlinear discriminative feature extraction in wireless local area network

Computer Communications

Quantified Score

Hi-index	0.01

Visualization

Abstract

In this paper, the method of kernel direct discriminant analysis is analyzed from a new viewpoint and its theoretical foundation is revealed. Based on this result, an efficient and robust method is proposed. That is, the QR decomposition on the small-size matrix is adopted and then a small eigenvalue problem is solved. Finally, experimental results on ORL face database show that the proposed method is effective and feasible.