Semi-random subspace method for face recognition
Image and Vision Computing
Actively exploring creation of face space(s) for improved face recognition
AAAI'07 Proceedings of the 22nd national conference on Artificial intelligence - Volume 1
Sort-merge feature selection and fusion methods for classification of unstructured video
ICME'09 Proceedings of the 2009 IEEE international conference on Multimedia and Expo
Coupling adaboost and random subspace for diversified fisher linear discriminant
ICONIP'06 Proceedings of the 13 international conference on Neural Information Processing - Volume Part I
QUEST hierarchy for hyperspectral face recognition
Advances in Artificial Intelligence - Special issue on Machine learning
Hi-index | 0.00 |
Random subspaces are a popular ensemble construction technique that improves the accuracy of weakclassifiers. It has been shown, in different domains, that random subspaces combined with weak classifiers such as decision trees and nearest neighbor classifiers can provide an improvement in accuracy. In this paper, we apply the random subspace methodology to the 2-D face recognition task. The main goal of the paper is to see if the random subspace methodology can do as well, if not better, than the single classifier constructed on the tuned face space. We also propose the use of a validation set for tuning the face space, to avoid bias in the accuracy estimation. In addition, we also compare the random subspace methodology to an ensemble of subsamples of image data. This work shows that a random subspaces ensemble can outperform a well-tuned single classifier for a typical 2-D face recognition problem. The random subspaces approach has the added advantage of requiring less careful tweaking.