DocumentCode :
3549147
Title :
Random subspaces and subsampling for 2-D face recognition
Author :
Chawla, N.V. ; Bowyer, K.W.
Author_Institution :
Dept. of Comput. Sci. & Eng., Univ. of Notre Dame, IN, USA
Volume :
2
fYear :
2005
fDate :
20-25 June 2005
Firstpage :
582
Abstract :
Random subspaces are a popular ensemble construction technique that improves the accuracy of weak classifiers. 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.
Keywords :
face recognition; feature extraction; image classification; image sampling; learning (artificial intelligence); face recognition; feature extraction; image classifier; image sampling; random subspace methodology; Classification tree analysis; Computer science; Decision trees; Face recognition; Filtering; Nearest neighbor searches; Pattern recognition; Pixel; Principal component analysis; Testing;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Computer Vision and Pattern Recognition, 2005. CVPR 2005. IEEE Computer Society Conference on
Conference_Location :
San Diego, CA, USA
ISSN :
1063-6919
Print_ISBN :
0-7695-2372-2
Type :
conf
DOI :
10.1109/CVPR.2005.286
Filename :
1467494
Link To Document :
بازگشت