We develop a pairwise classification framework for face recognition, in which a C class face recognition problem is divided into a set of C(C-1)/2 two class problems. Such a problem decomposition not only leads to a set of simpler classification problems to be solved, thereby increasing overall classification accuracy, but also provides a framework for independent feature selection for each pair of classes. A simple feature ranking strategy is used to select a small subset of the features for each pair of classes. Furthermore, we evaluate two classification methods under the pairwise comparison framework: the Bayes classifier and the AdaBoost. Experiments on a large face database with 1079 face images of 137 individuals indicate that 20 features are enough to achieve a relatively high recognition accuracy, which demonstrates the effectiveness of the pairwise recognition framework.
Pairwise face recognition
Proceedings Eighth IEEE International Conference on Computer Vision. ICCV 2001 ; 2 ; 282-287 vol.2
2001-01-01
584998 byte
Conference paper
Electronic Resource
English
British Library Conference Proceedings | 2001
|British Library Online Contents | 2003
|Pairwise Coupling for Machine Recognition of Hand-Printed Japanese Characters
British Library Conference Proceedings | 2001
|IEEE | 2005
|