Recognizing Partially Occluded Faces from a Single Sample Per Class Using String-Based Matching

No Thumbnail Available
File version
Author(s)
Chen, Weiping
Gao, Yongsheng
Griffith University Author(s)
Primary Supervisor
Other Supervisors
Editor(s)

Daniilidis, K

Maragos, P

Paragios, N

Date
2010
Size
File type(s)
Location

Heraklion, GREECE

License
Abstract

Automatically recognizing human faces with partial occlusions is one of the most challenging problems in face analysis community. This paper presents a novel string-based face recognition approach to address the partial occlusion problem in face recognition. In this approach, a new face representation, Stringface, is constructed to integrate the relational organization of intermediate-level features (line segments) into a high-level global structure (string). The matching of two faces is done by matching two Stringfaces through a string-to-string matching scheme, which is able to efficiently find the most discriminative local parts (substrings) for recognition without making any assumption on the distributions of the deformed facial regions. The proposed approach is compared against the state-of-the-art algorithms using both the AR database and FRGC (Face Recognition Grand Challenge) ver2.0 database. Very encouraging experimental results demonstrate, for the first time, the feasibility and effectiveness of a high-level syntactic method in face recognition, showing a new strategy for face representation and recognition.

Journal Title
Conference Title

COMPUTER VISION-ECCV 2010, PT III

Book Title
Edition
Volume

6313

Issue

PART 3

Thesis Type
Degree Program
School
Publisher link
Patent number
Funder(s)
Grant identifier(s)
Rights Statement
Rights Statement
Item Access Status
Note
Access the data
Related item(s)
Subject
Persistent link to this record
Citation