Pairwise Face Recognition

Abstract

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.

Cite

Text

Guo et al. "Pairwise Face Recognition." IEEE/CVF International Conference on Computer Vision, 2001. doi:10.1109/ICCV.2001.937637

Markdown

[Guo et al. "Pairwise Face Recognition." IEEE/CVF International Conference on Computer Vision, 2001.](https://mlanthology.org/iccv/2001/guo2001iccv-pairwise/) doi:10.1109/ICCV.2001.937637

BibTeX

@inproceedings{guo2001iccv-pairwise,
  title     = {{Pairwise Face Recognition}},
  author    = {Guo, Guodong and Zhang, HongJiang and Li, Stan Z.},
  booktitle = {IEEE/CVF International Conference on Computer Vision},
  year      = {2001},
  pages     = {282-287},
  doi       = {10.1109/ICCV.2001.937637},
  url       = {https://mlanthology.org/iccv/2001/guo2001iccv-pairwise/}
}