A generalised K-L expansion method which can deal with small sample size and high-dimensional problems

Jian Yang, Dapeng Zhang, Jing Yu Yang

Research output: Journal article publicationJournal articleAcademic researchpeer-review

42 Citations (Scopus)


The K-L expansion method, which is able to extract the discriminatory information contained in class-mean vectors, is generalised, in this paper, to make it suitable for solving small sample size problems. We further investigate, theoretically, how to reduce the method's computational complexity in high-dimensional cases. As a result, a simple and efficient GKLE algorithm is developed. We test our method on the ORL face image database and the NUST603 handwritten Chinese character database, and our experimental results demonstrate that GKLE outperforms the existing techniques of PCA, PCA plus LDA, and Direct LDA.
Original languageEnglish
Pages (from-to)47-54
Number of pages8
JournalPattern Analysis and Applications
Issue number1
Publication statusPublished - 26 Jun 2003


  • Face recognition
  • Feature extraction
  • High dimensional problem
  • K-L expansion
  • Principal Component Analysis
  • Small sample size problem

ASJC Scopus subject areas

  • Computer Vision and Pattern Recognition
  • Artificial Intelligence

Cite this