共查询到19条相似文献,搜索用时 183 毫秒
1.
针对目前大多数人脸识别方法只能单独实施降维或者字典学习而不能完全利用训练样本判别信息的问题,提出了基于判别性降维的字典学习方法,通过联合降维与字典学习使得投影矩阵和字典更好地相互拟合,从而可以获得更高效的人脸分类系统。所提方法的有效性在AR及MPIE两大通用人脸数据库上得到了验证,实验结果表明,相比于几种先进的线性表示方法,所提算法取得了更高的识别率,特别当训练样本数很少的时候,识别效果更佳。 相似文献
2.
针对现有的人脸识别算法由于光照、表情、姿态、伪装等变化而严重影响识别性能的问题,提出了一种基于通用学习框架结合2DPCA的鲁棒人脸识别算法。首先借助于额外的通用训练样本集进行样本的叠加以增加训练样本的数量;然后利用经典的2DPCA算法进行特征提取;最后,利用最近邻分类器对人脸进行分类并完成最终的人脸识别。在基准人脸数据库ORL、FERET及鲁棒人脸数据库AR、扩展YaleB上的实验验证了该算法的有效性及鲁棒性,实验结果表明,相比其他几种人脸识别算法,提出的算法不仅提高了人脸识别率,而且大大地减少了识别所用时间,有望应用于实时鲁棒人脸自动识别系统中。 相似文献
3.
针对低秩矩阵恢复算法复杂度过高和训练集样本存在遮挡的问题,本文提出一种基于低秩矩阵恢复和Gabor特征的鲁棒表示与分类的遮挡人脸识别方法.该方法首先通过快速低秩矩阵恢复算法,准确并且快速地求得训练样本图像对应的误差图像;然后,分别对"干净"人脸图像和遮挡误差图像进行Gabor变换,得到Gabor特征向量;接着,本文提出一种基于Gabor特征的遮挡字典压缩算法,可以计算出压缩后的Gabor遮挡字典,并用其与训练样本的Gabor特征向量构成Gabor压缩字典;最后,利用压缩字典对测试样本进行协作表示,获取最终的识别结果.在Extended Yale B和AR数据库上的实验结果表明,本方法不仅对遮挡人脸识别具有较强的鲁棒性,而且大大降低了对遮挡人脸图像编码的计算量,缩减了算法的运行时间. 相似文献
4.
传统独立元分析(Independent Component Analysis,ICA)用于人脸识别首先是将人脸图像矩阵转换成向量求白化矩阵,然后利用快速固定点算法求分离矩阵,获得人脸图像独立基子空间,从而实现人脸识别.二维主元分析(Two-dimensional Principle Component Analysis,2DPCA)无须将人脸图像矩阵转换成向量,直接利用二维人脸图像矩阵求协方差矩阵,其特征值与特征向量的计算得到简化.本文结合2DPCA与ICA算法的特点,提出2DPCA-ICA人脸识别算法.该方法通过2DPCA算法计算白化矩阵;接着利用ICA算法获得人脸图像的独立元;然后构造独立基子空间;最后依据测试样本在独立基子空间上的投影特征实现人脸识别.基于ORL与Yale人脸数据库的实验结果表明,2DPCA-ICA算法正确识别率与识别效率均高于PCA-ICA算法与2DPCA算法,是一种有效的人脸识别方法. 相似文献
5.
6.
针对训练样本和测试样本均存在光照及遮挡时,破坏图像低秩结构问题,本文提出基于监督低秩子空间恢复的正则鲁棒稀疏表示人脸识别算法。首先,将所有训练样本构造成矩阵D,对矩阵D进行监督低秩矩阵分解,分解为低秩类相关结构A,低秩类内差异结构B和稀疏误差结构E;然后用主成分分析方法找到类相关结构A低秩子空间的变换矩阵;再通过变换矩阵将训练样本和测试样本投影到低秩子空间;最后,在低秩子空间中,通过正则鲁棒稀疏编码进行加权分类识别。在AR和Extended Yale B公开人脸数据库上的实验结果验证本文算法的有效性及鲁棒性。 相似文献
7.
遮挡条件下的鲁棒人脸识别,目前在人脸识别领域逐渐被重视,被认为是难点问题之一. 本文利用稀疏表示理论满足人眼视觉特性及神经信息有效表达,且跟人脸固有特征具有的自然性是相吻合的特点,研究了彩色人脸图像色度信息有效融合策略,采用同伦算法解决稀疏表示模型中的l1范数问题,提出了一种基于彩色信息融合和同伦算法的遮挡鲁棒人脸识别算法. 在AR数据库中的实验结果表明,与传统基于灰度转换方法人脸识别方法及SRC算法相比,本文所提基于同伦算法的稀疏表示人脸识别,具有很高的计算效率,而且有效融合了彩色信息,显著提高了在遮挡及非遮挡情况下人脸识别的效率及识别性能. 相似文献
8.
针对人脸识别中的遮挡和姿态偏转等问题,提出了一种基于分块LBP和鲁棒核编码(Robust Kernel Coding,RKC)的人脸识别算法,简称LBP-RKC算法.该算法首先对人脸图像进行多级分块的LBP特征提取,得到图像的每一块统计直方图特征.然后,将特征投影到核空间中,在核空间中建立一个鲁棒的回归模型来处理图像中的异常值,并利用迭代重加权算法求解该模型.最后,计算测试样本的每一块核表示重构残差并进行分类识别.实验表明,提出的LBP-RKC算法在处理遮挡、姿态偏转等人脸问题时能取得很好的识别效果,同时算法效率较高. 相似文献
9.
10.
11.
Sparse representation-based classification (SRC) method has gained great success in face recognition due to its encouraging and impressive performance. However, in SRC the data used to train or test are usually corrupted, and hence the performance is affected. This paper proposes a robust face recognition approach by means of learning a class-specific dictionary and a projection matrix. Firstly, the training data are decomposed into class-specific dictionary, non-class-specific dictionary, and sparse error matrix. Secondly, in order to correct the corrupted test data, the data are projected onto their corresponding underlying subspace, and a projection matrix between the original training data and the class-specific dictionary is learned. Then, the features of the class-specific dictionary and the corrected test data are extracted by using Eigenface method. Finally, the SRC is performed to classify. Extensive experiments conducted on publicly available data sets show that the proposed algorithm performs better than some state-of-the-art methods. 相似文献
12.
为了提高基于流形学习理论人脸识别算法的识别率,采用一种将非线性降维与Fisher线性判别相结合的方法。首先利用邻域嵌入算法,将人脸图像测试和训练集的维数降低到合适维度,然后使用Fisher线性判别进行人脸数据集特征的提取,最后将测试集人脸图像特征和训练集人脸图像特征,使用最近邻分类器进行分类。在公开的Olivettifaces和ORL人脸图像数据库上,分别将该算法与几种经典基于流形学习理论的人脸识别算法进行了对比实验,实验结果表明当近邻数比较大时本算法识别率是最高的。 相似文献
13.
14.
针对人脸识别技术易受光照、姿态、表情等影响 ,为了增强人脸识别算法的鲁棒性,提出首先采用 LBP算法提取人脸图像的局部纹理特征,使用PCA算法将高维的空间人脸图像投影到低维的 特征空间,使 用LDA算法利用人脸类别标签信息寻找最优的投影向量,实现了人脸图像维度进一步地压缩 ,最后使用SVM 分类器分类匹配得到识别结果。分别使用ORL和Yale人脸数据库验证了算法的有效性,实 验结果表明,文 中该方法具有良好的识别性能,与其它的识别算法相比,识别率有了较大的提高。 相似文献
15.
针对辐射源识别中的特征稳定性不高和低信噪比环境适应性不足等问题,提出了一种基于二次时频分布、核协同表示与鉴别投影的识别方法.首先,通过时频变换、稀疏域降噪和二次特征提取的预处理算法降低噪声干扰和特征冗余,以获取高稳定性的二次时频分布特征;然后,采用核协同表示和鉴别投影思想进行降维学习和字典学习,以提升数据低维表征和类间鉴别能力;最后,通过离线训练完成系统优化并用于分类验证.仿真结果表明,二次时频分布特征具备较高稳定性,识别方法具备较强鲁棒性、时效性和适应性;当信噪比为-10dB时,该方法对8类辐射源信号的整体平均识别率达到96.88%. 相似文献
16.
Numerous dimensionality reduction methods have achieved impressive performance in face recognition field due to their potential to exploit the intrinsic structure of images and to enhance the computational efficiency. However, the FR methods based on the existing dimensionality reduction often suffer from small sample size (SSS) problems, where the sample dimensionality is larger than the number of training samples per subject. In recent years, Sparse Representation based Classification (SRC) has been demonstrated to be a powerful framework for robust FR. In this paper, a novel unsupervised dimensionality reduction algorithm, called Singular Value Decomposition Projection (SVDP), is proposed to better fit SRC for handling the SSS problems in FR. In SVDP, a weighted linear transformation matrix is derived from the original data matrix via Singular Value Decomposition. The projection obtained in this way is row-orthonormal and it has some good properties. It makes the solution be robust to small perturbations contained in the data and has better ability to represent various signals. Thus, SVDP could better preserve the discriminant information of the data. Based on SVDP, a novel face recognition method SVDP-SRC is designed to enable SRC to achieve better performance via low-dimensional representation of faces. The experiments carried out with some simulated data show that SVDP achieves higher recovery accuracy than several other dimensionality reduction methods. Moreover, the results obtained on three standard face databases demonstrate that SVDP-SRC is quite effective to handle the SSS problems in terms of recognition accuracy. 相似文献
17.
Collaborative representation-based projection (CRP) is a well-known dimensionality reduction technique, which has been proved to have better performance than sparse representation-based projection (SRP) in the fields of recognition and computer vision. However, classical CRP is sensitive to noises and outliers since its objective function is based on L2-norm, and it will suffer from the curse of dimensionality as it is used for images processing. In this paper, a novel CRP model, named L1-norm two-dimensional collaborative representation-based projection (L1-2DCRP) and an efficient iterative algorithm to solve it are proposed. Different from conventional CRP, the optimal problem in our proposed model is a L1-norm-based maximization and the vector data is extended to matrix date. The proposed algorithm is theoretically proved to be monotonously convergent, and more robust to noises and outliers since L1-norm is used. Experimental results on CMU Multi-PIE, COIL20, FERET and ORL face databases validate the effectiveness of L1-2DCRP compared with several state-of-the-art approaches. 相似文献
18.
为了更高效的处理高维数、高复杂性的非线性数据,发现其嵌入在源数据空间中的本维特征,提出了基于局部光滑逼近思想的流形学习算法,通过局部线性误差逼近最小化,实现将高维数据映射到低维空间.在FREY人脸数据库上进行降维实验,证明了该方法的可行性和有效性. 相似文献
19.
Dictionary learning is one of the most important algorithms for face recognition. However, many dictionary learning algorithms for face recognition have the problems of small sample and weak discriminability. In this paper, a novel discriminative dictionary learning algorithm based on sample diversity and locality of atoms is proposed to solve the problems. The rational sample diversity is implemented by alternative samples and new error model to alleviate the small sample size problem. Moreover, locality can leads to sparsity and strong discriminability. In this paper, to enhance the dictionary discrimination and to reduce the influence of noise, the graph Laplacian matrix of atoms is used to keep the local information of the data. At the same, the relational theory is presented. A large number of experiments prove that the proposed algorithm can achieve more high performance than some state-of-the-art algorithms. 相似文献