共查询到19条相似文献,搜索用时 234 毫秒
1.
针对现有的人脸识别算法由于光照、表情、姿态、面部遮挡等变化而严重影响识别性能的问题,提出了基于字典学习优化判别性降维的鲁棒人脸识别算法。首先,利用经典的特征提取算法PCA初始化降维投影矩阵;然后,计算字典和系数,通过联合降维与字典学习使得投影矩阵和字典更好地相互拟合;最后,利用迭代算法输出字典和投影矩阵,并利用经l2-范数正则化的分类器完成人脸的识别。在扩展YaleB、AR及一个户外人脸数据库上的实验验证了本文算法的有效性及鲁棒性,实验结果表明,相比几种线性表示算法,本文算法在处理鲁棒人脸识别时取得了更高的识别率。 相似文献
2.
针对训练样本字典学习仅包含全局信息、缺乏局部信息的不足,引入与类别相关的原子字典, 提出基于原子与分子字典联合扩展的加权稀疏表示人脸识别方法。首先,对各类训练样本进行PCA学习,得到带标记的训练样本基,构造PCA基原子字典,同时将训练样本字典作为分子字典。进而,利用原子字典与分子字典结合得到扩展字典模型。测试时,根据测试样本与扩展字典基之间的距离进行加权得到与当前测试样本关联的重构字典集,最后对测试样本稀疏重构,利用残差进行分类判别。为验证本文方法有效性,分别在AR、Georgia Tech和CMU PIE人脸数据库上进行实验。 相似文献
3.
4.
为了提高基于流形学习理论人脸识别算法的识别率,采用一种将非线性降维与Fisher线性判别相结合的方法。首先利用邻域嵌入算法,将人脸图像测试和训练集的维数降低到合适维度,然后使用Fisher线性判别进行人脸数据集特征的提取,最后将测试集人脸图像特征和训练集人脸图像特征,使用最近邻分类器进行分类。在公开的Olivettifaces和ORL人脸图像数据库上,分别将该算法与几种经典基于流形学习理论的人脸识别算法进行了对比实验,实验结果表明当近邻数比较大时本算法识别率是最高的。 相似文献
5.
6.
本文提出了一种基于判别子字典学习算法的图像分类优化方法.在判别字典学习算法的基础上,引入字典矩阵的正则化约束项,针对每一类图像学习其对应的特定字典,使字典中包含该类别的特定原子,规避不同子字典之间原子的相关性.同时,引入标签信息矩阵和拉普拉斯正则化矩阵,使大系数集中在某一类别的特定原子上,属于同一类别的样本彼此靠近,从而提高字典的判别能力.将该算法应用在3种不同的数据集上,实验结果证明了所提方法的有效性. 相似文献
7.
针对遥感图像信息提取过程中,因训练样本过大而导致提取结果不精准的问题,提出了基于人工智能的无人机测绘遥感图像信息提取方法。根据每一张图像数据的归一化指数构建图像信息提取模型;采用人工智能的机器学习卷积过程对图像信息进行降维处理;融合图像特征,获取概率特征图,构建目标相对优属度矩阵,共享卷积过程中的权值,实时更新机器学习的判别参数。使机器学习过程与判别过程平衡,将卷积得到的特征图连接起来作为判别依据,判别图像真假,由此提取图像真实信息。引入一个模型复杂性惩罚项,控制训练样本数量,实现无人机测绘遥感图像信息提取。实验结果表明,所提方法提取精度最高为0.93,损失程度最高为0.22,该方法信息提取精准度较高。 相似文献
8.
9.
针对人脸识别中的特征提取问题,提出一种新的基于Gabor的特征提取算法,利用Gabor小波变换良好的提取区分能力和LDA所具有的判别性优势来进行特征提取。首先利用Gabor小波变换来提取人脸特征。然后对得到的高维特征采用PCA进行初次降维,再利用LDA实现再次降维,得到最终的特征向量。在ORL和YALE人脸库上的实验验证了该算法的有效性。 相似文献
10.
11.
The current study puts forward a supervised within-class-similar discriminative dictionary learning (SCDDL) algorithm for face recognition. Some popular discriminative dictionary learning schemes for recognition tasks always incorporate the linear classification error term into the objective function or make some discriminative restrictions on representation coefficients. In the presented SCDDL algorithm, we propose to directly restrict the representation coefficients to be similar within the same class and simultaneously include the linear classification error term in the supervised dictionary learning scheme to derive a more discriminative dictionary for face recognition. The experimental results on three large well-known face databases suggest that our approach can enhance the fisher ratio of representation coefficients when compared with several dictionary learning algorithms that incorporate linear classifiers. In addition, the learned discriminative dictionary, the large fisher ratio of representation coefficients and the simultaneously learned classifier can improve the recognition rate compared with some state-of-the-art dictionary learning algorithms. 相似文献
12.
针对辐射源识别中的特征稳定性不高和低信噪比环境适应性不足等问题,提出了一种基于二次时频分布、核协同表示与鉴别投影的识别方法.首先,通过时频变换、稀疏域降噪和二次特征提取的预处理算法降低噪声干扰和特征冗余,以获取高稳定性的二次时频分布特征;然后,采用核协同表示和鉴别投影思想进行降维学习和字典学习,以提升数据低维表征和类间鉴别能力;最后,通过离线训练完成系统优化并用于分类验证.仿真结果表明,二次时频分布特征具备较高稳定性,识别方法具备较强鲁棒性、时效性和适应性;当信噪比为-10dB时,该方法对8类辐射源信号的整体平均识别率达到96.88%. 相似文献
13.
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. 相似文献
14.
In this paper, a new sparsity formulation called position-dictionary based sparse representation is developed for frontal face recognition. Different from the sparse representation based classification (SRC) method and the Gabor-feature based SRC (GSRC) method which both employ a global dictionary to decompose image patches, the proposed method constructs a position-dictionary for each location using training patches in the corresponding location since they resemble each other and are more likely to favor the same atoms. Sparse coefficients of each position-patch can be obtained by solving an \(l_{1}\) -norm minimization problem. For each face image, sparse coefficients of position-patches are pooled to construct a discriminative upper level feature to represent face image. PCA is used to perform dimension reduction. Each testing sample is represented as a sparse linear combination of all training samples, and recognition is accomplished by evaluating which class of training samples leads to the minimum reconstruction error. We compared the proposed method with SRC and GSRC method on three benchmark face databases. Experimental results show that the proposed method achieves higher recognition rates and is robust to a certain degree of occlusions. 相似文献
15.
16.
《Journal of Visual Communication and Image Representation》2014,25(5):763-773
This paper proposes a discriminative low-rank representation (DLRR) method for face recognition in which both the training and test samples are corrupted owing to variations in occlusion and disguise. The proposed method extends the sparse representation-based classification algorithm by incorporating the low-rank structure of data representation. The DLRR algorithm recovers a clean dictionary with enhanced discrimination ability from the corrupted training samples for sparse representation. Simultaneously, it learns a low-rank projection matrix to correct corrupted test samples by projecting them onto their corresponding underlying subspaces. The dictionary elements from different classes are encouraged to be as independent as possible by regularizing the structural incoherence of the original training samples. This leads to a compact representation of a corrected test sample by a linear combination of more dictionary elements from the corrected class. The experimental results on benchmark databases show the effectiveness and robustness of our face recognition technique. 相似文献
17.
本文提出了一种快速低秩的判别子字典学习算法。在训练阶段,构造一个子字典的低秩约束项和拉普拉斯矩阵正则化项,加入判别字典学习的目标函数中。将原始样本映射到一个新的空间中,使同一类别的相邻点彼此靠近,同时增强子字典对同类样本的重构能力,针对每类样本的判别性特征,学习出相应的学习字典。在测试阶段,利用k NN分类器估计测试样本的类别标签。同时,将算法应用在3种数据集上,与其他的字典学习算法进行比较,取得了较好的分类结果。 相似文献
18.
特征子空间学习是图像识别及分类任务的关键技术之一,传统的特征子空间学习模型面临两个主要的问题。一方面是如何使样本在投影到特征空间后有效地保持其局部结构和判别性。另一方面是当样本含噪时传统学习模型所发生的失效问题。针对上述两个问题,该文提出一种基于低秩表示(LRR)的判别特征子空间学习模型,该模型的主要贡献包括:通过低秩表示探究样本的局部结构,并利用表示系数作为样本在投影空间的相似性约束,使投影子空间能够更好地保持样本的局部近邻关系;为提高模型的抗噪能力,构造了一种利用低秩重构样本的判别特征学习约束项,同时增强模型的判别性和鲁棒性;设计了一种基于交替优化技术的迭代数值求解方案来保证算法的收敛性。该文在多个视觉数据集上进行分类任务的对比实验,实验结果表明所提算法在分类准确度和鲁棒性方面均优于传统特征学习方法。 相似文献
19.
Multilinear discriminant analysis for face recognition. 总被引:2,自引:0,他引:2
Shuicheng Yan Dong Xu Qiang Yang Lei Zhang Xiaoou Tang Hong-Jiang Zhang 《IEEE transactions on image processing》2007,16(1):212-220
There is a growing interest in subspace learning techniques for face recognition; however, the excessive dimension of the data space often brings the algorithms into the curse of dimensionality dilemma. In this paper, we present a novel approach to solve the supervised dimensionality reduction problem by encoding an image object as a general tensor of second or even higher order. First, we propose a discriminant tensor criterion, whereby multiple interrelated lower dimensional discriminative subspaces are derived for feature extraction. Then, a novel approach, called k-mode optimization, is presented to iteratively learn these subspaces by unfolding the tensor along different tensor directions. We call this algorithm multilinear discriminant analysis (MDA), which has the following characteristics: 1) multiple interrelated subspaces can collaborate to discriminate different classes, 2) for classification problems involving higher order tensors, the MDA algorithm can avoid the curse of dimensionality dilemma and alleviate the small sample size problem, and 3) the computational cost in the learning stage is reduced to a large extent owing to the reduced data dimensions in k-mode optimization. We provide extensive experiments on ORL, CMU PIE, and FERET databases by encoding face images as second- or third-order tensors to demonstrate that the proposed MDA algorithm based on higher order tensors has the potential to outperform the traditional vector-based subspace learning algorithms, especially in the cases with small sample sizes. 相似文献