ML Anthology

Finding Faces in Cluttered Scenes Using Labeled Random Graph Matching

Thomas K. Leung, Michael C. Burl, Pietro Perona
ICCV 1995 pp. 637-644
doi:10.1109/ICCV.1995.466878 /iccv/1995/leung1995iccv-finding/

Abstract

An algorithm for locating quasi-frontal views of human faces in cluttered scenes is presented. The algorithm works by coupling a set of local feature detectors with a statistical model of the mutual distances between facial features it is invariant with respect to translation, rotation (in the plane), and scale and can handle partial occlusions of the face. On a challenging database with complicated and varied backgrounds, the algorithm achieved a correct localization rate of 95% in images where the face appeared quasi-frontally.< <ETX xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">&gt;</ETX>

PDF ICCV Semantic Scholar

Cite

Text

Leung et al. "Finding Faces in Cluttered Scenes Using Labeled Random Graph Matching." IEEE/CVF International Conference on Computer Vision, 1995. doi:10.1109/ICCV.1995.466878

Markdown

[Leung et al. "Finding Faces in Cluttered Scenes Using Labeled Random Graph Matching." IEEE/CVF International Conference on Computer Vision, 1995.](https://mlanthology.org/iccv/1995/leung1995iccv-finding/) doi:10.1109/ICCV.1995.466878

BibTeX

@inproceedings{leung1995iccv-finding,
  title     = {{Finding Faces in Cluttered Scenes Using Labeled Random Graph Matching}},
  author    = {Leung, Thomas K. and Burl, Michael C. and Perona, Pietro},
  booktitle = {IEEE/CVF International Conference on Computer Vision},
  year      = {1995},
  pages     = {637-644},
  doi       = {10.1109/ICCV.1995.466878},
  url       = {https://mlanthology.org/iccv/1995/leung1995iccv-finding/}
}