Subspace-Based Holistic Registration for Low-Resolution Facial Images

Subspace-based holistic registration is introduced as an alternative to landmark-based face registration, which has a poor performance on low-resolution images, as obtained in camera surveillance applications. The proposed registration method finds the alignment by maximizing the similarity score between a probe and a gallery image. We use a novel probabilistic framework for both user-independent as well as user-specific face registration. The similarity is calculated using the probability that the face image is correctly aligned in a face subspace, but additionally we take the probability into account that the face is misaligned based on the residual error in the dimensions perpendicular to the face subspace. We perform extensive experiments on the FRGCv2 database to evaluate the impact that the face registration methods have on face recognition. Subspace-based holistic registration on low-resolution images can improve face recognition in comparison with landmark-based registration on high-resolution images. The performance of the tested face recognition methods after subspace-based holistic registration on a low-resolution version of the FRGC database is similar to that after manual registration

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

Subspace Methods for Face Recognition: Singularity, Regularization, and Robustness

Face recognition has been an important issue in computer vision and pattern recognition over the last several decades (Zhao et al., 2003). While human can recognize faces easily, automated face recognition remains a great challenge in computer-based automated recognition research. One difficulty in face recognition is how to handle the variations in expression, pose an

Face recognition in different subspaces - A comparative study

Face recognition is one of the most successful applications of image analysis and understanding and has gained much attention in recent years. Among many approaches to the problem of face recognition, appearance-based subspace analysis still gives the most promising results. In this paper we study the three most popular appearance-based face recognition projection methods (PCA, LDA and ICA). All methods are tested in equal working conditions regarding preprocessing and algorithm implementation on the FERET data set with its standard tests. We also compare the ICA method with its whitening preprocess and find out that there is no significant difference between them. When we compare different projection with different metrics we found out that the LDA+COS combination is the most promising for all tasks. The L1 metric gives the best results in combination with PCA and ICA1, and COS is superior to any other metric when used with LDA and ICA2. Our results are compared to other studies and some discrepancies are pointed ou

A Bilinear Illumination Model for Robust Face Recognition

We present a technique to generate an illumination subspace for arbitrary 3D faces based on the statistics of measured illuminations under variable lighting conditions from many subjects. A bilinear model based on the higher-order singular value decomposition is used to create a compact illumination subspace given arbitrary shape parameters from a parametric 3D face model. Using a fitting procedure based on minimizing the distance of the input image to the dynamically changing illumination subspace, we reconstruct a shape-specific illumination subspace from a single photograph. We use the reconstructed illumination subspace in various face recognition experiments with variable lighting conditions and obtain accuracies which are very competitive with previous methods that require specific training sessions or multiple images of the subject.Engineering and Applied Science

Advances of Robust Subspace Face Recognition

Face recognition has been widely applied in fast video surveillance and security systems and smart home services in our daily lives. Over past years, subspace projection methods, such as principal component analysis (PCA), linear discriminant analysis (LDA), are the well-known algorithms for face recognition. Recently, linear regression classification (LRC) is one of the most popular approaches through subspace projection optimizations. However, there are still many problems unsolved in severe conditions with different environments and various applications. In this chapter, the practical problems including partial occlusion, illumination variation, different expression, pose variation, and low resolution are addressed and solved by several improved subspace projection methods including robust linear regression classification (RLRC), ridge regression (RR), improved principal component regression (IPCR), unitary regression classification (URC), linear discriminant regression classification (LDRC), generalized linear regression classification (GLRC) and trimmed linear regression (TLR). Experimental results show that these methods can perform well and possess high robustness against problems of partial occlusion, illumination variation, different expression, pose variation and low resolution

Credit risk evaluation by using nearest subspace method

AbstractIn this paper, a classification method named nearest subspace method is applied for credit risk evaluation. Virtually credit risk evaluation is a very typical classification problem to identify “good” and “bad” creditors. Currently some machine learning technologies, such as support vector machine (SVM), have been discussed widely in credit risk evaluation. But there are many effective classification methods in pattern recognition and artificial intelligence have not been tested for credit evaluation. This paper presents to use nearest subspace classification method, a successful face recognition method, for credit evaluation. The nearest subspace credit evaluation method use the subspaces spanned by the creditors in same class to extend the training set, and the Euclidean distance from a test creditor to the subspace is taken as the similarity measure for classification, then the test creditor belongs to the class of nearest subspace. Experiments on real world credit dataset show that the nearest subspace credit risk evaluation method is a competitive method

Towards Practical Face Recognition System Employing Row-Based Distance Method In 2dpca Based Algorithms

Automatic face recognition has been a focus research topic in past few decades. This is due to the advantages of face recognition and the potential need for high security in commercial and law enforcement applications. However, due to nature of the face, it is subjected to several variations. Thus, finding a good face recognition system is still an active research field till today. Many approaches have been proposed to overcome the face variations. In the midst of these techniques, subspace methods are considered the most popular and powerful techniques. Among them, eigenface or Principal Component Analysis (PCA) method is considered as one of the most successful techniques in subspace methods. One of the most important extensions of PCA is Two-dimensional PCA (2DPCA). However, 2DPCA-based features are matrices rather than vectors as in PCA. Hence, different distance computation methods have been proposed to calculate the distance between the test feature matrix and the training feature matrices. All previous methods deal with the classification problem mathematically without any consideration between feature matrices and the face images. Besides, the system performance in practical applications relies on the number of eigenvectors chosen. As a solution to the above mentioned issues, four new distance methods have been proposed in this thesis, which are based on the rows of a feature matrix of 2DPCA-based algorithms. Through experiments, using eight face databases, their improvements compared to the previous distance methods are demonstrated