A State-of-the-Art Survey on Face Recognition Methods

Face recognition is one of the biometric identification methods with the highest potential. The existing face recognition algorithms relying on the texture information of face images are affected greatly by the variation of expression, scale and illumination. Whereas the algorithms based on the shape topology weaken the influence of illumination to some extent, but the impact of expression, scale and illumination on face recognition is still unsolved. To this end, we propose a new method for face recognition by integrating texture information with shape information, called biview face recognition algorithm. The texture models are constructed by using subspace learning methods and shape topologies are formed by building graphs for face images. The proposed biview face recognition method is compared with recognition algorithms merely based on texture or shape information. Experimental results of recognizing faces under the variation of illumination, expression and scale demonstrate that the performance of the proposed biview face recognition outperforms texture-based and shape-based algorithms.

In this paper, face recognition algorithms under three low-quality conditions, namely, complex illumination, low resolution and partial occlusion, are summarized, and relatively new face recognition algorithms under low-quality conditions are introduced and explained. Such as the algorithm of face recognition with occlusion based on partition, face recognition algorithm based on Iteratively Reweighted Robust Principal Component and face recognition with occlusion based on MEBML, illumination face recognition based on RPCA and Convolutional Neural Network, face recognition based on Illumination Normalization and Block-based Adaptive Local Ternary Pattern, low-resolution face recognition based on blocking CS-LBP and weighted PCA algorithm, pose Robust low-resolution face recognition via CKEDA and other face recognition algorithm under low-quality conditions. The existing problems and development trend of face recognition under low quality conditions are analyzed.

Attendance marking in a classroom during a lecture is not only a onerous task but also a time consuming one at that. Due to an unusually high number of students present during the lecture there will always be a probability of proxy attendance(s).Attendance marking with conventional methods has been an area of challenge. The growing need of efficient and automatic techniques of marking attendance is a growing challenge in the area of face recognition. In recent years, the problem of automatic attendance marking has been widely addressed through the use of standard biometrics like fingerprint and Radio frequency Identification tags etc., However,these techniques lack the element of reliability. In this proposed project an automated attendance marking and management system is proposed by making use of face detection and recognition algorithms. Instead of using the conventional methods, this proposed system aims to develop an automated system that records the student’s attendance by using facial recognition technology. The main objective of this work is to make the attendance marking and management system efficient, time saving, simple and easy. Here faces will be recognized using face recognition algorithms. The processed image will then be compared against the existing stored record and then attendance is marked in the database accordingly. Compared to existing system traditional attendance marking system, this system reduces the workload of people. This proposed system will be implemented with 4 phases such as Image Capturing, Segmentation of group image and Face Detection, Face comparison and Recognition, Updating of Attendance in database.

Chapter 10 - Local plastic surgery-based face recognition using convolutional neural networks

The last decade has seen automatic face recognition evolve from small-scale research systems to a wide range of commercial products. Driven by the FERET face database and evaluation protocol, the currently best commercial systems achieve verification accuracies comparable to those of fingerprint recognizers. In these experiments, only frontal face images taken under controlled lighting conditions were used. As the use of face recognition systems expands toward less restricted environments, the development of algorithms for view and illumination invariant face recognition becomes important. However, the performance of current algorithms degrades significantly when tested across pose and illumination, as documented in a number of evaluations. In this chapter, we review previously proposed algorithms for pose and illumination invariant face recognition. We then describe in detail two successful appearance-based algorithms for face recognition across pose, eigen light-fields, and Bayesian face subregions. We furthermore show how both of these algorithms can be extended toward face recognition across pose and illumination.

Face recognition algorithm is a very promising technique in biometric authentication. However, the recognition precision can be affected by many factors, such as feature extraction method and classifier selection. In this paper, a novel algorithm for face recognition is presented according to the advances of the wavelet decomposition technique and the Support Vector Machines (SVM) model. The extracted features from human images by wavelet decomposition are less sensitive to facial expression variation. As a classifier, SVM provides high generation performance without transcendental knowledge. First, we detect the face region using an improved AdaBoost algorithm. Second, we extract the appropriate features of the face by wavelet decomposition, and compose the face feature vectors as input to SVM. Third, we train the SVM model by the face feature vectors, and then use the trained SVM model to classify the human face. In the training process, three different kernel functions are adopted: Radial basis function, Polynomial and Linear kernel function. Finally, we present a face recognition system that can achieve high recognition precision and fast recognition speed in practice. Experimental results indicate that the proposed method can achieve recognition precision of 96.78 percent based on 96 persons in Ren-FEdb database that is higher than other approaches.

Our sense of ourselves is inextricably linked to our looks. It’s required for everyday interactions, communication, and other routine duties. Face recognition algorithms that are both durable and perfect are required to construct fully automated systems that analyse the data contained in face photographs, and a variety of methodologies are currently being used. Partial facial occlusion is one of the most difficult challenges in face recognition. In real-world applications, face recognition algorithms can recognize faces hidden under masks, scarves, or sunglasses, hands on the face, things carried by a person, or external sources. The outcome, when compared to other existing algorithms, produces the best results. When utilising the suggested dataset, they provide high accuracy and a low loss function. With both trainable and non-trainable parameters, the suggested model performs admirably. The above-average accuracy of 80% indicates a strong performance in facial recognition. Face recognition from video and photos is extremely important.

Facial recognition is a feature that uses facial detection algorithms to detect a face and then invokes facial recognition algorithms to try to match the person’s face. First, a person’s face needs to be enrolled; during enrollment, the person’s facial details are saved in a database—in this case, a mobile phone. The facial recognition algorithm uses this database to match the currently presented face with the faces saved in the database. The efficiency of a facial recognition algorithm depends upon the speed at which it can detect and recognize faces. The problem we address in this paper is that a reliable, automated method for testing facial recognition features in mobile phones. Because the multimedia capabilities of smartphones have expanded phenomenally, the need for thoroughly testing facial recognition algorithms has become crucial. The uses of facial recognition can range from facial authentication for unlocking phones to security for a number of other applications. To meet these needs, a reliable, automated test for validating the facial recognition algorithms must be developed. The challenge for the software test team was to automate the test cases, which involve tilting the phone at specific angles from the test subject. The permissible angular movements of the phone are determined by the algorithmic specifications of the facial recognition algorithm. We tested scenarios involving multiple faces, motion blur, panning the phone in front of the test subject faces at various speeds, and so on. We adopted a robotic arm to perform the facial recognition test cases and developed software to program the robotic arm to test the phone’s facial recognition software for functionality, performance, and stability as well as adversarial tests. This paper discusses the computer vision use case for facial recognition and describes how we developed an automated facial recognition test suite using a robotic arm.

Over the years, face recognition has been the research topic that has attracted many researchers around the world. One of the most significant applications of face recognition is the access control system. The access control system allows authorized persons to enter or exit certain or restricted areas. As a result, it will increase the security situation without over-investment in staff security. The access information can be the identification, time, and location, etc. It can be used to carry out human resource management tasks such as attendance and inspection of employees in a more fair and transparent manner. Although face recognition has been widely used in access control systems because of its better accuracy and convenience without requiring too much user cooperation, the 2D-based face recognition systems also retain many limitations due to the variations in pose and illumination. By analyzing facial geometries, 3D facial recognition systems can theoretically overcome the disadvantages of prior 2D methods and improve robustness in different working conditions. In this paper, we propose the 3D facial recognition algorithm for use in an access control system. The proposed algorithm includes the preprocessing, feature extraction, and classification stages. The application of the proposed access control system is the automatic sliding door, the controller of the system, the web-based monitoring, control, and storage of data.

In recent years, large databases of natural images have become increasingly popular in the evaluation of face and object recognition algorithms. However, Pinto et al. previously illustrated an inherent danger in using such sets, showing that an extremely basic recognition system, built on a trivial feature set, was able to take advantage of low-level regularities in popular object and face recognition sets, performing on par with many state-of-the-art systems. Recently, several groups have raised the performance “bar” for these sets, using more advanced classification tools. However, it is difficult to know whether these improvements are due to progress towards solving the core computational problem, or are due to further improvements in the exploitation of low-level regularities. Here, we show that even modest optimization of the simple model introduced by Pinto et al. using modern multiple kernel learning (MKL) techniques once again yields “state-of-the-art” performance levels on a standard face recognition set (“labeled faces in the wild”). However, at the same time, even with the inclusion of MKL techniques, systems based on these simple features still fail on a synthetic face recognition test that includes more “realistic” view variation by design. These results underscore the importance of building test sets focussed on capturing the central computational challenges of real-world face recognition.

In recent years, technologies related to face recognition have achieved rapid development. Face recognition Algorithms using Convolutional Neural Network (CNN) in the field of deep learning have been improved compared with traditional ones in terms of recognition accuracy, anti-interference ability and the speediness of identification. The mature face recognition technology now plays a decisive role in many areas, and also one of the key technologies in the facilitation of unmanned supermarkets. However, most algorithms nowadays just use the face database in unrestricted scenes to train, verify and evaluate. Their performance in practical applications is not satisfactory enough. In this paper, we eager to find a face recognition algorithm and system that are more suitable for unmanned supermarket scenes. After in-depth analysis of the scene, we find out that motion blur and large-scale recognition are two important reasons why current algorithms do not perform well. Aim to solve these problems, we summarize and propose new algorithms based on the existing ones. The experimental results show that the algorithm has effective face recognition ability in unmanned supermarket.

Due to its wide applications in practice, face recognition has been an active research topic. With the availability of adequate training samples, many machine learning methods could yield high face recognition accuracy. However, under the circumstance of inadequate training samples, especially the extreme case of having only a single training sample, face recognition becomes challenging. How to deal with conflicting concerns of the small sample size and high dimensionality in one-sample face recognition is critical for its achievable recognition accuracy and feasibility in practice. Being different from the conventional methods for global face recognition based on generalization ability promotion and local face recognition depending on image segmentation, a single-sample face recognition algorithm based on locality preserving projection (LPP) feature transfer is proposed here. First, transfer sources are screened to obtain the selective sample source using the whitened cosine similarity metric. Second, we project the vectors of source faces and target faces into feature subspace by LPP, respectively, and calculate the feature transfer matrix to approximate the mapping relationship on source faces and target faces in subspace. Then, the feature transfer matrix is used on training samples to transfer the original macro characteristics to target macro characteristics. Finally, the nearest neighbor classifier is used for face recognition. Our results based on popular databases FERET, ORL, and Yale demonstrate the superiority of the proposed LPP feature transfer-based one-sample face recognition algorithm when compared with popular single-sample face recognition algorithms, such as (PC) $^{2}\text{A}$ and Block FLDA.

Face recognition technology has evolved as a popular identification technique to perform verification of human identity. By using the feature extraction methods and dimensionality reduction techniques in the pattern recognition applications, a number of facial recognition systems has been produced with distinct measure of success. Various face recognition algorithms and their extensions, have been proposed in the past three decades. However, face recognition faces challenging problems in real life applications because of the variation in the illumination of the face images. In the recent years, the research is focused towards Illumination-invariant face recognition system and many approaches have been proposed. But, there are several issues in face recognition across illumination variation which still remains unsolved. This paper provides a research on an efficient illumination-invariant face recognition system using Discrete Cosine Transform (DCT) and Principal Component Analysis (PCA). For processing the illumination invariant image, low frequency components of DCT are used to normalize the illuminated image, odd and even components of DCT is used for compensation in illumination variation and PCA is used for recognition of face images. The existing approaches in illumination Invariant face recognition are comprehensively reviewed and discussed. The proposed approach is validated with Yale Face Database B. Experimental results demonstrate the effectiveness of this approach in the performance of face recognition.

Facial recognition methods were first explored in security systems to identify and compare human faces and is far superior compared to biometric and iris recognition, this technique has been implemented in iris recognition, image detection etc. Recently these methods have been explored in other fields of study and have become a commercial identification and marketing tool. This paper describes the different algorithms of facial recognition and compared their recognition accuracies. The face is detected through Haar Cascades algorithm which is saved into a database, after that, the study intended to compare facial recognition accuracy of the well-known algorithms Eigen faces with PCA, SVM, KNN, and CNN. The results showed out of the three algorithms we used CNN yielded the maximum accuracy.

In this paper, we report a comprehensive study of two well evolved and developed learning algorithms for effective Face Recognition (FR); viz. the Hidden Markov Model (HMM) and Support Vector Machines (SVM). It is evident that, the accuracy of recognition and efficiency in terms of time and speed of a FR system are directly proportional to the competency of the underlying learning algorithms. Here, we propose to compare the two acclaimed method stated above. A component-based approach is adapted to train face images for recognition. Each face image is divided into sub-states for both HMM and SVM algorithm. In attempt to achieve better rates of recognition, all face images are pre-processed and resizing which helps in reducing the overall complexity of the FR system. We run this proposed system against benchmarks accredited by previous researches.