Please use this identifier to cite or link to this item: http://hdl.handle.net/10397/17375
Title: A generalised K-L expansion method which can deal with small sample size and high-dimensional problems
Authors: Yang, J
Zhang, D 
Yang, JY
Issue Date: 2003
Source: Pattern analysis and applications, 2003, v. 6, no. 1, p. 47-54
Abstract: 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.
Keywords: Face recognition
Feature extraction
High dimensional problem
K-L expansion
Principal Component Analysis
Small sample size problem
Publisher: Springer
Journal: Pattern analysis and applications 
ISSN: 1433-7541 (print)
1433-755X (online)
DOI: 10.1007/s10044-002-0177-3
Appears in Collections:Journal/Magazine Article

Access
View full-text via PolyU eLinks SFX Query
Show full item record

SCOPUSTM   
Citations

42
Last Week
0
Last month
0
Citations as of Sep 8, 2020

WEB OF SCIENCETM
Citations

38
Last Week
0
Last month
0
Citations as of Sep 25, 2020

Page view(s)

161
Last Week
0
Last month
Citations as of Sep 21, 2020

Google ScholarTM

Check

Altmetric


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.