Complete neighborhood preserving embedding for face recognition

Neighborhood preserving embedding (NPE) is a linear approximation to the locally linear embedding algorithm which can preserve the local neighborhood structure on the data manifold. However, in typical face recognition where the number of data samples is smaller than the dimension of data space, it is difficult to directly apply NPE to high dimensional matrices because of computational complexity. Moreover, in such case, NPE often suffers from the singularity problem of eigenmatrix, which makes the direct implementation of the NPE algorithm almost impossible. In practice, principal component analysis or singular value decomposition is applied as a preprocessing step to attack these problems. Nevertheless, this strategy may discard dimensions that contain important discriminative information and the eigensystem computation of NPE could be unstable. Towards a practical dimensionality reduction method for face data, we develop a new scheme in this paper, namely, the complete neighborhood preserving embedding (CNPE). CNPE transforms the singular generalized eigensystem computation of NPE into two eigenvalue decomposition problems. Moreover, a feasible and effective procedure is proposed to alleviate the computational burden of high dimensional matrix for typical face image data. Experimental results on the ORL face database and the Yale face database show that the proposed CNPE algorithm achieves better performance than other feature extraction methods, such as Eigenfaces, Fisherfaces and NPE, etc.     

KNPE算法在化工过程故障检测中的应用

化工生产过程具有维数高、非线性强等特点。针对传统的邻域保持嵌入(NPE)算法对非线性数据特征提取不足的缺陷,引入高斯核函数,将数据由非线性的输入空间转换到线性的特征空间。核邻域保持嵌入(KNPE)算法在构建局部空间特征结构的基础上,能够更好地提取数据的非线性结构。通过以田纳西-伊斯曼(TE)仿真过程为例,构造T2和SPE统计量进行故障检测,证明了KNPE方法比NPE和KPCA方法能够更快更准确的检测出非线性故障的发生。     

基于二维近邻保持嵌入的图像识别

近邻保持嵌入算法(NPE)是一种保持数据流形上局部结构的子空间学习算法,它是对局部线性嵌入的线性逼近。然而当数据为图像时,图像被拉直为向量后的维数通常非常高,而样本点有限,由于矩阵的奇异性,NPE不能直接运用。我们将NPE推广到二维情形,提出二维近邻保持嵌入算法(2D-NPE)。2D-NPE直接在二维图像矩阵上提取图像特征,而不是把图像拉直成一维向量后再提取特征。通过在手写数字字符图像库和Yale人脸图像库上的实验,验证算法的有效性。     

改进的保持邻域嵌入人脸识别方法

为进一步提高保持邻域嵌入算法在人脸识别中的识别性能,提出一种改进的保持邻域嵌入人脸识别方法LDNPE。利用先验的类标签信息构造权重矩阵,按照线性鉴别的思想把类间散布矩阵嵌入到目标函数中,增加样本类间散布约束,基于修改后的目标函数得到最优变换矩阵,并用最近距离分类器分类。在CAS-PEAL和FERET人脸数据库上的实验结果表明该算法的有效性。     

基于类别信息的邻域保持嵌入算法

邻域保持嵌入通常被广泛用于发现高维数据的固有内在维数.为了充分利用样本的类别信息,构建了一个具有判别信息的邻接矩阵,其可以使同类样本点更加紧凑而异类样本点更加疏远.在此基础上,提出了基于类别信息的邻域保持嵌入算法.基于类别信息的邻域保持嵌入算法在不破坏原始高维数据局部几何结构的同时,可以使处于不同子流形上的样本点尽量分开.在UCI数据集和ORL人脸数据集上的实验结果表明,基于类别信息的邻域保持嵌入算法具有较高的识别率.     

一种改进的邻域保持嵌入算法

邻域保持嵌入(NPE)是一种新颖的子空间学习算法,在降维的同时保持了样本集原有的局部邻域流形结构。为了进一步增强NPE在人脸识别和语音识别中的识别功能,提出了一种改进的邻域保持嵌入算法(RNPE)。在NPE的基础上通过引入类间权值矩阵,使得类间离散度最大,类内离散度最小,增加了样本类间散布约束。最后利用极端学习机(ELM)分类器进行分类,在Yale人脸库、Umist人脸库、Isolet语音库上的实验结果表明,RNPE算法的识别率明显高于NPE算法、LMMDE算法以及RAF-GE算法。     

基于二维邻域保持判别嵌入的人脸识别

提出二维邻域保持判别嵌入(2DNPDE)算法,该算法是一种有监督的基于二维图像矩阵的特征提取算法.为表示样本的类内邻域结构和类间距离关系,分别构建类内邻接矩阵和类间相似度矩阵.2DNPDE所获得的投影空间不但使不同类数据点的低维嵌入相互分离,而且保留同类样本的邻域结构和不同类样本的距离关系.在ORL和AR人脸数据库上的实验表明,该算法具有更好的识别效果.     

Sparsity preserving projections with applications to face recognition

Dimensionality reduction methods (DRs) have commonly been used as a principled way to understand the high-dimensional data such as face images. In this paper, we propose a new unsupervised DR method called sparsity preserving projections (SPP). Unlike many existing techniques such as local preserving projection (LPP) and neighborhood preserving embedding (NPE), where local neighborhood information is preserved during the DR procedure, SPP aims to preserve the sparse reconstructive relationship of the data, which is achieved by minimizing a L1 regularization-related objective function. The obtained projections are invariant to rotations, rescalings and translations of the data, and more importantly, they contain natural discriminating information even if no class labels are provided. Moreover, SPP chooses its neighborhood automatically and hence can be more conveniently used in practice compared to LPP and NPE. The feasibility and effectiveness of the proposed method is verified on three popular face databases (Yale, AR and Extended Yale B) with promising results.     

改进LNS和邻域保持嵌入算法的研究

传统邻域保持嵌入算法(Neighbor Preserving Embedding,NPE)对具有多中心、方差差异明显特性的高维数据的降维处理效果并不好,因此提出一种改进LNS和邻域保持嵌入算法(Modified Local Neighbor Standardiza-tion-Neighbor Preserving Em...     

正交化近邻关系保持的降维及分类算法

针对近邻关系保持嵌入（NPE）算法易于受到降低后的维数影响,而且性能依赖于正确的维数估计的问题,提出了一种正交化的近邻关系保持的嵌入降维方法——ONPE。ONPE方法是使用数据点间的近邻关系来构造邻接图,假设每个数据点都能由其近邻点的线性组合表示,则可以通过提取数据点的局部几何信息,并在降维中保持提取的局部几何信息,迭代地计算正交基来得到数据的低维嵌入坐标。同时,在ONPE算法的基础上,利用局部几何信息,提出了一种在低维空间中使用标签传递（LNP）的分类算法——ONPC。其是假设高维空间中的局部近邻关系在降维后的空间中依然得到保持,并且数据点的类别可由近邻点的类别得到。在人工数据和人脸数据上的实验表明,该算法在减少维数依赖的同时,能有效提高NPE算法的分类性能。     

基于交叉熵的改进NPE间歇过程故障检测算法

针对具有复杂动态特性的间歇过程进行故障检测,邻域保持嵌入(neighborhood preserving embedding,NPE)算法在保持数据局部几何结构时因忽略全局信息而造成检测率较低的问题,提出一种基于交叉熵(cross entropy,CE)的邻域保持嵌入(CEGLNPE)算法.首先,将交叉熵保持全局结构的...     

Kernel class-wise locality preserving projection

In the recent years, the pattern recognition community paid more attention to a new kind of feature extraction method, the manifold learning methods, which attempt to project the original data into a lower dimensional feature space by preserving the local neighborhood structure. Among them, locality preserving projection (LPP) is one of the most promising feature extraction techniques. However, when LPP is applied to the classification tasks, it shows some limitations, such as the ignorance of the label information. In this paper, we propose a novel local structure based feature extraction method, called class-wise locality preserving projection (CLPP). CLPP utilizes class information to guide the procedure of feature extraction. In CLPP, the local structure of the original data is constructed according to a certain kind of similarity between data points, which takes special consideration of both the local information and the class information. The kernelized (nonlinear) counterpart of this linear feature extractor is also established in the paper. Moreover, a kernel version of CLPP namely Kernel CLPP (KCLPP) is developed through applying the kernel trick to CLPP to increase its performance on nonlinear feature extraction. Experiments on ORL face database and YALE face database are performed to test and evaluate the proposed algorithm.     

基于鉴别稀疏保持嵌入的人脸识别算法

鉴于近年来稀疏表示（Sparse representation,SR）在高维数据例如人脸图像的特征提取与降维领域的快速发展,对原始的稀疏保持投影（Sparsity preserving projection,SPP）算法进行了改进,提出了一种叫做鉴别稀疏保持嵌入（Discriminant sparsity preserving embedding,DSPE）的算法. 通过求解一个最小二乘问题来更新SPP中的稀疏权重并得到一个更能真实反映鉴别信息的鉴别稀疏权重,最后以最优保持这个稀疏权重关系为目标来计算高维数据的低维特征子空间.该算法是一个线性的监督学习算法,通过引入鉴别信息,能够有效地对高维数据进行降维. 在ORL库、Yale库、扩展Yale B库和CMU PIE库上的大量实验结果验证了算法的有效性.     

Locality preserving embedding for face and handwriting digital recognition

Most supervised manifold learning-based methods preserve the original neighbor relationships to pursue the discriminating power. Thus, structure information of the data distributions might be neglected and destroyed in low-dimensional space in a certain sense. In this paper, a novel supervised method, called locality preserving embedding (LPE), is proposed to feature extraction and dimensionality reduction. LPE can give a low-dimensional embedding for discriminative multi-class sub-manifolds and preserves principal structure information of the local sub-manifolds. In LPE framework, supervised and unsupervised ideas are combined together to learn the optimal discriminant projections. On the one hand, the class information is taken into account to characterize the compactness of local sub-manifolds and the separability of different sub-manifolds. On the other hand, at the same time, all the samples in the local neighborhood are used to characterize the original data distributions and preserve the structure in low-dimensional subspace. The most significant difference from existing methods is that LPE takes the distribution directions of local neighbor data into account and preserves them in low-dimensional subspace instead of only preserving the each local sub-manifold’s original neighbor relationships. Therefore, LPE optimally preserves both the local sub-manifold’s original neighborhood relationships and the distribution direction of local neighbor data to separate different sub-manifolds as far as possible. The criterion, similar to the classical Fisher criterion, is a Rayleigh quotient in form, and the optimal linear projections are obtained by solving a generalized Eigen equation. Furthermore, the framework can be directly used in semi-supervised learning, and the semi-supervised LPE and semi-supervised kernel LPE are given. The proposed LPE is applied to face recognition (on the ORL and Yale face databases) and handwriting digital recognition (on the USPS database). The experimental results show that LPE consistently outperforms classical linear methods, e.g., principal component analysis and linear discriminant analysis, and the recent manifold learning-based methods, e.g., marginal Fisher analysis and constrained maximum variance mapping.     

Process monitoring via enhanced neighborhood preserving embedding

A novel process monitoring scheme named enhanced neighborhood preserving embedding (ENPE) is proposed. Neighborhood preserving embedding (NPE) only considers the reconstruction error on the basis of each local neighborhood is linear. For the purpose of addressing both the reconstruction error and the distance, the dual weight matrix and the enhanced objective function are constructed in the ENPE method. Finally, under a numerical example and the Tennessee Eastman (TE) benchmark, the superiority of the proposed ENPE method is evaluated through comparing with principal component analysis (PCA) and NPE.     

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.     

基于彩色人脸图像的信息融合与识别方法

图像的彩色信息进行图像识别并有效地降低因利用颜色信息所带来的计算量大幅增加问题,提出了一种基于彩色图像的监督近邻保留嵌套的人脸识别方法,通过对图像的彩色信息进行信息融合并利用监督近邻保留嵌套算法来提高人脸识别的效率。首先,采用Gabor变换分别对彩色图像的每个彩色分量图提取Gabor特征;然后采用典型相关分析对所提取的Gabor特征进行特征融合,并采用监督近邻保留嵌套算法对高维彩色图像特征进行降维;最后,采用最近邻分类器对图像进行分类。实验基于XM2VTS和FRAV2D彩色人脸数据库,采用主成分分析、线性判别分析以及监督近邻保留嵌套对基于灰度图像的Gabor特征和基于彩色信息融合的Gabor特征进行降维,其结果说明多信通彩色图像融合技术与监督近邻保留嵌套结合的方法可以显著提高识别系统性能。     

Discriminant sparse neighborhood preserving embedding for face recognition

Sparse subspace learning has drawn more and more attentions recently. However, most of the sparse subspace learning methods are unsupervised and unsuitable for classification tasks. In this paper, a new sparse subspace learning algorithm called discriminant sparse neighborhood preserving embedding (DSNPE) is proposed by adding the discriminant information into sparse neighborhood preserving embedding (SNPE). DSNPE not only preserves the sparse reconstructive relationship of SNPE, but also sufficiently utilizes the global discriminant structures from the following two aspects: (1) maximum margin criterion (MMC) is added into the objective function of DSNPE; (2) only the training samples with the same label as the current sample are used to compute the sparse reconstructive relationship. Extensive experiments on three face image datasets (Yale, Extended Yale B and AR) demonstrate the effectiveness of the proposed DSNPE method.     

Supervised optimal locality preserving projection

In the past few years, the computer vision and pattern recognition community has witnessed a rapid growth of a new kind of feature extraction method, the manifold learning methods, which attempt to project the original data into a lower dimensional feature space by preserving the local neighborhood structure. Among these methods, locality preserving projection (LPP) is one of the most promising feature extraction techniques. Unlike the unsupervised learning scheme of LPP, this paper follows the supervised learning scheme, i.e. it uses both local information and class information to model the similarity of the data. Based on novel similarity, we propose two feature extraction algorithms, supervised optimal locality preserving projection (SOLPP) and normalized Laplacian-based supervised optimal locality preserving projection (NL-SOLPP). Optimal here means that the extracted features via SOLPP (or NL-SOLPP) are statistically uncorrelated and orthogonal. We compare the proposed SOLPP and NL-SOLPP with LPP, orthogonal locality preserving projection (OLPP) and uncorrelated locality preserving projection (ULPP) on publicly available data sets. Experimental results show that the proposed SOLPP and NL-SOLPP achieve much higher recognition accuracy.     

Supervised Discriminant Projection with Its Application to Face Recognition

In the past few decades, many face recognition methods have been developed. Among these methods, subspace analysis is an effective approach for face recognition. Unsupervised discriminant projection (UDP) finds an embedding subspace that preserves local structure information, and uncovers and separates embedding corresponding to different manifolds. Though UDP has been applied in many fields, it has limits to solve the classification tasks, such as the ignorance of the class information. Thus, a novel subspace method, called supervised discriminant projection (SDP), is proposed for face recognition in this paper. In our method, the class information was utilized in the procedure of feature extraction. In SDP, the local structure of the original data is constructed according to a certain kind of similarity between data points, which takes special consideration of both the local information and class information. We test the performance of the proposed method SDP on three popular face image databases (i.e. AR database, Yale database, and a subset of FERET database). Experimental results show that the proposed method is effective.