Effective Implementation of Linear Discriminant Analysis for Face Recognition and Verification

  • Yongping Li
  • Josef Kittler
  • Jiri Matas
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 1689)


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 databases (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


Face Recognition Linear Discriminant Analysis Face Image Face Database Cholesky Factorisation 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    P. Belhumeur et al, “Eigenfaces vs. Fisherfaces: Recognition Using Class Specific Linear Projection,” in Proc. of ECCV'96, pp 45–58, Cambridge, UK, 1996.Google Scholar
  2. 2.
    Pierre A. Devijver and Josef Kittler. “Pattern Recognition: A Statistical Approach,” Prentice-Hall, Englewood Cliffs, N.J., 1982.zbMATHGoogle Scholar
  3. 3.
    K. Etemad and R. Chellappa, “Face Recognition using Discriminant Eigenvectors,” In Proc. of ICASSP'96, pp. 2148–2151, 1996.Google Scholar
  4. 4.
    K. Etemad and R. Chellappa, “Discriminant Analysis for Recognition of Human Face Images,” In Proc. of AVBPA'97, pp. 127–142, 1997.Google Scholar
  5. 5.
    R. Fisher, “The use of multiple measures in taxonomic problems,” Ann. Eugenics, vol.7, pp. 179–188, 1936.Google Scholar
  6. 6.
    G.H. Golub, and C.F. Van Loan, Matrix computations, The Johns Hopkins University Press, Baltimore and London, 1989.zbMATHGoogle Scholar
  7. 7.
    C. Liu and H. Wechsler, “Face Recognition Using Evolutionary Pursuit,” in Proc. of ECCV'98, Vol. II, pp. 596–612, June 1998.Google Scholar
  8. 8.
    R.S. Martin et al, “Symmetric decomposition of a positive define matrix,” Numer. Math., Vol. 7, pp. 362–383, 1965.zbMATHCrossRefMathSciNetGoogle Scholar
  9. 9.
    C.B. Moler et al., “An algorithm for generalized matrix eigenvalue problem Aχ = λBχ,” SIAM J.Numer. Anal., Vol. 10, pp. 99–130, 1973.CrossRefMathSciNetGoogle Scholar
  10. 10.
    William H. Press, et al., Numerical recipes in C: the art of scientific computing, Cambridge Press, 1989.Google Scholar
  11. 11.
    L. Sirovich et al, “Low-dimensitional procedure for the characterization on human faces,” J. Opt. Soc. Am. A, vol. 4,no. 3, pp 519–524, 1987.CrossRefGoogle Scholar
  12. 12.
    M. Turk and A. Pentland, “Eigenface for Recognition,” Journal of Cognitive Neuroscience, Vol. 3,no. 1, pp. 70–86, 1991.CrossRefGoogle Scholar
  13. 13.
    P. Van Dooren, “The computation of Kronecker’s form of a singular pencil,” Linear Algebra and Appl., Vol. 27, pp. 103–140, 1979.zbMATHCrossRefMathSciNetGoogle Scholar
  14. 14.
    J. Wilkinson et al., “Handbook for Automatic Computation Vol II,” Linear Algebra, Springer-Verlag, Berlin Heidelberg, New York, 1971.Google Scholar
  15. 15.
    J. H. Wilkinson, “Kronecker’s Canonical Form and the QZ Algorithm,” Linear Algebra and Appl., vol. 28, pp. 285–303, 1979.zbMATHCrossRefMathSciNetGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1999

Authors and Affiliations

  • Yongping Li
    • 1
  • Josef Kittler
    • 1
  • Jiri Matas
    • 1
  1. 1.Centre for Vision Speech and Signal ProcessingUniversity of SurreyGuildford, SurreyEngland

Personalised recommendations