核稀疏保留投影及在步态识别中的应用

针对已有基于线性变换的稀疏保留投影方法在解决实际问题时,会遇到维数灾难和小样本问题.通过引入核方法,提出一种核稀疏保留投影方法.首先采用非线性变换将原始数据映射到高维特征空间,而后在这个高维空间进行稀疏重构,并对得到的系数矩阵进行降维优化,最终得到所需的投影矩阵.将其应用到步态识别中,采用CASIA(B)步态数据库进行实验分析,实验结果表明,本文方法取得了令人满意的识别效果.     

Manifold sparsity preserving projection for face and palmprint recognition

Multimedia Tools and Applications - Sparsity Preserving Projection (SPP) has been recently successfully applied on pattern recognition applications and is the basis for a series of follow up...     

有监督正交局部保留投影及其在人脸识别中的应用

针对局部保留投影算法（LPP）的无监督和非正交问题,提出了一种有监督的正交局部保留投影算法SOLPP。该算法同时考虑了样本的类别信息以及投影向量间的相互正交性,首先利用样本的类标签信息重新定义了类内和类间相似度矩阵,同时最大化类间离散度与类内离散度之比,有效地保持了样本的局部结构;其次对投影基向量进行正交化,在保持数据空间结构的同时进一步提高了人脸识别效果。在ORL和FERET人脸库上的实验表明,该方法的识别率要优于SLPP等算法。     

双向二维局部保持鉴别投影应用于人脸识别

双向二维局部保持映射（双向2DLPP）与二维局部保持映射（2DLPP）比较,双向2DLPP同时对图像的行方向和列方向进行降维处理,可以采用较少的系数有效地表示图像。为了进一步增强双向2DLPP算法的分类能力,将双向2DLPP所提取的特征采用线性判别式分析（LDA）进行分类,从而形成了一种新的监督算法：鉴别双向二维局部保持投影。理论分析表明,无论在计算量还是内存要求方面,所提鉴别双向二维局部保持投影算法比双向2DLPP和主成分分析+线性判别式分析（PCA+LDA）要少,而且在ORL 和Yale数据库上的人脸识别实验表明,新算法的识别性能比双向2DLPP和PCA+LDA算法要好,且具有较少的计算复杂度。     

结合成对约束的近邻稀疏保留投影算法

稀疏保持投影算法是一种无监督的全局线性降维方法,无法应对训练样本不足及类内样本间差异过大的情况。针对该问题,提出一种结合成对约束机制的近邻稀疏保留投影算法。利用近邻样本求取稀疏系数以保留局部结构信息,引入成对约束监督的思想,利用样本类别指导稀疏重构过程,最后定义能最大限度保留稀疏系数中蕴含的类别信息的低维子空间。将该算法用于人脸识别,实验结果证明了算法在识别率以及运行时间上的有效性和可行性。     

RP-LPP : a random permutation based locality preserving projection for cancelable biometric recognition

Biometrics are being increasingly used across the world, but it also raises privacy and security concerns of the enrolled identities. The main reason is due to the fact that biometrics are not cancelable and if compromised may give access to the intruder. Cancelable biometric template is a solution to this problem which can be reissued if compromised. In this paper, we suggest a simple and powerful method called Random Permutation Locality Preserving Projection (RP-LPP) for Cancelable Biometric Recognition. Here, we exploit the mathematical relationship between the eigenvalues and eigenvectors of the original biometric image and its randomly permuted version is exploited for carrying out cancelable biometric recognition. The proposed technique work in a cryptic manner by accepting the cancelable biometric template and a key (called PIN) issued to a user. The effectiveness of the proposed techniques is demonstrated on three freely available face (ORL), iris (UBIRIS) and ear (IITD) datasets against state-of-the-art methods. The advantages of proposed technique are (i) the classification accuracy remains unaffected due to cancelable biometric templates generated using random permutation, (ii) security and quality of generated templates and (iii) robustness across different biometrics. In addition, no image registration is required for performing recognition.

     

最小距离鉴别投影及其在人脸识别中的应用

针对人脸识别问题,提出了最小距离鉴别投影算法,其与经典的线性鉴别分析不同,它是一种流形学习降维算法。该算法首先定义样本的类内相似度与类间相似度:前者能够度量样本与类内中心的距离关系,后者不仅能够反映样本与类间中心的距离关系而且能够反映样本类间距与类内距的大小关系;然后将高维数据映射到低维特征空间,使得样本到类内中心距离最小同时到类间中心距离最大。最后,在ORL、FERET及AR人脸库上的实验结果表明所提算法识别性能要优于其他算法。     

Multi-linear neighborhood preserving projection for face recognition

This paper proposes a novel method of supervised and unsupervised multi-linear neighborhood preserving projection (MNPP) for face recognition. Unlike conventional neighborhood preserving projections, the MNPP method operates directly on tensorial data rather than vectors or matrices, and solves problems of tensorial representation for multi-dimensional feature extraction, classification and recognition. As opposed to traditional approaches such as NPP and 2DNPP, which derive only one subspace, multiple interrelated subspaces are obtained in the MNPP method by unfolding the tensor over different tensorial directions. The number of subspaces derived by MNPP is determined by the order of the tensor space. This approach is used for face recognition and biometrical security classification problems involving higher order tensors. The performance of our proposed and existing techniques is analyzed using three benchmark facial datasets ORL, AR, and FERET. The obtained results show that the MNPP outperforms the standard approaches in terms of the error rate.     

子模式局部保持映射人脸识别

研究表明基于整体思想的人脸识别方法由于忽略图像的局部信息,在识别性能方面不如局部信息特征保持较好的基于子模块思想的识别算法。基于应用流形技术对图像降维后能够较好保持非线性子流形中的局部数据流形结构,提出了一种改进的子模式局部保持映射人脸识别算法。其主要思想是将同类的不同图像一并划分子集,由同位置子图组成子模块,并对子模块运用LPP算法学习其流形结构,与将不同类图像一并划分子集学习流形的方法不同。实验表明,该算法能更好地保持人脸图像的局部流形结构和信息特征,提高了识别率。     

Optimal locality preserving projection for face recognition

In face recognition, when the number of images in the training set is much smaller than the number of pixels in each image, Locality Preserving Projections (LPP) often suffers from the singularity problem. To overcome singularity problem, principal component analysis is applied as a preprocessing step. But this procession may discard some important discriminative information. In this paper, a novel algorithm called Optimal Locality Preserving Projections (O-LPP) is proposed. The algorithm transforms the singular eigensystem computation to eigenvalue decomposition problems without losing any discriminative information, which can reduce the computation complexity. And the theoretical analysis related to the algorithm is also obtained. Extensive experiments on face databases demonstrate the proposed algorithm is superior to the traditional LPP algorithm.     

间距判别投影及其在表情识别中的应用

针对全局降维方法判别信息不足,局部降维方法对邻域关系的判定存在缺陷的问题,提出一种新的基于间距的降维方法——间距判别投影（MDP）。首先,根据类的中心均值的异类近邻关系定义描述类边缘的边界向量;在这个基础上,MDP重新定义类间离散度矩阵,同时,使用全局的方法构造类内离散度矩阵;然后,MDP借鉴判别分析思想建立衡量类间距的准则,并通过类间距最大化增强样本在投影空间中的可分性。对MDP在人脸表情数据库JAFFE和Extended Cohn-Kanade上进行表情识别实验,并且跟传统的降维方法主成分分析（PCA）、最大间距准则（MMC）和边界Fisher分析（MFA）进行对比,实验结果表明,所提算法能够有效提取更具区分性的低维特征,比其他几种方法分类精度更高。     

Discriminant sparse locality preserving projection for face recognition

Multimedia Tools and Applications - In this paper, aiming at the drawback of the popular dimensionality reduction method Discriminant Sparse Neighborhood Preserving Embedding(DSNPE), i.e. the...     

基于改进的局部保持投影算法的人脸识别

局部保持投影算法是基于流形的学习方法,在人脸识别过程中容易遇到奇异值问题,为此提出一种利用奇异值分解的方法。在模型中,样本数据被投影到一个非奇异正交矩阵中,解决了奇异值问题;然后再根据局部保持投影算法求出新样本空间的低维投影子空间。将训练样本和测试样本分别投影到低维子空间中,再利用最近邻分类器进行分类识别。在ORL人脸数据库中,采用了一系列的实验来对比该算法与传统局部保持投影算法和主成分分析算法的识别效果。实验结果验证了改进的局部保持投影算法在人脸识别的有效性。     

SRC最佳鉴别投影及其在人脸识别中的应用

根据稀疏表示分类器的分类准则,提出了一种稀疏表示分类器最佳判别的投影方法。该方法优化两个目标,一是数据集的类间和类内稀疏重构误差,二是数据集中区分度。优化结果使样本投影到低维空间中,确保SRC具有更好的分类性能。在AR和Yale数据库上进行人脸识别实验,并与几种流行的方法进行了比较,结果表明所提出的方法具有良好的有效性和鲁棒性。     

基于二维测地线距离保持映射的人脸识别

人脸空间是嵌套在高维观测空间中的低维流形,为了更好地描述人脸空间的凸起和凹进等细微结构,提出了一种基于二维测地线距离保持映射的人脸识别算法。算法采用矩阵的模式表示人脸空间中的样本图像;基于图像的矩阵表示模型,采用二维测地线距离保持映射算法计算人脸空间的低维嵌套流形;以人脸样本在低维流形空间中的投影为特征进行人脸识别。在CMU PIE人脸数据库上的实验结果验证了算法的合理性和有效性。     

基于监督判别局部保持投影的表情识别算法

LPP算法是无监督算法,并没有考虑到不同类别的样本对分类效果的影响,结果会造成不同类数据点的重叠,故所获得的子空间对于分类问题来说未必是最优的。提出一种新的基于监督判别局部保持投影（SDLPP）的表情识别算法。利用样本的类别信息重新构造LPP算法中的相似矩阵,然后在目标函数中增加类间散度约束,这样就会在保持样本点局部结构的同时,使不同类的样本点相互远离,从而得到更具有判别性的表情特征。该算法在识别率上比其他方法都有较大提高,通过在JAFFE表情库上的实验验证了其有效性。     

Two-dimensional locality preserving projections (2DLPP) with its application to palmprint recognition

This paper proposes a novel algorithm for image feature extraction, namely, the two-dimensional locality preserving projections (2DLPP), which directly extracts the proper features from image matrices based on locality preserving criterion. Experimental results on the PolyU palmprint database show the effectiveness of the proposed algorithm.     

LPiTrack: Eye movement pattern recognition algorithm and application to biometric identification

A comprehensive nonparametric statistical learning framework, called LPiTrack, is introduced for large-scale eye-movement pattern discovery. The foundation of our data-compression scheme is based on a new Karhunen–Loéve-type representation of the stochastic process in Hilbert space by specially designed orthonormal polynomial expansions. We apply this novel nonlinear transformation-based statistical data-processing algorithm to extract temporal-spatial-static characteristics from eye-movement trajectory data in an automated, robust way for biometric authentication. This is a significant step towards designing a next-generation gaze-based biometric identification system. We elucidate the essential components of our algorithm through data from the second Eye Movements Verification and Identification Competition, organized as a part of the 2014 International Joint Conference on Biometrics.     

An adaptively weighted sub-pattern locality preserving projection for face recognition

In this paper, an adaptively weighted sub-pattern locality preserving projection (Aw-SpLPP) algorithm is proposed for face recognition. Unlike the traditional LPP algorithm which operates directly on the whole face image patterns and obtains a global face features that best detects the essential face manifold structure, the proposed Aw-SpLPP method operates on sub-patterns partitioned from an original whole face image and separately extracts corresponding local sub-features from them. Furthermore, the contribution of each sub-pattern can be adaptively computed by Aw-SpLPP in order to enhance the robustness to facial pose, expression and illumination variations. The efficiency of the proposed algorithm is demonstrated by extensive experiments on three standard face databases (Yale, YaleB and PIE). Experimental results show that Aw-SpLPP outperforms other holistic and sub-pattern based methods.     

基于局部保持投影与隐马尔可夫模型的维文字符识别

针对传统隐马尔可夫模型(HMM)在对手写维吾尔文字符建模时,字符宽度变化大,模型训练收敛缓慢,且易陷入局部极值的问题,提出一种基于保局投影(LPP)与HMM相结合的维吾尔字符识别方法。首先,通过高度归一化保持原图像的宽高比,用滑动窗获取子图像序列,形成观测向量序列;其次,采用局部保持投影将观测序列映射到低维空间,并用随机抽样方法降低邻接图矩阵的规模;最后,采用新观测序列训练HMM。该算法在降维的同时提高了HMM的收敛速度,降低了陷入局部极值的风险。实验结果显示,算法的平均收敛步数减少,错误率降低,表明算法是有效的。