Linear subspace methods in face recognition

Nguyen, Hieu (2011) Linear subspace methods in face recognition. PhD thesis, University of Nottingham.

[img]
Preview
PDF - Requires a PDF viewer such as GSview, Xpdf or Adobe Acrobat Reader
Download (5MB) | Preview

Abstract

Despite over 30 years of research, face recognition is still one of the most difficult problems in the field of Computer Vision. The challenge comes from many factors affecting the performance of a face recognition system: noisy input, training data collection, speed-accuracy trade-off, variations in expression, illumination, pose, or ageing. Although relatively successful attempts have been made for special cases, such as frontal faces, no satisfactory methods exist that work under completely unconstrained conditions. This thesis proposes solutions to three important problems: lack of training data, speed-accuracy requirement, and unconstrained environments.

The problem of lacking training data has been solved in the worst case: single sample per person. Whitened Principal Component Analysis is proposed as a simple but effective solution. Whitened PCA performs consistently well on multiple face datasets.

Speed-accuracy trade-off problem is the second focus of this thesis. Two solutions are proposed to tackle this problem. The first solution is a new feature extraction method called Compact Binary Patterns which is about three times faster than Local Binary Patterns. The second solution is a multi-patch classifier which performs much better than a single classifier without compromising speed.

Two metric learning methods are introduced to solve the problem of unconstrained face recognition. The first method called Indirect Neighourhood Component Analysis combines the best ideas from Neighourhood Component Analysis and One-shot learning. The second method, Cosine Similarity Metric Learning, uses Cosine Similarity instead of the more popular Euclidean distance to form the objective function in the learning process. This Cosine Similarity Metric Learning method produces the best result in the literature on the state-of-the-art face dataset: the Labelled Faces in the Wild dataset.

Finally, a full face verification system based on our real experience taking part in ICPR 2010 Face Verification contest is described. Many practical points are discussed.

Item Type: Thesis (University of Nottingham only) (PhD)
Supervisors: Bai, Li
Keywords: human face recognition, linear subspace methods
Subjects: Q Science > QA Mathematics > QA 75 Electronic computers. Computer science
T Technology > TA Engineering (General). Civil engineering (General)
Faculties/Schools: UK Campuses > Faculty of Science > School of Computer Science
Item ID: 12330
Depositing User: EP, Services
Date Deposited: 28 Mar 2012 10:11
Last Modified: 13 Sep 2016 13:35
URI: http://eprints.nottingham.ac.uk/id/eprint/12330

Actions (Archive Staff Only)

Edit View Edit View