Two-dimensional complete neighborhood preserving embedding

Complete neighborhood preserving embedding (CNPE) is an improvement to the neighborhood preserving embedding (NPE) algorithm, which can address the singularity and stability problems of NPE and at the same time preserve useful discriminative information. However, CNPE works with vectorized representations of data, and thus, the original 2D face image matrices should be previously transformed into the same dimensional vectors. Such a matrix-to-vector transform usually leads to a high-dimensional image vector space, which makes the eigenanalysis quite difficult and time-consuming. Beyond computational issues, some spatial structural information between nearby pixels may be lost after vectorization. In this paper, we develop a new scheme for image feature extraction, namely, two-dimensional complete neighborhood preserving embedding (2D-CNPE). 2D-CNPE builds the eigenmatrix and the weight matrix which characterize local neighborhood properties of data directly based on the original face images, and then, the optimal embedding axes are obtained by performing an eigen-decomposition. Experimental results on three face databases show that the proposed 2D-CNPE achieves better performance than other feature extraction methods, such as Eigenfaces, Fisherfaces, and 2D-PCA.     

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

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

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

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

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

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

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

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

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

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

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

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

A novel maximum margin neighborhood preserving embedding for face recognition

This paper presents a novel supervised linear dimensionality reduction approach called maximum margin neighborhood preserving embedding (MMNPE). The central idea is to modify the neighborhood preserving embedding by maximizing the maximum margin distance while preserving the geometric structure of the manifold. Experimental results conducted on the ORL database, the Yale database and the VALID face database indicate the effectiveness of the proposed MMNPE.     

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.     

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.     

基于QR分解的正则化邻域保持嵌入算法

针对训练样本不足时,对数据的低维子空间估计可能会产生严重偏差的问题,提出了一种基于QR分解的正则化邻域保持嵌入算法。首先,该算法定义一个局部拉普拉斯矩阵保留原始数据的局部结构;其次,将类内散度矩阵的特征谱空间划分成三个子空间,通过倒数谱模型定义的权值函数获得新的特征向量空间,进而对高维数据进行预处理;最后,定义一个邻域保持邻接矩阵,利用QR分解获得的投影矩阵和最近邻分类器进行人脸分类。与正则化广义局部保持投影(RGDLPP)算法相比,所提算法在ORL、Yale、FERET和PIE库上识别率分别提高了2个百分点、1.5个百分点、1.5个百分点和2个百分点。实验结果表明,所提算法易于实现,在小样本(SSS)下有较高的识别率。     

核岭回归的邻域保持最大间隔分析的人脸识别

邻域保持嵌入是局部线性嵌入的线性近似,强调保持数据流形的局部结构.改进的最大间隔准则重视数据流形的判别和几何结构,提高了对数据的分类性能.文中提出的核岭回归的邻域保持最大间隔分析既保持流形的局部结构,又使不同类别的数据保持最大间隔,以此构建算法的目标函数.为了解决数据流形高度非线性化的问题,算法采用核岭回归计算特征空间的变换矩阵.先求解数据样本在核子空间中降维映射的结果,再解得核子空间.在标准人脸数据库上的实验表明该算法正确有效,并且识别性能优于普通的流形学习算法.     

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

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

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.     

中心近邻嵌入学习算法的人脸识别研究

针对人脸识别问题,提出了一种中心近邻嵌入的学习算法,其与经典的局部线性嵌入和保局映射不同,它是一种有监督的线性降维方法。该方法首先通过计算各类样本中心,并引入中心近邻距离代替两样本点之间的直接距离作为权系数函数的输入;然后再保持中心近邻的几何结构不变的情况下把高维数据嵌入到低维坐标系中。通过中心近邻嵌入学习算法与其他3种人脸识别方法(即主成分分析、线形判别分析及保局映射)在ORL、Yale及UMIST人脸库上进行的比较实验结果表明,它在高维数据低维可视化和人脸识别效果等方面均较其他3种方法取得了更好的效果。     

基于度量优化的保持邻域嵌入的人脸识别

监督的保持邻域嵌入算法采用欧氏度量选取k近邻。欧氏度量在数据维数较低时能获得较好的结果,但直接简单地将其从低维空间的应用推广到高维空间中不能取得较好的结果。针对该缺点,提出度量优化的保持邻域嵌入算法。该算法分为无类标号信息(MONPE)和有类标号信息(CLMONPE)2种情况,利用线性判别分析算法降维后的数据选取k近邻。在Yale人脸数据库上的实验结果表明,CLMONPE算法效果较优。     

有监督核化邻域投影分析算法

通过将鉴别邻域嵌入分析算法扩展到非线性场景,提出了一种有监督核化邻域投影分析算法。该算法在目标函数中引入类别标签和线性投影矩阵,并利用核函数处理非线性数据。通过两种不同策略优化目标函数,可将该算法进一步细分为有监督核化邻域投影分析算法一及有监督核化邻域投影分析算法二。其中,在有监督核化邻域投影分析算法一中应用拉普拉斯搜索方向达到了较快的收敛速度并降低了计算复杂度。实验结果表明,所提算法对于复杂的数据流形具有较高的识别率,且与鉴别邻域嵌入分析等相关算法相比在有效性和鲁棒性方面的表现更为出色。     

流形距离与压缩感知核稀疏投影的局部线性嵌入算法

流形学习算法的目的是发现嵌入在高维数据空间中的低维表示,现有的流形学习算法对邻域参数k和噪声比较敏感。针对此问题,文中提出一种流形距离与压缩感知核稀疏投影的局部线性嵌入算法,其核心思想是集成局部线性嵌入算法对高维流形结构数据的降维有效性与压缩感知核稀疏投影的强鉴别性,以实现高效有降噪流形学习。首先,在选择各样本点的近邻域时,采用流形距离代替欧氏距离度量数据间相似度的方法,创建能够正确反映流形内部结构的邻域图,解决以欧氏距离作为相似性度量时对邻域参数的敏感。其次,利用压缩感知核稀疏投影作为从高维观测空间到低维嵌入空间的映射,增强算法的鉴别性。最后,利用Matlab工具对实验数据集进行仿真,进一步验证所提算法的有效性。     

邻域保持嵌入—加权k近邻故障检测算法及其在半导体蚀刻过程中的应用

为了解决复杂的多模态过程故障检测问题,提出了邻域保持嵌入-加权k近邻规则（neighborhood preserving embedding-weighted k-nearest neighbors,NPE-wkNN）质量监控方法.首先,利用邻域保持嵌入（neighborhood preserving embedding,NPE）得到特征空间中数据的流形结构;然后,在特征空间中确定每个样本第k近邻的前K近邻集并计算样本的权重.最后,将样本的加权距离作为统计量对过程进行质量监控.NPE-wkNN方法在保持原始数据近邻结构的同时降低了计算复杂度,除此之外,权重规则消除了数据的多模态特征,从而提高了过程故障检测率.通过数值实例和半导体蚀刻工艺仿真实验,对比了传统的主元分析（principal component analysis,PCA）、NPE、k近邻（k-nearest neighbor,kNN）、加权k近邻（weighted kNN,wkNN）等方法,结果验证了本文方法的有效性.     

Sparse neighbor representation for classification

Recent research of sparse signal representation has aimed at learning discriminative sparse models instead of purely reconstructive ones for classification tasks, such as sparse representation based classification (SRC) which obtains state-of-the-art results in face recognition. In this paper, a new method is proposed in that direction. With the assumption of locally linear embedding, the proposed method achieves the classification goal via sparse neighbor representation, combining the reconstruction property, sparsity and discrimination power. The experiments on several data sets are performed and results show that the proposed method is acceptable for nonlinear data sets. Further, it is argued that the proposed method is well suited for the classification of low dimensional data dimensionally reduced by dimensionality reduction methods, especially the methods obtaining the low dimensional and neighborhood preserving embeddings, and it costs less time.