Please use this identifier to cite or link to this item:
Title: DLDA and LDA/QR equivalence framework for human face recognition
Authors: Li, R
Chan, CL
Baciu, G 
Issue Date: 2010
Source: 2010 9th IEEE International Conference on Cognitive Informatics (ICCI), 7-9 July 2010, Beijing, p. 180-185
Abstract: Singularity problem in human face feature extraction is very challenging that has gained a lot of attentions during the last decade. A pseudo-inverse linear discriminant analysis (LDA) plays a important role to solve the singularity problem of the scatter matrices. In this paper, we make use of Linear Discriminant Analysis via QR decomposition (LDA/QR) and Direct Linear Discriminant Analysis (DLDA) to solve the singularity problem in face feature recognition. We also show that an equivalent relationship between DLDA and LDA/QR. They can be regarded as a special case of pseudo-inverse LDA. Similar to LDA/QR algorithm, DLDA could be a two-stage LDA method. Interestingly, we find that the first stage of DLDA can act as a dimensionality reduction algorithm. In our experiment, we compare DLDA and LDA/QR algorithms in terms of classification accuracy, computational complexity in ORL and Yale face datasets. We have also conducted experiments to compare their first stages on these datasets. Our results indicate that the empirical and theoretic proofs of equivalence between DLDA and LDA/QR algorithms coincidentally converge and verify their same capabilities in the dimension reduction.
Keywords: Direct LDA
Face Recognition
Pseudo-inverse LDA
Publisher: IEEE
ISBN: 978-1-4244-8041-8
DOI: 10.1109/COGINF.2010.5599743
Appears in Collections:Conference Paper

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


Last Week
Last month
Citations as of Aug 18, 2020

Page view(s)

Last Week
Last month
Citations as of Nov 18, 2020

Google ScholarTM



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