A structure-preserved local matching approach for face recognition

In this paper, a novel local matching method called structure-preserved projections (SPP) is proposed for face recognition. Unlike most existing local matching methods which neglect the interactions of different sub-pattern sets during feature extraction, i.e., they assume different sub-pattern sets are independent; SPP takes the holistic context of the face into account and can preserve the configural structure of each face image in subspace. Moreover, the intrinsic manifold structure of the sub-pattern sets can also be preserved in our method. With SPP, all sub-patterns partitioned from the original face images are trained to obtain a unified subspace, in which recognition can be performed. The efficiency of the proposed algorithm is demonstrated by extensive experiments on three standard face databases (Yale, Extended YaleB and PIE). Experimental results show that SPP outperforms other holistic and local matching methods.     

局部线性嵌入优化光谱回归的鲁棒人脸识别

针对高维小样本鲁棒人脸识别问题,提出了一种局部线性嵌入优化光谱回归算法。计算出训练样本的特征向量,然后用局部线性嵌入算法构建分类问题所需的嵌入,并学习每种分类的子流形所需的嵌入;利用光谱回归计算投影矩阵,最近邻分类器完成人脸的识别。在人脸数据库FERET、AR及扩展YaleB上的实验结果表明,相比其他几种光谱回归算法,该算法取得了更好的识别效果。     

A robust approach based on local feature extraction for age invariant face recognition

Multimedia Tools and Applications - Age variation is a major problem in the area of face recognition under uncontrolled environment such as pose, illumination, expression. Most of the works of this...     

An efficient 3D face recognition approach using local geometrical signatures

This paper presents a computationally efficient 3D face recognition system based on a novel facial signature called Angular Radial Signature (ARS) which is extracted from the semi-rigid region of the face. Kernel Principal Component Analysis (KPCA) is then used to extract the mid-level features from the extracted ARSs to improve the discriminative power. The mid-level features are then concatenated into a single feature vector and fed into a Support Vector Machine (SVM) to perform face recognition. The proposed approach addresses the expression variation problem by using facial scans with various expressions of different individuals for training. We conducted a number of experiments on the Face Recognition Grand Challenge (FRGC v2.0) and the 3D track of Shape Retrieval Contest (SHREC 2008) datasets, and a superior recognition performance has been achieved. Our experimental results show that the proposed system achieves very high Verification Rates (VRs) of 97.8% and 88.5% at a 0.1% False Acceptance Rate (FAR) for the “neutral vs. nonneutral” experiments on the FRGC v2.0 and the SHREC 2008 datasets respectively, and 96.7% for the ROC III experiment of the FRGC v2.0 dataset. Our experiments also demonstrate the computational efficiency of the proposed approach.     

A local experts organization model with application to face emotion recognition

This paper presents a novel approach for recognizing human facial emotion in order to further detect human suspicious behaviors. Instead of relying on relative poor representation of facial features in a flat vector form, the approach utilizes a format of tree structures with Gabor feature representations to present a facial emotional state. The novel local experts organization (LEO) model is proposed for the processing of this tree structure representation. The motivation for the LEO model is to deal with the inconsistent length of features in case there are some features failed to be detected. The proposed LEO model is inspired by the natural hierarchical model presented in natural organization, where workers (local experts) reports to their supervisor (fusion classifier), whom in turn reports to upper management (global fusion classifier). Moreover, an Asian emotion database is created. The database contains high-resolution images of 153 Asian subjects in six basic pseudo-emotions (excluding neutral expression) in three different poses for evaluating our proposed system. Empirical studies were conducted to benchmark our approach with other well-known classifiers applying to the system, and the results showed that our approach is the most robust, and less affected by noise from feature locators for the face emotion recognition system.     

Maximal local interclass embedding with application to face recognition

Dimensionality reduction of high dimensional data is involved in many problems in information processing. A new dimensionality reduction approach called maximal local interclass embedding (MLIE) is developed in this paper. MLIE can be viewed as a linear approach of a multimanifolds-based learning framework, in which the information of neighborhood is integrated with the local interclass relationships. In MLIE, the local interclass graph and the intrinsic graph are constructed to find a set of projections that maximize the local interclass scatter and the local intraclass compactness simultaneously. This characteristic makes MLIE more powerful than marginal Fisher analysis (MFA). MLIE maintains all the advantages of MFA. Moreover, the computational complexity of MLIE is less than that of MFA. The proposed algorithm is applied to face recognition. Experiments have been performed on the Yale, AR and ORL face image databases. The experimental results show that owing to the locally discriminating property, MLIE consistently outperforms up-to-date MFA, Smooth MFA, neighborhood preserving embedding and locality preserving projection in face recognition.     

面部局部特征的独立分量分析及其应用

特征提取方法一直是人脸识别研究中的热点,局部特征分析（Local Feature Analysis）算法不仅能得到面部的全局特征,而且能提取出其局部特征信息,但该算法得到的结果具有过多冗余相关信息不利于识别。由于独立成分分析（Independent Component Analysis）算法能够有效地提取信号的高阶统计特性,很好地去除了各分量之间的相关性。给出了融合这两种方法的特征提取方法,经实验测试表明该算法能有效地提取面部特征。     

Orthogonal local spline discriminant projection with application to face recognition

In this paper, an efficient feature extraction algorithm called orthogonal local spline discriminant projection (O-LSDP) is proposed for face recognition. Derived from local spline embedding (LSE), O-LSDP not only inherits the advantages of LSE which uses local tangent space as a representation of the local geometry so as to preserve the local structure, but also makes full use of class information and orthogonal subspace to improve discriminant power. Extensive experiments on several standard face databases demonstrate the effectiveness of the proposed method.     

A complete fuzzy discriminant analysis approach for face recognition

In this paper, some studies have been made on the essence of fuzzy linear discriminant analysis (F-LDA) algorithm and fuzzy support vector machine (FSVM) classifier, respectively. As a kernel-based learning machine, FSVM is represented with the fuzzy membership function while realizing the same classification results with that of the conventional pair-wise classification. It outperforms other learning machines especially when unclassifiable regions still remain in those conventional classifiers. However, a serious drawback of FSVM is that the computation requirement increases rapidly with the increase of the number of classes and training sample size. To address this problem, an improved FSVM method that combines the advantages of FSVM and decision tree, called DT-FSVM, is proposed firstly. Furthermore, in the process of feature extraction, a reformative F-LDA algorithm based on the fuzzy k-nearest neighbors (FKNN) is implemented to achieve the distribution information of each original sample represented with fuzzy membership grade, which is incorporated into the redefinition of the scatter matrices. In particular, considering the fact that the outlier samples in the patterns may have some adverse influence on the classification result, we developed a novel F-LDA algorithm using a relaxed normalized condition in the definition of fuzzy membership function. Thus, the classification limitation from the outlier samples is effectively alleviated. Finally, by making full use of the fuzzy set theory, a complete F-LDA (CF-LDA) framework is developed by combining the reformative F-LDA (RF-LDA) feature extraction method and DT-FSVM classifier. This hybrid fuzzy algorithm is applied to the face recognition problem, extensive experimental studies conducted on the ORL and NUST603 face images databases demonstrate the effectiveness of the proposed algorithm.     

增强局部量化模式人脸识别算法

针对局部二值模式没有考虑邻域点之间的关系以及局部序数模式（LIOP）的邻域点数过少不足,提出一种利用大邻域范围内邻域点间序数信息的特征提取算法。该算法首先以类似LIOP编码的方式得到的邻域特征向量,然后应用[k]均值聚类算法降低特征向量的主模数量。同时此聚类过程可以离线进行并且运行十分高效;最终将级联直方图特征作为人脸特征向量。实验结果表明,该方法的鲁棒性和识别率均优于对比算法。最后应用WPCA算法既降低特征维数又提升了算法的识别率。     

基于S-LISSOM模型的人脸识别方法

提出了一种利用视皮层认知模型识别人脸的方法。该方法建立一种简化的感受野切片连接自组织映射简化模型(S LISSOM),模拟人脸图像在大脑视皮层的映射特征,作为隐马尔可夫模型(HMM)的观测向量进行人脸识别。实验结果同其他特征的人脸识别方法进行了比较,该方法更加有效的提取的人脸特征,提高了人脸识别率。     

A composite spatio-temporal modeling approach for age invariant face recognition

In this research we propose a novel method of face recognition based on texture and shape information. Age invariant face recognition enables matching of an image obtained at a given point in time against an image of the same individual obtained at an earlier point in time and thus has important applications, notably in law enforcement. We investigate various types of models built on different levels of data granularity. At the global level a model is built on training data that encompasses the entire set of available individuals, whereas at the local level, data from homogeneous sub-populations is used and finally at the individual level a personalized model is built for each individual. We narrow down the search space by dividing the whole database into subspaces for improving recognition time. We use a two-phased process for age invariant face recognition. In the first phase we identify the correct subspace by using a probabilistic method, and in the second phase we find the probe image within that subspace. Finally, we use a decision tree approach to combine models built from shape and texture features. Our empirical results show that the local and personalized models perform best when rated on both Rank-1 accuracy and recognition time.     

Local uncorrelated local discriminant embedding for face recognition

The feature extraction algorithm plays an important role in face recognition. However, the extracted features also have overlapping discriminant information. A property of the statistical uncorrelated criterion is that it eliminates the redundancy among the extracted discriminant features, while many algorithms generally ignore this property. In this paper, we introduce a novel feature extraction method called local uncorrelated local discriminant embedding (LULDE). The proposed approach can be seen as an extension of a local discriminant embedding (LDE) framework in three ways. First, a new local statistical uncorrelated criterion is proposed, which effectively captures the local information of interclass and intraclass. Second, we reconstruct the affinity matrices of an intrinsic graph and a penalty graph, which are mentioned in LDE to enhance the discriminant property. Finally, it overcomes the small-sample-size problem without using principal component analysis to preprocess the original data, which avoids losing some discriminant information. Experimental results on Yale, ORL, Extended Yale B, and FERET databases demonstrate that LULDE outperforms LDE and other representative uncorrelated feature extraction methods.     

无监督局部特征学习的鲁棒性人脸识别

特征表示是人脸识别的关键问题,由于人脸图像在拍摄过程中受光照、遮挡、姿势等因素的影响,如何提取鲁棒的图像特征成了研究的重点。受卷积网络框架的启发,结合K-means算法在卷积滤波器学习中所具有的效果稳定、收敛速度快等优点,提出了一种简单有效的人脸识别方法,主要包含三个部分：卷积滤波器学习、非线性处理和空间平均值池化。具体而言,首先在训练图像中提取局部图像块,预处理后,使用K-means算法快速学习滤波器,每个滤波器与图像进行卷积运算;然后通过双曲正切函数对卷积图像进行非线性变换;最后利用空间平均值池化对图像特征进行去噪和降维。分类阶段仅采用简单的线性回归分类器。在AR和ExtendedYaleB数据集上的评估实验结果表明所提方法虽然简单却非常有效,而且对光照和遮挡表现出了强鲁棒性。     

A probabilistic model of face mapping with local transformations and its application to person recognition

This paper proposes a new measure of "distance" between faces. This measure involves the estimation of the set of possible transformations between face images of the same person. The global transformation, which is assumed to be too complex for direct modeling, is approximated by a patchwork of local transformations, under a constraint imposing consistency between neighboring local transformations. The proposed system of local transformations and neighboring constraints is embedded within the probabilistic framework of a two-dimensional hidden Markov model. More specifically, we model two types of intraclass variabilities involving variations in facial expressions and illumination, respectively. The performance of the resulting method is assessed on a large data set consisting of four face databases. In particular, it is shown to outperform a leading approach to face recognition, namely, the Bayesian intra/extrapersonal classifier.