A modified algorithm for generalized discriminant analysis.
Generalized discriminant analysis (GDA) is an extension of the classical linear discriminant analysis (LDA) from linear domain to a nonlinear domain via the kernel trick. However, in the previous algorithm of GDA, the solutions may suffer from the degenerate eigenvalue problem (i.e., several eigenvectors with the same eigenvalue), which makes them not optimal in terms of the discriminant ability. In this letter, we propose a modified algorithm for GDA (MGDA) to solve this problem. The MGDA method aims to remove the degeneracy of GDA and find the optimal discriminant solutions, which maximize the between-class scatter in the subspace spanned by the degenerate eigenvectors of GDA. Theoretical analysis and experimental results on the ORL face database show that the MGDA method achieves better performance than the GDA method.
Zheng
Wenming
W
Engineering Research Center of Information Processing and Application, Southest University, Nanjing, Jiangsu 210096, People's Republic of China.
Zhao
Li
L
Zou
Cairong
C
D000465:Algorithms; D016002:Discriminant Analysis; D006801:Humans; D007091:Image Processing, Computer-Assisted; D008959:Models, Neurological; D016571:Neural Networks, Computer; D010363:Pattern Recognition, Automated; D012680:Sensitivity and Specificity