Gabor-based kernel PCA with doubly nonlinear mapping for face recognition with a single face image.

In this paper, a novel Gabor-based kernel principal component analysis (PCA) with doubly nonlinear mapping is proposed for human face recognition. In our approach, the Gabor wavelets are used to extract facial features, then a doubly nonlinear mapping kernel PCA (DKPCA) is proposed to perform feature transformation and face recognition. The conventional kernel PCA nonlinearly maps an input image into a high-dimensional feature space in order to make the mapped features linearly separable. However, this method does not consider the structural characteristics of the face images, and it is difficult to determine which nonlinear mapping is more effective for face recognition. In this paper, a new method of nonlinear mapping, which is performed in the original feature space, is defined. The proposed nonlinear mapping not only considers the statistical property of the input features, but also adopts an eigenmask to emphasize those important facial feature points. Therefore, after this mapping, the transformed features have a higher discriminating power, and the relative importance of the features adapts to the spatial importance of the face images. This new nonlinear mapping is combined with the conventional kernel PCA to be called "doubly" nonlinear mapping kernel PCA. The proposed algorithm is evaluated based on the Yale database, the AR database, the ORL database and the YaleB database by using different face recognition methods such as PCA, Gabor wavelets plus PCA, and Gabor wavelets plus kernel PCA with fractional power polynomial models. Experiments show that consistent and promising results are obtained.     

Topology preserving non-negative matrix factorization for face recognition.

In this paper, a novel topology preserving non-negative matrix factorization (TPNMF) method is proposed for face recognition. We derive the TPNMF model from original NMF algorithm by preserving local topology structure. The TPNMF is based on minimizing the constraint gradient distance in the high-dimensional space. Compared with L(2) distance, the gradient distance is able to reveal latent manifold structure of face patterns. By using TPNMF decomposition, the high-dimensional face space is transformed into a local topology preserving subspace for face recognition. In comparison with PCA, LDA, and original NMF, which search only the Euclidean structure of face space, the proposed TPNMF finds an embedding that preserves local topology information, such as edges and texture. Theoretical analysis and derivation given also validate the property of TPNMF. Experimental results on three different databases, containing more than 12,000 face images under varying in lighting, facial expression, and pose, show that the proposed TPNMF approach provides a better representation of face patterns and achieves higher recognition rates than NMF.     

基于PCA算法的人脸识别

PCA算法作为一种数值分析技术,主要的应用是用于简化数据、降低数据维度。将PCA算法应用到人脸识别,能提取出人脸图像中最主要特征,去除数据的冗余和噪声。文中采用PCA进行人脸识别,能为人脸识别提取区分度高的特征数据,有效提高了识别的准确性。且在ORL和YALE人脸库进行了实验。实验结果表明,该方法对实验的人脸图像有较高的识别率。     

一种基于稠密SIFT特征对齐的稀疏表达人脸识别算法

该文针对人脸图像受到非刚性变化的影响,如旋转、姿态以及表情变化等,提出一种基于稠密尺度不变特征转换(SIFT)特征对齐(Dense SIFT Feature Alignment, DSFA)的稀疏表达人脸识别算法。整个算法包含两个步骤:首先利用DSFA方法对齐训练和测试样本;然后设计一种改进的稀疏表达模型进行人脸识别。为加快DSFA步骤的执行速度,还设计了一种由粗到精的层次化对齐机制。实验结果表明:在ORL,AR和LFW 3个典型数据集上,该文方法都获得了最高的识别精度。该文方法比传统稀疏表达方法在识别精度上平均提高了4.3%,同时提高了大约6倍的识别效率。     

核典型相关分析的融合人脸识别算法

为了更有效地映射图像数据样本到可分类特征空间,提高分类正确率,提出了一种新的基于核函数的典型相关分析的融合人脸识别算法.该方法首先把图像矩阵通过核函数影射到核空间,然后从核空间的行和列两个方向进行特征抽取,同时避免分解映射后的数据矩阵,简化了数据运算,获得了更具鉴别力的分类特征.在Ohio州立大学的OTCBVS可见/红外人脸数据库中进行了分类识别实验,实验结果表明:该方法可以获得90%以上的识别正确率,优于其他的典型相关分析的人脸识别方法的分类正确率.此外,对不均匀光照变化,表情变化等人脸识别的常见问题具有很好的抵抗能力.     

Inferring facial expressions from videos: Tool and application

In this paper, we propose a novel approach for facial expression analysis and recognition. The main contributions of the paper are as follows. First, we propose a temporal recognition scheme that classifies a given image in an unseen video into one of the universal facial expression categories using an analysis–synthesis scheme. The proposed approach relies on tracked facial actions provided by a real-time face tracker. Second, we propose an efficient recognition scheme based on the detection of keyframes in videos. Third, we use the proposed method for extending the human–machine interaction functionality of the AIBO robot. More precisely, the robot is displaying an emotional state in response to the user's recognized facial expression. Experiments using unseen videos demonstrated the effectiveness of the developed methods.     

Frontalization and adaptive exponential ensemble rule for deep-learning-based facial expression recognition system

Automatic facial expression recognition (FER) is an important technique in human–computer interfaces and surveillance systems. It classifies the input facial image into one of the basic expressions (anger, sadness, surprise, happiness, disgust, fear, and neutral). There are two types of FER algorithms: feature-based and convolutional neural network (CNN)-based algorithms. The CNN is a powerful classifier, however, without proper auxiliary techniques, its performance may be limited. In this study, we improve the CNN-based FER system by utilizing face frontalization and the hierarchical architecture. The frontalization algorithm aligns the face by in-plane or out-of-plane, rotation, landmark point matching, and removing background noise. The proposed adaptive exponentially weighted average ensemble rule can determine the optimal weight according to the accuracy of classifiers to improve robustness. Experiments on several popular databases are performed and the results show that the proposed system has a very high accuracy and outperforms state-of-the-art FER systems.     

Gabor feature-based face recognition using supervised locality preserving projection

This paper introduces a novel Gabor-based supervised locality preserving projection (GSLPP) method for face recognition. Locality preserving projection (LPP) is a recently proposed method for unsupervised linear dimensionality reduction. LPP seeks to preserve the local structure which is usually more significant than the global structure preserved by principal component analysis (PCA) and linear discriminant analysis (LDA). In this paper, we investigate its extension, called supervised locality preserving projection (SLPP), using class labels of data points to enhance its discriminant power in their mapping into a low-dimensional space. The GSLPP method, which is robust to variations of illumination and facial expression, applies the SLPP to an augmented Gabor feature vector derived from the Gabor wavelet representation of face images. We performed comparative experiments of various face recognition schemes, including the proposed GSLPP method, PCA method, LDA method, LPP method, the combination of Gabor and PCA method (GPCA) and the combination of Gabor and LDA method (GLDA). Experimental results on AR database and CMU PIE database show superior of the novel GSLPP method.     

Perfect histogram matching PCA for face recognition

We present an enhanced principal component analysis (PCA) algorithm for improving rate of face recognition. The proposed pre-processing method, termed as perfect histogram matching, modifies the image histogram to match a Gaussian shaped tonal distribution in the face images such that spatially the entire set of face images presents similar facial gray-level intensities while the face content in the frequency domain remains mostly unaltered. Computationally inexpensive, the perfect histogram matching algorithm proves to yield superior results when applied as a pre-processing module prior to the conventional PCA algorithm for face recognition. Experimental results are presented to demonstrate effectiveness of the technique.     

PCA-based dictionary building for accurate facial expression recognition via sparse representation

Sparse representation is a new approach that has received significant attention for image classification and recognition. This paper presents a PCA-based dictionary building for sparse representation and classification of universal facial expressions. In our method, expressive facials images of each subject are subtracted from a neutral facial image of the same subject. Then the PCA is applied to these difference images to model the variations within each class of facial expressions. The learned principal components are used as the atoms of the dictionary. In the classification step, a given test image is sparsely represented as a linear combination of the principal components of six basic facial expressions. Our extensive experiments on several publicly available face datasets (CK+, MMI, and Bosphorus datasets) show that our framework outperforms the recognition rate of the state-of-the-art techniques by about 6%. This approach is promising and can further be applied to visual object recognition.     

一种基于相关性投影的人脸性别分类算法

针对于人脸图像检测的有效利用性,为了提高其检测的性能,提出一种新的基于 监督学习的优化相关性投影(ORP)人脸性别分类算法,并将其应用到基 于Eigenface算法与Fisherface算法的人脸识别中,以及应 用WPCA到基于PGA的性别分类中。本文算法首先基于带权主成分分析(WPCA)算法来降低脸部 维度,将脸部特征提取出;然后,对其进行优化,同时 计算ORP的误差函数;最后,最小化脸部ORP误差函数,计算特征向量的 欧式距离,进行人脸性别分类。将提出方法与 传统方法进行对比,在FERET数据库上进行了实验,证明了本文方法的有效性,获得了优 于传统方法的识别率。     

Multi-pose 3D face recognition based on 2D sparse representation

The increasing availability of 3D facial data offers the potential to overcome the difficulties inherent with 2D face recognition, including the sensitivity to illumination conditions and head pose variations. In spite of their rapid development, many 3D face recognition algorithms in the literature still suffer from the intrinsic complexity in representing and processing 3D facial data. In this paper, we propose the intrinsic 3D facial sparse representation (I3DFSR) algorithm for multi-pose 3D face recognition. In this algorithm, each 3D facial surface is first mapped homeomorphically onto a 2D lattice, where the value at each site is the depth of the corresponding vertex on the 3D surface. Each 2D lattice is then interpolated and converted into a 2D facial attribute image. Next, the sparse representation is applied to those attribute images. Finally, the identity of each query face can be obtained by using the corresponding sparse coefficients. The innovation of our approach lies in the strategy of converting irregular 3D facial surfaces into regular 2D attribute images such that 3D face recognition problem can be solved by using the sparse representation of those attribute images. We compare the proposed algorithm to three widely used 3D face recognition algorithms in the GavabDB database, to six state-of-the-art algorithms in the FRGC2.0 database, and to three baseline algorithms in the NPU3D database. Our results show that the proposed I3DFSR algorithm can substantially improve the accuracy and efficiency of multi-pose 3D face recognition.     

一种基于Retinex和PCA的人脸图像识别方法

针对目前人脸识别算法在光照条件恶劣时识别精度较低的缺陷,提出一种基于Retinex和PCA的人脸图像识别方法.Retinex算法能够有效去除图像中光照恶劣导致的阴影,而PCA能够有效提取图像中有代表性的特征,从而使得快速准确的识别成为可能.在Yale和Yale B数据库上验证该算法的性能,结果证明,此算法简单快速,且具有较高的识别精度,是一种实用的人脸图像识别方法.     

Facial Recognition Using Multisensor Images Based on Localized Kernel Eigen Spaces

A feature selection technique along with an information fusion procedure for improving the recognition accuracy of a visual and thermal image-based facial recognition system is presented in this paper. A novel modular kernel eigenspaces approach is developed and implemented on the phase congruency feature maps extracted from the visual and thermal images individually. Smaller sub-regions from a predefined neighborhood within the phase congruency images of the training samples are merged to obtain a large set of features. These features are then projected into higher dimensional spaces using kernel methods. The proposed localized nonlinear feature selection procedure helps to overcome the bottlenecks of illumination variations, partial occlusions, expression variations and variations due to temperature changes that affect the visual and thermal face recognition techniques. AR and Equinox databases are used for experimentation and evaluation of the proposed technique. The proposed feature selection procedure has greatly improved the recognition accuracy for both the visual and thermal images when compared to conventional techniques. Also, a decision level fusion methodology is presented which along with the feature selection procedure has outperformed various other face recognition techniques in terms of recognition accuracy.      

基于PCA特征提取和距离哈希K近邻分类的人脸表情识别

使用PCA降维,提取人脸表情特征,并结合基于距离的哈希K近邻分类算法进行人脸表情识别。首先使用类Haar特征和AdaBoost算法进行人脸检测,并对人脸图像进行预处理;接着使用PCA提取人脸表情特征,并将特征加入到哈希表;最后使用K近邻分类算法进行人脸表情的识别。将特征库重构为哈希表后,很大地提高了识别效率。     

Utility Preserved Facial Image De-identification Using Appearance Subspace Decomposition

Automated human facial image de-identification is a much-needed technology for privacy-preserving social media and intelligent surveillance ap-plications. We propose a novel utility preserved facial image de-identification to subtly tinker the appearance of facial images to achieve facial anonymity by creating"averaged identity faces". This approach is able to preserve the utility of the facial images while achieving the goal of privacy protection. We explore a decomposition of an Active appearance model (AAM) face space by using subspace learning where the loss can be modeled as the difference between two trace ratio items, and each respectively models the level of discriminativeness on identity and utility. Finally, the face space is decomposed into subspaces that are respectively sensitive to face identity and face utility. For the subspace most relevant to face identity, a k-anonymity de-identification procedure is applied. To verify the performance of the proposed facial image de-identification approach, we evaluate the created"averaged faces"using the extended Cohn-Kanade Dataset (CK+). The experimental results show that our proposed approach is satisfied to preserve the utility of the original image while defying face identity recognition.     

基于自适应鲁棒在线度量学习的面部表情识别

针对自然面部表情识别中的噪声标记问题,提出了一种自适应鲁棒在线度量学习方法.首先,学习新的度量空间以增加不同面部表情的判别性;然后,定义敏感度和特异性来表征每个注释器;最后,引入表示真实类标签的潜在变量,在期望最大化架构中迭代求解距离度量和注释器的可靠性.在MFP和AR人脸数据库上的实验结果表明,相比其他几种较新的方法,本方法在自然表情识别方面能获得更高的识别精度,高兴表情识别率可高达99.7％,并且在一定程度上降低了计算开销.     

基于Gabor小波的人脸表情特征提取研究

为了使计算机能更好的识别人脸表情,对基于Gabor小波变换的人脸表情识别方法进行了研究。首先对包含表情区域的静态灰度图像进行预处理,包括对确定的人脸表情区域进行尺寸和灰度归一化,然后利用二维Gabor小波变换提取脸部表情特征,使用快速PCA方法对提取的Gabor小波特征初步降维。再在低维的空间中,利用Fisher准则提取那些有利于分类的特征,最后用SVM分类器进行分类。实验结果表明,上述提出的方法比传统的方法识别速度更快,能达到实时性的要求,并且具有很好的鲁棒性,识别率高。     

直接正交鉴别保局投影算法

针对保局投影(LPP)及其衍生出的算法在人脸识别时须先采用主成分分析(PCA)算法对高维样本降维后才能应用,本文基于正交鉴别保局投影(ODLPP,orthogonal discriminal locality pre-serving projection)算法,提出了一种直接ODLPP(DODLPP)算法,利用拉普拉斯矩阵性质进行了相应的矩阵分解,可直接从高维样本的原始空间中提取投影矩阵。为解决ODLPP算法的小样本问题,给出先求解局部类内散度矩阵的零空间,然后再最大化类间散度矩阵的求解思路。人脸库上的实验结果表明所提算法的有效性。