The solution space for fisher discriminant analysis and the uniqueness under constraints

Authors:
Weishi Zheng;Jianhuang Lai;P. C. Yuen
Affiliations:
Department of Mathematics, Sun Yat-sen University;Department of Mathematics, Sun Yat-sen University;Department of Computer Science, Hong Kong Baptist University
Venue:
SINOBIOMETRICS'04 Proceedings of the 5th Chinese conference on Advances in Biometric Person Authentication
Year:
2004

Citing 5
Cited 0

An Optimal Transformation for Discriminant and Principal Component Analysis

IEEE Transactions on Pattern Analysis and Machine Intelligence
Eigenfaces vs. Fisherfaces: Recognition Using Class Specific Linear Projection

IEEE Transactions on Pattern Analysis and Machine Intelligence
PCA versus LDA

IEEE Transactions on Pattern Analysis and Machine Intelligence
Face recognition: A literature survey

ACM Computing Surveys (CSUR)
An optimization criterion for generalized discriminant analysis on undersampled problems

IEEE Transactions on Pattern Analysis and Machine Intelligence

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper studies the solution space of Fisher Criteria The space is large and it is impossible to find the best solution generally This paper intends to construct an optimal projection, which solves the Fisher criteria and is the unique solution under nonsingular linear transformation if some constraints are0020given Therefore a theorem is proposed which shows the feasible for constructing the projection, with a simple way to process the construction from the traditional LDA Experiment result shows the ability and feasible of the proposed solution.