A fast classification scheme and its application to face recognition
- 132 Downloads
To overcome the high computational complexity in real-time classifier design, we propose a fast classification scheme. A new measure called ‘reconstruction proportion’ is exploited to reflect the discriminant information. A novel space called the ‘reconstruction space’ is constructed according to the reconstruction proportions. A point in the reconstruction space denotes the case of a sample reconstructed using training samples. This is used to search for an optimal mapping from the conventional sample space to the reconstruction space. When the projection from the sample space to the reconstruction space is obtained, a new sample after mapping to the new discriminant space would be classified quickly according to the reconstruction proportions in the reconstruction space. This projection technique results in a diversion of time-consuming calculations from the classification stage to the training stage. Though training time is prolonged, it is advantageous in that classification problems such as identification can be solved in real time. Experimental results on the ORL, Yale, YaleB, and CMU PIE face databases showed that the proposed fast classification scheme greatly outperforms conventional classifiers in classification accuracy and efficiency.
Key wordsReconstruction proportion Reconstruction space Real-time classification Face recognition
Unable to display preview. Download preview PDF.
- Chen, C.J., 2010. Development of a Neural Classifier with Genetic Algorithm for Structural Vibration Suppression. Proc. Int. Conf. on Machine Learning and Cybernetics, p.2788–2795. [doi:10.1109/ICMLC.2010.5580789]Google Scholar
- He, X.F., Niyogi, P., 2003. Locality Preserving Projections. Advances in Neural Information Processing System 16.Google Scholar
- He, X.F., Cai, D., Yan, S.C., Zhang, H.J., 2005. Neighborhood Preserving Embedding. IEEE Int. Conf. on Computer Vision, p.1208–1213. [doi:10.1109/ICCV.2005.167]Google Scholar
- Ho, J., Yang, M., Lim, J., Lee, K., Kriegman, D., 2003. Clustering Appearances of Objects under Varying Illumination Conditions. Proc. IEEE Conf. on Computer Vision and Pattern Recognition, p.11–18. [doi:10.1109/CVPR.2003.1211332]Google Scholar
- Mullin, M., Sukthankar, R., 2000. Complete Cross-Validation for Nearest Neighbor Classifiers. Proc. Int. Conf. on Machine Learning, p.639–646.Google Scholar
- Stefan, A., Athitsos, V., Yuan, Q., Sclaroff, S., 2009. Reducing Jointboost-Based Multiclass Classification to Proximity Search. Proc. IEEE Conf. on Computer Vision and Pattern Recognition, p.589–596. [doi:10.1109/CVPR.2009.5206 687]Google Scholar
- Vincent, P., Bengio, Y., 2002. K-Local Hperplane and Convex Distance Nearest Neighbor Algorithms. Advances in Neural Information Processing Systems, p.985–992.Google Scholar
- Zhang, P., Zhu, X.Q., Tan, J.L., Guo, L., 2010. Classifier and Cluster Ensembles for Mining Concept Drifting Data Streams. Proc. IEEE Int. Conf. on Data Mining, p.1175–1180. [doi:10.1109/ICDM.2010.125]Google Scholar