基于字典学习的核稀疏表示人脸识别方法

受Metafaces方法的启发,提出一种基于字典学习方法的核稀疏表示方法并成功应用于人脸识别。首先,采用核技术将稀疏表示方法推广到高维空间得到核稀疏表示方法。其次,借鉴Metaface字典学习方法,进行字典学习得到一组核基向量构成核稀疏表示字典。最后,利用学习得到的核字典基重构样本,并根据样本与重构样本之间的残差最小原则对人脸图像进行分类。在AR、ORL和Yale人脸数据库上的实验表明该方法的良好识别性能。     

基于核字典学习的图像分类

航拍图像往往具有场景复杂、数据维度大的特点,对于该类图像的自动分类一直是研究的热点。针对航拍原始数据特征维度过高和数据线性不可分的问题,在字典学习和稀疏表示的基础上提出了一种结合核字典学习和线性鉴别分析的目标识别方法。首先学习核字典并通过核字典获取目标样本的稀疏表示,挖掘数据的内部结构;其次采用线性鉴别分析,加强稀疏表示的可分性;最后利用支持向量机对目标进行分类。实验结果表明,与传统基于子空间特征提取的算法和基于字典学习的算法相比,基于核字典学习与鉴别分析的算法分类性能优越。     

基于稀疏表示全局字典学习的图像分类方法

针对传统的稀疏表示字典学习图像分类方法在大规模分布式环境下效率低下的问题,设计一种基于稀疏表示全局字典的图像学习方法。将传统的字典学习步骤分布到并行节点上,使用凸优化方法在节点上学习局部字典并实时更新全局字典,从而提高字典学习效率和大规模数据的分类效率。最后在MapReduce平台上进行并行化实验,结果显示该方法在不影响分类精度的情况下对大规模分布式数据的分类有明显的加速,可以更高效地运用于各种大规模图像分类任务中。     

基于特征优选和字典优化的组稀疏表示表情识别

针对在小样本人脸表情数据库上识别模型过拟合问题,文中提出基于特征优选和字典优化的组稀疏表示分类方法.首先提出特征优选准则,选择相同类级稀疏模式、不同类内稀疏模式的互补特征构建字典.然后对字典进行最大散度差优化学习,使字典在不失真重构特征的同时具有较高鉴别能力.最后联合优化后的字典进行组稀疏表示分类.在JAFFE、CK+...     

面向乳腺病理图像分类的非相干字典学习及稀疏表示算法

针对乳腺病理图像分类,提出一种非相干字典学习及其稀疏表示算法.首先针对不同类别的图像,基于在线字典学习算法分别学习各类特定的子字典;其次利用紧框架建立一种非相干字典学习模型,通过交替投影优化字典的相干性、秩与紧框架性,从而有效地约束字典的格拉姆矩阵与参考格拉姆矩阵的距离,获得判别性更强的非相干字典;最后采用子空间旋转方法优化非相干字典的稀疏表示性能.利用乳腺癌数据集BreaKHis进行实验的结果证明,该算法所学习的非相干字典能平衡字典的判别性与稀疏表示性能,在良性肿瘤与恶性肿瘤图像分类上获得了86.0%的分类精度;在良性肿瘤图像中的腺病与纤维腺瘤的分类上获得92.5%的分类精度.     

基于字典优化的稀疏表示的视频镜头分类

为了克服稀疏表示中冗余字典分类效果不佳的问题,提出了基于字典优化的稀疏表示算法。该算法制定了新的基于稀疏表示的分类判别规则,采用了基于冗余字典内基元类内平均欧式距离最小以及类间平均欧式距离最大的字典优化方法,形成优化字典进行特征稀疏表示。将该算法应用于视频镜头的稀疏表示特征提取与分类,实验结果表明该方法优化后的字典进行视频镜头的特征提取和分类,其识别率得到了明显的提高。     

核可鉴别的特征分块稀疏表示的视频语义分析

针对视频特征的多样性和稀疏字典的冗余特点,提出一种基于核可鉴别的特征分块稀疏表示的视频语义分析方法.首先按照实际需求提取视频段多种特征,并根据各种特征的维数大小分别建立其分块稀疏字典,对每个分块字典在K-SVD算法基础上加入核可鉴别准则进行优化,使各种特征的稀疏表示特征具有更好的类别鉴别能力;在对视频段进行语义分析时,使用优化字典求解各种特征的稀疏表示特征,并对各种特征的稀疏表示特征采用加权KNN算法进行类别分类分析,最后依据各种特征对决策分析的支持度进行视频段的语义融合分析.实验结果表明,该方法有效地提高了视频语义分析的准确性和分析速度.     

高光谱图像分类的融合分层深度网络联合稀疏表示算法

在高光谱图像分类领域中每个像素的局部邻域一旦包含来自不同类别的样本,联合稀疏表示将受邻域内字典原子与测试样本之间同谱异类的影响,严重降低分类性能.根据高光谱图像的特点,文中提出融合分层深度网络的联合稀疏表示算法.在光谱和空间特征学习之间交替提取判别性光谱信息和空间信息,构建兼具空谱特征的学习字典,用于联合稀疏表示.在分类过程中将学习字典与测试样本间的相关系数与分类误差融合并决策.在两个高光谱遥感数据集上的实验验证文中算法的有效性.     

基于截断核范数低秩分解的自适应字典学习算法

针对过完备字典直接对图像进行稀疏表示不能很好地剔除高频噪声的影响,压缩感知后图像重构质量不高的问题,提出了基于截断核范数低秩分解的自适应字典学习算法。该算法首先利用截断核范数正则化低秩分解模型对图像矩阵低秩分解得到低秩部分和稀疏部分,其中低秩部分保留了图像的主要信息,稀疏部分主要包含高频噪声及部分物体轮廓信息;然后对图像低秩部分进行分块,依据图像块纹理复杂度对图像块进行分类;最后使用K奇异值分解（K-single value decomposition, K-SVD）字典学习算法,针对不同类别训练出多个不同大小的过完备字典。仿真结果表明,本文所提算法能够对图像进行较好的稀疏表示,并在很好地保持图像块特征一致性的同时显著提升图像重构质量。     

字典学习模型、算法及其应用研究进展

稀疏表示模型常利用训练样本学习过完备字典, 旨在获得信号的冗余稀疏表示. 设计简单、高效、通用性强的字典学习算法是目前的主要研究方向之一, 也是信息领域的研究热点. 基于综合稀疏模型的字典学习方法已经广泛应用于图像分类、图像去噪、图像超分辨率和压缩成像等领域. 近些年来, 解析稀疏模型、盲字典模型和信息复杂度模型等新模型的出现丰富了字典学习理论, 使得更广泛类型的信号能够被简单性描述. 本文详细介绍了综合字典、解析字典、盲字典和基于信息复杂度字典学习的基本模型及其算法, 阐述了字典学习的典型应用, 指出了字典学习的进一步研究方向.     

Deep locality-sensitive discriminative dictionary learning for semantic video analysis

Video semantic analysis (VSA) has received significant attention in the area of Machine Learning for some time now, particularly video surveillance applications with sparse representation and dictionary learning. Studies have shown that the duo has significantly impacted on the classification performance of video detection analysis. In VSA, the locality structure of video semantic data containing more discriminative information is very essential for classification. However, there has been modest feat by the current SR-based approaches to fully utilize the discriminative information for high performance. Furthermore, similar coding outcomes are missing from current video features with the same video category. To handle these issues, we first propose an improved deep learning algorithm—locality deep convolutional neural network algorithm (LDCNN) to better extract salient features and obtain local information from semantic video. Second, we propose a novel DL method, called deep locality-sensitive discriminative dictionary learning (DLSDDL) for VSA. In the proposed DLSDDL, a discriminant loss function for the video category based on sparse coding of sparse coefficients is introduced into the structure of the locality-sensitive dictionary learning (LSDL) method. After solving the optimized dictionary, the sparse coefficients for the testing video feature samples are obtained, and then the classification result for video semantic is realized by reducing the error existing between the original and recreated samples. The experiment results show that the proposed DLSDDL technique considerably increases the efficiency of video semantic detection as against competing methods used in our experiment.     

Collaborative representation analysis methods for feature extraction

Recently, sparse representation (SR) theory gets much success in the fields of pattern recognition and machine learning. Many researchers use SR to design classification methods and dictionary learning via reconstruction residual. It was shown that collaborative representation (CR) is the key part in sparse representation-based classification (SRC) and collaborative representation-based classification (CRC). Both SRC and CRC are good classification methods. Here, we give a collaborative representation analysis (CRA) method for feature extraction. Not like SRC-/CRC-based methods (e.g., SPP and CRP), CRA could directly extract the features like PCA and LDA. Further, a Kernel CRA (KCRA) is developed via kernel tricks. The experimental results on FERET and AR face databases show that CRA and KCRA are two effective feature extraction methods and could get good performance.

     

Robust sparse representation based face recognition in an adaptive weighted spatial pyramid structure

The sparse representation based classification methods has achieved significant performance in recent years. To fully exploit both the holistic and locality information of face samples, a series of sparse representation based methods in spatial pyramid structure have been proposed. However, there are still some limitations for these sparse representation methods in spatial pyramid structure. Firstly, all the spatial patches in these methods are directly aggregated with same weights, ignoring the differences of patches’ reliability. Secondly, all these methods are not quite robust to poses, expression and misalignment variations, especially in under-sampled cases. In this paper, a novel method named robust sparse representation based classification in an adaptive weighted spatial pyramid structure (RSRC-ASP) is proposed. RSRC-ASP builds a spatial pyramid structure for sparse representation based classification with a self-adaptive weighting strategy for residuals’ aggregation. In addition, three strategies, local-neighbourhood representation, local intra-class Bayesian residual criterion, and local auxiliary dictionary, are exploited to enhance the robustness of RSRC-ASP. Experiments on various data sets show that RSRC-ASP outperforms the classical sparse representation based classification methods especially for under-sampled face recognition problems.     

Sparse Representation Based Fisher Discrimination Dictionary Learning for Image Classification

The employed dictionary plays an important role in sparse representation or sparse coding based image reconstruction and classification, while learning dictionaries from the training data has led to state-of-the-art results in image classification tasks. However, many dictionary learning models exploit only the discriminative information in either the representation coefficients or the representation residual, which limits their performance. In this paper we present a novel dictionary learning method based on the Fisher discrimination criterion. A structured dictionary, whose atoms have correspondences to the subject class labels, is learned, with which not only the representation residual can be used to distinguish different classes, but also the representation coefficients have small within-class scatter and big between-class scatter. The classification scheme associated with the proposed Fisher discrimination dictionary learning (FDDL) model is consequently presented by exploiting the discriminative information in both the representation residual and the representation coefficients. The proposed FDDL model is extensively evaluated on various image datasets, and it shows superior performance to many state-of-the-art dictionary learning methods in a variety of classification tasks.     

Robust face recognition via occlusion dictionary learning

Sparse representation based classification (SRC) has recently been proposed for robust face recognition. To deal with occlusion, SRC introduces an identity matrix as an occlusion dictionary on the assumption that the occlusion has sparse representation in this dictionary. However, the results show that SRC's use of this occlusion dictionary is not nearly as robust to large occlusion as it is to random pixel corruption. In addition, the identity matrix renders the expanded dictionary large, which results in expensive computation. In this paper, we present a novel method, namely structured sparse representation based classification (SSRC), for face recognition with occlusion. A novel structured dictionary learning method is proposed to learn an occlusion dictionary from the data instead of an identity matrix. Specifically, a mutual incoherence of dictionaries regularization term is incorporated into the dictionary learning objective function which encourages the occlusion dictionary to be as independent as possible of the training sample dictionary. So that the occlusion can then be sparsely represented by the linear combination of the atoms from the learned occlusion dictionary and effectively separated from the occluded face image. The classification can thus be efficiently carried out on the recovered non-occluded face images and the size of the expanded dictionary is also much smaller than that used in SRC. The extensive experiments demonstrate that the proposed method achieves better results than the existing sparse representation based face recognition methods, especially in dealing with large region contiguous occlusion and severe illumination variation, while the computational cost is much lower.     

Laplacian sparse dictionary learning for image classification based on sparse representation

Sparse representation is a mathematical model for data representation that has proved to be a powerful tool for solving problems in various fields such as pattern recognition, machine learning, and computer vision. As one of the building blocks of the sparse representation method, dictionary learning plays an important role in the minimization of the reconstruction error between the original signal and its sparse representation in the space of the learned dictionary. Although using training samples directly as dictionary bases can achieve good performance, the main drawback of this method is that it may result in a very large and inefficient dictionary due to noisy training instances. To obtain a smaller and more representative dictionary, in this paper, we propose an approach called Laplacian sparse dictionary (LSD) learning. Our method is based on manifold learning and double sparsity. We incorporate the Laplacian weighted graph in the sparse representation model and impose the l₁-norm sparsity on the dictionary. An LSD is a sparse overcomplete dictionary that can preserve the intrinsic structure of the data and learn a smaller dictionary for each class. The learned LSD can be easily integrated into a classification framework based on sparse representation. We compare the proposed method with other methods using three benchmark-controlled face image databases, Extended Yale B, ORL, and AR, and one uncontrolled person image dataset, i-LIDS-MA. Results show the advantages of the proposed LSD algorithm over state-of-the-art sparse representation based classification methods.     

Sparse neighbor representation for classification

Recent research of sparse signal representation has aimed at learning discriminative sparse models instead of purely reconstructive ones for classification tasks, such as sparse representation based classification (SRC) which obtains state-of-the-art results in face recognition. In this paper, a new method is proposed in that direction. With the assumption of locally linear embedding, the proposed method achieves the classification goal via sparse neighbor representation, combining the reconstruction property, sparsity and discrimination power. The experiments on several data sets are performed and results show that the proposed method is acceptable for nonlinear data sets. Further, it is argued that the proposed method is well suited for the classification of low dimensional data dimensionally reduced by dimensionality reduction methods, especially the methods obtaining the low dimensional and neighborhood preserving embeddings, and it costs less time.     

自适应超完备字典学习的SAR图像降噪

提出一种基于自适应超完备字典学习的SAR图像降噪。该算法建立在超完备字典稀疏表示基础上,具有较强的数据稀疏性和稳健的建模假设。算法依据相干斑噪声统计特性,通过分步优化字典原子和变换系数自适应构造超完备字典,利用获得的超完备字典将图像局部信息投影到高维空间中,实现图像的稀疏表示,运用正则化方法建立多目标优化模型。最后通过对优化问题的求解重建SAR图像场景分辨单元的平均强度,实现SAR图像的降噪。实验结果表明,该算法对相干斑噪声有很好的抑制效果,并且具有保持图像细节信息的优点。