Improving face recognition using original and pre-processed features

In this paper, it studies two critical technical links of face detection and face recognition in the recognition of face, and conducts analyses and comparisons on some commonly used face detections and recognition algorithms. Through the collation of this information and the combination of related knowledge in the digital image processing, it proposes a face recognition algorithm based on the singular value decomposition. After preprocessing face images, by the use of the projection method, it obtains positions of five sense organs, and then extracts local feature values near five sense organs as the main features of faces by using the singular value decomposition. For different face images of the same individual, the matching degree of feature values will be very high.KeywordsFace recognitionimage recognitionlocal informationfeature extraction

This study proposes a Fusion, Feature-Level, Face Recognition System (FFLFRS) that is based on the Multi-Resolution, Singular Value Decomposition (MSVD) fusion technique. Face recognition in the FFLFRS is achieved via four processes: face detection, feature extraction, feature fusion, and face classification. In this system, the most significant face features (that is, the eyes, nose, and mouth) are first detected. Then, local and global features are extracted by the Local Binary Pattern (LBP) and Principal Component Analysis (PCA) extraction approaches. Afterwards, the extracted features are fused by the MSVD method and classified by the Artificial Neural Network (ANN). The proposed FFLFRS was verified on 10,000 face images drawn from the face images database of the Olivetti Research Laboratory (ORL). Face recognition performance of this system was contrasted with levels of performance of three state of the art, fusion-level, face recognition systems (FRSs) depending on the Frequency Partition (FP), Laplacian Pyramid (LP), and Covariance Intersection (CI) fusion methods. Ten-thousand images were employed to test the proposed model and assess its performance, which was evaluated in terms of changes in pose, illumination, and expression, besides low resolution and presence of occlusion. The face recognition results of the proposed FFLFRS are encouraging. This system proved to be effective in dealing with images having challenges to face recognition and it could achieve a recognition accuracy as high as 97.78%.

By introducing parameters with local information, several types of orthogonal moments have recently been developed for the extraction of local features in an image. But with the existing orthogonal moments, local features cannot be well-controlled with these parameters. The reason lies in that zeros distribution of these moments' basis function cannot be well-adjusted by the introduced parameters. To overcome this obstacle, a new framework, transformed orthogonal moment (TOM), is set up. Most existing continuous orthogonal moments such as Zernike moments, fractional-order orthogonal moments (FOOMs), etc. are all special cases of TOM. To control the basis function's zeros distribution, a novel local constructor is designed, and local orthogonal moment (LOM) is proposed. Zeros distribution of LOM's basis function can be adjusted with parameters introduced by the designed local constructor. Consequently, locations, where local features extracted from by LOM, are more accurate than those by FOOMs. In comparison with Krawtchouk moments and Hahn moments etc., the range, where local features are extracted from by LOM, is order insensitive. Experimental results demonstrate that LOM can be utilized to extract local features in an image.

The most significant practical challenge for face recognition is perhaps variability in lighting intensity. In this paper, we developed a face recognition which is insensitive to large variation in illumination. Normalization step including two steps, first we used Histogram truncation as a pre-processing step and then we implemented Homomorphic filter. The main idea is that, achieving illumination invariance causes to simplify feature extraction module and increases recognition rate. Then we utilized Fuzzy Linear Discriminant Analysis (FLDA) in feature extraction stage which showed a good discriminating ability compared to other methods while classification is performed using Feedforward Neural Network (FFNN). The experiments were performed on the ORL (Olivetti Research Laboratory) face image database and the results show the present method outweighs other techniques applied on the same database and reported in literature.

Face recognition is an important research area with many potential applications such as biometric security. Among various techniques, eigenface method by principal component analysis (PCA) of face images has been widely used. In traditional eigenface methods, PCA was used to get the eigenvectors of the covariance matrix of a training set of face images and recognition was achieved by applying a template matching scheme with the vectors obtained by projecting new faces along a small number of eigenfaces. In order to avoid the time consuming step of recomputing eigenfaces when new faces are added, we use a set of modules to generate PCA based face representation for each subjects instead of PCA of entire face images. The localized nature of the representation makes the system easy to maintain and tolerant of local facial characteristic changes. Results indicate that the modular scheme yield accurate recognition on the widely used Olivetti Research Laboratory (ORL) face database.

In this paper we investigate the face recognition problem via using the two dimensional locality preserving projection in frequency domain. For this purpose, we first introduce the two-dimensional locality preserving projections (2DLPP) and the two dimensional discrete cosine transform (2DDCT). Then the 2DLPP in frequency domain is proposed for face recognition. In fact, the 2DDCT is used as a pre-processing step and it converts the image signal from time domain into frequency domain aiming to reduce the effects of illumination and pose on face recognition. Then 2DLPP is applied on the upper left corner blocks of the global 2DDCT transform matrices of the original images, which represent the central energy of original images. For demonstration, the Olivetti Research Laboratory (ORL), YALE and FERET face datasets are used to compare the proposed approach with the conventional 2DLPP and 2DDCT approaches with the nearest neighborhood (NN) metric being used for classifiers. The experimental results show that the proposed 2DLPP in frequency domain is superior over the 2DLPP in time domain and 2DDCT in frequency domain.

In this paper, a novel method for independent component analysis (ICA) with 2-D Principle Component Analysis (2DPCA) in face recognition is presented, called 2DPCA-ICA. In this method, 2DPCA is used for dimension reduction, and ICA for recognition. As opposed to the method for ICA based on PCA in face recognition (PCA-ICA), 2DPCA is based on 2-D face image matrix, an image covariance matrix is constructed directly using 2-D image matrix, and its eigenvectors corresponding to the several larger eigenvalues are derived for whitened image matrix. It overcomes the shortcomings of PCA-ICA. To test 2DPCA-ICA and evaluate its performance, experiments are performed on Yale and ORL (Olivetti Research Laboratory) face database. Correct recognition rate of 2DPCA-ICA across all trials is higher than that of PCA-ICA and 2DPCA. Experimental results also show that features of face image extracted are more efficient by way of 2DPCA-ICA. Therefore, 2DPCA-ICA is more valid in face recognition.

This paper proposes an approach combining the set of Krawtchouk moments and HMMs (Hidden Markov Models) for unconstrained offline handwritten Chinese character recognition. The Krawtchouk moments can be effectively used as pattern features in analysis of two-dimensional images. Since the basis set is orthogonal in the discrete domain of the image coordinate space, the implementation of Krawtchouk moments doesn't involve any numerical approximation or coordinate transformation. This property makes Krawtchouk moments superior to conventional, more continuous moments such as Legendre moments and Zernike moments. In the field of character recognition, HMMs architecture has been used widely because of its strong adaptability to written distortion and variability. In this paper, Krawtchouk moments and HMMs are combined to recognize unconstrained offline handwritten Chinese amount in words. Experiments show that the average recognition of Krawtchouk is higher than Zernike and Legendre moments within the HMM framework.

Illumination variation significantly affects the performance of face recognition algorithms. However, it is difficult to construct a database that meets the demand of illumination analysis with current face image database construction technology. The influence of illumination variation on deep face recognition based on 3D face models is investigated. First a new method is presented to produce face images under arbitrary illuminations by using a 3D face model based on face basis image representation theory proposed. Then the database used for illumination analysis is constructed. Afterwards, an optimal way is explored to select illuminations used for constructing a high quality face image database by analyzing the impacts of different illumination sampling strategies on the performances of face recognition models. With the advantage of accurate illumination labeling of virtual data, the performances of different illumination labeling methods on the training of face recognition network are tested on a multi-task learning framework. Through experiments on the effects of different lighting sampling schemes and labeling methods on the performances of face recognition models carried out on virtual data and real data, it is concluded that using an appropriate amount of lightings of basis images to build a database is an effective lighting sampling scheme, and accurate lighting annotation can help further improve the face recognition rate, the corresponding recognition models have face recognition accuracy rates of more than 98% on virtual and real monitoring datasets which contain face images captured under very challenging lighting conditions. Proposed work improve the performance of deep face recognition models, and facilitate the construction of high quality face image databases with various illuminations.

The objective of this project was to assess the performance of the leading commercial-off-the-shelf (COTS) facial recognition software package when used as a laptop application. We performed the assessment to determine the system's usefulness for enrolling facial images in a database from remote locations and conducting real-time searches against a database of previously enrolled images. The assessment involved creating a database of 40 images and conducting 2 series of tests to determine the product's ability to recognize and match subject faces under varying conditions. This report describes the test results and includes a description of the factors affecting the results. After an extensive market survey, we selected Visionics' FaceIt{reg_sign} software package for evaluation and a review of the Facial Recognition Vendor Test 2000 (FRVT 2000). This test was co-sponsored by the US Department of Defense (DOD) Counterdrug Technology Development Program Office, the National Institute of Justice, and the Defense Advanced Research Projects Agency (DARPA). Administered in May-June 2000, the FRVT 2000 assessed the capabilities of facial recognition systems that were currently available for purchase on the US market. Our selection of this Visionics product does not indicate that it is the ''best'' facial recognition software package for all uses. It was the most appropriate package based on the specific applications and requirements for this specific application. In this assessment, the system configuration was evaluated for effectiveness in identifying individuals by searching for facial images captured from video displays against those stored in a facial image database. An additional criterion was that the system be capable of operating discretely. For this application, an operational facial recognition system would consist of one central computer hosting the master image database with multiple standalone systems configured with duplicates of the master operating in remote locations. Remote users could perform real-time searches where network connectivity is not available. As images are enrolled at the remote locations, periodic database synchronization is necessary.

Face recognition technique nowadays is emerging as the most significant and challenging aspects in terms of security for identification of images in various fields viz. banking, police records, biometric etc. other than an individual's thumb and documented identification proofs. Till date for efficient net banking to be initiated, one has to provide the appropriate user name and password for purpose of authentication. This project introduces a vehicle to take a step forward in easy and more reliable authentication of an individual by providing Face Image along with User Name and Password to the system. In this an individual's face is identified by biometric authentication support with which, only a person whose account is, can access it. However while transferring this sensitive data of user image, from client machine to bank server it has to be protected from hackers and intruders from manhandling it, hence it is transferred using covert communication called Wavelet Decomposition based steganography. As face images are affected by different expressions, poses, occlusions, illuminations and aging over a period of time and it differs from the same person than those from different ones is the main difficult task in face recognition. Whenever image information is jointly co-ordinated in three aspects viz. image space, scale and orientation domains they carry much higher clues than seen in each domain individually. In the proposed method combination of Local Binary Pattern (LBP) and Gabor features are used to increase the face recognition performance significantly to compare individual's face presentations. Hence face recognition and representation of Gabor faces are done using E-GV-LBP and CMI-LDA based feature recognition method. Gabor faces uses space, scale and orientation to support accurate face recognition, making net banking easier, authentic, reliable and user friendly.

Machine learning and pattern recognition recently become a hot topic in computing world. This is due to the fast-growing of resources as well as techniques that make it easier to solve machine learning and pattern recognition problems. Problems that require machine learning solutions may be very simple for humans but actually can be very complex for machines to solve them. Face recognition is amongst those problems. Almost all human can easily recognize others without require specific knowledge to do it, different from machines which require its. This paper discussed face recognition task using machine learning strategies which involved Kernel Principal Component Analysis (KPCA) and Support Vector Machine (SVM) to identify person. KPCA extracted features from 2D image input and produced the important features of an image input. The extracted face features are recognized by SVM by classifying human face according to their stored identity in a database. SVM, which was basically a binary classifier worked by using one-against-one strategy to compare the face feature vector of a single test image to the stored face image in a face image database. Experiment results on grayscale images with size 92x112 pixels gave 96.25% of accuracy rate. Hence, KPCA and SVM for face recognition is a robust machine learning method.

In recent years, the Face recognition task has been an active research area in computer vision and biometrics. Many feature extraction and classification algorithms are proposed to perform face recognition. However, the former usually suffer from the wide variations in face images, while the latter usually discard the local facial features, which are proven to be important for face recognition. In this paper, a novel framework based on merging the advantages of the Key points Local Binary/Tetra Pattern (KP-LTrP) and Improved Hough Transform (IHT) with the Improved DragonFly Algorithm-Kernel Ensemble Learning Machine (IDFA-KELM) is proposed to address the face recognition problem in unconstrained conditions. Initially, the face images are collected from the publicly available dataset. Then noises in the input image are removed by performing preprocessing using Adaptive Kuwahara filter (AKF). After preprocessing, the face from the preprocessed image is detected using the Tree-Structured Part Model (TSPM) structure. Then, features, such as KP-LTrP, and IHT are extracted from the detected face and the extracted feature is reduced using the Information gain based Kernel Principal Component Analysis (IG-KPCA) algorithm. Then, finally, these reduced features are inputted to IDFA-KELM for performing FR. The outcomes of the proposed method are examined and contrasted with the other existing techniques to confirm that the proposed IDFA-KELM detects human faces efficiently from the input images.

Dangerous persons can be monitored accurately and quickly using the high-precision recognition of the relative facial images via the image sensors. To increase the recognition rate of face recognition by improving the immune algorithm, the immune computation was redesigned for better face recognition to decrease the facial disturbances of the pose, illumination and expression (PIE), in this paper. The clonal selection algorithm was improved with the modification of the affinity and the algorithm workflow. The improved clonal selection algorithm searches the most similar antibody sample against the antigen of an unknown facial image, according to the affinity between the antigen and the antibody. The unknown facial images were recognized with this improved affinity and the uncertainty-based reasoning, so the affinity matching of the antibody with the unknown antigen was also improved. Experimental results show that this immune algorithm outperforms some state-of-the-art algorithms in the face recognition accuracy tests with such facial image databases as AR, Yale and CMU-PIE. So the proposed immune algorithm is useful and effective to improve the performance of face recognition in the image sensor network.

This paper introduces a novel method for the recognition of human faces in two-dimensional digital images using a new feature extraction method and Radial Basis Function (RBF) neural network with a Hybrid Learning Algorithm (HLA) as classifier. The proposed feature extraction method includes human face localization derived from the shape information using a proposed distance measure as Facial Candidate Threshold (FCT) as well as Pseudo Zernike Moment Invariant (PZMI) with a newly defined parameter named Correct Information Ratio (CIR) of images for disregarding irrelevant information of face images. In this paper, the effect of these parameters in disregarding irrelevant information in recognition rate improvement is studied. Also we evaluate the effect of orders of PZMI in recognition rate of the proposed technique as well as learning speed. Simulation results on the face database of Olivetti Research Laboratory (ORL) indicate that high order PZMI together with the derived face localization technique for extraction of feature data yielded a recognition rate of 99.3%.