Face Recognition with Improved Pairwise Coupling Support Vector Machines
When dealing with multi-class classification tasks, a popular and applicable way is to decompose the original problem into a set of binary subproblems. The most well-known decomposition strategy is one-against-one and the corresponding widely-used method to recombine the outputs of all binary classi...
Gespeichert in:
Hauptverfasser: | , , |
---|---|
Format: | Tagungsbericht |
Sprache: | eng |
Schlagworte: | |
Online-Zugang: | Volltext |
Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
Zusammenfassung: | When dealing with multi-class classification tasks, a popular and applicable way is to decompose the original problem into a set of binary subproblems. The most well-known decomposition strategy is one-against-one and the corresponding widely-used method to recombine the outputs of all binary classifiers is pairwise coupling (PWC). However PWC has an intrinsic shortcoming; many meaningless partial classification results contribute to the global prediction result. In this paper, this problem is tackled by the use of correcting classifiers. A novel algorithm is proposed which works in two steps: First the original pairwise probabilities are converted into a new set of pairwise probabilities, then pairwise coupling is employed to construct the global posterior probabilities. This algorithm is applied to face recognition on the ORL face database, experimental results show that it is effective and efficient. |
---|---|
ISSN: | 0302-9743 1611-3349 |
DOI: | 10.1007/11494669_114 |