Kernel sparse representation based classification

Sparse representation has attracted great attention in the past few years. Sparse representation based classification (SRC) algorithm was developed and successfully used for classification. In this paper, a kernel sparse representation based classification (KSRC) algorithm is proposed. Samples are mapped into a high dimensional feature space first and then SRC is performed in this new feature space by utilizing kernel trick. Since samples in the high dimensional feature space are unknown, we cannot perform KSRC directly. In order to overcome this difficulty, we give the method to solve the problem of sparse representation in the high dimensional feature space. If an appropriate kernel is selected, in the high dimensional feature space, a test sample is probably represented as the linear combination of training samples of the same class more accurately. Therefore, KSRC has more powerful classification ability than SRC. Experiments of face recognition, palmprint recognition and finger-knuckle-print recognition demonstrate the effectiveness of KSRC.     

基于局部保持的核稀疏表示字典学习

为了利用核技巧提高分类性能, 在局部保持的稀疏表示 字典学习的基础上, 提出了两种核化的稀疏表示字典学习方法. 首先, 原始训练数据被投影到高维核空间, 进行基于局部保持的核稀疏表示字典学习; 其次, 在稀疏系数上强加核局部保持约束, 进行基于核局部保持的核稀疏表示字典学习. 实验结果表明, 该方法的分类识别结果优于其他方法.     

基于K-PSO稀疏表示的故障分类方法研究

针对现代复杂生产过程中不能准确识别、分类多种故障的问题,提出一种改进的稀疏表示故障分类方法。该方法依据信号的稀疏表示来判断故障所属类别。其具体实现过程首先是利用K-均值奇异值分解(K-SVD)算法构造过完备字典,使其包含原信息的主要特征,再通过粒子群(PSO)算法有效地搜索并寻找稀疏分解中产生的在过完备字典范围中的最匹配原子,最后利用以该匹配原子为基础的稀疏表示结果实现对多故障问题的分类识别。运用数值仿真验证了该算法的可行性和有效性。同时,针对柴油机燃油系统的故障分类,将该方法与基于BP神经网络和SVM的分类识别方法进行比较,实验表明该算法在故障分类上具有更好的效果。     

特征加权组稀疏判别投影分析算法

近来, 稀疏表示分类算法已经在模式识别和特征提取领域获得了广泛的关注. 受最近提出的稀疏表示判别投影算法启发, 本文提出了一种新的特征加权组稀疏判别投影算法(Feature weighted group sparse classification steered discriminative projection, FWGSDP). 首先, 提出特征加权组稀疏分类算法(Feature weighted group sparsebased classification, FWGSC)进行稀疏系数编码, 该算法采用带特征加权约束的保局性信息, 能够鲁棒地重构给定的输入数据; 其次, 通过类内重构散度最小、类间重构散度最大为目标计算最优投影判别矩阵, 使得输入数据具有最佳的模式分类效果; 最后, 提出迭代重约束稀疏编码方法并结合特征分解操作进行FWGSDP模型高效求解. 在ExYaleB, PIE和AR三个人脸数据库的实验验证了所提算法在普通数据和带噪数据中的分类效果都优于现存的算法.     

非共享多测量向量的稀疏表示分类模型

多测量向量的联合稀疏重构要求多个源信号共享相同的稀疏结构,但实际应用中较难得到具有完全相同的稀疏结构的测量信号。为了降低非共享稀疏结构对MMV模型联合稀疏重构的影响,文中提出了一种改进贪婪类联合稀疏重构算法的方法。该方法在每次迭代时并不要求各测量向量选择相同的表示原子,而是要求选择同一类的表示原子。改进后的算法可用于非共享多测量向量的稀疏表示分类。基于模拟数据和标准人脸库数据的实验结果表明,改进后的模型可有效提高稀疏表示的分类性能。     

基于低秩稀疏分解与协作表示的图像分类算法

目前,大部分图像分类算法为了获取较高的性能均需要充分的训练学习过程,然而在实际应用中,往往存在训练样本不足及过拟合等问题。为了避免上述问题出现,在朴素贝叶斯最近邻分类算法的原理框架下,基于非负稀疏编码、低秩稀疏分解以及协作表示提出一种非参数学习的图像分类算法。首先,基于非负稀疏编码和最大值汇聚操作表示图像信息,并构建具有低秩性质的同类训练图像集的局部特征矩阵;其次,采用低秩稀疏分解结合别类标签信息构建两类视觉词典以充分利用同类图像的相关性和差异性;最后基于协作表示表征测试图像并进行分类决策,实验结果验证了所提算法的有效性。     

Sparse representation with multi-manifold analysis for texture classification from few training images

Texture classification is one of the most important tasks in computer vision field and it has been extensively investigated in the last several decades. Previous texture classification methods mainly used the template matching based methods such as Support Vector Machine and k-Nearest-Neighbour for classification. Given enough training images the state-of-the-art texture classification methods could achieve very high classification accuracies on some benchmark databases. However, when the number of training images is limited, which usually happens in real-world applications because of the high cost of obtaining labelled data, the classification accuracies of those state-of-the-art methods would deteriorate due to the overfitting effect. In this paper we aim to develop a novel framework that could correctly classify textural images with only a small number of training images. By taking into account the repetition and sparsity property of textures we propose a sparse representation based multi-manifold analysis framework for texture classification from few training images. A set of new training samples are generated from each training image by a scale and spatial pyramid, and then the training samples belonging to each class are modelled by a manifold based on sparse representation. We learn a dictionary of sparse representation and a projection matrix for each class and classify the test images based on the projected reconstruction errors. The framework provides a more compact model than the template matching based texture classification methods, and mitigates the overfitting effect. Experimental results show that the proposed method could achieve reasonably high generalization capability even with as few as 3 training images, and significantly outperforms the state-of-the-art texture classification approaches on three benchmark datasets.     

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.     

基于自适应权重的多重稀疏表示分类算法

提出了一种基于多特征字典的稀疏表示算法。该算法针对SRC的单特征鉴别性较弱这一不足,对样本提出多个不同特征并分别进行相应的稀疏表示。并根据SRC算法计算各个特征的鉴别性,自适应地学习出稀疏权重并进行线性加权,从而提高分类的性能。实验表明,基于自适应权重的多重稀疏表示分类算法,具有更好的分类效果。     

Subsampled terahertz data reconstruction based on spatio-temporal dictionary learning

In this paper, the problem of terahertz pulsed imaging and reconstruction is addressed. It is assumed that an incomplete (subsampled) three dimensional THz data set has been acquired and the aim is to recover all missing samples. A sparsity-inducing approach is proposed for this purpose. First, a simple interpolation is applied to incomplete noisy data. Then, we propose a spatio-temporal dictionary learning method to obtain an appropriate sparse representation of data based on a joint sparse recovery algorithm. Then, using the sparse coefficients and the learned dictionary, the 3D data is effectively denoised by minimizing a simple cost function. We consider two types of terahertz data to evaluate the performance of the proposed approach: THz data acquired for a model sample with clear layered structures (e.g., a T-shape plastic sheet buried in a polythene pellet), and pharmaceutical tablet data (with low spatial resolution). The achieved signal-to-noise-ratio for reconstruction of T-shape data, from only 5% observation was 19 dB. Moreover, the accuracies of obtained thickness and depth measurements for pharmaceutical tablet data after reconstruction from 10% observation were 98.8%, and 99.9%, respectively. These results, along with chemical mapping analysis, presented at the end of this paper, confirm the accuracy of the proposed method.     

基于分水岭分割和稀疏表示的高光谱图像分类方法

近年来,高光谱图像的分类受到了广泛的关注。许多机器学习的方法都在高光谱图像上得到了应用,如SVM、神经网络、决策树等。但光谱图像可能存在“同物异谱”和“同谱异物”的情况,这给高光谱图像的精确分类带来了一定挑战。针对该问题,提出了利用分水岭分割得到的空间信息与稀疏表示来得到更精确的分类结果。首先利用分水岭得到图像区域信息,然后以区域为单位,对每个区域的样本进行分类。在两幅图像上对该方法的有效性进行了验证,结果表明该方法优于其它一些同类方法。     

面向视频语义分析的局部敏感的可鉴别稀疏表示

视频语义分析已经成为人们研究的热点。在传统稀疏表示方法中,相似视频特征未必能产生相近稀疏表示结果。在基于稀疏表示的视频语义分析中,假定相似的视频数据样本的稀疏表示也相似,即两个相似视频特征的稀疏系数之间的距离较小。为了提高视频语义分析的准确性,基于该假设提出一种面向视频语义分析的局部敏感的可鉴别稀疏表示方法。该方法在局部敏感稀疏表示中引入基于稀疏系数的鉴别损失函数,优化构建稀疏表示的字典,使稀疏表示特征满足类内离散度小、类间离散度大的Fisher准则,并建立可鉴别稀疏模型。为验证所提方法的有效性,在相关视频数据库中将其与多种算法进行对比,实验结果表明,该方法显著地提高了视频特征稀疏表示的鉴别性,有效地提高了视频语义分析的准确性。     

Adaptive sparse graph learning based dimensionality reduction for classification

To preserve the sparsity structure in dimensionality reduction, sparsity preserving projection (SPP) is widely used in many fields of classification, which has the advantages of noise robustness and data adaptivity compared with other graph based method. However, the sparsity parameter of SPP is fixed for all samples without any adjustment. In this paper, an improved SPP method is proposed, which has an adaptive parameter adjustment strategy during sparse graph construction. With this adjustment strategy, the sparsity parameter of each sample is adjusted adaptively according to the relationship of those samples with nonzero sparse representation coefficients, by which the discriminant information of graph is enhanced. With the same expectation, similarity information both in original space and projection space is applied for sparse representation as guidance information. Besides, a new measurement is introduced to control the influence of each sample’s local structure on projection learning, by which more correct discriminant information should be preserved in the projection space. With the contributions of above strategies, the low-dimensional space with high discriminant ability is found, which is more beneficial for classification. Experimental results on three datasets demonstrate that the proposed approach can achieve better classification performance over some available state-of-the-art approaches.     

整合原始人脸图像和其虚拟样本的人脸分类算法

人脸识别作为最具吸引力的生物识别技术之一,由于会受到不同的照明条件、面部表情、姿态和环境的影响,仍然是一个具有挑战性的任务.众所周知,一幅人脸图像是对人脸的一次采样,它不应该被看作是脸部的绝对精确表示.然而在实际应用中很难获得足够多的人脸样本.随着稀疏表示方法在图像重建问题中的成功应用,研究人员提出了一种特殊的分类方法,即基于稀疏表示的分类方法.受此启发,提出了在稀疏表示框架下的整合原始人脸图像和虚拟样本的人脸分类算法.首先,通过合成虚拟训练样本来减少面部表示的不确定性.然后,在原始训练样本和虚拟样本组成的混合样本中通过计算来消除对分类影响较小的类别和单个样本,在系数分解的过程中采用最小误差正交匹配追踪(Error-Constrained Orthogonal Matching Pursuit,OMP)方法,进而选出贡献程度大的类别样本并进行分类.实验结果表明,提出的方法不仅能获得较高的人脸识别的精度,而且还具有更低的计算复杂性.     

基于稀疏表示的低分辨率人脸疲劳表情识别

为了有效提高低分辨率图像的人脸疲劳表情识别性能,提出一种基于稀疏表示的低分辨率人脸疲劳表情的识别方法。首先,采用肯德尔和谐系数可信度分析法构建了低分辨率人脸疲劳表情图像库TIREDFACE。其次,通过图像库中的低分辨率样本疲劳表情图像进行稀疏表示,再利用压缩感知理论寻求低分辨率测试样本的最稀疏解,采用求得的最稀疏解实现低分辨率人脸疲劳表情的分类。在低分辨率人脸视觉特征的疲劳表情图像库TIREDFACE的实验测试结果表明,将该方法用于低分辨人脸疲劳表情识别,性能优于线性法、最近邻法、支持向量机以及最近邻子空间法。可见,该方法用于低分辨率人脸疲劳表情识别时识别效果较好,精确度较高。     

A sparse direction-of-arrival estimation algorithm for MIMO radar in the presence of gain-phase errors

In this paper, the problem of direction-of-arrival (DOA) estimation for monostatic multiple-input multiple-output (MIMO) radar with gain-phase errors is addressed, by using a sparse DOA estimation algorithm with fourth-order cumulants (FOC) based error matrix estimation. Useful cumulants are designed and extracted to estimate the gain and the phase errors in the transmit array and the receive array, thus a reliable error matrix is obtained. Then the proposed algorithm reduces the gain-phase error matrix to a low dimensional one. Finally, with the updated gain-phase error matrix, the FOC-based reweighted sparse representation framework is introduced to achieve accurate DOA estimation. Thanks to the fourth-order cumulants based gain-phase error matrix estimation, and the reweighted sparse representation framework, the proposed algorithm performs well for both white and colored Gaussian noises, and provides higher angular resolution and better angle estimation performance than reduced-dimension MUSIC (RD-MUSIC), adaptive sparse representation (adaptive-SR) and ESPRIT-based algorithms. Simulation results verify the effectiveness and advantages of the proposed method.     

基于稀疏表示的图像超分辨率重构算法

为提高单幅图像的分辨率,提出一种基于稀疏表示的图像超分辨率重构方法。该方法的核心是联合训练高分辨率和低分辨率字典,然后利用所得字典求解高、低分辨率下图像块共有的稀疏表示系数。与已有的基于稀疏表示的图像超分辨重构算法相比,该算法在求解稀疏表示系数时并未采用拉格朗日乘子将稀疏度和重构误差相结合,而是利用对偶模型求解原始的带约束优化问题。实验表明,与其他图像超分辨率重构方法相比,该方法所需手动调节参数较少,重构效果较好。     

基于监督学习的稀疏编码及在数据表示中的应用

针对稀疏编码在数据表示时没有利用样本类别信息的问题,提出一种基于监督学习的稀疏编码算法,并应用于数据表示.首先利用样本的类别信息构建图,直接提取样本的鉴别结构信息;然后利用基向量拟合鉴别结构特性向量,进而在基向量中嵌入样本的鉴别信息;最后对样本逐个进行稀疏表示.在COIL20和PIE图像库的实验结果表明,相比几种无监督矩阵分解算法,所提出的算法更利于样本的表示和分类.     

一种监督降维的OP-LASRC算法在行为识别中的应用*

针对大数据的人体行为识别时实时性差和识别率低的问题,提出了优化投影对线性近似稀疏表示分类(OP-LASRC)的监督降维算法。OP-LASRC将高维的行为数据优化投影到低维空间,与线性近似稀疏表示(LASCR)快速分类算法相结合应用大数据的人体行为识别。首先利用LASCR的残差计算规律设计OP-LASRC算法,实现监督降维;利用线性正交投影缩减高维数据的维度,投影时减小训练样本的本类重构残差及增大类间重构残差,从而保留训练样本的类别特征。然后,对降维后的行为数据,利用LASCR算法进行分类;用L2范数估算稀疏系数,选出前k个最大的稀疏系数对应的训练样本,缩减训练样本库后用L1范数最小化和残差最小化计算得到识别结果,从识别率、鲁棒性、执行时间三个方评价此方法,在KTH行为数据库上进行实验测试。实验表明：OP-LASRC监督降维后,LASRC在分类时不仅识别率高达96.5%,执行时间比同类算法短,而且保证了强鲁棒性,证明了OP-LASRC能完美匹配LASCR算法用于行为识别,这为大数据的行为识别提供了一种新的思路。     

基于稀疏表示和弹性网络的人脸识别

由于稀疏表示方法在人脸分类算法中的成功使用,在此基础上提出了一种更为有效的基于稀疏表示（SRC）和弹性网络相结合的分类方法。为了加强样本间的协作表示能力以及增强处理强相关性变量数据的能力,基于迭代动态剔除机制,提出一种结合弹性网络的稀疏分解方法。通过采用训练样本的线性组合来表示测试样本,并运用迭代机制从所有样本中剔除对分类贡献度较小的类别和样本,采用Elastic Net算法来进行系数分解,从而选择出对分类贡献度较大的样本和类别,最后根据计算相似度对测试样本进行分类。在ORL、FERET和AR三个数据集进行了许多实验,实验结果显示算法识别率分别达到了98.75%、86.62%、99.72%,表明了所提算法的有效性。所提算法相比LASSO和SRC-GS等方法,在系数分解过程中增强了处理高维小样本和强相关性变量数据的能力,突出了稀疏约束在该算法中的重要性,具有更高的准确性和稳定性,能够更加有效地适用于人脸分类。