Dimensionality reduction-based spoken emotion recognition

To improve effectively the performance on spoken emotion recognition, it is needed to perform nonlinear dimensionality reduction for speech data lying on a nonlinear manifold embedded in a high-dimensional acoustic space. In this paper, a new supervised manifold learning algorithm for nonlinear dimensionality reduction, called modified supervised locally linear embedding algorithm (MSLLE) is proposed for spoken emotion recognition. MSLLE aims at enlarging the interclass distance while shrinking the intraclass distance in an effort to promote the discriminating power and generalization ability of low-dimensional embedded data representations. To compare the performance of MSLLE, not only three unsupervised dimensionality reduction methods, i.e., principal component analysis (PCA), locally linear embedding (LLE) and isometric mapping (Isomap), but also five supervised dimensionality reduction methods, i.e., linear discriminant analysis (LDA), supervised locally linear embedding (SLLE), local Fisher discriminant analysis (LFDA), neighborhood component analysis (NCA) and maximally collapsing metric learning (MCML), are used to perform dimensionality reduction on spoken emotion recognition tasks. Experimental results on two emotional speech databases, i.e. the spontaneous Chinese database and the acted Berlin database, confirm the validity and promising performance of the proposed method.     

Handwritten Digit Recognition by a Mixture of Local Principal Component Analysis

Mixture of local principal component analysis (PCA) has attracted attention due to a number of benefits over global PCA. The performance of a mixture model usually depends on the data partition and local linear fitting. In this paper, we propose a mixture model which has the properties of optimal data partition and robust local fitting. Data partition is realized by a soft competition algorithm called neural 'gas' and robust local linear fitting is approached by a nonlinear extension of PCA learning algorithm. Based on this mixture model, we describe a modular classification scheme for handwritten digit recognition, in which each module or network models the manifold of one of ten digit classes. Experiments demonstrate a very high recognition rate.     

分块多线性主成分分析及其在人脸识别中的应用研究

主成分分析(Principal Component Analysis,PCA)是人脸识别中一个经典的算法,但PCA方法在特征提取时考虑的是图像的整体信息,并没有考虑图像的局部信息,而分块PCA(Modular Principal Component Analysis,Modular PCA)则可以有效地提取图像中重要的局部信息,所以在人脸识别实验中获得了比传统PCA更好的识别效果。但PCA和Modular PCA都要进行图像的矢量化,这会破坏原始数据的空间结构,也有可能会导致"维数灾难"。多线性主成分分析(Multilinear Principal Component Analysis,Multilinear PCA)作为PCA在高维数据上的扩展,直接使用矩阵或者高阶的张量来获得有效特征,既可以避免"维数灾难",又可以体现直接将张量数据作为处理对象时保留原始数据较好基本结构信息的优点。在研究Modular PCA和Multilinear PCA的基础上,提出了分块多线性主成分分析(Modular Multilinear Principal Component Analysis,M2PCA)算法,用于识别人脸。在Yale、XM2VTS和JAFFE人脸数据库上进行了人脸识别实验,结果表明,在同等的分块条件下,所提出的方法的识别效果要优于Modular PCA的方法。     

Holistic and partial facial features fusion by binary particle swarm optimization

This paper proposes a novel binary particle swarm optimization (PSO) algorithm using artificial immune system (AIS) for face recognition. Inspired by face recognition ability in human visual system (HVS), this algorithm fuses the information of the holistic and partial facial features. The holistic facial features are extracted by using principal component analysis (PCA), while the partial facial features are extracted by non-negative matrix factorization with sparseness constraints (NMFs). Linear discriminant analysis (LDA) is then applied to enhance adaptability to illumination and expression. The proposed algorithm is used to select the fusion rules by minimizing the Bayesian error cost. The fusion rules are finally applied for face recognition. Experimental results using UMIST and ORL face databases show that the proposed fusion algorithm outperforms individual algorithm based on PCA or NMFs.     

基于KPCA的人脸匹配方法

分析一般主成分分析(PCA)在处理非线性问题上存在的不足,阐述基于核的主成分分析(KPCA)方法,并将其应用到人脸匹配之中,应用结果表明,KPCA具有优秀的特征提取性能.     

On Bayesian principal component analysis

A complete Bayesian framework for principal component analysis (PCA) is proposed. Previous model-based approaches to PCA were often based upon a factor analysis model with isotropic Gaussian noise. In contrast to PCA, these approaches do not impose orthogonality constraints. A new model with orthogonality restrictions is proposed. Its approximate Bayesian solution using the variational approximation and results from directional statistics is developed. The Bayesian solution provides two notable results in relation to PCA. The first is uncertainty bounds on principal components (PCs), and the second is an explicit distribution on the number of relevant PCs. The posterior distribution of the PCs is found to be of the von-Mises-Fisher type. This distribution and its associated hypergeometric function, , are studied. Numerical reductions are revealed, leading to a stable and efficient orthogonal variational PCA (OVPCA) algorithm. OVPCA provides the required inferences. Its performance is illustrated in simulation, and for a sequence of medical scintigraphic images.     

Adaptive nonlinear manifolds and their applications to pattern recognition

Dimensionality reduction has long been associated with retinotopic mapping for understanding cortical maps. Multisensory information is processed, fused and mapped to an essentially 2-D cortex in an information preserving manner. Data processing and projection techniques inspired by this biological mechanism are playing an increasingly important role in pattern recognition, computational intelligence, data mining, information retrieval and image recognition. Dimensionality reduction involves reduction of features or volume of data and has become an essential step of information processing in many fields. The topic of manifold learning has recently attracted a great deal of attention, and a number of advanced techniques for extracting nonlinear manifolds and reducing data dimensions have been proposed from statistics, geometry theory and adaptive neural networks. This paper provides an overview of this challenging and emerging topic and discusses various recent methods such as self-organizing map (SOM), kernel PCA, principal manifold, isomap, local linear embedding, and Laplacian eigenmap. Many of them can be considered in a learning manifold framework. The paper further elaborates on the biologically inspired SOM model and its metric preserving variant ViSOM under the framework of adaptive manifold; and their applications in dimensionality reduction with face recognition are investigated. The experiments demonstrate that adaptive ViSOM-based methods produce markedly improved performance over the others due to their metric scaling and preserving properties along the nonlinear manifold.     

Image retrieval using nonlinear manifold embedding

The huge number of images on the Web gives rise to the content-based image retrieval (CBIR) as the text-based search techniques cannot cater to the needs of precisely retrieving Web images. However, CBIR comes with a fundamental flaw: the semantic gap between high-level semantic concepts and low-level visual features. Consequently, relevance feedback is introduced into CBIR to learn the subjective needs of users. However, in practical applications the limited number of user feedbacks is usually overwhelmed by the large number of dimensionalities of the visual feature space. To address this issue, a novel semi-supervised learning method for dimensionality reduction, namely kernel maximum margin projection (KMMP) is proposed in this paper based on our previous work of maximum margin projection (MMP). Unlike traditional dimensionality reduction algorithms such as principal component analysis (PCA) and linear discriminant analysis (LDA), which only see the global Euclidean structure, KMMP is designed for discovering the local manifold structure. After projecting the images into a lower dimensional subspace, KMMP significantly improves the performance of image retrieval. The experimental results on Corel image database demonstrate the effectiveness of our proposed nonlinear algorithm.     

Face recognition using laplacianfaces

We propose an appearance-based face recognition method called the Laplacianface approach. By using locality preserving projections (LPP), the face images are mapped into a face subspace for analysis. Different from principal component analysis (PCA) and linear discriminant analysis (LDA) which effectively see only the Euclidean structure of face space, LPP finds an embedding that preserves local information, and obtains a face subspace that best detects the essential face manifold structure. The Laplacianfaces are the optimal linear approximations to the eigenfunctions of the Laplace Beltrami operator on the face manifold. In this way, the unwanted variations resulting from changes in lighting, facial expression, and pose may be eliminated or reduced. Theoretical analysis shows that PCA, LDA, and LPP can be obtained from different graph models. We compare the proposed Laplacianface approach with Eigenface and Fisherface methods on three different face data sets. Experimental results suggest that the proposed Laplacianface approach provides a better representation and achieves lower error rates in face recognition.     

Kernel-based nonlinear dimensionality reduction for electrocardiogram recognition

The human heart is a complex system that reveals many clues about its condition in its electrocardiogram (ECG) signal, and ECG supervising is the most important and efficient way of preventing heart attacks. ECG analysis and recognition are both important and tempting topics in modern medical research. The purpose of this paper is to develop an algorithm which investigates kernel method, locally linear embedding (LLE), principal component analysis (PCA), and support vector machine(SVM) algorithms for dimensionality reduction, features extraction, and classification for recognizing and classifying the given ECG signals. In order to do so, a nonlinear dimensionality reduction kernel method based LLE is proposed to reduce the high dimensions of the variational ECG signals, and the principal characteristics of the signals are extracted from the original database by means of the PCA, each signal representing a single and complete heart beat. SVM method is applied to classify the ECG data into several categories of heart diseases. Experimental results obtained demonstrated that the performance of the proposed method was similar and sometimes better when compared to other ECG recognition techniques, thus indicating a viable and accurate technique.     

基于多线性主元分析和FLD的掌纹识别*

为了减少高维对计算成本的影响,同时提取有利于分类的判别特征,提出运用多线性主元分析(MPCA)与FLD相结合的方法进行掌纹识别。运用MPCA直接对掌纹张量进行降维和特征提取,低维特征向量作为FLD的输入,提取判别特征向量,计算特征向量间的余弦距离进行掌纹匹配。PolyU掌纹图像库的实验结果表明,与主元分析（PCA）、PCA+FLD、二维主元分析(2DPCA)、独立元分析（ICA）和MPCA相比,该算法的识别率(RR)最高为9991%,特征提取和匹配总时间为0398 s,满足实时系统的要求。     

主成分分析方法(PCA)在车辆牌照识别中的应用

将主成分分析方法（PCA）应用于车牌识别。首先根据采集到样本分类构造各类样本对应特征子空间,然后对待识别字符图片进行预处理,再分别向各类特征空间投影,根据重构误差判断类别识别字符。     

核主元分析及其在人脸识别中的应用

传统的基于数据二阶统计矩的特征脸法(Eigenface)或主元分析法(PCA)是一种有效的数据特征提取方法,是基于原始特征的一种线性变换。但是,当原始数据中存在非线性属性时,用主元分析法后留下的显著成分就可能不再反映这种非线性属性。而核主元分析则是基于原始数据的高阶统计量,是一种非线性变换,在图像识别中它可以描述多个像素之间的相关性。该文采用KPCA法提取人脸特征,利用线性支持向量机设计分类器,实验结果表明,基于核主元分析方法的识别正确率明显优于基于主元分析法。     

基于流形特征的视频情感分析与识别

本文研究了基于Isomap的非线性降维方法,对由面部表情序列提取的面部动画参数特征进行降维,分析了降维后的流形特征空间与认知心理学情感空间之间的关系。实验结果表明,Isomap降维后的情感流形特征能够表现情感的强度变化,而且比PCA降维特征对情感强度的描述更加合理和平滑;情感识别实验也表明,使用Isomap降维流形特征的识别率要高于原始情感特征和PCA降维特征,而且对各种情感的识别结果更加均衡。     

Online signature verification based on null component analysis and principal component analysis

This paper describes a method for stroke-based online signature verification using null component analysis (NCA) and principal component analysis (PCA). After the segmentation and flexible matching of the signature, we extract stable segments from each reference signature in order that the segment sequences have the same length. The reference set of feature vectors are transformed and separated into null components (NCs) and principal components (PCs) by K-L transform. Online signature verification is a special two-category classification problem and there is not a single available forgery set in an actual system. Therefore, it is different from the typical application of PCA in pattern recognition that both NCA and PCA are used to respectively analyze stable and unstable components of genuine reference set. Experiments on a data set containing a total 1,410 signatures of 94 signers show that the NCA/PCA-based online signature verification method can achieve better results. The best result yields an equal error rate of 1.9%.     

Theory of fractional covariance matrix and its applications in PCA and 2D-PCA

In this paper, according to the definition and applications of fractional moments, we give new definitions of the fractional variance and fractional covariance. Furthermore, we give the definition of fractional covariance matrix. Based on fractional covariance matrix, principal component analysis (PCA) and two-dimensional principal component analysis (2D-PCA), we propose two new techniques, called fractional principal component analysis (FPCA) and two-dimensional fractional principal component analysis (2D-FPCA), which extends PCA and 2D-PCA to fractional order form, and extends the transition recognition ranges of PCA and 2D-PCA. To evaluate the performances of FPCA and 2D-FPCA, a series of experiments are performed on two face image databases: ORL and Yale. Experiments show that two new techniques are superior to the standard PCA and 2D-PCA if choosing different order between 0 and 1.     

Discriminative functional analysis of human movements

This paper investigates the use of statistical dimensionality reduction (DR) techniques for discriminative low dimensional embedding to enable affective movement recognition. Human movements are defined by a collection of sequential observations (time-series features) representing body joint angle or joint Cartesian trajectories. In this work, these sequential observations are modelled as temporal functions using B-spline basis function expansion, and dimensionality reduction techniques are adapted to enable application to the functional observations. The DR techniques adapted here are: Fischer discriminant analysis (FDA), supervised principal component analysis (PCA), and Isomap. These functional DR techniques along with functional PCA are applied on affective human movement datasets and their performance is evaluated using leave-one-out cross validation with a one-nearest neighbour classifier in the corresponding low-dimensional subspaces. The results show that functional supervised PCA outperforms the other DR techniques examined in terms of classification accuracy and time resource requirements.     

Constructing PCA baseline algorithms to reevaluate ICA-based face-recognition performance.

The literature on independent component analysis (ICA)-based face recognition generally evaluates its performance using standard principal component analysis (PCA) within two architectures, ICA Architecture I and ICA Architecture II. In this correspondence, we analyze these two ICA architectures and find that ICA Architecture I involves a vertically centered PCA process (PCA I), while ICA Architecture II involves a whitened horizontally centered PCA process (PCA II). Thus, it makes sense to use these two PCA versions as baselines to reevaluate the performance of ICA-based face-recognition systems. Experiments on the FERET, AR, and AT&T face-image databases showed no significant differences between ICA Architecture I (II) and PCA I (II), although ICA Architecture I (or II) may, in some cases, significantly outperform standard PCA. It can be concluded that the performance of ICA strongly depends on the PCA process that it involves. Pure ICA projection has only a trivial effect on performance in face recognition.     

Robust palmprint identification based on directional representations and compressed sensing

In this paper, we propose a novel approach for palmprint recognition, which contains two interesting components: directional representation and compressed sensing. Gabor wavelets can be well represented for biometric image for their similar characteristics to human visual system. However, these Gabor-based algorithms are not robust for image recognition under non-uniform illumination and suffer from the heavy computational burden. To improve the recognition performance under the low quality conditions with a fast operation speed, we propose novel palmprint recognition approach using directional representations. Firstly, the directional representation for palmprint appearance is obtained by the anisotropy filter, which is robust to drastic illumination changes and preserves important discriminative information. Then, the principal component analysis (PCA) is used for feature extraction to reduce the dimensions of the palmprint images. At last, based on a sparse representation on PCA feature, the compressed sensing is used to distinguish palms from different hands. Experimental results on the PolyU palmprint database show the proposed algorithm have better performance than that of the Gabor based methods.     

基于改进核主元分析的TE故障诊断

PCA、KPCA作为常用的多变量统计监控算法,一般适用于定常过程。针对实际工业过程的时变、非线性特性,提出一种基于分块的改进KPCA算法。该方法通过采用随时间更新的核矩阵代替固定核矩阵用于主元模型的建立,使非线性监控模型能够在线更新,从而提高KPCA的检测正确率。与KPCA方法相比,该方法的运算复杂度明显降低。将该方法应用于TE(Tennessee Eastman)过程,仿真结果显示,该方法具有较好的监测性能,且所需时间大大减小,说明了本算法的有效性。