Aging fingerprint characterization of beer using electronic nose

In this work, attempts were made in order to characterize the change of aroma of alcoholic and non alcoholic beers during the aging process by use of a metal oxide semiconductor based electronic nose. The aged beer samples were statistically characterized in several classes. Linear techniques as principal component analysis (PCA) and Linear Discriminant Analaysis (LDA) were performed over the data that revealed non alcoholic beer classes are separated except a partial overlapping between zones corresponding to two specified classes of the aged beers. A clear discrimination was not found among the alcoholic beer classes showing the more stability of such type of beer compared with non alcoholic beer. In this research, to classify the classes, two types of artificial neural networks were used: Probabilistic Neural Networks (PNN) with Radial Basis Functions (RBF) and FeedForward Networks with Backpropagation (BP) learning method. The classification success was found to be 90% and 100% for alcoholic and non alcoholic beers, respectively. Application of PNN showed the classification accuracy of 83% and 100%, respectively for the aged alcoholic and non alcoholic beer classes as well. Finally, this study showed the capability of the electronic nose system for the evaluation of the aroma fingerprint changes in beer during the aging process.     

Optimized discriminative transformations for speech features based on minimum classification error

Feature extraction is an important component of pattern classification and speech recognition. Extracted features should discriminate classes from each other while being robust to environmental conditions such as noise. For this purpose, several feature transformations are proposed which can be divided into two main categories: data-dependent transformation and classifier-dependent transformation. The drawback of data-dependent transformation is that its optimization criteria are different from the measure of classification error which can potentially degrade the classifier’s performance. In this paper, we propose a framework to optimize data-dependent feature transformations such as PCA (Principal Component Analysis), LDA (Linear Discriminant Analysis) and HLDA (Heteroscedastic LDA) using minimum classification error (MCE) as the main objective. The classifier itself is based on Hidden Markov Model (HMM). In our proposed HMM minimum classification error technique, the transformation matrices are modified to minimize the classification error for the mapped features, and the dimension of the feature vector is not changed. To evaluate the proposed methods, we conducted several experiments on the TIMIT phone recognition and the Aurora2 isolated word recognition tasks. The experimental results show that the proposed methods improve performance of PCA, LDA and HLDA transformation for mapping Mel-frequency cepstral coefficients (MFCC).     

Optimization of temporal filters for constructing robust features in speech recognition

Linear discriminant analysis (LDA) has long been used to derive data-driven temporal filters in order to improve the robustness of speech features used in speech recognition. In this paper, we proposed the use of new optimization criteria of principal component analysis (PCA) and the minimum classification error (MCE) for constructing the temporal filters. Detailed comparative performance analysis for the features obtained using the three optimization criteria, LDA, PCA, and MCE, with various types of noise and a wide range of SNR values is presented. It was found that the new criteria lead to superior performance over the original MFCC features, just as LDA-derived filters can. In addition, the newly proposed MCE-derived filters can often do better than the LDA-derived filters. Also, it is shown that further performance improvements are achievable if any of these LDA/PCA/MCE-derived filters are integrated with the conventional approach of cepstral mean and variance normalization (CMVN). The performance improvements obtained in recognition experiments are further supported by analyses conducted using two different distance measures.     

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.     

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.     

基于 PCA 和 LDA 的方言辨识

针对PCA没有有效利用样本的类别信息而导致方言识别率低的问题,采用PCA和LDA组合方法进行特征提取。首先用PCA对普通话、上海话、广东话和闽南话四种方言进行降维,然后在降维后的空间中用LDA进一步特征提取,最后将该特征向量送入BP神经网络进行辨识。仿真实验结果表明,基于PCA和LDA的方言识别的平均识别率高达85%。     

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.     

A scalable supervised algorithm for dimensionality reduction on streaming data

Algorithms on streaming data have attracted increasing attention in the past decade. Among them, dimensionality reduction algorithms are greatly interesting due to the desirability of real tasks. Principal Component Analysis (PCA) and Linear Discriminant Analysis (LDA) are two of the most widely used dimensionality reduction approaches. However, PCA is not optimal for general classification problems because it is unsupervised and ignores valuable label information for classification. On the other hand, the performance of LDA is degraded when encountering limited available low-dimensional spaces and singularity problem. Recently, Maximum Margin Criterion (MMC) was proposed to overcome the shortcomings of PCA and LDA. Nevertheless, the original MMC algorithm could not satisfy the streaming data model to handle large-scale high-dimensional data set. Thus an effective, efficient and scalable approach is needed. In this paper, we propose a supervised incremental dimensionality reduction algorithm and its extension to infer adaptive low-dimensional spaces by optimizing the maximum margin criterion. Experimental results on a synthetic dataset and real datasets demonstrate the superior performance of our proposed algorithm on streaming data.     

基于PCA和LDA结合的人脸识别方法的比较研究

针对用于人脸识别的主分量分析(PCA)计算量大、识别效果不佳和分类时间长,线性判别分析(LDA)存在小样本问题,比较研究几种基于PCA和LDA的人脸识别方法,这些方法包括PCA+ LDA、2DPCA+ DLDA和2DPCA+2DLDA.在理论和实验上比较研究这些方法,且在ORL和Yale人脸库的实验数据表明,结合后的方法比结合前的方法分类效果好,分类时间短,且在这几种方法中,2DPCA+2DLDA的效果最佳.     

基于金属氧化物传感器阵列的小麦霉变程度检测

研制了一套由8个金属氧化物传感器组成、用于检测小麦霉变的电子鼻系统.使用该电子鼻对不同霉变程度和掺入不同百分比含量霉麦的小麦样品进行检测.通过方差分析和主成分分析优化传感器阵列并去掉冗余传感器,对优化后的数据进行主成分分析(PCA)和线性判别分析(LDA),其中PCA的前两个主成分对两类实验结果分析的总贡献率为98.30％和99.27％,LDA前两个判别因子对两类实验结果分析的总贡献率为99.68％和93.30％,且由得分图可知两种方法均能很好地区分不同的小麦样品.利用BP神经网络建立预测模型,对样品菌落总数和掺入样品中霉麦的百分比进行预测.两种预测模型的预测值和测量值之间的相关系数分别为0.91和0.94,表明预测模型具有较好预测性能.     

A least-squares framework for Component Analysis

Over the last century, Component Analysis (CA) methods such as Principal Component Analysis (PCA), Linear Discriminant Analysis (LDA), Canonical Correlation Analysis (CCA), Locality Preserving Projections (LPP), and Spectral Clustering (SC) have been extensively used as a feature extraction step for modeling, classification, visualization, and clustering. CA techniques are appealing because many can be formulated as eigen-problems, offering great potential for learning linear and nonlinear representations of data in closed-form. However, the eigen-formulation often conceals important analytic and computational drawbacks of CA techniques, such as solving generalized eigen-problems with rank deficient matrices (e.g., small sample size problem), lacking intuitive interpretation of normalization factors, and understanding commonalities and differences between CA methods. This paper proposes a unified least-squares framework to formulate many CA methods. We show how PCA, LDA, CCA, LPP, SC, and its kernel and regularized extensions correspond to a particular instance of least-squares weighted kernel reduced rank regression (LS--WKRRR). The LS-WKRRR formulation of CA methods has several benefits: 1) provides a clean connection between many CA techniques and an intuitive framework to understand normalization factors; 2) yields efficient numerical schemes to solve CA techniques; 3) overcomes the small sample size problem; 4) provides a framework to easily extend CA methods. We derive weighted generalizations of PCA, LDA, SC, and CCA, and several new CA techniques.     

基于改进EST的人脸性别分类方法

提出一种基于改进的特征空间分离变换和支持向量机的人脸性别分类方法。在FERET人脸库和淮阴师范学院学生人脸库上进行实验,比较不同的特征提取方法和分类方法处理人脸性别分类问题的性能,结果表明,采用新方法在最优投影轴数和正确识别率方面均取得较好的结果,在2种人脸库上的正确识别率优于主成分分析方法和线性鉴别分析方法。     

三种判别分析方法在元音库上的分类

分别用降秩线性判别分析(RRLDA)、降秩二次判别分析(RRQDA)和主成分分析+线性判别分析(PCA+LDA)三种模型对数据进行了分析,并在元音测试数据集上进行了测试.分别画出了这三种模型的误分类率曲线,画出了RRLDA和PCA+LDA分别降至二维后的最优分类面.从实验结果中可以发现,RRLDA模型的实验结果优于PC...     

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方法的数据分类效果更好。     

PCA-LDA算法在性别鉴别中的应用

结合主元分析(Principal Components Analysis, PCA)与线性鉴别分析(Linear Discriminant Analysis, LDA)的特点，提出用于性别鉴别的PCA-LDA算法。该算法通过PCA算法求得训练样本的特征子空间，并在此基础上计算LDA算法的特征子空间。将PCA算法与LDA算法的特征子空间进行融合，获得PCA-LDA算法的融合特征空间。训练样本与测试样本分别朝融合特征空间投影，从而得到识别特征。利用最近邻准则即可完成性别鉴别。基于ORL(Olivetti Research Laboratory)人脸数据库的实验结果表明，PCA-LDA算法比PCA算法识别性能好，在性别鉴别中是一种有效的方法。     

基于KDDA的人脸识别研究

由于PCA 和LDA算法存在小样本问题(Smell Sample Size),结合D-LDA 和Kernel,将线性不可分的低维空间映射到高维空间,并借助于"kernel 技巧"克服了维度灾难问题,并且充分的利用曾经被抛弃的有用信息Null-Space.经过才ORL人脸库的实验表明,此方法比PCA,LDA提高了人脸识别的可分性,并有效地解决了小样本问题.     

Expressions Recognition of North-East Indian (NEI) Faces

Facial expression is one of the major distracting factors for face recognition performance. Pose and illumination variations on face images also influence the performance of face recognition systems. The combination of three variations (facial expression, pose and illumination) seriously degrades the recognition accuracy. In this paper, three experimental protocols are designed in such a way that the successive performance degradation due to the increasing variations (expressions, expressions with illumination effect and expressions with illumination and pose effect) on face images can be examined. The whole experiment is carried out using North-East Indian (NEI) face images with the help of four well-known classification algorithms namely Linear Discriminant Analysis (LDA), K-Nearest Neighbor algorithm (KNN), combination of Principal Component Analysis and Linear Discriminant Analysis (PCA + LDA), combination of Principal Component Analysis and K-Nearest Neighbor algorithm (PCA + KNN). The experimental observations are analyzed through confusion matrices and graphs. This paper also describes the creation of NEI facial expression database, which contains visual static face images of different ethnic groups of the North-East states. The database is useful for future researchers in the area of forensic science, medical applications, affective computing, intelligent environments, lie detection, psychiatry, anthropology, etc.     

Combining reconstructive and discriminative subspace methods for robust classification and regression by subsampling

Linear subspace methods that provide sufficient reconstruction of the data, such as PCA, offer an efficient way of dealing with missing pixels, outliers, and occlusions that often appear in the visual data. Discriminative methods, such as LDA, which, on the other hand, are better suited for classification tasks, are highly sensitive to corrupted data. We present a theoretical framework for achieving the best of both types of methods: an approach that combines the discrimination power of discriminative methods with the reconstruction property of reconstructive methods which enables one to work on subsets of pixels in images to efficiently detect and reject the outliers. The proposed approach is therefore capable of robust classification with a high-breakdown point. We also show that subspace methods, such as CCA, which are used for solving regression tasks, can be treated in a similar manner. The theoretical results are demonstrated on several computer vision tasks showing that the proposed approach significantly outperforms the standard discriminative methods in the case of missing pixels and images containing occlusions and outliers.     

基于皮尔逊最优电极选择的ADHD患者脑电特征提取及分类研究

事件相关电位(ERP)可用于注意缺陷多动障碍儿童(ADHD)和正常儿童的脑电特征 提取与分类。首先,采用赌博任务范式,采集2 类儿童的脑电信号;其次,基于皮尔逊相关系 数算法选择最优电极,并预处理最优电极脑电信号;然后,提取预处理脑电信号的时域特征(均 值、方差、峰值)和频域特征(Theta 波段功率、Alpha 波段功率);最后,利用传统分类方法支持 向量机(SVM)、自适应增强(AdaBoost)、自举汇聚法(Bagging)、线性判别式分析(LDA)、反向传 播(BP)和组合分类器的分类方法(LDA-SVM,BP-SVM)完成对2 种脑电信号的分类。研究结果 表明,传统方法BP 分类器的分类准确率可达80.52%,组合分类器BP-SVM 的分类准确率可达 88.88%。组合分类方法能提高ADHD 儿童的分类准确率,为基于脑机接口技术的ADHD 神经 反馈康复治疗提供技术支持。     

BP网络与RBF网络在感官评估中应用比较

介绍BP网络与RBF网络的方法原理以及二者在感官评估中的应用.利用企业提供的单料烟感官数据设计建立BP网络和RBF网络模型,并利用模型预测单料烟感官质量指标,然后通过行业专家提供的符合度公式对建立的模型进行评估,评估结果以百分比的形式展示.实验结果表明:在感官评估应用中,RBF网络模型预测性能优于BP网络模型.