一种基于PCA-LDA的卫星遥感图像的分类方法

结合主成分分析PCA(Principal Components Analysis)和线性判别分析LDA(Linear Discriminant Analysis)的特点,提出一种基于PCA-LDA算法的卫星遥感图像色彩分类方法。该算法将PCA算法和LDA算法的特征空间相融合,得到融合颜色特征空间。该方法去除了图像的R、G、B之间的相关性,改善了光照敏感性,采用基于区域分类的空间一致性原则对图像进行颜色分类。实验结果表明,该方法是对多频谱遥感图像分类的一种有效的方法。     

非线性流形上的性别识别算法研究

在高维非线性空间中,如何更有效地提取人脸图像的主要特征,以及如何更有效地区分不同的性别类别,已经成为性别识别中广泛关注的问题。针对这一问题,提出一种非线性流形上的性别识别算法。该算法不但能有效提取高维空间中数据点的主要特征,并且能充分挖掘出数据流形间的几何结构和判别结构,从而使不同性别之间达到最优化分类。通过ORL和Yale两个人脸数据集实验,并与PCA(Principal Components Analysis)+LDA(Linear Discriminant Analysis),PCA+SVM(Support Vector Machine),KPCA+LDA,KPCA+SVM 4种常用的性别识别算法进行比较。实验结果显示:所提出的算法与其他传统算法相比具有更高的识别率,且有一定的鲁棒性和较高的运行效率。     

基于线性投影分析和FCM动态聚类的人脸识别*

依据主成分分析方法(PCA)对图像具有很好的表达能力,即能很好地重构原图像,而线性鉴别分析(LDA)可使图像样本具有较高可分性的特点,提出对图像先进行PCA处理,再进行LDA处理,从而降低人脸特征维数并对人脸图像进行了特征提取;并提出用FCM动态聚类算法作为识别分类器,对人脸进行识别。实验和分析结果表明,在人脸识别中,这种融合PCA和LDA的分类方法能够更好地对特征进行提取,且FCM动态聚类分类器比K近邻判别分类器更具有灵活的分类能力。     

基于PCA和LDA统一化原理的增强型线性鉴别分析准则

主分量分析(PCA)和线性鉴别分析(LDA)是模式识别领域的使用最为广泛的两种特征抽取方法,而在图像识别中经常采用的是PCA LDA方法来代替单纯的LDA。本文提出一种增强型线性鉴别准则(ELDA),将PCA的优点和LDA的优点充分地融合在一起,不仅解决了PCA过程中使用最小距离方法时识别精度相对低的缺点,而且解决了LDA过程中当类内散布矩阵奇异时投影向量的求解问题,也就是说可以使用该方法来替代PCA LDA的两步骤方法。另外,该方法在识别精度上比PCA和LDA或PCA LDA方法都有较大的提高,通过在ORL、Yale和NUST603人脸库上的实验验证了该算法的有效性。     

基于小波变换的优化LDA人脸特征提取

运用小波进行图像分解提取低频子带图,并利用优化的线性判别分析(LDA)算法寻找最优投影子空间,从而映射提取人脸特征,实现人脸的分类识别。该方法避免了传统LDA算法中类内离散度矩阵非奇异的要求,解决了边缘类重叠问题,具有更广泛的应用空间。实验表明:该方法优于传统的LDA方法和主分量分析(PCA)方法。     

基于半监督LDA特征子空间优化的人脸识别算法

人脸特征提取是人脸识别流程最重要的步骤,特征的好坏直接影响了识别效果。为了得到更好的人脸识别效果,需要充分利用样本的信息。为了充分利用训练样本和测试样本包含的信息,提出了利用样本散度矩阵将主成分分析PCA算法和线性判别分析LDA算法加权组合的半监督LDA（SLDA）特征提取算法。同时,受组合优化问题的启发,利用二进制遗传算法对半监督特征提取算法得到的特征空间进行优化。在ORL人脸数据库上的实验结果表明：与人脸识别经典算法和部分改进算法相比,SLDA算法获得了更高的识别率。     

基于子空间分析的人脸识别算法

本文以人脸识别为目标,重点分析基于子空间分析的人脸特征提取技术.首先介绍人脸识别系统的构成,其次分析人脸识别的关键技术,如人脸检测、特征提取和图像预处理等,重点分析人脸识别的各种算法,根据小波在对图像数据矩阵的处理的高效性,以及LDA训练样本维数少的缺陷,PCA不能利用数据的高阶统计特性,本文将这三种算法进行融合,并用MATLAB进行仿真实验,实验证明该方法的有效性.     

一种基于局部排序PCA的线性鉴别算法

主分量分析(Principal Component Analysis,PCA)是模式识别领域中一种重要的特征抽取方法,该方法通过K-L展开式来抽取样本的主要特征。基于此,提出一种拓展的PCA人脸识别方法,即分块排序PCA人脸识别方法(MSPCA)。分块排序PCA方法先对图像矩阵进行分块,对所有分块得到的子图像矩阵利用PCA方法求出矩阵的所有特征值所对应的特征向量并加以标识;然后找出这些所有的特征值中k个最大的特征值所对应的特征向量,用这些特征向量分别去抽取所属的子图像的特征;最后,在MSPCA的基础上,将抽取子图像所得到的特征矩阵合并,把这个合并后的特征矩阵作为新的样本进行PCA+LDA。与PCA和PCA+LDA方法相比,分块排序PCA由于使用子图像矩阵,可以避免使用奇异值分解理论,从而更加简便。在ORL人脸库上的实验结果表明,所提出的方法在识别性能上明显优于经典的PCA和PCA+LDA方法。     

视觉引导AGV多分支路径识别研究

为了提高视觉引导AGV多分支路径识别的实时性和鲁棒性,论文提出基于PCA-LDA的特征提取算法与AD-ABOOST的分类算法.首先对采集到的图像进行预处理,再利用PCA对处理后的图像降维,并利用LDA进行初分类得到识别特征,最后利用ADABOOST分类器进行多路径的识别.实验结果表明,在满足实时性条件下,路径识别的准确...     

核Direct LDA子空间高光谱影像地物分类

为降低高光谱影像的数据维数,提高地物分类识别效率,提出了一种地物分类方法——核直接线性判别分析(Kernel Direct Linear Discriminant Analysis,KDLDA)子空间法;并推导出类先验概率的一般形式下KDLDA的解。KDLDA子空间法先采用KDLDA提取遥感影像的非线性可分特征,然后在KDLDA子空间采用最小距离分类器进行分类识别。机载可见光/红外成像光谱仪(Airborne Visible/Infrared Imaging Spectrometer,AVIRIS)的高光谱影像识别结果表明,相比原空间法、LDA子空间法、直接线性判别分析(Direct Linear Discriminant Analysis,DLDA)子空间法、核线性判别分析(Kernel Linear Discriminant Analysis,KLDA)子空间法,KDLDA子空间法可显著提高识别效率。     

WPCA-LDA:一种数据分类新方法

PCA（principal component analysis）是一种常用的特征提取方法,LDA（linear discriminant analysis）是一种常用的数据分类方法。然而,传统PCA投影数据没有区分数据的类标签,传统LDA投影数据没有消除数据间的相关性,分类效果都不理想。针对该问题进行研究,设计出了一种WPCA-LDA（weighted principal component analysis-linear discriminant analysis）分类方法。该方法首先对样本数据进行预处理,再运用数据中不同类别间的特征关系计算权值,对数据样本加权,之后用PCA进行特征提取,最后采用LDA方法对提取的特征分类。在Matlab仿真实验中,该方法能将六类样品清晰分开。实验结果表明：与传统的PCA、LDA和PCA-LDA分类方法相比,WPCA-LDA方法的数据分类效果更好。     

Feature extraction and dimensionality reduction algorithms and their applications in vowel recognition

Feature extraction is an important component of a pattern recognition system. It performs two tasks: transforming input parameter vector into a feature vector and/or reducing its dimensionality. A well-defined feature extraction algorithm makes the classification process more effective and efficient. Two popular methods for feature extraction are linear discriminant analysis (LDA) and principal component analysis (PCA). In this paper, the minimum classification error (MCE) training algorithm (which was originally proposed for optimizing classifiers) is investigated for feature extraction. A generalized MCE (GMCE) training algorithm is proposed to mend the shortcomings of the MCE training algorithm. LDA, PCA, and MCE and GMCE algorithms extract features through linear transformation. Support vector machine (SVM) is a recently developed pattern classification algorithm, which uses non-linear kernel functions to achieve non-linear decision boundaries in the parametric space. In this paper, SVM is also investigated and compared to linear feature extraction algorithms.     

人脸的性别分类

人脸的性别分类是指根据人脸的图像判别其性别的模式识别问题．系统地研究了不同的特征提取方法和分类方法在性别分类问题上的性能，其中包括主分量分析(PCA)、Fishel线性鉴别分析(FLD)、最佳特征提取、Adaboost算法、支持向量机(SVM)．给出了在9姿态人脸库、FERET人脸库和一个网络图片人脸库上的对比实验结果．实验表明人脸中的性别信息集中存在于某个子空间中，因此，在分类前对样本进行适当的压缩降维不但不会明显降低分类器的性能，而且可以大大减少分类的时间开销．最后介绍了将性别分类器与自动人脸检测和特征提取平台集成起来的基于人脸图像的性别判别系统．     

Improved discriminate analysis for high-dimensional data and its application to face recognition

Many pattern recognition applications involve the treatment of high-dimensional data and the small sample size problem. Principal component analysis (PCA) is a common used dimension reduction technique. Linear discriminate analysis (LDA) is often employed for classification. PCA plus LDA is a famous framework for discriminant analysis in high-dimensional space and singular cases. In this paper, we examine the theory of this framework and find out that even if there is no small sample size problem the PCA dimension reduction cannot guarantee the subsequent successful application of LDA. We thus develop an improved discriminate analysis method by introducing an inverse Fisher criterion and adding a constrain in PCA procedure so that the singularity phenomenon will not occur. Experiment results on face recognition suggest that this new approach works well and can be applied even when the number of training samples is one per class.     

Design of face recognition algorithm using PCA -LDA combined for hybrid data pre-processing and polynomial-based RBF neural networks : Design and its application

In this study, polynomial-based radial basis function neural networks are proposed as one of the functional components of the overall face recognition system. The system consists of the preprocessing and recognition module. The design methodology and resulting procedure of the proposed P-RBF NNs are presented. The structure helps construct a solution to high-dimensional pattern recognition problems. In data preprocessing part, principal component analysis (PCA) is generally used in face recognition. It is useful in reducing the dimensionality of the feature space. However, because it is concerned with the overall face image, it cannot guarantee the same classification rate when changing viewpoints. To compensate for these limitations, linear discriminant analysis (LDA) is used to enhance the separation between different classes. In this paper, we elaborate on the PCA-LDA algorithm and design an optimal P-RBF NNs for the recognition module.The proposed P-RBF NNs architecture consists of three functional modules such as the condition part, the conclusion part, and the inference part realized in terms of fuzzy “if–then” rules. In the condition part of fuzzy rules, the input space is partitioned with the use of fuzzy clustering realized by means of the Fuzzy C-Means (FCM) algorithm. In the conclusion part of rules, the connection weight is realized through three types of polynomials such as constant, linear, and quadratic. The coefficients of the P-RBF NNs model are obtained by fuzzy inference method forming the inference part of fuzzy rules. The essential design parameters (including learning rate, momentum, fuzzification coefficient, and the feature selection mechanism) of the networks are optimized by means of differential evolution (DE). The experimental results completed on benchmark face datasets – the AT&T, and Yale datasets demonstrate the effectiveness and efficiency of PCA-LDA combined algorithm compared with other algorithms such as PCA, LPP, 2D-PCA and 2D-LPP. A real time face recognition system realized in this way is also presented.     

General tensor discriminant analysis and gabor features for gait recognition

The traditional image representations are not suited to conventional classification methods, such as the linear discriminant analysis (LDA), because of the under sample problem (USP): the dimensionality of the feature space is much higher than the number of training samples. Motivated by the successes of the two dimensional LDA (2DLDA) for face recognition, we develop a general tensor discriminant analysis (GTDA) as a preprocessing step for LDA. The benefits of GTDA compared with existing preprocessing methods, e.g., principal component analysis (PCA) and 2DLDA, include 1) the USP is reduced in subsequent classification by, for example, LDA; 2) the discriminative information in the training tensors is preserved; and 3) GTDA provides stable recognition rates because the alternating projection optimization algorithm to obtain a solution of GTDA converges, while that of 2DLDA does not.We use human gait recognition to validate the proposed GTDA. The averaged gait images are utilized for gait representation. Given the popularity of Gabor function based image decompositions for image understanding and object recognition, we develop three different Gabor function based image representations: 1) the GaborD representation is the sum of Gabor filter responses over directions, 2) GaborS is the sum of Gabor filter responses over scales, and 3) GaborSD is the sum of Gabor filter responses over scales and directions. The GaborD, GaborS and GaborSD representations are applied to the problem of recognizing people from their averaged gait images.A large number of experiments were carried out to evaluate the effectiveness (recognition rate) of gait recognition based on first obtaining a Gabor, GaborD, GaborS or GaborSD image representation, then using GDTA to extract features and finally using LDA for classification. The proposed methods achieved good performance for gait recognition based on image sequences from the USF HumanID Database. Experimental comparisons are made with nine state of the art classification methods in gait recognition.     

Random Sampling for Subspace Face Recognition

Subspace face recognition often suffers from two problems: (1) the training sample set is small compared with the high dimensional feature vector; (2) the performance is sensitive to the subspace dimension. Instead of pursuing a single optimal subspace, we develop an ensemble learning framework based on random sampling on all three key components of a classification system: the feature space, training samples, and subspace parameters. Fisherface and Null Space LDA (N-LDA) are two conventional approaches to address the small sample size problem. But in many cases, these LDA classifiers are overfitted to the training set and discard some useful discriminative information. By analyzing different overfitting problems for the two kinds of LDA classifiers, we use random subspace and bagging to improve them respectively. By random sampling on feature vectors and training samples, multiple stabilized Fisherface and N-LDA classifiers are constructed and the two groups of complementary classifiers are integrated using a fusion rule, so nearly all the discriminative information is preserved. In addition, we further apply random sampling on parameter selection in order to overcome the difficulty of selecting optimal parameters in our algorithms. Then, we use the developed random sampling framework for the integration of multiple features. A robust random sampling face recognition system integrating shape, texture, and Gabor responses is finally constructed.     

Selecting discriminant eigenfaces by using binary feature selection

Eigenface (PCA) and Fisherface (LDA) are two of the most commonly used subspace techniques in the area of face recognition. PCA maximizes not only intersubject variation but also the intrasubject variation without considering the class label even if they are available. LDA is prone to overfitting when the training data set is small, which wildly exists in face recognition. In this work, we present a binary feature selection (BFS) method to choose the most suitable set of eigenfaces for classification when only a small number of training samples per subject are available. In the proposed method, we make use of class label, look on two subjects as a group, and then the most suitable eigenfaces that help to identify these two subjects are picked out to form the binary classifier. The final classifier is the integration of these binary classifiers by voting. Experiments on the AR and AT&T face databases with small training data set prove that our proposed method outperforms not only traditional PCA and LDA but also some state of the art methods.     

行为识别中基于GA优化的加速度特征选择方法

在基于加速度信号的人体行为识别中,LDA是较常用的特征降维方法之一,然而LDA并不直接以训练误差作为目标函数,无法保证获得训练误差最小的投影空间。针对这一情况,采用基于GA优化的LDA进行特征选择。提取加速度信号特征,利用PCA方法解决“小样本问题”,通过GA调整LDA中类间离散度矩阵的特征值矢量,使获得的投影空间训练误差最小。采用SVM对7种日常行为进行分类。实验结果表明,与单独采用PCA和采用PCA+LDA方法相比,基于GA优化的LDA算法在保证较高识别率的同时能有效降低特征维数并减小分类误差,最终测试样本的识别率可达95.96%。