正交化Fisher鉴别向量集及其应用

在正交化Fisher鉴别分析的基础上提出了正交化核Fisher鉴别分析方法。该方法具有理论简单、计算方便、特征表示能力强等优点。在CENPARMI手写体阿拉伯数字数据库、NUST603HW手写体汉字样本库和FERET人脸图像数据库上的仿真实验结果表明，正变化Fisher鉴别和正交化核Fisher鉴别方法在特征抽取能力和特征抽取效率方面均分别优于FoleySammon鉴别和核Foley-Sammon鉴别方法。     

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

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

模糊逆Fisher鉴别分析及其在人脸识别中的应用

在逆Fisher鉴别分析的基础上,引入了模糊数学的思想,提出了模糊逆Fisher鉴别分析并成功应用于人脸识别。模糊逆Fisher鉴别分析通过隶属度函数将样本归入所有的类别之中,根据隶属度重新定义了类间散布矩阵和类内散布矩阵,进而将样本的原始分布信息通过相应的隶属度函数完全融入到了最后提取到的特征中。在ORL和FERET人脸库上的实验结果证明了基于模糊逆Fisher鉴别准则特征提取方法的优越性。     

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

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

一种用于人脸识别的非线性鉴别特征融合方法

最近，在人脸等图像识别领域，用于抽取非线性特征的核方法如核Fisher鉴别分析(KFDA)已经取得成功并得到了广泛应用，但现有的核方法都存在这样的问题，即构造特征空间中的核矩阵所耗费的计算量非常大．而且，抽取得到的单类特征往往不能获得到令人满意的识别结果．提出了一种用于人脸识别的非线性鉴别特征融合方法，即首先利用小波变换和奇异值分解对原始输入样本进行降雏变换，抽取同一样本空间的两类特征，然后利用复向量将这两类特征组合在一起，构成一复特征向量空间，最后在该空间中进行最优鉴别特征抽取．在ORL标准人脸库上的试验结果表明所提方法不仅在识别性能上优于现有的核Fisher鉴别分析方法，而且，在ORL人脸库上的特征抽取速度提高了近8倍．     

基于图像分块的改进Fisher人脸识别算法

二维方法用于图像矩阵特征提取,虽然速度快,但影响了分类速度。针对二维线性鉴别分析（Two-Dimensional Linear Discriminant Analysis,2DLDA）的特点,研究了一种基于图像分块的改进Fisher人脸识别算法,该算法首先对人脸图像进行压缩降维处理,得到相应的特征矩阵,然后利用改进Fisher算法对特征矩阵进行类间离散度矩阵和类内离散度矩阵的计算,该算法充分考虑了类别信息,避免了传统Fisher算法造成的小样本问题,有效提高了分类速度。基于ORL（Olivetti Research Laboratory）与Yale人脸数据库的实验结果证明了该算法的有效性。     

模式识别中广义核函数Fisher最佳鉴别

本文在线性Fisher鉴别与核函数Fisher鉴别的基础上,依据D.H.Foley和J.W.Sammon提出的广义Fish-er最佳鉴别概念,将两类模式识别问题的求解方法进行非线性推广,引入了相应的概念,导出并证明了广义核函数Fisher最佳鉴别,得出了广义核函数Fisher最佳鉴别的决策函数.广义核函数Fisher最佳鉴别在判断测试样本时采用竞争原则,将测试样本判为具有最大决策函数值所属的类别,为解决多类模式识别问题提供了一种有效途径.广义核函数Fisher最佳鉴别具有充分的理论依据,泛化能力强,在多类模式识别中具有重要的意义和应用价值.     

一种基于核的快速非线性鉴别分析方法

基于“核技巧”提出的新的非线性鉴别分析方法在最小二乘意义上与基于核的Fisher鉴别分析方法等效，相应鉴别方向通过一个线性方程组得出，计算代价较小，相应分类实现极其简便．该方法的最大优点是，对训练数据进行筛选，可使构造鉴别矢量的“显著”训练模式数大大低于总训练模式数，从而使得测试集的分类非常高效；同时，设计出专门的优化算法以加速“显著”训练模式的选取．实验表明，这种非线性方法不仅具有明显的效率上的优势，且具有不低于基于核的Fisher鉴别分析方法的性能．     

改进的线性判别分析及人脸识别

为有效解决传统LDA（线性鉴别分析）的小样本规模问题,提出一种改进的LDA算法。首先对样本进行无损降维;然后在Fisher准则基础上,用散度矩阵差代替散度矩阵的比值,避免对类内矩阵求逆的同时也降低了计算复杂度,实现有效的特征抽取;最后实现对人脸的识别。实验结果表明,该算法是有效的,优于传统LDA方法。     

鉴别分析方法的最优化问题研究

提出了一种核Fisher鉴别分析方法优化方案,并分别给出了解决两类分类和解决多于两类的分类问题的算法,该方案具有明显的分类效率上的优势。在这种方案的实现中,首先从总体训练样本中选择出“显著”训练样本,对测试样本的分类只依赖于测试样本与“显著”训练样本之间的核函数。还设计出了一种选择“显著”训练样本的递归算法,以降低算法的计算复杂度。将该算法应用于人脸图象数据库与“基准”数据集,得到了很好的实验效果。     

A new fuzzy approach for handling class labels in canonical correlation analysis

Canonical correlation analysis (CCA) can extract more discriminative features by utilizing class labels, especially the ones that can reflect the sample distribution appropriately. In this paper, a new fuzzy approach for handling class labels in the form of fuzzy membership degrees is proposed. We elaborately design a novel fuzzy membership function to represent the distribution of image samples. These fuzzy class labels promote the classification performances of CCA and kernel CCA (KCCA) through incorporating distribution information into the process of feature extraction. Comprehensive experimental results on face recognition demonstrate the effectiveness and feasibility of the proposed method.     

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.     

An MRF-based kernel method for nonlinear feature extraction

Nonlinear kernel-based feature extraction algorithms have recently been proposed to alleviate the loss of class discrimination after feature extraction. When considering image classification, a kernel function may not be sufficiently effective if it depends only on an information resource from the Euclidean distance in the original feature space. This study presents an extended radial basis kernel function that integrates multiple discriminative information resources, including the Euclidean distance, spatial context, and class membership. The concepts related to Markov random fields (MRFs) are exploited to model the spatial context information existing in the image. Mutual closeness in class membership is defined as a similarity measure with respect to classification. Any dissimilarity from the additional information resources will improve the discrimination between two samples that are only a short Euclidean distance apart in the feature space. The proposed kernel function is used for feature extraction through linear discriminant analysis (LDA) and principal component analysis (PCA). Experiments with synthetic and natural images show the effectiveness of the proposed kernel function with application to image classification.     

Essence of kernel Fisher discriminant: KPCA plus LDA

In this paper, the method of kernel Fisher discriminant (KFD) is analyzed and its nature is revealed, i.e., KFD is equivalent to kernel principal component analysis (KPCA) plus Fisher linear discriminant analysis (LDA). Based on this result, a more transparent KFD algorithm is proposed. That is, KPCA is first performed and then LDA is used for a second feature extraction in the KPCA-transformed space. Finally, the effectiveness of the proposed algorithm is verified using the CENPARMI handwritten numeral database.     

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.     

基于核化原理的非线性典型相关判别分析

典型相关判别分析是将传统的典型相关分析应用于判别问题，它是一类重要的特征提取算法，但其本质上只能提取数据的线性特征，应用统计学习理论中的核化原理可以将这样的线性特征提取算法推广至非线性特征提取算法，该文研究了如何将这一原理应用于典型相关判别分析，提出了基于核化原理的非线性典型相关判别分析，并且给出了求解该问题的一个自适应学习算法．数值实验表明，基于核化原理所导出的非线性典型相关判别分析比传统的典型相关判别分析更有效，另外，该文从理论上证明，所提出的新方法与Fisher核判别分析等价。     

Learning the kernel matrix by maximizing a KFD-based class separability criterion

The advantage of a kernel method often depends critically on a proper choice of the kernel function. A promising approach is to learn the kernel from data automatically. In this paper, we propose a novel method for learning the kernel matrix based on maximizing a class separability criterion that is similar to those used by linear discriminant analysis (LDA) and kernel Fisher discriminant (KFD). It is interesting to note that optimizing this criterion function does not require inverting the possibly singular within-class scatter matrix which is a computational problem encountered by many LDA and KFD methods. We have conducted experiments on both synthetic data and real-world data from UCI and FERET, showing that our method consistently outperforms some previous kernel learning methods.     

融合FDA-PCMC样本分类的KPCA故障检测新算法

针对处理实际工业过程中提取的建模样本不纯而导致故障检测失效的问题,提出一种新的融合Fisher判别分析-可能性C-均值聚类(FDA-PCMC)的核主元分析(KPCA)故障检测算法.通过FDA特征提取、初分类和PCMC聚类相结合的方代来实现建模样本的有效分类和提纯,然后使用KPCA进行实时故障检测.对Tennessee Eastman(TE)过程的仿真研宄结果表明了该算法的可行性和有效性.     

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

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