The algorithmic techniques for the implementation of the Linear Discriminant Analysis (LDA) play an important role when the LDA is applied to the high dimensional pattern recognition problem such as face recognition or verification. The LDA implementation in the context of face recognition and verification is investigated in this paper. Three main algorithmic techniques: matrix transformation, the Cholesky factorisation and QR algorithm, the Kronecker canonical form and QZ algorithm are proposed and tested on four publicly available face data- bases(M2VTS, YALE, XM2FDB, HARVARD)1. Extensive experimental results support the conclusion that the implementation based on the Kronecker canonical form and the QZ algorithm accomplishes the best performance in all experiments.
CITATION STYLE
Li, Y., Kittler, J., & Matas, J. (1999). Effective implementation of linear discriminant analysis for face recognition and verification. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 1689, pp. 234–242). Springer Verlag. https://doi.org/10.1007/3-540-48375-6_29
Mendeley helps you to discover research relevant for your work.