基于散度差准则的隐空间特征抽取方法

本文提出了一种新的非线性特征抽取方法——基于散度差准则的隐空间特征抽取方法。该方法的主要思想就是首先利用一核函数将原始输入空间非线性变换到隐空间，然后，在该隐空间中，利用类间离散度与类内离散度之差作为鉴别准则进行特征抽取。与现有的核特征抽取方法不同，该方法不需要核函数满足Mercer定理，从而增加了核函数的选择范围。更为重要的是，由于采用了散度差作为鉴别准则，从根本上避免了传统的Fisher线性鉴别分析所遇到的小样本问题。在ORL人脸数据库和AR标准人脸库上的试验结果验证了本文方法的有效性。     

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

尽管基于Fisher准则的线性鉴别分析被公认为特征抽取的有效方法之一，并被成功地用于人脸识别，但是由于光照变化、人脸表情和姿势变化，实际上的人脸图像分布是十分复杂的，因此，抽取非线性鉴别特征显得十分必要。为了能利用非线性鉴别特征进行人脸识别，提出了一种基于核的子空间鉴别分析方法。该方法首先利用核函数技术将原始样本隐式地映射到高维（甚至无穷维）特征空间；然后在高维特征空间里，利用再生核理论来建立基于广义Fisher准则的两个等价模型；最后利用正交补空间方法求得最优鉴别矢量来进行人脸识别。在ORL和NUST603两个人脸数据库上，对该方法进行了鉴别性能实验，得到了识别率分别为94％和99．58％的实验结果，这表明该方法与核组合方法的识别结果相当，且明显优于KPCA和Kernel fisherfaces方法的识别结果。     

基于核对称散布矩阵空间的特征抽取方法

为解决传统Fisher鉴别分析方法中非线性小样本的特征抽取问题,从核线性子空间角度出发,构造一种矩阵变换,得到核空间中类内散布矩阵的另一个对称核子空间,通过对2个核子空间分别求解,从而得到样本的有效鉴别信息。在NUST603和ORL人脸数据库上的实验结果验证了该算法的有效性。     

新的非线性鉴别特征抽取方法及人脸识别

在非线性空间中采用新的最大散度差鉴别准则,提出了一种新的核最大散度差鉴别分析方法.该方法不仅有效地抽取了人脸图像的非线性鉴别特征,而且从根本上避免了以往核Fisher鉴别分析中训练样本总数较多时,通常存在的核散布矩阵奇异的问题,计算复杂度大大降低,识别速度有了明显的提高.在ORL人脸数据库上的实验结果验证了该算法的有效性.     

基于核的Fisher非线性最佳鉴别分析在人脸识别中的应用

抽取最佳鉴别特征是人脸识别中的重要一步。对小样本的高维人脸图像样本,由于各种抽取非线性鉴别特征的方法均存在各自的问题,为此提出了一种求解核的Fisher非线性最佳鉴别特征的新方法,该方法首先在特征空间用类间散度阵和类内散度阵作为Fisher准则,来得到最佳非线性鉴别特征,然后针对此方法存在的病态问题,进一步在类内散度阵的零空间中求解最佳非线性鉴别矢量。基于ORL人脸数据库的实验表明,该新方法抽取的非线性最佳鉴别特征明显优于Fisher线性鉴别分析(FLDA)的线性特征和广义鉴别分析(GDA)的非线性特征。     

一种新的核广义鉴别特征抽取方法

在基于核的广义鉴别特征模型的基础上,提出了一种新的核广义鉴别特征抽取方法。利用空间变换的有关理论,使得变换后的核总体散布矩阵满足非奇异性;同时通过核共轭特征抽取方法,抽取满足核共轭正交条件的特征向量,使抽取的特征满足统计不相关性。在ORL人脸库上的实验表明了所提方法的有效性,达到了比核鉴别分析等方法更好的识别效果。     

一种改进的Fisher判别方法在人脸识别中的应用

对核Fisher鉴别分析进行了深入分析,发现了一种等价的但更为简单的非线性特征抽取方法.该方法利用一个映射将原始输入空间变换到一个更低维的空间RN中,然后在该空间上利用线性Fisher鉴别分析进行最优特征抽取.讨论了特征提取的一般模型,并提出了一种基于矩阵相似度的特征提取算法.通过ORL人脸数据库的数值实验,表明该算法比传统Fisher算法有更好的性能.     

一种基于特征融合的人脸识别新方法

提出了一种基于特征融合的人脸识别新方法。首先采用两种不同的K-L变换分别降低原始图像空间的维数，避开人脸识别小样本集的局限，然后利用复向量将同一样本的两组特征向量合并在一起，通过运用具有统计不相关性的复线性鉴别分析来抽取人脸图像的有效鉴别特征，最后在ORL人脸库上实验结果表明所提出的方法不仅识别性能优于经典的Fisherfaces，而且仅用14个特征识别率就达到96％。     

一种融合PCA 和KFDA 的人脸识别方法

提出一种融合PCA和KFDA的人脸识别方法，即在进行非线性映射之前，首先利用经典的主分量分析(C—PCA)进行降维，然后执行KFDA．为进一步降低整个算法的计算时问，又提出一种I—PCA KFDA方法，它直接基于图像矩阵的主分量分析(I—PCA)．ORL标准人脸库的试验结果表明，与现有的核Fisher鉴别分析方法相比，两种方法可将特征抽取的速度分别提高3倍和7倍，其识别精度没有丝毫的降低．     

Fisher线性鉴别分析的理论研究及其应用

Fisher线性鉴别分析已成为特征抽取的最为有效的方法之一.但是在高维、小样本情 况下如何抽取Fisher最优鉴别特征仍是一个困难的、至今没有彻底解决的问题.文中引入压缩 映射和同构映射的思想,从理论上巧妙地解决了高维、奇异情况下最优鉴别矢量集的求解问题, 而且该方法求解最优鉴别矢量集的全过程只需要在一个低维的变换空间内进行,这与传统方法 相比极大地降低了计算量.在此理论基础上,进一步为高维、小样本情况下的最优鉴别分析方法 建立了一个通用的算法框架,即先作K-L变换,再用Fisher鉴别变换作二次特征抽取.基于该 算法框架,提出了组合线性鉴别法,该方法综合利用了F-S鉴别和J-Y鉴别的优点,同时消除了 二者的弱点.在ORL标准人脸库上的试验表明,组合鉴别法所抽取的特征在普通的最小距离分 类器和最近邻分类器下均达到97%的正确识别率,而且识别结果十分稳定.该结果大大优于经 典的特征脸和Fisherfaces方法的识别结果.     

Fast kernel Fisher discriminant analysis via approximating the kernel principal component analysis

Kernel Fisher discriminant analysis (KFDA) extracts a nonlinear feature from a sample by calculating as many kernel functions as the training samples. Thus, its computational efficiency is inversely proportional to the size of the training sample set. In this paper we propose a more approach to efficient nonlinear feature extraction, FKFDA (fast KFDA). This FKFDA consists of two parts. First, we select a portion of training samples based on two criteria produced by approximating the kernel principal component analysis (AKPCA) in the kernel feature space. Then, referring to the selected training samples as nodes, we formulate FKFDA to improve the efficiency of nonlinear feature extraction. In FKFDA, the discriminant vectors are expressed as linear combinations of nodes in the kernel feature space, and the extraction of a feature from a sample only requires calculating as many kernel functions as the nodes. Therefore, the proposed FKFDA has a much faster feature extraction procedure compared with the naive kernel-based methods. Experimental results on face recognition and benchmark datasets classification suggest that the proposed FKFDA can generate well classified features.     

一种基于空间变换的核Fisher鉴别分析

引入空间变换的思相想，提出了一种基于空间变换的核Fisher鉴别分析，与KFDA不同的是，该方法只需在一个较低维的空间内执行，从而较大幅度地降低了求解最优鉴别矢量集的计算量，提高了计算速度，在ORL标准人脸库上的试验结果验证了所提方法的有效性。     

基于核正交半监督鉴别分析的人脸识别算法

针对人脸识别中的非线性特征提取和有标记样本不足问题,提出了在核空间具有正交性半监督鉴别矢量的计算方法。算法利用核函数将人脸数据映射到高维非线性空间,在该空间采用边界Fisher判别分析（Marginal Fisher Analysis,MFA）算法将少量有类别标签样本进行降维,同时采用无监督鉴别投影（Unsupervised Discriminant Projection,UDP）对大量无标签样本进行学习,以半监督的方法构造算法的目标函数,在特征值求解时以正交方式找出最优投影向量,进行人脸识别。通过实验,在ORL和YALE人脸数据库上验证了该算法的有效性。     

Face recognition using a kernel fractional-step discriminant analysis algorithm

Feature extraction is among the most important problems in face recognition systems. In this paper, we propose an enhanced kernel discriminant analysis (KDA) algorithm called kernel fractional-step discriminant analysis (KFDA) for nonlinear feature extraction and dimensionality reduction. Not only can this new algorithm, like other kernel methods, deal with nonlinearity required for many face recognition tasks, it can also outperform traditional KDA algorithms in resisting the adverse effects due to outlier classes. Moreover, to further strengthen the overall performance of KDA algorithms for face recognition, we propose two new kernel functions: cosine fractional-power polynomial kernel and non-normal Gaussian RBF kernel. We perform extensive comparative studies based on the YaleB and FERET face databases. Experimental results show that our KFDA algorithm outperforms traditional kernel principal component analysis (KPCA) and KDA algorithms. Moreover, further improvement can be obtained when the two new kernel functions are used.     

Kernel-based nonlinear discriminant analysis for face recognition

Linear subspace analysis methods have been successfully applied to extract features for face recognition.But they are inadequate to represent the complex and nonlinear variations of real face images,such as illumination,facial expression and pose variations,because of their linear properties.In this paper,a nonlinear subspace analysis method,Kernel-based Nonlinear Discriminant Analysis (KNDA),is presented for face recognition,which combines the nonlinear kernel trick with the linear subspace analysis method-Fisher Linear Discriminant Analysis (FLDA).First,the kernel trick is used to project the input data into an implicit feature space,then FLDA is performed in this feature space.Thus nonlinear discriminant features of the input data are yielded.In addition,in order to reduce the computational complexity,a geometry-based feature vectors selection scheme is adopted.Another similar nonlinear subspace analysis is Kernel-based Principal Component Analysis (KPCA),which combines the kernel trick with linear Principal Component Analysis (PCA).Experiments are performed with the polynomial kernel,and KNDA is compared with KPCA and FLDA.Extensive experimental results show that KNDA can give a higher recognition rate than KPCA and FLDA.     

Distance-Based Classifier via the Kernel Trick

For classifying large data sets, we propose a discriminant kernel that introduces a nonlinear mapping from the joint space of input data and output label to a discriminant space. Our method differs from traditional ones, which correspond to map nonlinearly from the input space to a feature space. The induced distance of our discriminant kernel is Eu- clidean and Fisher separable, as it is defined based on distance vectors of the feature space to distance vectors on the discriminant space. Unlike the support vector machines or the kernel Fisher discriminant analysis, the classifier does not need to solve a quadric program- ming problem or eigen-decomposition problems. Therefore, it is especially appropriate to the problems of processing large data sets. The classifier can be applied to face recognition, shape comparison and image classification benchmark data sets. The method is significantly faster than other methods and yet it can deliver comparable classification accuracy.     

基于核方法的雷达目标一维距离像识别

由于雷达目标及其所处环境的复杂性,导致不同目标之间的关系往往是非线性的.研究基于核的非线性方法,并将其应用于雷达目标一维距离像识别.核Fisher判别分析(KFDA)是一种抽取非线性特征的最有效方法之一,但它往往会面临小样本问题.针对此问题,给出一种null-KFDA方法,对距离像进行特征提取.然后,采用一种新的核非线性分类器——KNR(kernel-based nonlinear representor),对所提取的特征进行分类.对3种飞机的实测距离像进行实验,结果验证了null-KFDA的有效性.此外,与非线性支持向量机(SVM)和径向基函数神经网络(RBFNN)相比,KNR分类器具有更优的识别性能.     

Fuzzy discriminant analysis with kernel methods

A novel fuzzy nonlinear classifier, called kernel fuzzy discriminant analysis (KFDA), is proposed to deal with linear non-separable problem. With kernel methods KFDA can perform efficient classification in kernel feature space. Through some nonlinear mapping the input data can be mapped implicitly into a high-dimensional kernel feature space where nonlinear pattern now appears linear. Different from fuzzy discriminant analysis (FDA) which is based on Euclidean distance, KFDA uses kernel-induced distance. Theoretical analysis and experimental results show that the proposed classifier compares favorably with FDA.