Finding faces in cluttered scenes using random labeled graph matching

Author

Leung, T.K. ; Burl, M.C. ; Perona, P.

Author_Institution

California Inst. of Technol., Pasadena, CA, USA

fYear

1995

fDate

20-23 Jun 1995

Firstpage

637

Lastpage

644

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

Keywords

computer vision; face recognition; feature extraction; graph theory; image matching; image recognition; random processes; algorithm; cluttered scenes; complicated backgrounds; correct localization rate; database; face finding; facial feature; images; local feature detectors; mutual distances; partial occlusions; quasi-frontal human face view location; random labeled graph matching; statistical model; varied backgrounds; Computer science; Computer vision; Detectors; Face detection; Face recognition; Facial features; Filters; Image databases; Layout; Mutual coupling;

fLanguage

English

Publisher

ieee

Conference_Titel

Computer Vision, 1995. Proceedings., Fifth International Conference on

Conference_Location

Cambridge, MA

Print_ISBN

0-8186-7042-8

Type

conf

DOI

10.1109/ICCV.1995.466878

Filename

466878