应用于人脸识别的监督局部邻域保持嵌入算法

提出了一种应用于人脸识别的监督线性维数约简 算法。首先引入图像距离度量方法以确定人脸数据 之间的相似程度,之后将训练样本的类标先验信息融入到邻域保持嵌入(NPE,neighborhood preserving embedding)算法的目标函 数中,使得降维后的嵌入空间的投影数据呈多流形分布,不仅最优保持了样本空间的局部几 何结构,同时各类样本 投影的类内散度最小化,类间散度最大化,增大了各类数据分布之间的间隔,提高了嵌入空 间的辨别能力。在Extended Yale B和CMU PIE两个开放人脸数据库上进行了识别实验,结果表明,本文算法取得了很好 的识别效果。     

近邻边界Fisher判别分析

将数据集进行合理的维数约简对于一些机器学习算法效率的提高起着至关重要的影响。该文提出了一种利用数据点邻域信息的线性监督降维算法:近邻边界Fisher判别分析(Neighborhood Margin Fisher Discriminant Analysis,NMFDA)。NMFDA尝试将每一数据点邻域内最远的同类数据点和最近的异类数据点之间的边界在投影子空间内尽可能地扩大,从而提高基于距离的识别算法的准确率。同时为了解决非线性降维问题,提出了Kernel NMFDA,通过在几个标准人脸数据库上与其它降维算法的对比识别实验,验证了提出算法的有效性。     

基于二维局部敏感判别分析法的雷达目标识别

由于在不同的观察角度、位置以及光照等条件下雷达目标图像之间差异较大,使得很多经典的维数约简和特征提取算法不能有效地用于飞机目标图像识别。基于二维局部敏感判别分析(2DLSDA),提出了一种雷达目标识别方法。首先构造类内和类间邻域关系图,计算两个邻域图上的权重矩阵;然后基于Schur分解求出两个正交变换矩阵,得到映射矩阵,对观察数据进行维数约简,由此有效地克服小样本问题。对飞机目标的分类实验结果表明,该方法是有效可行的。     

张量正交局部敏感判别式分析及其在人脸识别中的应用

针对人脸识别的特征提取问题,本文提出了一种张量正交局部敏感判别分析(Tensor-based Orthogonal Locality Sensitive Discriminant Analysis, Tensor-OLSDA)的人脸识别算法。张量正交局部敏感判别分析在保持了流形的局部几何结构的同时加强了全局判别结构,并克服了局部敏感判别分析算法中非正交性带来的度量失真和维数估计困难等问题,从而增强了数据的可分性,提高了识别效果。张量正交局部敏感判别分析首先将人脸数据表示成高阶张量形式,在进行特征提取时将高阶张量数据沿不同阶展开,再利用特征根之间的正交性约束条件,求解正交局部敏感判别式分析特征子空间,最后将高阶人脸数据投影于这个特征子空间,进行识别。在AT&T和YaleB人脸库上的实验结果表明,Tensor-OLSDA具有良好的分类性能,能获得较为理想的识别结果。      

值域空间超球面上的判别分析

Fisher线性判别分析(LDA)是模式识别中使用最广泛的线性分析方法之一。然而,实际应用中,样本数量相对于样本空间的维数而言是很少的,即样本在高维空间中呈稀疏分布。LDA采用基于欧式距离的度量方法将会使判别向量趋向于较大的类间距离。从而,可能融合距离较近的类。我们用超球面模型表示数据在高维空间中的结构信息,提出一种值域空间中的超球面判别分析方法(RHDA)。RHDA方法将数据映射到其值域空间的单位超球面上;在值域空间超球面上计算各个子类的判别子空间;最后,计算测试样本与各个判别子空间中子类均值向量间的距离。RHDA将测试样本判别为第 类仅当测试样本与第 类的均值向量的距离最小。超球面判别分析采用单位超球面上数据的归一化向量来表示样本向量的结构信息,它主要针对于基于欧式距离的判别分析所引起的判别向量偏离问题。最后本文还提出了值域空间超球面核判别分析方法。超球面核判别分析方法为高维空间中对不同数据采用不同映射提供了可能。在不同数据库上的分类实验结果证实了RHDA相对于 LDA及其相关推广算法的优良性。      

基于二维局部敏感判别分析法的雷达目标识别

由于在不同的观察角度、位置以及光照等条件下雷达目标图像之间差异较大,使得很多经典的维数约简和特征提取算法不能有效地用于飞机目标图像识别.基于二维局部敏感判别分析(2 DLSDA),提出了一种雷达目标识别方法.首先构造类内和类间邻域关系图,计算两个邻域图上的权重矩阵;然后基于Schur分解求出两个正交变换矩阵,得到映射矩阵,对观察数据进行维数约简,由此有效地克服小样本问题.对飞机目标的分类实验结果表明,该方法是有效可行的.     

基于有监督的核局部线性嵌入的人脸性别识别

流形学习方法可以有效地发现存在于高维图像空间的低维子流形并进行维数约简,但它是一种非监督学习方法,其鉴别能力反而不如传统的维数约简方法,而且流形学习方法大多没有明晰的投影矩阵,很难直接对新样本进行维数约简.针对这两个问题,提出一种新的有监督的核局部线性嵌入算法(SKLLE,supervised kernel local linear embedding).该算法通过非线性核映射将人脸样本投影到高维核特征空间,然后将人脸局部流形的结构信息和样本的类别信息进行有效地结合进行维数约简,提取低维鉴别流形特征用于分类.SKLLE算法不仅能发现嵌入于高维人脸图像的低维子流形,而且增强了局部类间的联系,同时对新样本有较好的泛化性,实验结果表明该算法能有效的提高人脸性别识别的性能.     

一种应用于人脸识别的有监督NMF算法

为了提高非负矩阵分解(NMF)算法识别率,提出了一种有监督的NMF(SNMF)方法.该算法对NMF基图像进行判别分析,然后选择主要反应类内差异的基图像来构造子空间,最后在子空间上进行识别.通过UMIST人脸库和CMU PIE人脸库上的实验结果表明,该方法对光照、姿态和表情变化具有一定的鲁棒性,识别率高于NMF方法和其它子空间分析法.     

基于谱回归和核空间最近邻的基因表达数据分类

肿瘤基因表达数据是典型的高维小样本数据,直接对其进行识别存在维数灾难,需要对数据进行维数约简.提出了一种基于谱回归分析和核空间最近邻分类器的基因表达数据分类方法,采用谱回归分析得到可有效提取低维鉴别特征的投影矩阵,然后通过投影矩阵对基因表达数据进行维数约简,得到的低维数据用核空间最近邻分类器进行识别.通过在Prosta...     

基于概率神经网络优化DWT-2DLDA的高噪声人脸识别

针对人脸识别中的原始图像存在噪声而影响识别性能的问题,提出了基于概率神经网络优化二维子空间分析的人脸识别方法。首先,使用离散小波变化对图像进行预处理;然后,利用二维线性判别分析进行特征提取;最后,利用概率神经网络完成人脸分类。在ORL和FEI量大通用人脸数据库及自己搜集的数据库上的实验结果表明,在添加噪声的情况下,识别率也可高达98.9%,相比几种较新的识别方法,本文方法取得更好的识别性能。     

基于正则化零空间鉴别分析的人脸识别

提取有效的特征对高维数据的模式分类起着关键 作用,针对现有故障特征维数过高的问题,本文提 出了一种基于正则化零空间线性鉴别分析(Exponential Regularized Null Space Linear Discriminant Analysis, ERNSLDA)的特征提取方法。零空间线性判别分析已经在数据降维和特征提取上展现出良好 的性能,在 本文中,首先对类内样本矩阵进行正则化处理,避免小样本问题,其次对判别准则进行指数 化处理。所提 方法集成了NSLDA和RLDA在模式识别上的优势,有效地提高了人脸识别的精度,在ORL和YALE 数据库上的仿真实验证了本文所提方法的有效性。     

A novel semi-supervised canonical correlation analysis and extensions for multi-view dimensionality reduction

Canonical correlation analysis (CCA) is an efficient method for dimensionality reduction on two-view data. However, as an unsupervised learning method, CCA cannot utilize partly given label information in multi-view semi-supervised scenarios. In this paper, we propose a novel two-view semi-supervised learning method, called semi-supervised canonical correlation analysis based on label propagation (LPbSCCA). LPbSCCA incorporates a new sparse representation based label propagation algorithm to infer label information for unlabeled data. Specifically, it firstly constructs dictionaries consisting of all labeled samples; and then obtains reconstruction coefficients of unlabeled samples using sparse representation technique; at last, by combining given labels of labeled samples, estimates label information for unlabeled ones. After that, it constructs soft label matrices of all samples and probabilistic within-class scatter matrices in each view. Finally, in order to enhance discriminative power of features, it is formulated to maximize the correlations between samples of the same class from cross views, while minimizing within-class variations in the low-dimensional feature space of each view simultaneously. Furthermore, we also extend a general model called LPbSMCCA to handle data from multiple (more than two) views. Extensive experimental results from several well-known datasets demonstrate that the proposed methods can achieve better recognition performances and robustness than existing related methods.     

Multilinear discriminant analysis for face recognition.

There is a growing interest in subspace learning techniques for face recognition; however, the excessive dimension of the data space often brings the algorithms into the curse of dimensionality dilemma. In this paper, we present a novel approach to solve the supervised dimensionality reduction problem by encoding an image object as a general tensor of second or even higher order. First, we propose a discriminant tensor criterion, whereby multiple interrelated lower dimensional discriminative subspaces are derived for feature extraction. Then, a novel approach, called k-mode optimization, is presented to iteratively learn these subspaces by unfolding the tensor along different tensor directions. We call this algorithm multilinear discriminant analysis (MDA), which has the following characteristics: 1) multiple interrelated subspaces can collaborate to discriminate different classes, 2) for classification problems involving higher order tensors, the MDA algorithm can avoid the curse of dimensionality dilemma and alleviate the small sample size problem, and 3) the computational cost in the learning stage is reduced to a large extent owing to the reduced data dimensions in k-mode optimization. We provide extensive experiments on ORL, CMU PIE, and FERET databases by encoding face images as second- or third-order tensors to demonstrate that the proposed MDA algorithm based on higher order tensors has the potential to outperform the traditional vector-based subspace learning algorithms, especially in the cases with small sample sizes.     

基于部分标记数据进行人脸图像特征提取

针对无监督特征提取的识别率低与监督特征提取需要大量标记的问题,提出一种基于部分标记数据的半监督判别分析(SSDPA)特征提取法。本文方法能实现图像数据降维,避免线性判别分析(LDA)存在的小样本问题,达到提高识别率的目的。算法对图像进行离散余弦变换(DCT)变换;根据DCT图像的频率分布,利用部分标记数据计算SSDP;优先搜索SSDP高的DCT图像信息。将本文方法与其它方法进行组合,在不同人脸数据库上进行了实验。实验证明了本文方法的有效性,用较低的代价获得了优于传统方法的识别率。     

基于低秩张量分析的高光谱图像降维与分类

提出一种用于高光谱图像降维和分类的分块低秩张量分析方法。该算法以提高分类精度为目标,对图像张量分块进行降维和分类。将高光谱图像分成若干子张量,不仅保存了高光谱图像的三维数据结构,利用了空间与光谱维度的关联性,还充分挖掘了图像局部的空间相关性。与现有的张量分析法相比,这种分块处理方法克服了图像的整体空间相关性较弱以及子空间维度的设定对降维效果的负面影响。只要子空间维度小于子张量维度,所提议的分块算法就能取得较好的降维效果,其分类精度远远高于不分块的算法,从而无需借助原本就不可靠的子空间维度估计法。仿真和真实数据的实验结果表明,所提议分块低秩张量分析算法明显地表现出较好的降维效果,具有较高的分类精度。     

加权鉴别保持投影降维的非约束人脸识别研究

非约束环境下采集的人脸图像复杂多变,因稀疏保留投影(Sparse Preserving Projection, SPP)算法没有考虑到样本的局部结构使其降维效果不理想,针对该问题,本文提出了加权判别稀疏保留投影(Weighted Discriminant Sparse Preserving Projection, WDSPP)算法。首先,引入样本类别标签和类内紧凑项,用以增强待测样本和同类样本之间的重构关系;其次,非控环境下样本质量参差不齐,考虑以样本距离权值约束稀疏重构系数,降低同类奇异样本的影响,进一步提高重构关系的准确度;最后,低维投影阶段增加全局约束因子,利用样本全局分布中隐含的鉴别信息使低维子空间分布更紧凑、更易于鉴别。在AR库、Extended Yale B库、LFW库和PubFig库上的大量实验结果表明,本文所提算法在复杂人脸环境下具有较好的识别结果。       

基于两空间核鉴别分析的人脸识别

指出了几种线性鉴别分析方法在处理小样本人脸识别问题时存在的不足,结合核方法的思想,提出了一种基于两空间核鉴别分析的人脸识别方法.首先使用KPCA方法在核变换后的特征空间中对样本进行处理;进面将变换后的类内散布矩阵分成非零空间和零空间进行鉴别向量确定和鉴别特征提取,最后将得到的两种鉴别特征融合,从而使用最近邻法进行分类....     

Decision Fusion With Confidence-Based Weight Assignment for Hyperspectral Target Recognition

Conventional hyperspectral image-based automatic target recognition (ATR) systems project high-dimensional reflectance signatures onto a lower dimensional subspace using techniques such as principal components analysis (PCA), Fisher's linear discriminant analysis (LDA), and stepwise LDA. Typically, these feature space projections are suboptimal. In a typical hyperspectral ATR setup, the number of training signatures (ground truth) is often less than the dimensionality of the signatures. Standard dimensionality reduction tools such as LDA and PCA cannot be applied in such situations. In this paper, we present a divide-and-conquer approach that addresses this problem for robust ATR. We partition the hyperspectral space into contiguous subspaces based on the optimization of a performance metric. We then make local classification decisions in every subspace using a multiclassifier system and employ a decision fusion system for making the final decision on the class label. In this work, we propose a metric that incorporates higher order statistical information for accurate partitioning of the hyperspectral space. We also propose an adaptive weight assignment method in the decision fusion process based on the strengths (as measured by the training accuracies) of individual classifiers that made the local decisions. The proposed methods are tested using hyperspectral data with known ground truth, such that the efficacy can be quantitatively measured in terms of target recognition accuracies. The proposed system was found to significantly outperform conventional approaches. For example, under moderate pixel mixing, the proposed approach resulted in classification accuracies around 90%, where traditional feature fusion resulted in accuracies around 65%.     

Image classification using correlation tensor analysis

Images, as high-dimensional data, usually embody large variabilities. To classify images for versatile applications, an effective algorithm is necessarily designed by systematically considering the data structure, similarity metric, discriminant subspace, and classifier. In this paper, we provide evidence that, besides the Fisher criterion, graph embedding, and tensorization used in many existing methods, the correlation-based similarity metric embodied in supervised multilinear discriminant subspace learning can additionally improve the classification performance. In particular, a novel discriminant subspace learning algorithm, called correlation tensor analysis (CTA), is designed to incorporate both graph-embedded correlational mapping and discriminant analysis in a Fisher type of learning manner. The correlation metric can estimate intrinsic angles and distances for the locally isometric embedding, which can deal with the case when Euclidean metric is incapable of capturing the intrinsic similarities between data points. CTA learns multiple interrelated subspaces to obtain a low-dimensional data representation reflecting both class label information and intrinsic geometric structure of the data distribution. Extensive comparisons with most popular subspace learning methods on face recognition evaluation demonstrate the effectiveness and superiority of CTA. Parameter analysis also reveals its robustness.