Matrix computations (3rd ed.)
Eigenfaces vs. Fisherfaces: Recognition Using Class Specific Linear Projection
IEEE Transactions on Pattern Analysis and Machine Intelligence
Bayesian Classification With Gaussian Processes
IEEE Transactions on Pattern Analysis and Machine Intelligence
IEEE Transactions on Pattern Analysis and Machine Intelligence
SIAM Journal on Matrix Analysis and Applications
The CMU Pose, Illumination, and Expression Database
IEEE Transactions on Pattern Analysis and Machine Intelligence
Discriminative features for text document classification
Pattern Analysis & Applications
A Two-Stage Linear Discriminant Analysis via QR-Decomposition
IEEE Transactions on Pattern Analysis and Machine Intelligence
The Journal of Machine Learning Research
Document Clustering Using Locality Preserving Indexing
IEEE Transactions on Knowledge and Data Engineering
Discriminant Analysis: A Least Squares Approximation View
CVPR '05 Proceedings of the 2005 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR'05) - Workshops - Volume 03
Rapid and brief communication: Face recognition based on 2D Fisherface approach
Pattern Recognition
(2D)2LDA: An efficient approach for face recognition
Pattern Recognition
Rapid and brief communication: Two-dimensional FLD for face recognition
Pattern Recognition
2D-LDA: A statistical linear discriminant analysis for image matrix
Pattern Recognition Letters
An optimization criterion for generalized discriminant analysis on undersampled problems
IEEE Transactions on Pattern Analysis and Machine Intelligence
Hi-index | 0.00 |
Singularity problems of scatter matrices in Linear Discriminant Analysis LDA are challenging and have obtained attention during the last decade. Linear Discriminant Analysis via QR decomposition LDA/QR and Direct Linear Discriminant analysis DLDA are two popular algorithms to solve the singularity problem. This paper establishes the equivalent relationship between LDA/QR and DLDA. They can be regarded as special cases of pseudo-inverse LDA. Similar to LDA/QR algorithm, DLDA can also be considered as a two-stage LDA method. Interestingly, the first stage of DLDA can act as a dimension reduction algorithm. The experiment compares LDA/QR and DLDA algorithms in terms of classification accuracy, computational complexity on several benchmark datasets and compares their first stages. The results confirm the established equivalent relationship and verify their capabilities in dimension reduction.