基于类别相关近邻子空间的最大似然稀疏表示鲁棒图像识别算法

为了构建一个快速鲁棒的图像识别算法, 提出基于类别相关近邻子空间的最大似然稀疏表示图像识别算法. 考虑到每个测试样本的不同分布特性及训练样本选择的类别代表性原则, 不再将所有训练样本作为稀疏表示的字典, 而是基于距离相近准则选择合适子空间, 从每个类别中选取自适应数量的局部近邻构成新的字典, 在减少训练样本的同时保留了稀疏表示原有的子空间结构. 然后基于最大似然稀疏表示识别方法, 将稀疏表示的保真度表示为余项的最大似然函数, 并将识别问题转化为加权的稀疏优化问题. 在公用人脸与数字识别数据库上的实验证明该算法的合理性, 提高识别速度的同时保证了识别精度和算法的鲁棒性, 特别是对于遮挡与干扰图像具有较好的适应性.     

Face hallucination with imprecise-alignment using iterative sparse representation

Existing face hallucination methods assume that the face images are well-aligned. However, in practice, given a low-resolution face image, it is very difficult to perform precise alignment. As a result, the quality of the super-resolved image is degraded dramatically. In this paper, we propose a near frontal-view face hallucination method which is robust to face image mis-alignment. Based on the discriminative nature of sparse representation, we propose a global face sparse representation model that can reconstruct images with mis-alignment variations. We further propose an iterative method combining the global sparse representation and the local linear regression using the Expectation Maximization (EM) algorithm, in which the face hallucination is converted into a parameter estimation problem with incomplete data. Since the proposed algorithm is independent of the face similarity resulting from precise alignment, the proposed algorithm is robust to mis-alignment. In addition, the proposed iterative manner not only combines the merits of the global and local face hallucination, but also provides a convenient way to integrate different strategies to handle the mis-alignment problem. Experimental results show that the proposed method achieves better performance than existing methods, especially for mis-aligned face images.     

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.     

Face Recognition Algorithm Fusing Monogenic Binary Coding and Collaborative Representation

Monogenic binary coding(MBC) have been known to be effective for local feature extraction, while sparse or collaborative representation based classification(CRC) has shown interesting results in robust face recognition. In this paper, a novel face recognition algorithm of fusing MBC and CRC named M-CRC is proposed; in which the dimensionality problem is resolved by projection matrix. The proposed algorithm is evaluated on benchmark face databases, including AR, Poly U-NIR and CAS-PEAL. The results indicate a significant increase in the performance when compared with state-of-the-art face recognition methods.     

Robust visual tracking via discriminative appearance model based on sparse coding

In this paper, we formulate visual tracking as a binary classification problem using a discriminative appearance model. To enhance the discriminative strength of the classifier in separating the object from the background, an over-complete dictionary containing structure information of both object and background is constructed which is used to encode the local patches inside the object region with sparsity constraint. These local sparse codes are then aggregated for object representation, and a classifier is learned to discriminate the target from the background. The candidate sample with largest classification score is considered as the tracking result. Different from recent sparsity-based tracking approaches that update the dictionary using a holistic template, we introduce a selective update strategy based on local image patches which alleviates the visual drift problem, especially when severe occlusion occurs. Experiments on challenging video sequences demonstrate that the proposed tracking algorithm performs favorably against several state-of-the-art methods.     

融合LBP和局部稀疏表示的人脸表情识别

为更好获取人脸局部表情特征,提出了一种融合局部二值模式（Local Binary Pattern,LBP）和局部稀疏表示的人脸表情特征与识别方法。为深入分析表情对人脸子区域的影响,根据五官特征对人脸进行非均匀分区,并提取局部LBP特征;为精细刻画人脸局部纹理,整合人脸局部特征,设计了人脸局部稀疏重构表示方法,并根据表情对各局部子区域的影响因子,加权融合局部重构残差进行人脸表情识别。在JAFFE2表情人脸库上的对比实验,验证了该方法的可行性和鲁棒性。     

Robust object tracking via multi-scale patch based sparse coding histogram

There are many visual tracking algorithms that are based on sparse representation appearance model. Most of them are modeled by local patches with fixed patch scale, which make trackers less effective when objects undergone appearance changes such as illumination variation, pose change or partial occlusion. To solve the problem, a novel appearance representation model is proposed via multi-scale patch based sparse coding histogram for robust visual tracking. In this paper, the appearance of an object is modeled by different scale patches, which are represented by sparse coding histogram with different scale dictionaries. Then a similarity measure is applied to the calculation of the distance between the sparse coding histograms of target candidate and target template. Finally, the similarity score of the target candidate is passed to a particle filter to estimate the target state sequentially in the tracking process. Additionally, in order to decrease the visual drift caused by partial occlusion, an occlusion handling strategy is adopted, which takes the spatial information of multi-scale patches and occlusion into account. Based on the experimental results on some benchmarks of video sequences, our tracker outperforms state-of-the-art tracking methods.     

基于低秩表示中稀疏误差的可变光照和局部遮挡人脸识别

可变光照和有遮挡人脸识别是人脸识别问题中的一个难点。受到鲁棒主成分分析法(RPCA)和稀疏表示分类法(SRC)的启发,提出一种基于低秩表示(LRR)中稀疏误差图像的可变光照有遮挡人脸识别算法。在训练阶段,利用LRR计算每类人脸低秩数据矩阵,在此基础上求解每类人脸图像低秩映射矩阵,通过各类低秩映射矩阵将未知人脸图像投影得到每类下的低秩数据矩阵和稀疏误差矩阵,为了有效提取稀疏误差图像中的鉴别信息,分别对稀疏误差图像进行边缘检测和平滑度分析,设计了基于两者加权和的类别判据。在Extended Yale B和AR两个数据库上进行了详细的实验分析,实验结果与其它算法相比较有明显提高,证实了所提算法的有效性和鲁棒性。     

Discriminative sparse representation for face recognition

Recently Sparse Representation (or coding) based Classification (SRC) has gained great success in face recognition. In SRC, the testing image is expected to be best represented as a sparse linear combination of training images from the same class, and the representation fidelity is measured by the ?₂-norm or ?₁-norm of the coding residual. However, SRC emphasizes the sparsity too much and overlooks the spatial information during local feature encoding process which has been demonstrated to be critical in real-world face recognition problems. Besides, some work considers the spatial information but overlooks the different discriminative ability in different face regions. In this paper, we propose to weight spatial locations based on their discriminative abilities in sparse coding for robust face recognition. Specifically, we learn the weights at face locations according to the information entropy in each face region, so as to highlight locations in face images that are important for classification. Furthermore, in order to construct a robust weights to fully exploit structure information of each face region, we employed external data to learn the weights, which can cover all possible face image variants of different persons, so the robustness of obtained weights can be guaranteed. Finally, we consider the group structure of training images (i.e. those from the same subject) and added an ?_2,1-norm (group Lasso) constraint upon the formulation, which enforcing the sparsity at the group level. Extensive experiments on three benchmark face datasets demonstrate that our proposed method is much more robust and effective than baseline methods in dealing with face occlusion, corruption, lighting and expression changes, etc.     

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图像分类

提出了一种新的基于多尺度压缩感知(Compressed sensing, CS)金字塔的分类方法, 用于合成孔径雷达(Synthetic aperture radar, SAR)图像的分类. 首先通过原始图像上的小波平滑和特征提取构建多尺度极化干涉特征空间, 然后利用压缩感知提取每一个尺度上图像子块的观测域特征并在数据域重建稀疏特征, 最后组合多尺度的稀疏特征生成最终用于分类的多尺度金字塔表达. 针对稀疏编码和一般金字塔算法的局限性, 提出了基于压缩感知和多尺度金字塔的方法, 利用观测矩阵降低特征维数的优势的同时, 对SAR图像的纹理特征进行不同尺度的分析. 在国内首批极化干涉SAR数据上的实验证明了上述算法的有效性.     

基于带补偿字典的松弛稀疏表示的小样本人脸识别*

在训练集类内变化类型不可控的小样本人脸识别问题中,补偿字典很难发挥足够作用。在基于带补偿字典的稀疏表示的人脸识别方法中,训练集字典和补偿字典对测试图片表示的能力不同,文中讨论因此不同而导致的二者在稀疏性上的不同要求,通过对两类字典采用不同的稀疏性约束,提出基于带补偿字典的松弛稀疏表示的人脸识别方法。实验表明,在训练集图片类内变化类型不可控的小样本人脸识别问题中,文中方法能取得较优效果。     

利用CNN和PCA约束优化模型实现稀疏表示分类

目的 传统的稀疏表示分类方法运用高维数据提升算法的稀疏分类能力,早已引起了广泛关注,但其忽视了测试样本与训练样本间的信息冗余,导致了不确定性的决策分类问题。为此,本文提出一种基于卷积神经网络和PCA约束优化模型的稀疏表示分类方法（EPCNN-SRC）。方法 首先通过深度卷积神经网络计算,在输出层提取对应的特征图像,用以表征原始样本的鲁棒人脸特征。然后在此特征基础上,构建一个PCA（principal component analysis）约束优化模型来线性表示测试样本,计算对应的PCA系数。最后使用稀疏表示分类算法重构测试样本与每类训练样本的PCA系数来完成分类。结果 本文设计的分类模型与一些典型的稀疏分类方法相比,取得了更好的分类性能,在AR、FERET、FRGC和LFW人脸数据库上的实验结果显示,当每类仅有一个训练样本时,EPCNN-SRC算法的识别率分别达到96.92%、96.15%、86.94%和42.44%,均高于传统的表示分类方法,充分验证了本文算法的有效性。同时,本文方法不仅提升了对测试样本稀疏表示的鲁棒性,而且在保证识别率的基础上,有效降低了算法的时间复杂度,在FERET数据库上的运行时间为4.92 s,均低于一些传统方法的运行时间。结论 基于卷积神经网络和PCA约束优化模型的稀疏表示分类方法,将深度学习特征与PCA方法相结合,不仅具有较好的识别准确度,而且对稀疏分类也具有很好的鲁棒性,尤其在小样本问题上优势显著。     

融合局部性和非负性的Laplacian稀疏编码的图像分类*

稀疏编码在编码过程中忽略特征之间的局部关系,使编码不稳定,并且优化问题中的减法运算可能会导致特征之间相互抵消.针对上述2个问题,文中提出融合局部性和非负性的Laplacian稀疏编码的图像分类方法.引入局部特征附近的基约束编码,利用非负矩阵分解将非负性加到Laplacian稀疏编码中,利用空间金字塔划分和最大值融合表示最终的图像,并采用多类线性SVM分类图像.本文方法保留特征之间的局部信息,避免特征之间相互抵消,保留更多的特征,从而改善编码的不稳定性.在4个公共数据集上的实验表明,相比其它现有算法,本文方法分类准确率更高.     

Supervised neighborhood regularized collaborative representation for face recognition

How to represent a test sample is very crucial for linear representation based classification. The famous sparse representation focuses on employing linear combination of small samples to represent the query sample. However, the local structure and label information of data are neglected. Recently, locality-constrained collaborative representation (LCCR) has been proposed and integrates a kind of locality-constrained term into the collaborative representation scheme. For each test sample, LCCR mainly considers its neighbors to deal with noise and LCCR is robust to various corruptions. However, the nearby samples may not belong to the same class. To deal with this situation, in this paper, we not only utilize the positive effect of neighbors, but also consider the side effect of neighbors. A novel supervised neighborhood regularized collaborative representation (SNRCR) is proposed, which employs the local structure of data and the label information of neighbors to improve the discriminative capability of the coding vector. The objective function of SNRCR obtains the global optimal solution. Many experiments are conducted over six face data sets and the results show that SNRCR outperforms other algorithms in most case, especially when the size of training data is relatively small. We also analyze the differences between SNRCR and LCCR.     

基于多任务联合判别稀疏表示的人脸识别

针对人脸识别中由于姿态、光照及噪声等影响造成的识别率不高的问题,提出一种基于多任务联合判别稀疏表示的人脸识别方法。首先提取人脸的局部二值特征,并基于多个特征建立一个联合分类误差与表示误差的过完备字典学习目标函数。然后,使用一种多任务联合判别字典学习方法,将多任务联合判别字典与最优线性分类器参数联合学习,得到具有良好表征和鉴别能力的字典及相应的分类器,进而提高人脸识别效果。实验结果表明,所提方法相比其他稀疏人脸识别方法具有更好的识别性能。     

基于分类稀疏表示的人脸表情识别

为挖掘不同人脸表情图像的统计特性差异,提出一种基于分类稀疏表示的表情识别算法。首先通过对不同类别表情图像的字典学习,构建满足各类表情图像统计特性的基函数子集,进而采用Lasso算法获得表情图像在由基函数集所张成特征子空间中的稀疏表示,最后通过比较表情图像在各基函数子集上的重构误差实现不同表情的分类识别。基于JAFFE人脸表情数据库的实验结果表明,该算法可以有效克服人脸身份对表情识别的影响,具有较高的表情识别率和鲁棒性。     

基于多尺度稀疏表示的场景分类

提出一种基于多尺度稀疏表示的场景分类框架。首先从图像中提取多个尺度的局部特征,然后利用稀疏编码为每个尺度的特征单独学习相应的过完备字典;在图像表示阶段,为图像各尺度上的局部特征依据与其对应尺度的字典进行编码,并按照空间金字塔表示方法和特征各维最大汇总(max pooling)对各尺度上的特征编码分别汇总;最后将不同尺度上汇总的特征串接,形成对图像最终描述的全局向量。在三个常用标准场景库上的分类结果表明,提出的算法由于利用了不同尺度特征间的互补关系,与采用单尺度特征的方法相比,性能有了显著提升。