Theory analysis on FSLDA and ULDA

被引:44
作者
Xu, Y [1 ]
Yang, JY [1 ]
Jin, Z [1 ]
机构
[1] Nanjing Univ Sci & Technol, Dept Comp Sci, Nanjing 210094, Peoples R China
基金
中国国家自然科学基金;
关键词
Fisher criterion; Foley-Sammon linear discriminant analysis; uncorrelated linear discriminant analysis;
D O I
10.1016/S0031-3203(03)00157-2
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
It is first revealed that the Fisher criterion ratio of each FSLDA discriminant vector must not be less than that of corresponding ULDA discriminant vector. So, the phenomenon in Yang et al. (Pattern Recognition 35 (2002) 2665) is not strange but certain, and must be available in all experiments! In addition, it is also first illustrated that in fact ULDA discriminant vectors are the S-t- orthogonal eigenvectors of a generalized eigenequation. As a result, the algorithms to obtain S-t- orthogonal eigenvectors of the generalized eigenequation are equivalent to the ULDA algorithm. Consequently, it is possible to work out ULDA discriminant vectors more efficiently. (C) 2003 Pattern Recognition Society. Published by Elsevier Ltd. All rights reserved.
引用
收藏
页码:3031 / 3033
页数:3
相关论文
共 5 条
[1]  
Cheng Y.P., 2002, Matrix Theory
[2]  
DING XR, 1985, MATRIX THEORY
[3]   OPTIMAL SET OF DISCRIMINANT VECTORS [J].
FOLEY, DH ;
SAMMON, JW .
IEEE TRANSACTIONS ON COMPUTERS, 1975, C 24 (03) :281-289
[4]   Face recognition based on the uncorrelated discriminant transformation [J].
Jin, Z ;
Yang, JY ;
Hu, ZS ;
Lou, Z .
PATTERN RECOGNITION, 2001, 34 (07) :1405-1416
[5]   What's wrong with Fisher criterion? [J].
Yang, J ;
Yang, JY ;
Zhang, D .
PATTERN RECOGNITION, 2002, 35 (11) :2665-2668