一类基于多目标规划的线性鉴别准则

两类Fisher鉴别准则、大间距线性投影准则以及最大散度差鉴别准则都是直接用于模式分类的两类线性鉴别准则,它们的共同点是将“投影后数据的可分性达到最大的方向”作为最优投影方向。区别在于它们对数据可分性的定义有所不同。过去的研究成果表明,大间距线性投影分类器与支持向量机之间、大间距线性投影准则与最大散度差鉴别准则之间以及最大散度差鉴别准则与两类Fisher鉴别准则之间,均存在着这样或那样的联系。论文试图在以往研究成果的基础上进一步理清这些两类线性鉴别准则之间的内在关系,并建立一个统一的理论框架从而将基于投影后数据可分性的这些两类线性鉴别准则都纳入其中。     

基于模糊决策和MSD的单样本人脸识别算法

当每个人只有一个训练样本时,最大散度差鉴别分析在人脸识别中的识别性能会降低,为了解决这一问题,提出了基于模糊决策和最大散度差鉴别分析的单样本人脸识别算法。通过对每个训练样本进行适当的分块,从而获得较多的训练样本个数,在这些新的训练样本集上应用类内中间值最大散度差鉴别分析算法得到最优投影矩阵,并基于这个最优投影矩阵可以计算训练样本和待测试样本的特征。对模糊决策方法进行分类。在著名的ORL和FERET人脸数据库上的大量实验结果表明,该算法可以提高识别率。     

基于PSO的Fisher准则下小样本最佳鉴别变换

小样本条件下,Fisher准则中类内散布矩阵一般是奇异的,无法直接求解.本文提出利用粒子群优化理论,在无需求类内散布矩阵逆的情况下求解Fisher准则下小样本最佳鉴别变换的方法.讨论了通过粒子群优化算法的位置-速度搜索模型获取最佳鉴别投影向量的方法和步骤.实验对比类内散布矩阵非奇异时,采用计算特征向量方法和本文方法的差异.分析验证小样本条件下类内散布矩阵奇异时,通过本文方法进行最佳鉴别变换的分类效果.实验证实本文算法的有效性.     

最大散度差和大间距线性投影与支持向量机

首先对Fisher鉴别准则作了必要的修正,并基于新的鉴别准则设计了最大散度差分 类器;然后探讨了当参数C趋向无穷大时,最大散度差分类器的极限情况,得到了大间距线 性投影分类器;最后通过分析说明,大间距线性投影分类器实际上是在模式样本线性可分的条 件下,线性支持向量机的一种特殊情况.在ORL和NUST603人脸库上的测试结果表明,最 大散度差分类器和大间距线性投影分类器可以与线性支持向量机、不相关线性鉴别分析相媲 美,优于Foley-Sammon鉴别分析方法.     

融合奇异值分解和最大间距准则的人脸识别方法

提出了一种融合奇异值分解（SVD）和最大间距准则鉴别分析（MMC）的人脸识别方法。对人脸图像进行奇异值分解,选取较大的一组奇异值构成特征向量,对所有训练样本按照最大间距准则鉴别分析算法计算投影矩阵,把人脸图像矩阵在投影矩阵上投影得到特征矩阵。融合决策阶段,在以上两类特征集中,分别计算待识别样本到所有训练样本的欧氏距离并对得到的两类结果进行加权融合,最后根据最近距离分类器分类。基于ORL人脸数据库上的实验结果表明算法的有效性。     

基于保持投影的最大散度差的特征抽取方法

对非监督鉴别投影(UDP)准则进行修正,并在修正的准则基础上提出基于保持投影的最大散度差的特征抽取方法.该方法利用非局部散度与局部散度之差作为鉴别准则,从而避免UDP线性鉴别分析中所遇到的小样本问题引起的局部散度矩阵奇异的问题.在标准人脸数据库Yale和FERET上进行实验,实验结果表明本文方法的有效性.     

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

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

基于改进二维保局投影算法的人脸识别

传统的二维保局投影(2DLPP)算法未考虑样本邻域间局部信息,并且所提取的特征矩阵分量间存在相关性。针对该问题,提出基于大间距准则的最小相关性监督2DLPP算法。引入类间局部散度矩阵和类内局部散度矩阵,最大化带权的散度矩阵迹差,以增大样本类间散度,减小样本类内散度,从而更好地刻画数据的流形结构。计算所提取特征矩阵各分量间的协方差矩阵,通过最小相关性分析,减少特征信息的冗余。在Yale和ORL人脸库上进行仿真实验,结果显示,当训练样本数为5时,该算法的最高识别率分别为92.5%和96.2%,与传统2DLPP算法、二维主成分分析法、二维线性判别分析法和二维大间距准则法相比,识别率均有所提高。同时对不同训练样本数下识别率均值和方差进行分析,验证了算法的稳定性。     

最大散度差鉴别分析及人脸识别

传统的Fisher线性鉴别分析(LDA)在人脸等高维图像识别应用中不可避免地遇到小样本问题。提出一种基于散度差准则的鉴别分析方法。与LDA方法不同的是,该方法利用样本模式的类间散布与类内散布之差而不是它们的比作为鉴别准则,这样,从根本上避免了类内散布矩阵奇异带来的困难。在ORL人脸数据库和AR人脸数据库上的实验结果验证算法的有效性。     

Fisher大间距线性分类器

作为一种著名的特征抽取方法,Fisher线性鉴别分析的基本思想是选择使得Fisher准则函数达到最大值的向量(称为最优鉴别向量)作为最优投影方向,以便使得高维输入空间中的模式样本在该向量投影后,在类间散度达到最大的同时,类内散度最小。大间距线性分类器是寻找一个最优投影矢量(最优分隔超平面的法向量),它可使得投影后的两类样本之间的分类间距(Margin)最大。为了获得更佳的识别效果,结合Fisher线性鉴别分析和大间距分类器的优点,提出了一种新的线性投影分类算法——Fisher大间距线性分类器。该分类器的主要思想就是寻找最优投影矢量wbest(最优超平面的法向量),使得高维输入空间中的样本模式在wbest上投影后,在使类间间距达到最大的同时,使类内离散度尽可能地小。并从理论上讨论了与其他线性分类器的联系。在ORL人脸库和FERET人脸数据库上的实验结果表明,该线性投影分类算法的识别率优于其他分类器。     

基于大间距准则的不相关保局投影分析

局部保持投影(Locality preserving projections,LPP)算法只保持了目标在投影后的邻域局部信息,为了更好地刻画数据的流形结构, 引入了类内和类间局部散度矩阵,给出了一种基于有效且稳定的大间距准则(Maximum margin criterion,MMC)的不相关保局投影分析方法.该方法在最大化散度矩阵迹差时,引入尺度因子α,对类内和类间局部散度矩阵进行加权,以便找到更适合分类的子空间并且可避免小样本问题; 更重要的是,大间距准则下提取的判别特征集一般情况下是统计相关的,造成了特征信息的冗余, 因此,通过增加一个不相关约束条件,利用推导出的公式提取不相关判别特征集, 这样做, 对正确识别更为有利.在Yale人脸库、PIE人脸库和MNIST手写数字库上的测试结果表明,本文方法有效且稳定, 与LPP、LDA (Linear discriminant analysis)和LPMIP(Locality-preserved maximum information projection)方法等相比,具有更高的正确识别率.     

A multiple maximum scatter difference discriminant criterion for facial feature extraction.

Maximum scatter difference (MSD) discriminant criterion was a recently presented binary discriminant criterion for pattern classification that utilizes the generalized scatter difference rather than the generalized Rayleigh quotient as a class separability measure, thereby avoiding the singularity problem when addressing small-sample-size problems. MSD classifiers based on this criterion have been quite effective on face-recognition tasks, but as they are binary classifiers, they are not as efficient on large-scale classification tasks. To address the problem, this paper generalizes the classification-oriented binary criterion to its multiple counterpart--multiple MSD (MMSD) discriminant criterion for facial feature extraction. The MMSD feature-extraction method, which is based on this novel discriminant criterion, is a new subspace-based feature-extraction method. Unlike most other subspace-based feature-extraction methods, the MMSD computes its discriminant vectors from both the range of the between-class scatter matrix and the null space of the within-class scatter matrix. The MMSD is theoretically elegant and easy to calculate. Extensive experimental studies conducted on the benchmark database, FERET, show that the MMSD out-performs state-of-the-art facial feature-extraction methods such as null space method, direct linear discriminant analysis (LDA), eigenface, Fisherface, and complete LDA.     

Weighted maximum scatter difference based feature extraction and its application to face recognition

An improved maximum scatter difference (MSD) algorithm based on weighted scheme is proposed in this paper. The existing MSD model and its improved method only highlight the role which within-class scatter matrix plays while they pay little attention to the action of between-class scatter matrix. Another weakness of the existing MSD model is that it is difficult to select an appropriate weight for within-class scatter matrix because the range of weight is usually too large. In order to make MSD more suitable for classification, different weights are assigned to both between-class and within-class scatter matrices, respectively. This scheme is more convenient for operation than original MSD because it confines the range of parameters to a small range. Finally, the results of experiments conducted on AR and FERET face database indicate the effectiveness of the proposed approach.     

Median MSD-based method for face recognition

An improved maximum scatter difference (MSD) criterion is proposed in this paper. A weakness of existing MSD model is that the class mean vector in the expressions of within-class scatter matrix and between-class scatter matrix is estimated by class sample average. Under the non-ideal conditions such as variations of expression, illumination, pose, and so on, there will be some outliers in the sample set, so the class sample average is not sufficient to provide an accurate estimate of the class mean using a few of given samples. As a result, the recognition performance of traditional MSD model will decrease. To address this problem, also to render MSD model rather robust, within-class median vector rather than within-class mean vector is used in the original MSD method. The results of experiments conducted on CAS-PEAL and FERET face database indicate the effectiveness of the proposed approach.     

核邻域保持判别嵌入在人脸识别中的应用

为更有效地进行数据降维,将核映射思想引入到邻域保持判别嵌入中,提出一种核邻域保持判别嵌入的流形学习算法。以类内相似度矩阵与类间散度矩阵之差作为鉴别准则,使类间散度矩阵不受满秩的约束,从而解决人脸数据的非线性和小样本问题。在ORL和Yale人脸库上的实验结果表明,该算法具有较好的人脸识别性能。     

An optimal symmetrical null space criterion of Fisher discriminant for feature extraction and recognition

Linear discriminant analysis (LDA) is one of the most effective feature extraction methods in statistical pattern recognition, which extracts the discriminant features by maximizing the so-called Fisher’s criterion that is defined as the ratio of between-class scatter matrix to within-class scatter matrix. However, classification of high-dimensional statistical data is usually not amenable to standard pattern recognition techniques because of an underlying small sample size (SSS) problem. A popular approach to the SSS problem is the removal of non-informative features via subspace-based decomposition techniques. Motivated by this viewpoint, many elaborate subspace decomposition methods including Fisherface, direct LDA (D-LDA), complete PCA plus LDA (C-LDA), random discriminant analysis (RDA) and multilinear discriminant analysis (MDA), etc., have been developed, especially in the context of face recognition. Nevertheless, how to search a set of complete optimal subspaces for discriminant analysis is still a hot topic of research in area of LDA. In this paper, we propose a novel discriminant criterion, called optimal symmetrical null space (OSNS) criterion that can be used to compute the Fisher’s maximal discriminant criterion combined with the minimal one. Meanwhile, by the reformed criterion, the complete symmetrical subspaces based on the within-class and between-class scatter matrices are constructed, respectively. Different from the traditional subspace learning criterion that derives only one principal subspace, in our approach two null subspaces and their orthogonal complements were all obtained through the optimization of OSNS criterion. Therefore, the algorithm based on OSNS has the potential to outperform the traditional LDA algorithms, especially in the cases of small sample size. Experimental results conducted on the ORL, FERET, XM2VTS and NUST603 face image databases demonstrate the effectiveness of the proposed method.     

一种新的基于最大散度差准则的特征抽取方法

本文基于最大散度差准则（MSDC），利用统计不相关投影空间，提出了一组具有统计不相关性的最佳鉴别矢量的计算方法。该方法的目标是寻求一组鉴别矢量集，既要使投影后的特征空间的类间散度最大，而类内散度最小；又要使最佳鉴别矢量之间具有统计不相关性。另外，本文还揭示了最大散度差鉴别准则与Fisher准则的内在关系。在ORL与NUST603人脸库上的实验结果表明，本文所提出的方法在识别性能上优于原MSDC特征抽取方法与传统的PCA方法。     

Discriminative common vectors for face recognition

In face recognition tasks, the dimension of the sample space is typically larger than the number of the samples in the training set. As a consequence, the within-class scatter matrix is singular and the linear discriminant analysis (LDA) method cannot be applied directly. This problem is known as the "small sample size" problem. In this paper, we propose a new face recognition method called the discriminative common vector method based on a variation of Fisher's linear discriminant analysis for the small sample size case. Two different algorithms are given to extract the discriminative common vectors representing each person in the training set of the face database. One algorithm uses the within-class scatter matrix of the samples in the training set while the other uses the subspace methods and the Gram-Schmidt orthogonalization procedure to obtain the discriminative common vectors. Then, the discriminative common vectors are used for classification of new faces. The proposed method yields an optimal solution for maximizing the modified Fisher's linear discriminant criterion given in the paper. Our test results show that the discriminative common vector method is superior to other methods in terms of recognition accuracy, efficiency, and numerical stability.     

Face recognition using fuzzy maximum scatter discriminant analysis

As we know, classical Fisher discriminant analysis usually suffers from the small sample size problem due to the singularity problem of the within-class scatter matrix. In this paper, a novel fuzzy linear classifier, called fuzzy maximum scatter difference (FMSD) discriminant criterion, is proposed to extract features from samples, especially deals with outlier samples. FMSD takes the scatter difference between between-class and within-class as discriminant criterion, so it will not suffer from the small sample size problem. The conventional scatter difference discriminant criterion (SDDC) assumes the same level of relevance of each sample to the corresponding class. In this paper, the fuzzy set theory is introduced to the conventional SDDC algorithm, where the fuzzy k-nearest neighbor is adopted to achieve the distribution information of original samples. The distribution is utilized to redefine the scatter matrices that are different from the conventional SDDC and effective to extract discriminative features from outlier samples. Experiments conducted on FERET and ORL face databases demonstrate the effectiveness of the proposed method.     

基于多子空间线性判别分析的特征提取与分类

为了解决高维小样本数据的分类中Fisherface思想判别分析方法的不足,在最大散度差准则的基础上,提出了利用多线性子空间技术对每类样本进行单独描述的方法,该方法能更准确地反映样本在类内类间的分布关系.在分类中不是以距离作为判别依据,而是按照贝叶斯决策规则得到的隶属置信度作为衡量标准.实验结果表明了该方法的有效性,和同类方法相比,有更高的识别率.