Boosting Graph Embedding with Application to Facial Expression Recognition

As a general framework in feature extract technology, Graph embedding has been paid much attention. Integrate graph embedding with boosting method is a potential developing way. We are the first successfully attempt to incorporate these two technology together. Further more, a new adjacency graph weighting method called “classification graph” was proposed. By using this more suitable graph, the performance of the boosting graph embedding was improved. Experiment results demonstrate the efficient of our approach.

[1]  Konstantinos N. Plataniotis,et al.  Ensemble-based discriminant learning with boosting for face recognition , 2006, IEEE Transactions on Neural Networks.

[2]  Xiaofei He,et al.  Locality Preserving Projections , 2003, NIPS.

[3]  S T Roweis,et al.  Nonlinear dimensionality reduction by locally linear embedding. , 2000, Science.

[4]  Anil K. Jain,et al.  Artificial neural networks for feature extraction and multivariate data projection , 1995, IEEE Trans. Neural Networks.

[5]  Stephen Lin,et al.  Graph Embedding and Extensions: A General Framework for Dimensionality Reduction , 2007, IEEE Transactions on Pattern Analysis and Machine Intelligence.

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

[7]  J. Tenenbaum,et al.  A global geometric framework for nonlinear dimensionality reduction. , 2000, Science.