Random subspaces and subsampling for 2-D face recognition

@inproceedings{citeulike:1399037, 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.}, author = {Chawla, N. V. and Bowyer, K. W. }, citeulike-article-id = {1399037}, journal = {Computer Vision and Pattern Recognition, 2005. CVPR 2005. IEEE Computer Society Conference on}, keywords = {random, subspaces}, pages = {582--589 vol. 2}, posted-at = {2007-06-19 18:57:12}, priority = {2}, title = {Random subspaces and subsampling for 2-D face recognition}, url = {http://ieeexplore.ieee.org/xpls/abs\_all.jsp?arnumber=1467494}, volume = {2}, year = {2005} }

TY - CONF ID - citeulike:1399037 L3 - citeulike-article-id:1399037 TI - Random subspaces and subsampling for 2-D face recognition JF - Computer Vision and Pattern Recognition, 2005. CVPR 2005. IEEE Computer Society Conference on VL - 2 SP - 582 EP - 589 vol. 2 N2 - 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. KW - random KW - subspaces AU - Chawla, NV AU - Bowyer, KW PY - 2005/// UR - http://ieeexplore.ieee.org/xpls/abs_all.jsp?arnumber=1467494 ER -