Open AccessA robust two‐stage face recognition system with localisation error compensation
Author(s) -
Su ChingYao,
Yang JarFerr
Publication year - 2014
Publication title -
iet computer vision
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.38
H-Index - 37
eISSN - 1751-9640
pISSN - 1751-9632
DOI - 10.1049/iet-cvi.2013.0281
Subject(s) - computer science , facial recognition system , residual , computation , artificial intelligence , face (sociological concept) , pattern recognition (psychology) , compensation (psychology) , block (permutation group theory) , computer vision , algorithm , mathematics , psychology , social science , geometry , sociology , psychoanalysis
In practical systems, face recognition under unconstrained conditions is a very challenging task, where their input images are first pre‐processed and initially aligned by a face detection algorithm. However, there are still some residual localisation errors after the initial alignment. If we do not take these errors into account, the recognition performance should be greatly degraded for most face recognition algorithms. Generally, when designing a practical face recognition system, we need to compromise the capability of residual error tolerance and the discriminating capability. Although it is feasible to apply an iterative alignment algorithm to fine‐tune alignment, it will increase the computation load significantly. In this study, we propose an adaptive two‐stage face recognition system consisting of two block‐based recognition stages with a relatively larger cell size (i.e. the size of local regions) in the first stage to provide sufficient tolerance for geometric errors followed by a smaller one in the second stage to accurately evaluate a most probable candidate subset, which is adaptively determined according to the proposed confidence measure. In addition, an iterative gradient‐based alignment algorithm is incorporated into the two‐stage system to refine the alignment such that the recognition performance can be improved and the computation load can be saved simultaneously.