A survey of face recognition algorithms and testing results

Automated face recognition (AFR) has received increased attention. We describe two general approaches to the problem and discuss their effectiveness and robustness with respect to several possible applications. We also discuss some issues of run-time performance. The AFR technology falls into three main subgroups, which represent more-or-less independent approaches to the problem: neural network solutions, eigenface solutions, and wavelet/elastic matching solutions. Each of these first requires that a facial image be identified in a scene, a process called segmentation. The image should be normalized to some extent. Normalization is usually a combination of linear translation, rotation and scaling, although the elastic matching method includes spatial transformations.

[1]  Joachim M. Buhmann,et al.  Distortion Invariant Object Recognition in the Dynamic Link Architecture , 1993, IEEE Trans. Computers.

[2]  Hyeonjoon Moon,et al.  The FERET evaluation methodology for face-recognition algorithms , 1997, Proceedings of IEEE Computer Society Conference on Computer Vision and Pattern Recognition.

[3]  L Sirovich,et al.  Low-dimensional procedure for the characterization of human faces. , 1987, Journal of the Optical Society of America. A, Optics and image science.

[4]  Francis Galton,et al.  Personal Identification and Description , 2022, Nature.

[5]  Sandor Z. Der,et al.  FERET (Face Recognition Technology) Recognition Algorithm Development and Test Results. , 1996 .

[6]  Jun Zhang,et al.  Pace recognition: eigenface, elastic matching, and neural nets , 1997, Proc. IEEE.

[7]  M. Turk,et al.  Eigenfaces for Recognition , 1991, Journal of Cognitive Neuroscience.

[8]  Alex Pentland,et al.  Human Face Recognition and the Face Image Set's Topology , 1994 .