Real-Time Face Recognition Using Eigenfaces

In recent years considerable progress has been made in the area of face recognition. Through the development of techniques like eigenfaces, computer can now compute favourably with humans in many face recognition tasks, particularly those in which large databases of faces must be searched. Whilst these methods perform extremely well under constrained conditions, the problem of face recognition under gross variations in expressions, view and lighting remains largely unsolved. This paper details the design of a real-time face recognition system aimed at operating in less constrained environments. The system is capable of single scale recognition with an accuracy of 94% at 2 frames per second. A description of the system's performance and the issues and problems faced during its development is given

Real-Time Face Detection and Recognition

The face has become a popular biometric for identification due to the wide range of features and difficulty in manipulation of the metric. In order to work towards a robust facial recognition system, this work contains a foundation for using the face as a recognition metric. First, faces are detected from still images using a Viola-Jones object detection algorithm. Then, Eigenfaces is applied to the detected faces. The system was tested on face databases as well as real-time feed from a web camera

The Impact of the Number of Eigen-Faces on the Face Recognition Accuracy Using Different Distance Measures

The embedded and real-time systems are the main motivation for this research where the computations are critical to be reduced as much as possible. Face recognition method using eigen-faces yields good accuracy if enough eigen-faces are considered in the classification process. The more eigen-faces used, the more computation power is needed. In this paper, the main goal is to investigate the trade-off between the used number of eigen-faces and the accuracy and the needed computation power of face recognition. Three different distance measures are studied. Namely: Euclidean, block-city, and chess board distances are used. It is concluded that there is some optimum number of eigen-faces that provides the highest recognition rate and acceptable execution time. Moreover, the best number of eigenfaces highly depends on the selected distance measure

Optimizing Face Recognition Using PCA

Principle Component Analysis PCA is a classical feature extraction and data representation technique widely used in pattern recognition. It is one of the most successful techniques in face recognition. But it has drawback of high computational especially for big size database. This paper conducts a study to optimize the time complexity of PCA (eigenfaces) that does not affects the recognition performance. The authors minimize the participated eigenvectors which consequently decreases the computational time. A comparison is done to compare the differences between the recognition time in the original algorithm and in the enhanced algorithm. The performance of the original and the enhanced proposed algorithm is tested on face94 face database. Experimental results show that the recognition time is reduced by 35% by applying our proposed enhanced algorithm. DET Curves are used to illustrate the experimental results.Comment: 9 page

Gradient-orientation-based PCA subspace for novel face recognition

This article has been made available through the Brunel Open Access Publishing Fund.Face recognition is an interesting and a challenging problem that has been widely studied in the field of pattern recognition and computer vision. It has many applications such as biometric authentication, video surveillance, and others. In the past decade, several methods for face recognition were proposed. However, these methods suffer from pose and illumination variations. In order to address these problems, this paper proposes a novel methodology to recognize the face images. Since image gradients are invariant to illumination and pose variations, the proposed approach uses gradient orientation to handle these effects. The Schur decomposition is used for matrix decomposition and then Schurvalues and Schurvectors are extracted for subspace projection. We call this subspace projection of face features as Schurfaces, which is numerically stable and have the ability of handling defective matrices. The Hausdorff distance is used with the nearest neighbor classifier to measure the similarity between different faces. Experiments are conducted with Yale face database and ORL face database. The results show that the proposed approach is highly discriminant and achieves a promising accuracy for face recognition than the state-of-the-art approaches

A comparative study on face recognition techniques and neural network

In modern times, face recognition has become one of the key aspects of computer vision. There are at least two reasons for this trend; the first is the commercial and law enforcement applications, and the second is the availability of feasible technologies after years of research. Due to the very nature of the problem, computer scientists, neuro-scientists and psychologists all share a keen interest in this field. In plain words, it is a computer application for automatically identifying a person from a still image or video frame. One of the ways to accomplish this is by comparing selected features from the image and a facial database. There are hundreds if not thousand factors associated with this. In this paper some of the most common techniques available including applications of neural network in facial recognition are studied and compared with respect to their performance.Comment: 8 page