Marginal Fisher analysis （MFA） not only aims to maintain the original relations of neighboring data points of the same class but also wants to keep away neighboring data points of the different classes.MFA can effec...Marginal Fisher analysis （MFA） not only aims to maintain the original relations of neighboring data points of the same class but also wants to keep away neighboring data points of the different classes.MFA can effectively overcome the limitation of linear discriminant analysis （LDA） due to data distribution assumption and available projection directions.However,MFA confronts the undersampled problems.Generalized marginal Fisher analysis （GMFA） based on a new optimization criterion is presented,which is applicable to the undersampled problems.The solutions to the proposed criterion for GMFA are derived,which can be characterized in a closed form.Among the solutions,two specific algorithms,namely,normal MFA （NMFA） and orthogonal MFA （OMFA）,are studied,and the methods to implement NMFA and OMFA are proposed.A comparative study on the undersampled problem of face recognition is conducted to evaluate NMFA and OMFA in terms of classification accuracy,which demonstrates the effectiveness of the proposed algorithms.展开更多
Marginal Fisher analysis （MFA） is a repre- sentative margin-based learning algorithm for face recognition. A major problem in MFA is how to select appropriate parameters, k1 and k2, to construct the respective intri...Marginal Fisher analysis （MFA） is a repre- sentative margin-based learning algorithm for face recognition. A major problem in MFA is how to select appropriate parameters, k1 and k2, to construct the respective intrinsic and penalty graphs. In this paper, we propose a novel method called nearest-neighbor （NN） classifier motivated marginal discriminant projections （NN-MDP）. Motivated by the NN classifier, NN-MDP seeks a few projection vectors to prevent data samples from being wrongly categorized. Like MFA, NN-MDP can characterize the compactness and separability of samples simultaneously. Moreover, in contrast to MFA, NN-MDP can actively construct the intrinsic graph and penalty graph without unknown parameters. Experimental results on the 0RL, Yale, and FERET face databases show that NN-MDP not only avoids the intractability, and high expense of neighborhood parameter selection, but is also more applicable to face recognition with NN classifier than other methods.展开更多
基金supported by Science Foundation of the Fujian Province of China (No. 2010J05099)
文摘Marginal Fisher analysis （MFA） not only aims to maintain the original relations of neighboring data points of the same class but also wants to keep away neighboring data points of the different classes.MFA can effectively overcome the limitation of linear discriminant analysis （LDA） due to data distribution assumption and available projection directions.However,MFA confronts the undersampled problems.Generalized marginal Fisher analysis （GMFA） based on a new optimization criterion is presented,which is applicable to the undersampled problems.The solutions to the proposed criterion for GMFA are derived,which can be characterized in a closed form.Among the solutions,two specific algorithms,namely,normal MFA （NMFA） and orthogonal MFA （OMFA）,are studied,and the methods to implement NMFA and OMFA are proposed.A comparative study on the undersampled problem of face recognition is conducted to evaluate NMFA and OMFA in terms of classification accuracy,which demonstrates the effectiveness of the proposed algorithms.
文摘Marginal Fisher analysis （MFA） is a repre- sentative margin-based learning algorithm for face recognition. A major problem in MFA is how to select appropriate parameters, k1 and k2, to construct the respective intrinsic and penalty graphs. In this paper, we propose a novel method called nearest-neighbor （NN） classifier motivated marginal discriminant projections （NN-MDP）. Motivated by the NN classifier, NN-MDP seeks a few projection vectors to prevent data samples from being wrongly categorized. Like MFA, NN-MDP can characterize the compactness and separability of samples simultaneously. Moreover, in contrast to MFA, NN-MDP can actively construct the intrinsic graph and penalty graph without unknown parameters. Experimental results on the 0RL, Yale, and FERET face databases show that NN-MDP not only avoids the intractability, and high expense of neighborhood parameter selection, but is also more applicable to face recognition with NN classifier than other methods.
