论文信息 - Laplacian linear discriminant analysis

Laplacian linear discriminant analysis

A novel linear discriminant criterion function is proved to be equal to Fisher's criterion function. The analysis of the function is linked to spectral decomposition of the Laplacian of a graph. Moreover, the function is maximized using two algorithms. Experimental results show the effectiveness and some specific characteristics of our algorithms.

Pengfei Shi | Hong Tang | Tao Fang

[1] P. Shi,et al. Rapid and brief communications: Kernel direct discriminant analysis and its theoretical foundation , 2005 .

[2] Jan van den Heuvel,et al. Using Laplacian Eigenvalues and Eigenvectors in the Analysis of Frequency Assignment Problems , 2001, Ann. Oper. Res..

[3] Jian Yang,et al. KPCA plus LDA: a complete kernel Fisher discriminant framework for feature extraction and recognition , 2005, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[4] Hua Yu,et al. A direct LDA algorithm for high-dimensional data - with application to face recognition , 2001, Pattern Recognit..

[5] Yuxiao Hu,et al. Face recognition using Laplacianfaces , 2005, IEEE Transactions on Pattern Analysis and Machine Intelligence.