Search

• A robust deep low-rank feature learning and encoding model for cross-age face recognition is proposed. • A manifold-constrained low-rank approximation algorithm is proposed to learn clean low-rank feature matrix for representation. • A locality-constrained feature encoding framework is proposed to represent the cross-age face images of the same identity by similar codewords. • The proposed method outperforms other state-of-the-art methods in terms of recognition rate. Cross-age face recognition (CAFR) is a challenging task, due to significant intra-personal variations. Furthermore, the training and testing data may contain random noise components. To address these issues, this paper proposes a deep low-rank feature learning and encoding method. Firstly, our method employs manifold learning in the low-rank optimization, which preserves the global and local structure of the data samples, while learning the clean low-rank features. Secondly, we encode the low-rank features using our locality-constrained feature encoding method, which learns an age-insensitive codebook from training data, and enables the intra-class samples to share the same local bases in a codebook. In the testing stage, the gallery and probe features are encoded by the learned codebook, which represents the images of the same identity by similar codewords for recognition. Furthermore, the periocular region of human faces is investigated for CAFR. Extensive experiments on five datasets demonstrate the effectiveness of our method. [ABSTRACT FROM AUTHOR]

The one-sample-per-person problem has become an active research topic for face recognition in recent years because of its challenges and significance for real-world applications. However, achieving relatively higher recognition accuracy is still a difficult problem due to, usually, too few training samples being available and variations of illumination and expression. To alleviate the negative effects caused by these unfavorable factors, in this paper we propose a more accurate spectral feature image-based 2DLDA (two-dimensional linear discriminant analysis) ensemble algorithm for face recognition, with one sample image per person. In our algorithm, multi-resolution spectral feature images are constructed to represent the face images; this can greatly enlarge the training set. The proposed method is inspired by our finding that, among these spectral feature images, features extracted from some orientations and scales using 2DLDA are not sensitive to variations of illumination and expression. In order to maintain the positive characteristics of these filters and to make correct category assignments, the strategy of classifier committee learning (CCL) is designed to combine the results obtained from different spectral feature images. Using the above strategies, the negative effects caused by those unfavorable factors can be alleviated efficiently in face recognition. Experimental results on the standard databases demonstrate the feasibility and efficiency of the proposed method. [ABSTRACT FROM AUTHOR]

Abstract: In this paper, we present a kernel-based eigentransformation framework to hallucinate the high-resolution (HR) facial image of a low-resolution (LR) input. The eigentransformation method is a linear subspace approach, which represents an image as a linear combination of training samples. Consequently, those novel facial appearances not included in the training samples cannot be super-resolved properly. To solve this problem, we devise a kernel-based extension of the eigentransformation method, which takes higher-order statistics of the image data into account. To generate HR face images with higher fidelity, the HR face image reconstructed using this kernel-based eigentransformation method is treated as an initial estimation of the target HR face. The corresponding high-frequency components of this estimation are extracted to form a prior in the maximum a posteriori (MAP) formulation of the SR problem so as to derive the final reconstruction result. We have evaluated our proposed method using different kernels and configurations, and have compared these performances with some current SR algorithms. Experimental results show that our kernel-based framework, along with a proper kernel, can produce good HR facial images in terms of both visual quality and reconstruction errors. [ABSTRACT FROM AUTHOR]

Abstract: Face-detection methods based on cascade architecture have demonstrated a fast and robust performance. In most of these methods, each node of the cascade employs the simple Haar-like features from the central eye–nose–mouth region using the boosting method. However, it can be empirically observed that, in the deeper nodes of the boosting process, the non-face examples collected by bootstrapping are in fact very similar to the face examples, and the error rate of those feature-based weak classifiers is very close to 50%. Consequently, the performance of the face detector is hardly further improved. In this paper, we propose a novel and simple solution to this problem by imitating the characteristics of the human visual system. The main idea of our solution is to boost the cascade based on a hierarchical strategy, which employs the information from the central and surrounding parts of the face regions step by step. We argue that the context information about a face can be advantageously used in the deeper nodes of the boosting process when the features derived from the central region of the face do not provide any further benefit. Furthermore, we also propose a simplified Gabor feature to extend the feature set for the training of deeper nodes. Experiments show that our proposed method can improve not only the detection performance, but also the detection speed, by about 10% when compared to the original AdaBoost face-detection method for our implementation. [Copyright &y& Elsevier]

Abstract: In this paper, an efficient method for human facial expression recognition is presented. We first propose a representation model for facial expressions, namely the spatially maximum occurrence model (SMOM), which is based on the statistical characteristics of training facial images and has a powerful representation capability. Then the elastic shape–texture matching (ESTM) algorithm is used to measure the similarity between images based on the shape and texture information. By combining SMOM and ESTM, the algorithm, namely SMOM–ESTM, can achieve a higher recognition performance level. The recognition rates of the SMOM–ESTM algorithm based on the AR database and the Yale database are 94.5% and 94.7%, respectively. [Copyright &y& Elsevier]

Abstract: In this paper, we propose a new face recognition algorithm based on a single frontal-view image for each face subject, which considers the effect of the face manifold structure. To compare two near-frontal face images, each face is considered a combination of a sequence of local image blocks. Each of the image blocks of one image can be reconstructed according to the corresponding local image block of the other face image. Then an elastic local reconstruction (ELR) method is proposed to measure the similarities between the image block pairs in order to measure the difference between the two face images. Our algorithm not only benefits from the face manifold structure, in terms of being robust to various image variations, but also is computationally simple because there is no need to build the face manifold. We evaluate the performance of our proposed face recognition algorithm with the use of different databases, which are produced under various conditions, e.g. lightings, expressions, perspectives, with/without glasses and occlusions. Consistent and promising experimental results were obtained, which show that our algorithm can greatly improve the recognition rates under all the different conditions. [Copyright &y& Elsevier]

Abstract: In this paper, a novel, elastic, shape-texture matching method, namely ESTM, for human face recognition is proposed. In our approach, both the shape and the texture information are used to compare two faces without establishing any precise pixel-wise correspondence. The edge map is used to represent the shape of an image, while the texture information is characterized by both the Gabor representations and the gradient direction of each pixel. Combining these features, a shape-texture Hausdorff distance is devised to compute the similarity of two face images. The elastic matching is robust to small, local distortions of the feature points such as those caused by facial expression variations. In addition, the use of the edge map, Gabor representations and the direction of the image gradient can all alleviate the effect of illumination to a certain extent. With different databases, experimental results show that our algorithm can always achieve a better performance than other face recognition algorithms under different conditions, except when an image is under poor and uneven illumination. Experiments based on the Yale database, AR database, ORL database and YaleB database show that our proposed method can achieve recognition rates of 88.7%, 97.7%, 78.3% and 89.5%, respectively. [Copyright &y& Elsevier]

Abstract: In this paper, an efficient representation method insensitive to varying illumination is proposed for human face recognition. Theoretical analysis based on the human face model and the illumination model shows that the effects of varying lighting on a human face image can be modeled by a sequence of multiplicative and additive noises. Instead of computing these noises, which is very difficult for real applications, we aim to reduce or even remove their effect. In our method, a local normalization technique is applied to an image, which can effectively and efficiently eliminate the effect of uneven illuminations while keeping the local statistical properties of the processed image the same as in the corresponding image under normal lighting condition. After processing, the image under varying illumination will have similar pixel values to the corresponding image that is under normal lighting condition. Then, the processed images are used for face recognition. The proposed algorithm has been evaluated based on the Yale database, the AR database, the PIE database, the YaleB database and the combined database by using different face recognition methods such as PCA, ICA and Gabor wavelets. Consistent and promising results were obtained, which show that our method can effectively eliminate the effect of uneven illumination and greatly improve the recognition results. [Copyright &y& Elsevier]

Abstract: The appearance of a face will vary drastically when the illumination changes. Variations in lighting conditions make face recognition an even more challenging and difficult task. In this paper, we propose a novel approach to handle the illumination problem. Our method can restore a face image captured under arbitrary lighting conditions to one with frontal illumination by using a ratio-image between the face image and a reference face image, both of which are blurred by a Gaussian filter. An iterative algorithm is then used to update the reference image, which is reconstructed from the restored image by means of principal component analysis (PCA), in order to obtain a visually better restored image. Image processing techniques are also used to improve the quality of the restored image. To evaluate the performance of our algorithm, restored images with frontal illumination are used for face recognition by means of PCA. Experimental results demonstrate that face recognition using our method can achieve a higher recognition rate based on the Yale B database and the Yale database. Our algorithm has several advantages over other previous algorithms: (1) it does not need to estimate the face surface normals and the light source directions, (2) it does not need many images captured under different lighting conditions for each person, nor a set of bootstrap images that includes many images with different illuminations, and (3) it does not need to detect accurate positions of some facial feature points or to warp the image for alignment, etc. [Copyright &y& Elsevier]

This paper proposes a novel illumination compensation algorithm, which can compensate for the uneven illuminations on human faces and reconstruct face images in normal lighting conditions. A simple yet effective local contrast enhancement method, namely block-based histogram equalization (BHE), is first proposed. The resulting image processed using BHE is then compared with the original face image processed using histogram equalization (HE) to estimate the category of its light source. In our scheme, we divide the light source for a human face into 65 categories. Based on the category identified, a corresponding lighting compensation model is used to reconstruct an image that will visually be under normal illumination. In order to eliminate the influence of uneven illumination while retaining the shape information about a human face, a 2D face shape model is used. Experimental results show that, with the use of principal component analysis for face recognition, the recognition rate can be improved by 53.3% to 62.6% when our proposed algorithm for lighting compensation is used. [Copyright &y& Elsevier]

Hausdorff distance is an efficient measure of the similarity of two point sets. In this paper, we propose a new spatially weighted Hausdorff distance measure for human face recognition. The weighting function used in the Hausdorff distance measure is based on an eigenface, which has a large value at locations of importance facial features and can reflect the face structure more effectively. Two modified Hausdorff distances, namely, “spatially eigen-weighted Hausdorff distance” (SEWHD) and “spatially eigen-weighted ‘doubly’ Hausdorff distance” (SEW2HD) are proposed, which incorporate the information about the location of important facial features such as eyes, mouth, and face contour so that distances at those regions will be emphasized. Experimental results based on a combination of the ORL, MIT, and Yale face databases show that SEW2HD can achieve recognition rates of 83%, 90% and 92% for the first one, the first three and the first five likely matched faces, respectively, while the corresponding recognition rates of SEWHD are 80%, 83% and 88%, respectively. [Copyright &y& Elsevier]

Proposes an analytic to holistic approach in an attempt to identify faces at different perspective variations. Steps to be taken in the analysis; Results of the analysis; Information on the importance of face recognition to human beings.

• A novel method for Low-resolution (LR) face recognition is proposed. • Features are decomposed into a low-rank feature matrix and a corresponding sparse error matrix. • Learned low-rank features are projected onto a sparse feature space for recognition. • Experiments on five face datasets shows the effectiveness of our proposed method. In this paper, we propose a novel approach for low-resolution face recognition, under uncontrolled settings. Our approach first decomposes a multiple of extracted local features into a set of representative basis (low-rank matrix) and sparse error matrix, and then learns a projection matrix based on our proposed sparse-coding-based algorithm, which preserves the sparse structure of the learned low-rank features, in a low-dimensional feature subspace. Then, a coefficient vector, based on linear regression, is computed to determine the similarity between the projected gallery and query image's features. Furthermore, a new morphological pre-processing approach is proposed to improve the visual quality of images. Our experiments were conducted on five available face-recognition datasets, which contain images with variations in pose, facial expressions and illumination conditions. Experiment results show that our method outperforms other state-of–the-art low-resolution face recognition methods in terms of recognition accuracy. [ABSTRACT FROM AUTHOR]

Abstract: In this paper, we propose a face-hallucination method, namely face hallucination based on sparse local-pixel structure. In our framework, a high resolution (HR) face is estimated from a single frame low resolution (LR) face with the help of the facial dataset. Unlike many existing face-hallucination methods such as the from local-pixel structure to global image super-resolution method (LPS-GIS) and the super-resolution through neighbor embedding, where the prior models are learned by employing the least-square methods, our framework aims to shape the prior model using sparse representation. Then this learned prior model is employed to guide the reconstruction process. Experiments show that our framework is very flexible, and achieves a competitive or even superior performance in terms of both reconstruction error and visual quality. Our method still exhibits an impressive ability to generate plausible HR facial images based on their sparse local structures. [Copyright &y& Elsevier]

Abstract: Gabor wavelets (GWs) are commonly used for extracting local features for various applications such as object detection, recognition and tracking. However, extracting Gabor features is computationally intensive, so the features are impractical for real-time applications. In this paper, we propose a simplified version of Gabor wavelets (SGWs) and an efficient algorithm for extracting the features based on an integral image. We evaluate the performance of the SGW features for face recognition. Experimental results show that using SGWs can achieve a performance level similar to using GWs, while the runtime for feature extraction using SGWs is, at most, 4.39 times faster than that of GWs implemented by using the fast Fourier transform (FFT). [Copyright &y& Elsevier]