Classification by pairwise coupling
NIPS '97 Proceedings of the 1997 conference on Advances in neural information processing systems 10
Support vector machines applied to face recognition
Proceedings of the 1998 conference on Advances in neural information processing systems II
The FERET Evaluation Methodology for Face-Recognition Algorithms
IEEE Transactions on Pattern Analysis and Machine Intelligence
IEEE Transactions on Pattern Analysis and Machine Intelligence
Improved Pairwise Coupling Classification with Correcting Classifiers
ECML '98 Proceedings of the 10th European Conference on Machine Learning
Reducing Multiclass to Binary: A Unifying Approach for Margin Classifiers
ICML '00 Proceedings of the Seventeenth International Conference on Machine Learning
Solving multiclass learning problems via error-correcting output codes
Journal of Artificial Intelligence Research
Hi-index | 0.00 |
In face recognition, a simple classifier such as k-NN is frequently used. For a robust system, it is common to construct the multi-class classifier by combining the outputs of several binary ones. The two basic schemes for this purpose are known as one-per-class (OPC) and pairwise coupling (PWC). The performance of decomposition methods depends on accuracy of base dichotomizers. Support vector machine is suitable for this purpose. In this paper, we give the strength and weakness of two representative decomposition methods, OPC and PWC. We also introduce a new method combining OPC and PWC with rejection based on the analysis of OPC and PWC using SVM as base classifiers. The experimental results on the ORL face database show that our proposed method can reduce the error rate on the real dataset.