多稀疏表示分类器决策融合修正距离的图像检索

针对当前许多图 像检索方法的检索精度不理想的问题,本文为增强图像特征的表达能力,通过统计图像的颜 色矩、多尺度分块 局部二值模式、灰度共生矩阵、尺度不变特征变换以及空间位置信息,提取5类能从不同角 度表征图像本 质特性的特征,并根据图像库中各训练图像的类别信息,以此5类特征构造5个稀疏表示分类 器,同时引 入决策融合思想,根据每个子分类器的分类性能,通过一个自适应迭代运算过程确定各子分 类器的融合权 值,以刻画不同类别特征的图像表达能力,并据此构造距离修正因子对不同特征所描述的图 像间距离进行 修正,从而得到综合各类特征表达能力的图像间的修正距离,实现图像的相似性评价,获得 检索结果。实 验结果表明,基于Corel-1000图像库,本文提出的方法平均查准率 为82.1%,比现有的方法平均提升10个百分点 ,而且鲁棒性更强。     

熵权约束稀疏表示的短文本分类算法

针对短文本特征稀疏性问题,提出一种熵权约束稀疏表示的短文本分类方法.考虑到初始字典维数较高,首先,利用Word2vec工具将字典中的词表示成词向量形式,然后根据加权向量平均值对原始字典进行降维.其次,利用一种快速特征子集选择算法去除字典中不相关和冗余短文本,得到过滤后的字典.再次,基于稀疏表示理论在过滤后的字典上,为目标函数设计一种熵权约束的稀疏表示方法,引入拉格朗日乘数法求得目标函数的最优值,从而得到每个类的子空间.最后,在学习到的子空间下通过计算待分类短文本与每个类中短文本的距离,并根据三种分类规则对短文本进行分类.在真实数据集上的大量实验结果表明,本文提出的方法能够有效缓解短文本特征稀疏问题且优于现有短文本分类方法.     

基于块分类稀疏表示的图像融合算法

针对基于单一字典训练稀疏表示的图像融合算法忽略图像局部特征的问题,提出了基于块分类稀疏表示的图像融合算法。此算法是根据图像局部特征的差异将图像块分为平滑、边缘和纹理三种结构类型,对边缘和纹理结构分别训练出各自的冗余字典。平滑结构利用算术平均法进行融合,边缘和纹理结构由对应字典利用稀疏表示算法进行融合,并对边缘结构稀疏表示中的残余量进行小波变换融合。实验结果证明,该算法相对于单一字典稀疏表示算法,在融合图像的主观评价和客观评价指标上都有显著改进,并且算法速度也有提高。     

基于多字典稀疏表示的遥感图像亚像元映射

本文提出了一种基于多字典稀疏表示的亚像元映射算法,利用已知的同类型高空间分辨率地物分布图像,构建能够更好反映不同类别地物空间分布模式的多个字典,将待分类亚像元用每一类字典稀疏表示,并依据重构误差最小化原则以及光谱失真程度约束条件来划分亚像元的地物类别.模拟与真实数据上的实验结果表明,本文算法能有效应对地物空间分布模式的多样性,具有更高的亚像元映射精度和更好的算法鲁棒性.     

基于Gabor特征的稀疏表示纹理分割研究

稀疏表示和字典学习在图像去噪、图像重建和模式识别等应用上取得了良好的效果,其利用稀疏系数和重构误差来作为模式分类的判别准则。稀疏表示纹理分割方法是将图像分割问题转换为像素点的分类问题。但通常稀疏表示分类方法是基于图像块特征,难以准确表征图像纹理信息。为了解决上述问题,提出基于Gabor特征的稀疏表示纹理分割方法。因为Gabor特征对图像纹理信息的鲁棒性,算法首先从每类纹理中选择一些像素点作为训练样本,计算其不同尺度和方向下的Gabor特征,将其作为初始化字典,通过判别性的字典学习算法(D-KSVD)更新字典,该字典学习算法在KSVD基础上使得字典更具有类别判别能力,最后以待分割图像的每个像素点作为测试样本,计算其Gabor特征。利用OMP算法得到测试样本在字典下的稀疏系数,根据稀疏系数得到类标签,进而对像素点进行分类,完成分割。通过在Brodatz纹理库上的实验结果表明,该方法有效提高了稀疏表示算法对纹理图像分割的正确率。     

基于稀疏表示及光谱信息的高光谱遥感图像分类

该文结合稀疏表示及光谱信息提出了一种新的高光谱遥感图像分类算法。首先提出利用高光谱遥感图像数据集构造学习字典,然后根据学习字典计算每个像元的稀疏系数,从而获得像元的稀疏表示特征,最后根据稀疏表示特征和光谱信息分别构造随机森林,通过投票机制得到最终的分类结果。在AVIRIS高光谱遥感图像上的实验结果表明:该文所提方法能够提高分类效果,且其分类总精度和Kappa系数要高于光谱信息和稀疏表示特征方法。     

基于稀疏表示的概率子空间聚类人脸识别

针对子空间聚类应用中高达数以百万计信号的数据集合问题,为了实现快速聚类,提出了一种基于稀疏表示的概率子空间聚类算法。首先,每个信号由一个稀疏组合的基本元素(原子)表示,这些原子构成了字典矩阵的列;接着利用稀疏表示集推导出一个混合模式的原子和信号的共生矩阵;最后,通过共生矩阵的非负矩阵分解(NNMF)得到混合模式的组件,并根据最大似然(ML)准则估算每个信号的子空间。在YaleB人脸数据库上的实验结果表明,与其他几种最先进的方法相比,所提方法取得了较好的聚类精度。     

Gist特征和概率协从表示的人脸识别算法

为了进一步提高基于协从表示的人脸识别系统的 性能,在概率协从表示(ProCRC)算法和字典学习的基础上提出了一 种基于Gist特征和ProCRC的GL-PCRC人脸识别算法。首先提取每副人脸图像的G ist特征,再把人脸图像的Gist 特征采用线性判别算法(LDA)方法投影到最优判别子空间,使得到的LDA特征拥有最小的类内 离散度以及最大的类间离散度;然后利用 LC-KSVD方法对LDA特征进行迭代训练从而得到新的学习字典;继而通过ProCRC算法快 速得到稀疏系数;最后通过计算测 试样本属于各个类别的概率进行分类。分别在ORL和扩展的YaleB人脸库上进行实验检测的 结果表明,与传统的协从表示方法 相比,本文给出的方案可以使人脸识别系统的性能得到显著的提升。     

一种新的结合稀疏编码的红外图像聚类分割算法

聚类作为一种重要的图像分割方法得到了大量研究,提出了一种新的结合稀疏编码的红外图像聚类分割算法,扩展了传统的基于K-means聚类的图像分割方法。结合稀疏编码的聚类算法能有效融合图像的局部信息,而且易于利用像素之间的内在相关性,但是对于分割会出现过分割和像素难以归类的问题。为此,在字典的学习过程中,将原子的聚类算法引入其中,有助于缩减字典中原子所属类别的数目防止出现过分割;同时将稀疏编码系数同原子对聚类中心的隶属程度相结合来判断像素所属的类别。这种处理方式能更好地实现利用像素的内在相关性进行聚类分割,并在其中自然引入了局部空间信息,达到更好分离目标区域和背景区域的目的。实验结果表明,结合稀疏编码的K-means聚类分割算法能更好的实现复杂背景下红外图像重要区域的准确分割提取。     

基于优化字典学习的遥感图像融合方法

为提升全色图像和多光谱图像的融合效果,该文提出基于优化字典学习的遥感图像融合方法。首先将经典图像库中的图像分块作为训练样本,对其进行K均值聚类,根据聚类结果适度裁减数量较多且相似度较高的图像块,减少训练样本个数。接着对裁减后的训练样本进行训练,得到通用性字典,并标记出相似字典原子和较少使用的字典原子。然后用与原稀疏模型差异最大的全色图像块规范化后替换相似字典原子和较少使用的字典原子,得到自适应字典。使用自适应字典对多光谱图像经IHS变换后获取的亮度分量和源全色图像进行稀疏表示,把每一个图像块稀疏系数中的模极大值系数分离,得到极大值稀疏系数,将剩下的稀疏系数称为剩余稀疏系数。针对极大值稀疏系数和剩余稀疏系数分别选择不同的融合规则进行融合,以保留更多的光谱信息和空间细节信息,最后进行IHS逆变换获得融合图像。实验结果表明,与传统方法相比所提方法得到的融合图像主观视觉效果较好,且客观评价指标更优。     

Sparse matrix transform-based linear discriminant analysis for hyperspectral image classification

Due to the high dimensionality of hyperspectral image (HSI), dimension reduction or feature extraction is usually needed before the HSI classification. Traditional linear discriminant analysis (LDA) method for feature extraction usually encounters difficulty because the available training samples in HSI classification are limited, which causes the singularity of data scatter matrix. In this paper, we propose a sparse matrix transform-based LDA (SMT-LDA) algorithm for the HSI classification. By using SMT, the total scatter matrix used in LDA can be constrained to have an eigen-decomposition where the eigenvectors can be sparsely parametrized by a limited number of Givens rotations. In this way, the estimated scatter matrix is always positive definite and well conditioned even in the case of limited training samples. The proposed SMT-LDA method is compared with regularized LDA and PCA-LDA methods on two benchmark hyperspectral data sets. Experimental results indicate that the performance of the proposed method is overall superior to these methods, especially for small-sample-size classification.     

Parametric adaptive signal detection for hyperspectral imaging

Hyperspectral imaging (HSI) sensors can provide very fine spectral resolution that allows remote identification of ground objects smaller than a full pixel in an HSI image. Traditional approaches to the so-called subpixel target signal detection problem are training inefficient due to the need for an estimate of a large-size covariance matrix of the background from target-free training pixels. This imposes a training requirement that is often difficult to meet in a heterogeneous environment. In this paper, a class of training-efficient adaptive signal detectors is presented by exploiting a parametric model that takes into account the nonstationarity of HSI data in the spectral dimension. A maximum-likelihood (ML) estimator is developed to estimate the parameters associated with the proposed parametric model. Several important issues are discussed, including model order selection, training screening, and time-series-based whitening and detection, which are intrinsic parts of the proposed parametric adaptive detectors. Experimental results using real HSI data reveal that the proposed parametric detectors are more training efficient and outperform conventional covariance-matrix-based detectors when the training size is limited.     

Kernel eigenmaps based multiscale sparse model for hyperspectral image classification

Hyperspectral imaging (HSI) is the emerging method that combines traditional imaging and spectroscopy to provide the image with both the spatial and spectral information of the object present in the image. The major challenges of the existing techniques for HSI classification are the high dimensionality of data and its complexity in classification. This paper devises a new technique to classify the HSI named Spatial–Spectral Schroedinger Eigen Maps based Multi-scale adaptive sparse representation (S²SEMASR). In this, two different phases are employed for the accurate classification of the HSI, namely, Schroedinger Eigen maps (SE) based spatial–spectral feature extraction and multi-scale adaptive sparse classification for the feature extracted image. SE makes use of spatial–spectral cluster potentials which allows the extraction of features that best describes the characteristics of different classes of HSI. The multiscale adaptive sparse representation (MASR) applied over the SE features provides the sparse coefficients that includes distinct scale level sparsity with same class level sparsity. With the obtained coefficients, the class label of each pixel is determined. The proposed HSI classifier well utilizes the spectral and spatial characteristics to exploit the within-class variability and thus reduces the misclassification of similar test pixels Experimental results demonstrated that the proposed S²SEMASR approach outperforms the traditional results both qualitatively and quantitatively with an overall accuracy of 98.3%.     

基于端元字典稀疏解混的高光谱图像亚像元定位

针对高光谱图像中普遍存在的混合像元中各端元空间分布定位困难的问题,文中提出一种基于K-SVD的光谱解混算法,利用其解混结果进行亚像元定位。算法首先通过KNN分类来区分待处理图像中的混合像元和纯像元,然后借鉴基于冗余字典的稀疏分解相关理论,以标准光谱库为基础,通过基于K-SVD的字典训练算法训练产生最具代表性的地物光谱曲线,构建端元冗余字典,通过基于K-SVD的稀疏分解算法实现各端元丰度的求解。最后利用求得的丰度系数在两种空间性相关性约束下进行亚像元定位。实验结果表明,采用该算法进行模拟数据和真实数据的亚像元的定位可以取得不错的定位结果。     

一种利用MAP估计的双目运动体视算法

本文提出一种融合运动和体视信息的运动与结构参数的鲁棒估计算法，算法首先通过计算瞬时ＦＯＥ，实现对每个像素处位移的ＭＡＰ估计，并计算关联的置信度；然后利用位移估计，从两图像序列之一计算相对深度，导出能用于匹配两体视图像序列的视差先验概率分布，使体视对的两帧图像匹配，确定３Ｄ景物深度，算法可方便地估计每个像素处的视差，不需对表面作平滑假设。     

联合核稀疏多元逻辑回归和TV-L1错误剔除的高光谱图像分类算法

稀疏多元逻辑回归（SMLR）是高光谱监督分类中的重要方法,然而仅仅利用光谱信息的SMLR忽略了影像本身的空间特征,在少量监督样本下的分类精度和算法的鲁棒性仍明显不足;虽然通过引入核技巧,核稀疏多元逻辑回归（KSMLR）可以部分克服上述缺点,其分类错误仍然有待进一步降低.本文基于核稀疏多元逻辑回归分类误差的统计建模分析,提出一种联合核稀疏多元逻辑回归和正则化错误剔除的高光谱图像分类模型.提出的模型通过引入隐概率场,采取L1范数度量KSMLR分类误差的重尾特性建立数据保真项;利用全变差（Total Variation,TV）正则化度量隐概率场的局部空间光滑性.由Indian Pines和University of Pavia数据集等实测数据应用表明,该方法可以得到更鲁棒和更高的分类精度.     

Face recognition using position-dictionaries and region covariance feature

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.     

面向目标检测基于稀疏表示的波段选择方法

随着高光谱成像技术的发展,日益提高的光谱分辨率在提高目标检测和识别能力的同时,其较高的数据维度和较大的数据量也为数据分析和处理带来了很大的挑战.波段选择作为一种有效提高处理效率的技术受到广泛关注,但却鲜有专门针对目标检测设计的方法.针对上述问题,本文在分析约束能量最小化（CEM）检测算法特点的基础上,提出了一种面向目标检测,基于稀疏表示的波段选择方法.该方法首先基于数据的对称KL散度分布情况,将原始高光谱数据划分为若干波段子空间.然后在各子空间内稀疏重构检测结果,利用选择波段与稀疏向量非零项的一一对应关系,通过求解最优化问题实现波段选择.实验结果验证了该方法的有效性.     

Sparsity adaptive matching pursuit for face recognition

Sparse representation methods have exhibited promising performance for pattern recognition. However, these methods largely rely on the data sparsity available in advance and are usually sensitive to noise in the training samples. To solve these problems, this paper presents sparsity adaptive matching pursuit based sparse representation for face recognition (SAMPSR). This method adaptively explores the valid training samples that exactly represent the test via iterative updating. Next, the test samples are reconstructed via the valid training samples, and classification is performed subsequently. The two-phase strategy helps to improve the discriminating power of class probability distribution, and thus alleviates effect of the noise from the training samples to some extent and correctly performs classification. In addition, the method solves the sparse coefficient by comparing the residual between the test sample and the reconstructed sample instead of using the sparsity. A large number of experiments show that our method achieves promising performance.