Face recognition using discriminant locality preserving projections based on maximum margin criterion

In this paper, we propose a new discriminant locality preserving projections based on maximum margin criterion (DLPP/MMC). DLPP/MMC seeks to maximize the difference, rather than the ratio, between the locality preserving between-class scatter and locality preserving within-class scatter. DLPP/MMC is theoretically elegant and can derive its discriminant vectors from both the range of the locality preserving between-class scatter and the range space of locality preserving within-class scatter. DLPP/MMC can also derive its discriminant vectors from the null space of locality preserving within-class scatter when the parameter of DLPP/MMC approaches +∞. Experiments on the ORL, Yale, FERET, and PIE face databases show the effectiveness of the proposed DLPP/MMC.     

Graph-optimized locality preserving projections

Locality preserving projections (LPP) is a typical graph-based dimensionality reduction (DR) method, and has been successfully applied in many practical problems such as face recognition. However, LPP depends mainly on its underlying neighborhood graph whose construction suffers from the following issues: (1) such neighborhood graph is artificially defined in advance, and thus does not necessary benefit subsequent DR task; (2) such graph is constructed using the nearest neighbor criterion which tends to work poorly due to the high-dimensionality of original space; (3) it is generally uneasy to assign appropriate values for the neighborhood size and heat kernel parameter involved in graph construction. To address these problems, we develop a novel DR algorithm called Graph-optimized Locality Preserving Projections (GoLPP). The idea is to integrate graph construction with specific DR process into a unified framework, which results in an optimized graph rather than predefined one. Moreover, an entropy regularization term is incorporated into the objective function for controlling the uniformity level of the edge weights in graph, so that a principled graph updating formula naturally corresponding to conventional heat kernel weights can be obtained. Finally, the experiments on several publicly available UCI and face data sets show the feasibility and effectiveness of the proposed method with encouraging results.     

Bagging null space locality preserving discriminant classifiers for face recognition

In this paper, we propose a novel bagging null space locality preserving discriminant analysis (bagNLPDA) method for facial feature extraction and recognition. The bagNLPDA method first projects all the training samples into the range space of a so-called locality preserving total scatter matrix without losing any discriminative information. The projected training samples are then randomly sampled using bagging to generate a set of bootstrap replicates. Null space discriminant analysis is performed in each replicate and the results of them are combined using majority voting. As a result, the proposed method aggregates a set of complementary null space locality preserving discriminant classifiers. Experiments on FERET and PIE subsets demonstrate the effectiveness of bagNLPDA.     

Facial expression recognition based on two-dimensional discriminant locality preserving projections

In this paper, a novel method called two-dimensional discriminant locality preserving projections (2D-DLPP) is proposed. By introducing between-class scatter constraint and label information into two-dimensional locality preserving projections (2D-LPP) algorithm, 2D-DLPP successfully finds the subspace which can best discriminate different pattern classes. So the subspace obtained by 2D-DLPP has more discriminant power than 2D-LPP, and is more suitable for recognition tasks. The proposed method was applied to facial expression recognition tasks on JAFFE and Cohn-Kanade database and compared with other three widely used two-dimensional methods: 2D-PCA, 2D-LDA and 2D-LPP. The high recognition rates show the effectiveness of the proposed algorithm.     

基于判别正则化的局部保留投影

局部保留投影（Locality preserving projections,LPP）是一种常用的线性化流形学习方法,其通过线性嵌入来保留基于图所描述的流形数据本质结构特征,因此LPP对图的依赖性强,且在嵌入过程中缺少对图描述的进一步分析和挖掘。当图对数据本质结构特征描述不恰当时,LPP在嵌入过程中不易实现流形数据本质结构的有效提取。为了解决这个问题,本文在给定流形数据图描述的条件下,通过引入局部相似度阈值进行局部判别分析,并据此建立判别正则化局部保留投影（简称DRLPP）。该方法能够在现有图描述的条件下,有效突出不同流形结构在线性嵌入空间中的可分性。在人造合成数据集和实际标准数据集上对DRLPP以及相关算法进行对比实验,实验结果证明了DRLPP的有效性。     

多非线性多视角局部保持投影的步态识别

已知样本与待识别样本的视角差异是影响步态识别精度的主要因素,子空间方法将不同视角的步态投影到公共子空间,能有效避免视角差异的影响.但现有方法多通过学习投影矩阵对样本进行线性投影,难以保持多视角步态数据的原始非线性结构.针对于此,本文提出多非线性多视角局部保持投影.先用非线性函数族实现样本的多次非线性投影,再基于局部结构保持原则将不同视角的样本投影到公共子空间,最后在公共子空间中进行最近邻分类识别.在多视角步态库CASIA(B)进行步态识别实验,结果表明本文方法在多种视角组合下优于其它投影方法.     

Enhanced locality preserving projections using robust path based similarity

Curse of dimensionality is a bothering problem in high dimensional data analysis. To enhance the performances of classification or clustering on these data, their dimensionalities should be reduced beforehand. Locality Preserving Projections (LPP) is a widely used linear dimensionality reduction method. It seeks a subspace in which the neighborhood graph structure of samples is preserved. However, like most dimensionality reduction methods based on graph embedding, LPP is sensitive to noise and outliers, and its effectiveness depends on choosing suitable parameters for constructing the neighborhood graph. Unfortunately, it is difficult to choose effective parameters for LPP. To address these problems, we propose an Enhanced LPP (ELPP) using a similarity metric based on robust path and a Semi-supervised ELPP (SELPP) with pairwise constraints. In comparison with original LPP, our methods are not only robust to noise and outliers, but also less sensitive to parameters selection. Besides, SELPP makes use of pairwise constraints more efficiently than other comparing methods. Experimental results on real world face databases confirm their effectiveness.     

基于图像矩阵判别局部保持投影的人脸识别

提出一种基于图像矩阵判别局部保持投影的人脸识别方法。图像矩阵判别局部保持投影是在局部保持投影基础上进行了扩展,考虑了类标签信息并在其目标函数中增加类间散度约束,使得求解的特征更具判别性。另外,图像矩阵判别局部保持投影是直接处理图像矩阵而不需要将矩阵转化为向量,保留了像素间的空间位置关系,避免了奇异性问题。实验结果表明该方法是有效的。     

基于保局投影的离线签名识别

针对离线签名识别中的特征提取问题,提出了一种基于保局投影的签名识别方法。该方法首先对签名图像进行形状特征、伪动态特征和纹理特征的提取;然后采用保局投影得到更具判别性的特征;最后运用支持向量机进行分类识别。实验表明该方法不但能有效地降低特征空间的维数,而且能使分类准确率得到显著提高。     

嵌入保局投影及在表情识别中的应用

提出了一种基于嵌入保局投影的人脸表情识别方法,称之为ELPP。通过降维处理,ELPP不仅保留邻空间的局部结构信息,通过样本化的图像嵌入处理,还保留了嵌入空间的数据信息,这样可从原始表情数据中提取更多更有效更具判决性的表情特征信息。基于JAFFE和CED-WYU两个表情数据库的识别结果表明,基于ELPP的特征提取方法能有效地改善识别效果。     

Face recognition using discriminative locality preserving vectors

We proposed an effective face recognition method based on the discriminative locality preserving vectors method (DLPV). Using the analysis of eigenspectrum modeling of locality preserving projections, we selected the reliable face variation subspace of LPP to construct the locality preserving vectors to characterize the data set. The discriminative locality preserving vectors (DLPV) method is based on the discriminant analysis on the locality preserving vectors. Furthermore, the theoretical analysis showed that the DLPV is viewed as a generalized discriminative common vector, null space linear discriminant analysis and null space discriminant locality preserving projections, which gave the intuitive motivation of our method. Extensive experimental results obtained on four well-known face databases (ORL, Yale, Extended Yale B and CMU PIE) demonstrated the effectiveness of the proposed DLPV method.     

基于无参数二维判别局部保持投影算法的人脸识别

通过向二维局部保持投影（2D-LPP）算法中引入类间约束和类标识信息,得到二维判别局部保持投影（2D-DLPP）算法,使它拥有更多的判别信息。但它却面临复杂的参数选择问题,这使得它在解决识别问题时受到限制。为解决此问题,构造无参数的相似矩阵,提出无参数的二维判别局部投影（无参数2D-DLPP）算法。在Yale和ORL人脸库上的仿真实验结果表明,该算法与二维判别局部保持投影（2D-DLPP）、二维局部保持投影法（2D-LPP）和二维线性判别分析法（2D-LDA）相比能够取得更高的识别率。     

核的正交完备鉴别局部保持投影

针对完备鉴别局部保持投影算法所求得的最优判别矢量间存在信息冗余问题,提出了核的正交完备鉴别局部保持投影算法。通过将核函数技术与正交性原理融合,采用高斯核函数将原始样本映射到高维特征空间,在高维特征空间的局部总体散度矩阵中计算最优判别矢量,只需在整个范围内对值域空间进行特征值分解,去除局部零空间达到样本降维目的。该算法分别在 UMIST 人脸库和 JAFFE 人脸表情库上进行实验,实验结果表明算法的识别率高达95．59％。     

Regularized locality preserving discriminant analysis for face recognition

This paper proposes a regularized locality preserving discriminant analysis (RLPDA) approach for facial feature extraction and recognition. The RLPDA approach decomposes the eigenspace of the locality preserving within-class scatter matrix into three subspaces, i.e., the face space, the noise space and the null space, and then regularizes the three subspaces differently according to their predicted eigenvalues. As a result, the proposed approach integrates discriminative information in all of the three subspaces, de-emphasizes the effect of the eigenvectors corresponding to the small eigenvalues, and meanwhile suppresses the small sample size problem. Extensive experiments on ORL face database, FERET face subset and UMIST face database illustrate the effectiveness of the proposed approach.     

Two-dimensional locality preserving projections (2DLPP) with its application to palmprint recognition

This paper proposes a novel algorithm for image feature extraction, namely, the two-dimensional locality preserving projections (2DLPP), which directly extracts the proper features from image matrices based on locality preserving criterion. Experimental results on the PolyU palmprint database show the effectiveness of the proposed algorithm.     

Improved discriminant locality preserving projections for face and palmprint recognition

We propose in this paper two improved manifold learning methods called diagonal discriminant locality preserving projections (Dia-DLPP) and weighted two-dimensional discriminant locality preserving projections (W2D-DLPP) for face and palmprint recognition. Motivated by the fact that diagonal images outperform the original images for conventional two-dimensional (2D) subspace learning methods such as 2D principal component analysis (2DPCA) and 2D linear discriminant analysis (2DLDA), we first propose applying diagonal images to a recently proposed 2D discriminant locality preserving projections (2D-DLPP) algorithm, and formulate the Dia-DLPP method for feature extraction of face and palmprint images. Moreover, we show that transforming an image to a diagonal image is equivalent to assigning an appropriate weight to each pixel of the original image to emphasize its different importance for recognition, which provides the rationale and superiority of using diagonal images for 2D subspace learning. Inspired by this finding, we further propose a new discriminant weighted method to explicitly calculate the discriminative score of each pixel within a face and palmprint sample to duly emphasize its different importance, and incorporate it into 2D-DLPP to formulate the W2D-DLPP method to improve the recognition performance of 2D-DLPP and Dia-DLPP. Experimental results on the widely used FERET face and PolyU palmprint databases demonstrate the efficacy of the proposed methods.     

Inverse Fisher discriminate criteria for small sample size problem and its application to face recognition

This paper addresses the small sample size problem in linear discriminant analysis, which occurs in face recognition applications. Belhumeur et al. [IEEE Trans. Pattern Anal. Mach. Intell. 19 (7) (1997) 711-720] proposed the FisherFace method. We find out that the FisherFace method might fail since after the PCA transform the corresponding within class covariance matrix can still be singular, this phenomenon is verified with the Yale face database. Hence we propose to use an inverse Fisher criteria. Our method works when the number of training images per class is one. Experiment results suggest that this new approach performs well.     

A novel process monitoring and fault detection approach based on statistics locality preserving projections

Data-driven fault detection technique has exhibited its wide applications in industrial process monitoring. However, how to extract the local and non-Gaussian features effectively is still an open problem. In this paper, statistics locality preserving projections (SLPP) is proposed to extract the local and non-Gaussian features. Firstly, statistics pattern analysis (SPA) is applied to construct process statistics and grasp the non-Gaussian statistical property using high order statistics. Then, locality preserving projections (LPP) method is used to discover local manifold structure of the statistics. In essence, LPP tries to map the close points in the original space to close in the low-dimensional space. Lastly, T² and squared prediction error (SPE) charts of SLPP model are used to detect process faults. One simple simulated system and the Tennessee Eastman process show that the proposed SLPP method is more effective than principal component analysis, LPP and statistics principal component analysis in fault detection performance.     

Multivariate statistical process control based on multiway locality preserving projections

An approach for multivariate statistical process control based on multiway locality preserving projections (LPP) is presented. The recently developed LPP is a linear dimensionality reduction technique for preserving the neighborhood structure of the data set. It is characterized by capturing the intrinsic structure of the observed data and finding more meaningful low-dimensional information hidden in the high-dimensional observations compared with PCA. In this study, LPP is used to extract the intrinsic geometrical structure of the process data. Hotelling’s T² (D) and the squared prediction error (SPE or Q) statistic charts for on-line monitoring are then presented, and the contribution plots of these two statistical indices are used for fault diagnosis. Moreover, a moving window technique is used for the implementation of on-line monitoring. Case study was carried out with the data of industrial penicillin fed-batch cultivations. As a comparison, the results obtained with the MPCA are also presented. It is concluded that the Multiway LPP (MLPP) outperforms the conventional MPCA. Finally, the robustness of the MLPP monitoring is analyzed by adding noises to the original data.     

Regularized discriminant analysis for the small sample size problem in face recognition

It is well-known that the applicability of both linear discriminant analysis (LDA) and quadratic discriminant analysis (QDA) to high-dimensional pattern classification tasks such as face recognition (FR) often suffers from the so-called “small sample size” (SSS) problem arising from the small number of available training samples compared to the dimensionality of the sample space. In this paper, we propose a new QDA like method that effectively addresses the SSS problem using a regularization technique. Extensive experimentation performed on the FERET database indicates that the proposed methodology outperforms traditional methods such as Eigenfaces, direct QDA and direct LDA in a number of SSS setting scenarios.