Recognizing partially occluded faces from a single sample per class using string-based matching

Authors:
Weiping Chen;Yongsheng Gao
Affiliations:
School of Engineering, Griffith University, Australia;School of Engineering, Griffith University, Australia and National ICT Australia, Queensland Research Lab
Venue:
ECCV'10 Proceedings of the 11th European conference on computer vision conference on Computer vision: Part III
Year:
2010

Citing 11
Cited 2

Dynamic two-strip algorithm in curve fitting

Pattern Recognition
Extended attributed string matching for shape recognition

Computer Vision and Image Understanding
Recognizing Imprecisely Localized, Partially Occluded, and Expression Variant Faces from a Single Sample per Class

IEEE Transactions on Pattern Analysis and Machine Intelligence
Face Recognition Using Line Edge Map

IEEE Transactions on Pattern Analysis and Machine Intelligence
Matching and Retrieval of Distorted and Occluded Shapes Using Dynamic Programming

IEEE Transactions on Pattern Analysis and Machine Intelligence
Overview of the Face Recognition Grand Challenge

CVPR '05 Proceedings of the 2005 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR'05) - Volume 1 - Volume 01
Eigenfaces for recognition

Journal of Cognitive Neuroscience
Face recognition using adaptively weighted patch PZM array from a single exemplar image per person

Pattern Recognition
Robust Face Recognition via Sparse Representation

IEEE Transactions on Pattern Analysis and Machine Intelligence
Robust visual similarity retrieval in single model face databases

Pattern Recognition
Face recognition by independent component analysis

IEEE Transactions on Neural Networks

Image warping for face recognition: From local optimality towards global optimization

Pattern Recognition
Fast and robust face recognition via coding residual map learning based adaptive masking

Pattern Recognition

Quantified Score

Hi-index	0.00

Visualization

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.