An Optimization Criterion for Generalized Marginal Fisher Analysis on Undersampled Problems

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.

Nearest-neighbor classifier motivated marginal discriminant projections for face recognition

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.

General moving objects recognition method based on graph embedding dimension reduction algorithm

Effective and robust recognition and tracking of objects are the key problems in visual surveillance systems. Most existing object recognition methods were designed with particular objects in mind. This study presents a general moving objects recognition method using global features of targets. Targets are extracted with an adaptive Gaussian mixture model and their silhouette images are captured and unified. A new objects silhouette database is built to provide abundant samples to train the subspace feature. This database is more convincing than the previous ones. A more effective dimension reduction method based on graph embedding is used to obtain the projection eigenvector. In our experiments, we show the effective performance of our method in addressing the moving objects recognition problem and its superiority compared with the previous methods.