DocumentCode
3482843
Title
An unconstrained optimal set of discriminant vectors
Author
Zeng Xian-gui ; Li Shao-fa ; Zuo Wen-ming
Author_Institution
Sch. of Comput. Sci. & Eng., South China Univ. of Technol., Guangzhou
Volume
2
fYear
2004
fDate
1-3 Dec. 2004
Firstpage
1398
Lastpage
1401
Abstract
Under circumstances of orthogonal constraints, the vectors that make the Fisher discriminant criterion function attain the maximum values are F-S optimal set of discriminant vectors. In this paper, an optimal set of discriminant vectors which need not fill any constraint condition has been presented, together with the solution for the set. In addition, when the number of training samples is smaller than the dimensions of training samples (i.e. small number of training samples problem), the within-class scatter matrix is singular. Under this circumstance, to acquire both F-S optimal set of discriminant vectors and unconstrained optimal set of discriminant vectors presented here becomes unfeasible. To solve this problem, an approved Fisher discriminant function is presented. The results of experiment on ORL face database show that the algorithms presented here have strong ability in discrimination
Keywords
face recognition; matrix algebra; set theory; vectors; Fisher discriminant criterion function; ORL face database; discriminant vector optimal set; orthogonal constraint; unconstrained optimal set; vectors; within-class scatter matrix; Computer science; Databases; Face recognition; Humans; Pattern classification; Pattern recognition; Scattering; Vectors;
fLanguage
English
Publisher
ieee
Conference_Titel
Cybernetics and Intelligent Systems, 2004 IEEE Conference on
Conference_Location
Singapore
Print_ISBN
0-7803-8643-4
Type
conf
DOI
10.1109/ICCIS.2004.1460797
Filename
1460797
Link To Document