To improve the efficiency of null space based algorithm
a new fast implementation of null space based algorithm(FINBSA)is presented. FINBSA is carried out without any eigen-decomposition computing and singular value decomposition
by only one step of orthogonal-triangular(QR)decomposition to obtain the optimal projection matrix. Thus the computational complexity of this algorithm gets much lower than that of the other null space based ones. The experiments on PIE face database demonstrate that the recognition accuracy of FINBSA is equivalent to the other null space based algorithms
but FINBSA is more efficient especially for large size of training samples
and the running period of FINBSA is over 100% lower than that of the other existing null space based algorithms.
关键词
Keywords
references
RAUDYS S J, JAIN A K. Small sample size effects in statistical pattern recognition: recommendations for practitioners[J]. IEEE Trans on Pattern Analysis and Machine Intelligence, 1991, 13(3): 252-264.
MARTINEZ A M, KAK A C. PCA versus LDA[J]. IEEE Trans on Pattern Analysis and Machine Intelligence, 2001, 23(2): 228-233.
BELHUMEOUR P N, HESPANHA J P, KRIEGMAN D J. Eigenfaces vs. fisherfaces: recognition using class specific linear projection[J]. IEEE Trans on Pattern Analysis and Machine Intelligence, 1997, 19(7): 711-720.
YU Hua, YANG Jie. A direct LDA algorithm for high-dimensional data with application to face recognition [J]. Pattern Recognition, 2001, 34(10): 2067-2070.
YANG Jian, ZHANG D, FRANGI A F, et al. Two-dimensional PCA: a new approach to appearance-based face representation and recognition[J]. IEEE Trans on Pattern Analysis and Machine Intelligence, 2004, 26(1): 131-137.
YANG Jian, YANG Jingyu. Uncorrelated image projection discriminant analysis and face recognition [J]. Journal of Computer Research and Development, 2003, 40(3): 447-452
CHEN L F, LIAO H Y M, KO M T, et al. A new LDA-based face recognition system which can solve the small sample size problem[J]. Pattern Recognition, 2000, 33(10): 1713-1726.
HUANG R, LIU Q, LU H, et al, Solving the small size problem of LDA[C]∥Proc of 16th Inter Conf on Pattern Recognition. Piscataway, NJ, USA: IEEE Computer Society, 2002: 29-32.
GOLUB G H, LOAN C F V. Matrix computations [M]. 3rd ed. Baltimore, Maryland, USA: The Johns Hopkins University Press, 1996:253-254.
CHU Delin, THYE G S. A new and fast implementation for null space based linear discriminant analysis[J]. Pattern Recognition, 2010, 43(4): 1373-1379.
WENG Juyang, ZHANG Yilu, HWANG Wey-Shiuan. Candid covariance-free incremental principal component analysis[J]. IEEE Trans on Pattern Analysis and Machine Intelligence, 2003, 25(8): 1034-1040.