Two-dimensional Laplacianfaces method for face recognition

In this paper we propose a two-dimensional (2D) Laplacianfaces method for face recognition. The new algorithm is developed based on two techniques, i.e., locality preserved embedding and image based projection. The 2D Laplacianfaces method is not only computationally more efficient but also more accurate than the one-dimensional (1D) Laplacianfaces method in extracting the facial features for human face authentication. Extensive experiments are performed to test and evaluate the new algorithm using the FERET and the AR face databases. The experimental results indicate that the 2D Laplacianfaces method significantly outperforms the existing 2D Eigenfaces, the 2D Fisherfaces and the 1D Laplacianfaces methods under various experimental conditions

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 analysis of neural and statistical classifiers for dimensionality reduction-based face recognition systems.

Human face recognition has received a wide range of attention since 1990s. Recent approaches focus on a combination of dimensionality reduction-based feature extraction algorithms and various types of classifiers. This thesis provides an in depth comparative analysis of neural and statistical classifiers by combining them with existing dimensionality reduction-based algorithms. A set of unified face recognition systems were established for evaluating alternate combinations in terms of recognition performance, processing time, and conditions to achieve certain performance levels. A preprocessing system and four dimensionality reduction-based methods based on Principal Component Analysis (PCA), Two-dimensional PCA, Fisher\u27s Linear Discriminant and Laplacianfaces were utilized and implemented. Classification was achieved by using various types of classifiers including Euclidean Distance, MLP neural network, K-nearest-neighborhood classifier and Fuzzy K-Nearest Neighbor classifier. The statistical model is relatively simple and requires less computation complexity and storage. Experimental results were shown after the algorithms were tested on two databases of known individuals, Yale and AR database. After comparing these algorithms in every aspect, the results of the simulations showed that considering recognition rates, generalization ability, classification performance, the power of noise immunity and processing time, the best results were obtained with the Laplacianfaces, using either Fuzzy K-NN.Dept. of Electrical and Computer Engineering. Paper copy at Leddy Library: Theses & Major Papers - Basement, West Bldg. / Call Number: Thesis2006 .X86. Source: Masters Abstracts International, Volume: 45-01, page: 0428. Thesis (M.A.Sc.)--University of Windsor (Canada), 2006

Face recognition using nonparametric-weighted Fisherfaces

This study presents an appearance-based face recognition scheme called the nonparametric-weighted Fisherfaces (NW-Fisherfaces). Pixels in a facial image are considered as coordinates in a high-dimensional space and are transformed into a face subspace for analysis by using nonparametric-weighted feature extraction (NWFE). According to previous studies of hyperspectral image classification, NWFE is a powerful tool for extracting hyperspectral image features. The Fisherfaces method maximizes the ratio of between-class scatter to that of within-class scatter. In this study, the proposed NW-Fisherfaces weighted the between-class scatter to emphasize the boundary structure of the transformed face subspace and, therefore, enhances the separability for different persons' face. The proposed NW-Fisherfaces was compared with Orthogonal Laplacianfaces, Eigenfaces, Fisherfaces, direct linear discriminant analysis, and null space linear discriminant analysis methods for tests on five facial databases. Experimental results showed that the proposed approach outperforms other feature extraction methods for most databases. © 2012 Li et al

Multi-Criteria in Discriminant Analysis to Find the Dominant Features

A crucial problem in biometrics is enormous dimensionality. It will have an impact on the costs involved. Therefore, the feature extraction plays a significant role in biometrics computational. In this research, a novel approach to extract the features is proposed for facial image recognition. Four criteria of the Discriminant Analysis have been modeled to find the dominant features. For each criterion is an objective function, it was derived to obtain the optimum values. The optimum values can be solved by using generalized the Eigenvalue problem associated to the largest Eigenvalue. The modeling results were employed to recognize the facial image by the multi-criteria projection to the original data. The training sets were also processed by using the Eigenface projection to avoid the singularity problem cases. The similarity measurements were performed by using four different methods, i.e. Euclidian Distance, Manhattan, Chebyshev, and Canberra.  Feature extraction and analysis results using multi-criteria have shown better results than the other appearance method, i.e. Eigenface (PCA), Fisherface (Linear Discriminant Analysis or LDA), Laplacianfaces (Locality Preserving Projection or LPP), and Orthogonal Laplacianfaces (Orthogonal Locality Preserving Projection or O-LPP).

Face Recognition Using Laplacian Faces

This paper presents Recognition of human faces from abstract features using PCA and Laplacian faces. Abstract features of human are too large and unnecessary features are eliminated through PCA. Efficient and robust results achieved through Laplacian faces