共查询到20条相似文献,搜索用时 15 毫秒
1.
Gui-Fu Lu Author Vitae Zhong Lin Author Vitae Author Vitae 《Pattern recognition》2010,43(10):3572-3579
In this paper, we propose a new discriminant locality preserving projections based on maximum margin criterion (DLPP/MMC). DLPP/MMC seeks to maximize the difference, rather than the ratio, between the locality preserving between-class scatter and locality preserving within-class scatter. DLPP/MMC is theoretically elegant and can derive its discriminant vectors from both the range of the locality preserving between-class scatter and the range space of locality preserving within-class scatter. DLPP/MMC can also derive its discriminant vectors from the null space of locality preserving within-class scatter when the parameter of DLPP/MMC approaches +∞. Experiments on the ORL, Yale, FERET, and PIE face databases show the effectiveness of the proposed DLPP/MMC. 相似文献
2.
Liping Yang Author Vitae Author Vitae Xiaohua Gu Author Vitae Author Vitae Yanfei Liu Author Vitae 《Pattern recognition》2009,42(9):1853-1858
In this paper, we propose a novel bagging null space locality preserving discriminant analysis (bagNLPDA) method for facial feature extraction and recognition. The bagNLPDA method first projects all the training samples into the range space of a so-called locality preserving total scatter matrix without losing any discriminative information. The projected training samples are then randomly sampled using bagging to generate a set of bootstrap replicates. Null space discriminant analysis is performed in each replicate and the results of them are combined using majority voting. As a result, the proposed method aggregates a set of complementary null space locality preserving discriminant classifiers. Experiments on FERET and PIE subsets demonstrate the effectiveness of bagNLPDA. 相似文献
3.
《Pattern recognition》2014,47(2):544-555
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. 相似文献
4.
Xiao-Sheng Zhuang Author Vitae Author Vitae 《Pattern recognition》2007,40(5):1570-1578
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. 相似文献
5.
For face recognition, graph embedding techniques attempt to produce a high data locality projection for better recognition performance. However, estimation of population data locality could be severely biased due to small number of training samples. The biased estimation triggers overfitting problem and hence poor generalization. In this paper, we propose a new linear graph embedding technique based upon an adaptive locality preserving regulation model (ALPRM), known as Regularized Locality Preserving Discriminant Embedding (RLPDE). In RLPDE, the projection features are regulated based on ALPRM to approach population data locality, which can directly enhance the locality preserving capability of the projection features. This paper also presents the relation between locality preserving capability and class discrimination. Specifically, we show that the optimization of the locality preserving function minimizes the within-class variability. Experiments on three face datasets such as PIE, FRGC and FERET show the promising performance of the proposed technique. 相似文献
6.
Xi ChenAuthor Vitae Jiashu Zhang Author Vitae 《Future Generation Computer Systems》2012,28(1):212-217
This paper presents a novel supervised linear dimensionality reduction approach called maximum margin neighborhood preserving embedding (MMNPE). The central idea is to modify the neighborhood preserving embedding by maximizing the maximum margin distance while preserving the geometric structure of the manifold. Experimental results conducted on the ORL database, the Yale database and the VALID face database indicate the effectiveness of the proposed MMNPE. 相似文献
7.
为了充分利用样本的类别信息,提出了一种改进的有监督保局投影人脸识别算法。利用先验类标签信息重新构造传统保局投影算法中的权重矩阵,基于改进后的保局投影算法得到变换矩阵;用线性鉴别的思想筛选出变换矩阵中的最优基向量,构成最终的变换矩阵。把训练样本和测试样本投影到由最优基向量构成的子空间得到训练样本和测试样本的特征。采用最近邻分类器分类。在ORL和FERET人脸库上的测试结果表明,算法具有较好的识别性能。 相似文献
8.
We propose Kernel Self-optimized Locality Preserving Discriminant Analysis (KSLPDA) for feature extraction and recognition. The procedure of KSLPDA is divided into two stages, i.e., one is to solve the optimal expansion of the data-dependent kernel with the proposed kernel self-optimization method, and the second is to seek the optimal projection matrix for dimensionality reduction. Since the optimal parameters of data-dependent kernel are achieved automatically through solving the constraint optimization equation, based on maximum margin criterion and Fisher criterion in the empirical feature space, KSLPDA works well on feature extraction for classification. The comparative experiments show that KSLPDA outperforms PCA, LDA, LPP, supervised LPP and kernel supervised LPP. 相似文献
9.
有监督的无参数核局部保持投影及人脸识别 总被引:1,自引:0,他引:1
针对发掘人脸图像中的高维非线性结构,将加核及构造无参数近邻图两种思想同时引入到局部保持投影算法中,在有监督的模式下,提出了一种新的有监督的无参数核局部保持投影(Parameter-less Supervised Kernel Locality Preserving Projection,PSKLPP)算法并给出了其推导过程。该算法通过将欧氏距离改为对离群数据更为鲁棒的余弦距离,构造无参数近邻图,利用核方法提取人脸图像中的非线性信息,并将其投影在一个高维非线性空间,运用局部保持投影算法得到一线性映射,有效避免了在计算相似矩阵过程中面临的复杂参数选择问题。在ORL和Yale人脸库上的仿真实验验证了所提算法的有效性。 相似文献
10.
局部保持投影LPP(Locality Preserving Projection)是一种有效的非线性降维方法,能够使投影降维后的数据与原输入空间中的相似局部结构保持一致,但是该方法没有充分利用类间样本点的权重等重要信息。为了解决这个问题,提出基于Fisher准则的多流形判别分析FMMDA(Fisher Multi-Manifold Discriminant Analysis)方法。结合Fisher准则训练样本类内拉普拉斯图和样本均值类间拉普拉斯图,既保持了原样本的相似局部结构,又充分地利用了不同类别之间的权重。在ORL及Yale人脸库上验证了该方法的有效性。与其他几种最先进的方法相比,FMMDA方法取得了更好的识别效果。 相似文献
11.
12.
In this paper, we propose an effective feature extraction algorithm, called Multi-Subregion based Correlation Filter Bank (MS-CFB), for robust face recognition. MS-CFB combines the benefits of global-based and local-based feature extraction algorithms, where multiple correlation filters corresponding to different face subregions are jointly designed to optimize the overall correlation outputs. Furthermore, we reduce the computational complexity of MS-CFB by designing the correlation filter bank in the spatial domain and improve its generalization capability by capitalizing on the unconstrained form during the filter bank design process. MS-CFB not only takes the differences among face subregions into account, but also effectively exploits the discriminative information in face subregions. Experimental results on various public face databases demonstrate that the proposed algorithm provides a better feature representation for classification and achieves higher recognition rates compared with several state-of-the-art algorithms. 相似文献
13.
Xiaohua Gu Author VitaeWeiguo GongAuthor Vitae Liping Yang Author Vitae 《Neurocomputing》2011,74(17):3036-3042
This paper proposes a regularized locality preserving discriminant analysis (RLPDA) approach for facial feature extraction and recognition. The RLPDA approach decomposes the eigenspace of the locality preserving within-class scatter matrix into three subspaces, i.e., the face space, the noise space and the null space, and then regularizes the three subspaces differently according to their predicted eigenvalues. As a result, the proposed approach integrates discriminative information in all of the three subspaces, de-emphasizes the effect of the eigenvectors corresponding to the small eigenvalues, and meanwhile suppresses the small sample size problem. Extensive experiments on ORL face database, FERET face subset and UMIST face database illustrate the effectiveness of the proposed approach. 相似文献
14.
This paper proposes a novel method for extraction of eyebrow contour and chin contour. We first segment rough eyebrow regions using spatial constrained sub-area K-means clustering. Then eyebrow contours are extracted by Snake method with effective image force. For chin contour extraction, we first estimate several possible chin locations which are used to build a number of curves as chin contour candidates. Based on the chin like edges extracted by proposed chin edge detector, the curve with the largest likeliness to be the actual chin contour is selected. Finally, the credible extracted eyebrow contour and the estimated chin contours are used as geometric features for face recognition. Experimental results show that the proposed algorithms can extract eyebrow contours and chin contours with good accuracy and the extracted features are effective for improving face recognition rates. 相似文献
15.
局部保持鉴别分析在人脸识别研究中具有非常重要的地位。在此基础上提出的2DLPDA算法直接在二维空间进行运算,一定程度上提高了性能。但是当样本在光照阴影、遮挡等情况下时,识别率受到很大影响,为此提出一种改进的算法,即分块二维局部保持鉴别分析方法。其将样本分块,以更好地提取样本中的局部近邻特征。这样同一样本的不同分块在选择近邻时,就可能具有来自不同样本的近邻,从而能更好地提取样本的局部特征。最后将局部特征整合为整体作为识别的依据。在AR、YALE及ORL库上验证了算法的有效性。 相似文献
16.
Jianzhong Wang Zhiqiang MaBaoxue Zhang Miao QiJun Kong 《Pattern recognition letters》2011,32(3):494-504
In this paper, a novel local matching method called structure-preserved projections (SPP) is proposed for face recognition. Unlike most existing local matching methods which neglect the interactions of different sub-pattern sets during feature extraction, i.e., they assume different sub-pattern sets are independent; SPP takes the holistic context of the face into account and can preserve the configural structure of each face image in subspace. Moreover, the intrinsic manifold structure of the sub-pattern sets can also be preserved in our method. With SPP, all sub-patterns partitioned from the original face images are trained to obtain a unified subspace, in which recognition can be performed. The efficiency of the proposed algorithm is demonstrated by extensive experiments on three standard face databases (Yale, Extended YaleB and PIE). Experimental results show that SPP outperforms other holistic and local matching methods. 相似文献
17.
Regularized discriminant analysis for the small sample size problem in face recognition 总被引:1,自引:0,他引:1
It is well-known that the applicability of both linear discriminant analysis (LDA) and quadratic discriminant analysis (QDA) to high-dimensional pattern classification tasks such as face recognition (FR) often suffers from the so-called “small sample size” (SSS) problem arising from the small number of available training samples compared to the dimensionality of the sample space. In this paper, we propose a new QDA like method that effectively addresses the SSS problem using a regularization technique. Extensive experimentation performed on the FERET database indicates that the proposed methodology outperforms traditional methods such as Eigenfaces, direct QDA and direct LDA in a number of SSS setting scenarios. 相似文献
18.
针对鉴别的局部中值保持投影(DLMPP)在小样本情况下面临的类内散布矩阵奇异的问题,提出了广义的鉴别局部中值保持投影(GDLMPP)算法。GDLMPP首先将样本等价映射到一个低维子空间,然后在此子空间求解最佳投影矩阵,从而有效解决了小样本问题,并从理论上验证了当类内散布矩阵非奇异时,GDLMPP等价于DLMPP。最后,通过在ORL及AR库上的实验验证了算法的有效性。 相似文献
19.
Linear discriminant regression classification (LDRC) was presented recently in order to boost the effectiveness of linear regression classification (LRC). LDRC aims to find a subspace for LRC where LRC can achieve a high discrimination for classification. As a discriminant analysis algorithm, however, LDRC considers an equal importance of each training sample and ignores the different contributions of these samples to learn the discriminative feature subspace for classification. Motivated by the fact that some training samples are more effectual in learning the low-dimensional feature space than other samples, in this paper, we propose an adaptive linear discriminant regression classification (ALDRC) algorithm by taking special consideration of different contributions of the training samples. Specifically, ALDRC makes use of different weights to characterize the different contributions of the training samples and utilizes such weighting information to calculate the between-class and the within-class reconstruction errors, and then ALDRC seeks to find an optimal projection matrix that can maximize the ratio of the between-class reconstruction error over the within-class reconstruction error. Extensive experiments carried out on the AR, FERET and ORL face databases demonstrate the effectiveness of the proposed method. 相似文献
20.
Orthogonal local spline discriminant projection with application to face recognition 总被引:1,自引:0,他引:1
Ying-Ke Lei Zhi-Guo DingRong-Xiang Hu Shan-Wen ZhangWei Jia 《Pattern recognition letters》2011,32(4):615-625
In this paper, an efficient feature extraction algorithm called orthogonal local spline discriminant projection (O-LSDP) is proposed for face recognition. Derived from local spline embedding (LSE), O-LSDP not only inherits the advantages of LSE which uses local tangent space as a representation of the local geometry so as to preserve the local structure, but also makes full use of class information and orthogonal subspace to improve discriminant power. Extensive experiments on several standard face databases demonstrate the effectiveness of the proposed method. 相似文献