Gabor-based kernel PCA for palmprint recognition

A novel Gabor-based kernel principal component analysis (PCA) method by integrating the Gabor wavelet representation of palm images and the kernel PCA method for palmprint recognition is proposed. The feasibility of the proposed method has been successfully tested on two different public data sets from the PolyU palmprint databases, for which the samples were collected in two different sessions.     

适于人脸识别的PCA算法应用研究

人脸识别问题涵盖了多个领域如图像处理、计算机视觉和模式识别等,文中主要研究了PCA算法的原理,并基于MATLAB软件平台实现了人脸识别系统。本系统对图像进行预处理后,用ORL人脸库中的部分图像作为样本,通过K-L变换获取训练样本的特征值和特征向量,从而得到特征脸向量,然后将测试样本投影到已知的特征脸空间,计算出坐标系数,进而得出分类识别的结果。实验证明了本系统有较高的人脸识别率,具有一定的实际应用价值。     

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.     

融合奇异值分解和主分量分析的人脸识别算法

提出了奇异值分解(SVD)和主分量分析(PCA)相结合的人脸识别算法。理论上,当两种数据或分类器具有一定的独立性或互补性时,数据融合或分类器融合才能改善识别率。SVD和PCA之间有着明显的互补之处。PCA在图像表示上是最佳的(在均方差意义上),但敏感于位移、旋转等几何变换。而SVD则具有位移、旋转不变性。因此,将这两种方法相结合就有可能提高分类性能(好于单独的SVD方法和单独的PCA方法)。在ORL数据库上的实验表明,SVD和PCA相融合的识别方法的确提高了人脸识别率。     

Locality-sensitive kernel sparse representation classification for face recognition

In this paper a new classification method called locality-sensitive kernel sparse representation classification (LS-KSRC) is proposed for face recognition. LS-KSRC integrates both sparsity and data locality in the kernel feature space rather than in the original feature space. LS-KSRC can learn more discriminating sparse representation coefficients for face recognition. The closed form solution of the l₁-norm minimization problem for LS-KSRC is also presented. LS-KSRC is compared with kernel sparse representation classification (KSRC), sparse representation classification (SRC), locality-constrained linear coding (LLC), support vector machines (SVM), the nearest neighbor (NN), and the nearest subspace (NS). Experimental results on three benchmarking face databases, i.e., the ORL database, the Extended Yale B database, and the CMU PIE database, demonstrate the promising performance of the proposed method for face recognition, outperforming the other used methods.     

Background learning for robust face recognition with PCA in the presence of clutter.

We propose a new method within the framework of principal component analysis (PCA) to robustly recognize faces in the presence of clutter. The traditional eigenface recognition (EFR) method, which is based on PCA, works quite well when the input test patterns are faces. However, when confronted with the more general task of recognizing faces appearing against a background, the performance of the EFR method can be quite poor. It may miss faces completely or may wrongly associate many of the background image patterns to faces in the training set. In order to improve performance in the presence of background, we argue in favor of learning the distribution of background patterns and show how this can be done for a given test image. An eigenbackground space is constructed corresponding to the given test image and this space in conjunction with the eigenface space is used to impart robustness. A suitable classifier is derived to distinguish nonface patterns from faces. When tested on images depicting face recognition in real situations against cluttered background, the performance of the proposed method is quite good with fewer false alarms.     

一种应用于人脸识别的核正交等度规映射算法

针对人脸识别中的特征提取,提出了一种新的核正交等度规映射(KOIsoP,kernel orthogonal isometric projection)人脸识别算法。首先用核方法提取人脸图像中的非线性信息,并将其投影在一个高维非线性空间,从而更好地提取人脸非线性流形结构信息。然后通过等度规映射做一线性映射得到基向量。最后正交化得到的基向量,使得算法更利于保留人脸非线性子流形空间与距离有关的结构信息和重构样本,以便获得更好的识别效果。ORL和PIE库上的人脸识别实验验证了算法的有效性。     

基于非线性核空间映射与人工免疫网络的高光谱遥感图像分类

提出了一种基于非线性核空间映射人工免疫网络的高光谱遥感图像分类算法.根据生物免疫网络基本原理构建了人工免疫网络模型,利用非线性核函数将高光谱训练样本映射到高维空间,完善了人工免疫网络中目标样本核空间相似性分选方法,降低了人工免疫网络识别样本所需的抗体数量,提升了算法的分类精度和运算效率.为了验证算法的有效性,利用两组高光谱遥感数据将多种高光谱分类方法进行了对比实验.实验表明该算法分类精度和算法运算时间上都有较大改善,是一种分类精度更高、运算速度更快的改进型基于人工免疫网络的高光谱遥感图像分类新方法.     

LBP和2DDCT相结合的单幅人脸图像识别

LBP（局部二值模式）作为一种有效的纹理描述算子,度量和提取图像局部的纹理信息,对光照具有不变性,在单幅人脸图像识别具有很好的应用。在研究此理论的基础上提出了一种基于局部二值模式（LBP）与二维离散余弦变换（2DDCT）相结合的人脸识别方法。将单幅的人脸图像规则的分成多个子块,对每个子块进行LBP变换,把每个LBP变换的后的子块分别用2DDCT变换到频率域,大部分信息保存在低频部分,选取低频作为人脸的频率域特征,有效的降低了维数,使计算量降低。实验结果表面,在ORL人脸数据库上具有较高的识别率。     

一种应用于人脸识别的非线性降维方法

局部线性嵌入算法(locally linear embedding,LLE)作为一种新的非线性维数约减算法,在高维数据可视化方面获得了成功的应用.然而LLE算法获取的特征从分类角度而言并非最优,而且LLE算法难以获取新样本点的低维投影.为解决这两个缺陷,提出了将非线性的LLE算法和线性判别分析算法(linear discriminant analysis,LDA)相结合的一种新的非线性降维方法,通过ORL、Havard和CMU PIE三个人脸库的实验,结果表明,该方法能够大幅度提高识别率,对光照、姿态及表情变化具有一定的鲁棒性.     

一种局部敏感的核稀疏表示分类算法

为了克服核稀疏表示分类(KSRC)算法无法获取数据的局部性信息从而导致获取的稀疏表示系数判别性受到限制的不足,提出一种局部敏感的KSRC(LS-KSRC)算法用于人脸识别。通过在核特征空间中同时集成稀疏性和数据局部性信息,从而获取具有良好判别性的用于分类的稀疏表示系数。在标准的ORL人脸数据库和Extended Yale B人脸数据库的试验结果表明,本文方法的分类性能优于传统的(KSRC)算法、稀疏表示分类(SRC)算法、局部线性约束编码(LLC)、支持向量机(SVM)、最近邻法(NN)以及最近邻子空间法(NS),用于人脸识别能够取得优越的分类性能。     

Textural feature based face recognition for single training images

A novel face recognition algorithm using single training face image is proposed. The algorithm is based on textural features extracted using the 2D log Gabor wavelet. These features are encoded into a binary pattern to form a face template which is used for matching. Experimental results show that on the colour FERET database the accuracy of the proposed algorithm is higher than the local feature analysis (LFA) and correlation filter (CF) based face recognition algorithms even when the number of training images is reduced to one. In comparison with recent single training image based face recognition algorithms, the proposed 2D log Gabor wavelet based algorithm shows an improvement of more than 3% in accuracy.     

Variational Feature Representation-based Classification for face recognition with single sample per person

The single sample per person (SSPP) problem is of great importance for real-world face recognition systems. In SSPP scenario, there is always a large gap between a normal sample enrolled in the gallery set and the non-ideal probe sample. It is a crucial step for face recognition with SSPP to bridge the gap between the ideal and non-ideal samples. For this purpose, we propose a Variational Feature Representation-based Classification (VFRC) method, which employs the linear regression model to fit the variational information of a non-ideal probe sample with respect to an ideal gallery sample. Thus, a corresponding normal feature, which reserve the identity information of the probe sample, is obtained. A combination of the normal feature and the probe sample is used, which makes VFRC method more robust and effective for SSPP scenario. The experimental results show that VFRC method possesses higher recognition rate than other related face recognition methods.     

行列分块的核独立成分分析的人脸识别

提出一种行列分块的核独立成分分析(RC-KICA)的人脸识别方法。RC-KICA先对人脸图像矩阵按行列分块;然后对训练样本集依次进行行和列的核独立成分分析,得到左右解混矩阵;最后把训练样本子块投影到解混矩阵构成的特征空间进行特征提取及分类识别。RC-KICA更大程度地降低了样本维数,更好地解决了KICA高维小样本的缺陷。在YALE人脸库上的实验结果表明RC-KICA优于KICA和B-KICA。     

Multi-manifold metric learning for face recognition based on image sets

In this paper, we propose a new multi-manifold metric learning (MMML) method for the task of face recognition based on image sets. Different from most existing metric learning algorithms that learn the distance metric for measuring single images, our method aims to learn distance metrics to measure the similarity between manifold pairs. In our method, each image set is modeled as a manifold and then multiple distance metrics among different manifolds are learned. With these distance metrics, the intra-class manifold variations are minimized and inter-class manifold variations are maximized simultaneously. For each person, we learn a distance metric by using such a criterion that all the learned distance metrics are person-specific and thus more discriminative. Our method is extensively evaluated on three widely studied face databases, i.e., Honda/UCSD database, CMU MoBo database and YouTube Celebrities database, and compared to the state-of-the-arts. Experimental results are presented to show the effectiveness of the proposed method.     

基于单视图的多姿态人脸图像生成技术研究

该文提出了一种基于单视图或小样本的多姿态人脸图像生成技术,它首先利用一个特征点集表示人脸,然后基于二元高次多项式函数最小二乘方法对人脸各姿态之间的特征点集坐标变化进行拟合,形成全局的变形域,最后由单视图通过变形映射生成多姿态人脸图像。实验结果表明,利用单视图和生成的多姿态图像进行多姿态人脸识别,正确率得到大大提高,证明该文人脸图像生成技术十分有效。     

Manifold-manifold distance and its application to face recognition with image sets

In this paper, we address the problem of classifying image sets for face recognition, where each set contains images belonging to the same subject and typically covering large variations. By modeling each image set as a manifold, we formulate the problem as the computation of the distance between two manifolds, called manifold-manifold distance (MMD). Since an image set can come in three pattern levels, point, subspace, and manifold, we systematically study the distance among the three levels and formulate them in a general multilevel MMD framework. Specifically, we express a manifold by a collection of local linear models, each depicted by a subspace. MMD is then converted to integrate the distances between pairs of subspaces from one of the involved manifolds. We theoretically and experimentally study several configurations of the ingredients of MMD. The proposed method is applied to the task of face recognition with image sets, where identification is achieved by seeking the minimum MMD from the probe to the gallery of image sets. Our experiments demonstrate that, as a general set similarity measure, MMD consistently outperforms other competing nondiscriminative methods and is also promisingly comparable to the state-of-the-art discriminative methods.     

Orthogonal laplacianfaces for face recognition.

Following the intuition that the naturally occurring face data may be generated by sampling a probability distribution that has support on or near a submanifold of ambient space, we propose an appearance-based face recognition method, called orthogonal Laplacianface. Our algorithm is based on the locality preserving projection (LPP) algorithm, which aims at finding a linear approximation to the eigenfunctions of the Laplace Beltrami operator on the face manifold. However, LPP is nonorthogonal, and this makes it difficult to reconstruct the data. The orthogonal locality preserving projection (OLPP) method produces orthogonal basis functions and can have more locality preserving power than LPP. Since the locality preserving power is potentially related to the discriminating power, the OLPP is expected to have more discriminating power than LPP. Experimental results on three face databases demonstrate the effectiveness of our proposed algorithm.     

Research on a face recognition algorithm based on 3D face data and 2D face image matching

Under the condition of weak light or no light, the recognition accuracy of the mature 2D face recognition technology decreases sharply. In this paper, a face recognition algorithm based on the matching of 3D face data and 2D face images is proposed. Firstly, 3D face data is reconstructed from the 2D face in the database based on the 3DMM algorithm, and the face depth image is obtained through orthogonal projection. Then, the average curvature map of the face depth image is used to enhance the data of the depth image. Finally, an improved residual neural network based on the depth image and curvature is designed to compare the scanned face with the face in the database. The method proposed in this paper is tested on the 3D face data in three public face datasets (Texas 3DFRD, FRGC v2.0, and Lock3DFace), and the recognition accuracy is 84.25%, 83.39%, and 78.24%, respectively.