基于监督局部线性嵌入的中药材分类鉴别研究*

电子鼻所采集的中药材气味信息往往具有高维性和非线性。针对气味信息的这种特性,提出一种基于监督局部线性嵌入(SLLE)和线性判别分析(LDA)的气味数据分析方法。首先利用SLLE对所采集的高维非线性气味信息进行降维,目的是提取出气味数据内在的低维流行特征,并增大类别间的辨别信息。然后,在低维空间中,利用LDA进行特征分类判别。通过实验,分别将该方法与单独使用SLLE方法及PCA LDA方法进行对比分析,结果表明,该方法可以很好地对五种不同种类的中药材及三种不同产地的何首乌进行分类鉴别,其个体识别率和整体识别率均可达到100%,为使用电子鼻对中药材进行分类鉴别提供了一种行之有效的方法。     

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

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

基于PCA+LDA的热红外成像人脸识别

研究热红外成像人脸识别技术,提出一种基于主成分分析(PCA)和线性鉴别分析(LDA)的热红外成像人脸识别方法.针对热红外人脸图像的特点,首先对图像进行预处理得到一组标准热红外人脸图像,利用PCA算法对图像向量进行降维并提取其全局特征,对降维后的热红外人脸全局特征采用LDA算法训练生成一个使类间离散度最大、类内离散度最小的最佳分类器.最后,进行基于PCA+LDA的热红外人脸图像识别研究,实验结果表明该方法可获得较高的识别率.     

局部样条嵌入的正交半监督子空间学习算法

为了更加准确地对图像进行聚类与分类,提出一种基于局部样条嵌入的正交半监督子空间学习算法.通过学习一个正交投影矩阵,使得训练样本中的标注数据经过投影矩阵降维后类间离散度尽量大,类内离散度尽量小;采用局部样条回归将局部低维嵌入坐标映射成全局低维嵌入坐标,使得被投影数据保持原有流形结构,并有效地利用有标注训练样本和未标注训练样本得到优化的图像表达方式.图像聚类与分类实验的结果表明了文中算法的有效性.     

一种改进的线性判别分析算法MLDA

线性判别分析(LDA)是模式识别方法之一,已广泛应用于模式识别、数据分析等诸多领域。线性判别分析法寻找的是有效分类的方向。而当样本维数远大于样本个数(即小样本问题)时,LDA便束手无策。为有效解决线性判别分析法的小样本问题,提出了一种改进的LDA算法——MLDA。该算法将类内离散度矩阵进行标量化处理,有效地避免了对类内离散度矩阵求逆。通过实验证明MLDA在一定程度上解决了经典LDA的小样本问题。     

融合PCA与LDA变换的仿生人脸识别研究

就基于PCA与LDA变换的传统人脸识别方法识别率低但特征提取过程中维数低和基于K-L 变换的仿生人脸识别方法识别率高但在特征提取过程中维数过高的的问题,将两者的优点相结合,提出了一种基于PCA与LDA变换的仿生人脸识别新方法。通过PCA与LDA变换对训练人脸样本进行特征提取,然后构建各类样本的覆盖区域。再通过判断待识别人脸特征在各覆盖区域的归属情况来识别人脸。实验收到了预期的效果,证明了方法的可行性。     

基于在体植入电极的生物嗅觉传感系统设计及其气味识别

目前生物嗅觉系统在气味识别方面相比于化学传感器阵列构成的电子鼻系统具有更高的灵敏度、特异性和响应速度。为了探讨生物嗅觉传感系统气味识别的可行性,构建了基于微电极阵列传感器植入大鼠嗅球构成的嗅觉传感系统,研究记录了浓度为10 mM的异丁醇、苯甲醚、香芹酮和柠檬醛4种气味刺激引起的嗅球僧帽层低频场电位信号,采用多窗谱估计算法和移动窗技术结合得到随时间分布的功率谱密度图。实验结果发现气味刺激后信号功率谱能量较多分布在gamma频段(40 Hz～120 Hz)。使用K最邻近分类方法对120组数据进行分类识别,4种气味分类正确率达到77.4%。实验结果表明该嗅觉传感系统结合多窗谱估计时频图与K最邻近分类算法可以初步实现气味识别。     

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

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

基于改进LDA算法的人脸识别

提出一种基于改进LDA的人脸识别算法,该算法克服传统LDA算法的缺点,重新定义样本类间离散度矩阵和Fisher准则,从而保留住最有辨别力的信息,增强算法的识别率.实验结果证明该算法是可行的,与传统的PCA LDA算法比较,具有较高的识别率.     

BH随机邻域嵌入在驾驶行为识别中的应用

针对驾驶系统处理大量驾驶数据时出现的效率和精度不足的问题,提出一种基于巴恩斯哈特随机邻域嵌入(BH-SNE)和径向基函数神经网络(RBFNN)的识别算法。从手机传感器中获取加速度数据、陀螺仪数据和磁强计数据,融合这三种传感器数据,经过预处理后使用BH-SNE完成降维处理,将降维数据输入到RBFNN中识别出驾驶行为。实验结果表明,BH-SNE的效率远高于t分布式随机邻域嵌入(t-SNE),并且可视化效果优于t-SNE,该模型的整体识别率为98.8%,分类效果优于传统的机器学习算法。     

基于移动机器人的主动嗅觉技术研究

使用移动机器人来定位气味源已经成为一个研究热点,机器人主动嗅觉是指使用机器人自主发现并跟踪烟羽,最终确定气味源所在位置的技术。本文对当前主动嗅觉技术进行概述,并根据生物嗅觉行为介绍一种气味源定位算法,这种算法不依赖某一点气味浓度值,仅依靠气味浓度变化率就可找到气味源。并在高斯模型下对烟羽分布模型进行仿真。     

Incremental Linear Discriminant Analysis Using Sufficient Spanning Sets and Its Applications

This paper presents an incremental learning solution for Linear Discriminant Analysis (LDA) and its applications to object recognition problems. We apply the sufficient spanning set approximation in three steps i.e. update for the total scatter matrix, between-class scatter matrix and the projected data matrix, which leads an online solution which closely agrees with the batch solution in accuracy while significantly reducing the computational complexity. The algorithm yields an efficient solution to incremental LDA even when the number of classes as well as the set size is large. The incremental LDA method has been also shown useful for semi-supervised online learning. Label propagation is done by integrating the incremental LDA into an EM framework. The method has been demonstrated in the task of merging large datasets which were collected during MPEG standardization for face image retrieval, face authentication using the BANCA dataset, and object categorisation using the Caltech101 dataset.     

A two-stage linear discriminant analysis via QR-decomposition

Linear discriminant analysis (LDA) is a well-known method for feature extraction and dimension reduction. It has been used widely in many applications involving high-dimensional data, such as image and text classification. An intrinsic limitation of classical LDA is the so-called singularity problems; that is, it fails when all scatter matrices are singular. Many LDA extensions were proposed in the past to overcome the singularity problems. Among these extensions, PCA+LDA, a two-stage method, received relatively more attention. In PCA+LDA, the LDA stage is preceded by an intermediate dimension reduction stage using principal component analysis (PCA). Most previous LDA extensions are computationally expensive, and not scalable, due to the use of singular value decomposition or generalized singular value decomposition. In this paper, we propose a two-stage LDA method, namely LDA/QR, which aims to overcome the singularity problems of classical LDA, while achieving efficiency and scalability simultaneously. The key difference between LDA/QR and PCA+LDA lies in the first stage, where LDA/QR applies QR decomposition to a small matrix involving the class centroids, while PCA+LDA applies PCA to the total scatter matrix involving all training data points. We further justify the proposed algorithm by showing the relationship among LDA/QR and previous LDA methods. Extensive experiments on face images and text documents are presented to show the effectiveness of the proposed algorithm.     

SVM-based feature extraction for face recognition

The primary goal of linear discriminant analysis (LDA) in face feature extraction is to find an effective subspace for identity discrimination. The introduction of kernel trick has extended the LDA to nonlinear decision hypersurface. However, there remained inherent limitations for the nonlinear LDA to deal with physical applications under complex environmental factors. These limitations include the use of a common covariance function among each class, and the limited dimensionality inherent to the definition of the between-class scatter. Since these problems are inherently caused by the definition of the Fisher's criterion itself, they may not be solvable under the conventional LDA framework. This paper proposes to adopt a margin-based between-class scatter and a regularization process to resolve the issue. Essentially, we redesign the between-class scatter matrix based on the SVM margins to facilitate an effective and reliable feature extraction. This is followed by a regularization of the within-class scatter matrix. Extensive empirical experiments are performed to compare the proposed method with several other variants of the LDA method using the FERET, AR, and CMU-PIE databases.     

Extensions of LDA by PCA mixture model and class-wise features

Linear discriminant analysis (LDA) is a data discrimination technique that seeks transformation to maximize the ratio of the between-class scatter and the within-class scatter. While it has been successfully applied to several applications, it has two limitations, both concerning the underfitting problem. First, it fails to discriminate data with complex distributions since all data in each class are assumed to be distributed in the Gaussian manner. Second, it can lose class-wise information, since it produces only one transformation over the entire range of classes. We propose three extensions of LDA to overcome the above problems. The first extension overcomes the first problem by modelling the within-class scatter using a PCA mixture model that can represent more complex distribution. The second extension overcomes the second problem by taking different transformation for each class in order to provide class-wise features. The third extension combines these two modifications by representing each class in terms of the PCA mixture model and taking different transformation for each mixture component. It is shown that all our proposed extensions of LDA outperform LDA concerning classification errors for synthetic data classification, hand-written digit recognition, and alphabet recognition.     

一种两阶段判别分析方法

为了解决LDA 对复杂分布数据的表达问题,本文提出了一种新的非参数形式的散度矩阵构造方法。该方法 能更好的刻画分类边界信息,并保留更多对分类有用的信息。同时针对小样本问题中非参数结构形式的类内散度矩阵可能奇 异,提出了一种两阶段鉴别分析方法对准则函数进行了最优化求解。该方法通过奇异值分解把人脸图像投影到混合散度矩阵 的主元空间,使类内散度矩阵在投影空间中是非奇异的,通过CS 分解,从理论上分析了同时对角化散度矩阵的求解,并证明了 得到的投影矩阵满足正交约束条件。在ORL,Yale 和YaleB 人脸库上测试的结果显示,改进的算法在性能上优于PCA+LDA, ULDA 和OLDA 等子空间方法。     

类依赖的线性判别分析

线性判别分析(LDA)是一种常用的特征提取方法,其目标是提取特征后样本的类间离散度和类内离散度的比值最大,即各类样本在特征空间中有最佳的可分离性.该方法利用同一个准则将所有类的样本投影到同一个特征空间中,忽略了各类样本分布特征的差异.本文提出类依赖的线性判别方法(Class-Specific LDA,CSLDA),对每一类样本寻找最优的投影矩阵,使得投影后能够更好地把该类样本与所有其他类的样本尽可能分开,并将该方法与经验核相结合,得到经验核空间中类依赖的线性判别分析.在人工数据集和UCI数据集上的实验结果表明,在输入空间和经验核空间里均有CSLDA特征提取后的识别率高于LDA.     

Linear discriminant analysis with worst between-class separation and average within-class compactness

Linear discriminant analysis (LDA) is one of the most popular supervised dimensionality reduction (DR) techniques and obtains discriminant projections by maximizing the ratio of average-case between-class scatter to average-case within-class scatter. Two recent discriminant analysis algorithms (DAS), minimal distance maximization (MDM) and worst-case LDA (WLDA), get projections by optimizing worst-case scatters. In this paper, we develop a new LDA framework called LDA with worst between-class separation and average within-class compactness (WSAC) by maximizing the ratio of worst-case between-class scatter to average-case within-class scatter. This can be achieved by relaxing the trace ratio optimization to a distance metric learning problem. Comparative experiments demonstrate its effectiveness. In addition, DA counterparts using the local geometry of data and the kernel trick can likewise be embedded into our framework and be solved in the same way.     

LDA模型在红酒数据关系挖掘中的应用研究

为了调查食品尤其是包含复合香气的食品（如葡萄酒和酒精饮料等）中的气味活性化合物的构成机理，提出了一种将LDA模型应用于红酒气味与化学分子关系挖掘的方法。该方法在红酒风味数据集上，将红酒看作文档，气味和化学分子看作词语，通过LDA主题模型挖掘隐含的红酒特征；根据红酒与化学分子在红酒中的分布进行聚类，并结合Apriori算法进行关联分析，最终找出气味与化学分子之间的关系，为设计一个能够通过测试化学分子识别食品气味的电子鼻打下基础。实验数据由法国南特大学Oniris气味实验室提供，实验结果部分地证实了将LDA模型应用于红酒气味与化学分子关系挖掘的可行性。