基于非负矩阵分解的高光谱遥感图像混合像元分解

传统非负矩阵分解算法的目标函数具有大量的局部极小,在进行高光谱图像的光谱解混时,受初始值的影响很大.为解决该问题,作者通过在目标函数中引入丰度分离性和平滑性的约束条件,提出一种基于有约束非负矩阵分解的混合像元分解方法.同时该算法能够满足混合像元分解问题所要求的丰度值非负以及和为一的约束.模拟和实际数据实验结果表明,所提...     

Adaptive graph-based discriminative nonnegative matrix factorization for image clustering

Nonnegative matrix factorization(NMF) is an effective dimension reduction method, which is widely used in image clustering and other fields. Some NMF variants preserve the manifold structure of the original data. However, the construction of the traditional neighbor graph depends on the original data, so it may be affected by noise and outliers. Moreover, these methods are unsupervised and do not use available label information. Therefore, this paper presents an adaptive graph-based discriminative nonnegative matrix factorization(AGDNMF). AGDNMF uses the available label to construct the label matrix, such that the new representations with the same label data are aligned to the same axis. And the neighbor graph in AGDNMF is obtained by adaptive iterations. A number of experiments on many image data sets verify that AGDNMF is effective compared with the other state-of-the-art methods.     

全变差稀疏约束深度非负矩阵分解高光谱遥感影像解混方法

传统非负矩阵分解方法仅基于单层线性模型,现有的深度非负矩阵分解模型忽略了地物光谱的实际混合物理过程,仅从数学理论考虑深度分解。对此,文中从光谱混合的物理过程出发,综合非负矩阵分解和深度学习,将光谱混合过程进行反向建模,并充分考虑丰度的稀疏性和空间平滑性,构建了用于高光谱遥感影像解混的面向端元矩阵的全变差稀疏约束深度非负矩阵分解模型。通过模拟实验和真实实验,将文中所提方法与5种解混方法进行对比。结果表明,相较于面向丰度的深度非负矩阵分解算法,文中所提方法的平均光谱角距离和均方根误差均有所降低,取得了最佳解混结果。     

Joint feature representation and classification via adaptive graph semi-supervised nonnegative matrix factorization

As an effective feature representation method, non-negative matrix factorization (NMF) cannot utilize the label information sufficiently, which makes it not be suitable for the classification task. In this paper, we propose a joint feature representation and classification framework named adaptive graph semi-supervised nonnegative matrix factorization (AGSSNMF). Firstly, to enhance the discriminative ability of feature representation and accomplish the classification task, a regression model with nonnegative matrix factorization (called as RNMF) is proposed, which exploits the relation between the label information and feature representation. Secondly, to overcome the drawback of insufficient labels, an adaptive graph-based label propagation (refereed as AGLP) model is established, which adopts a local constraint to reflect the local structure of data. Then, we integrate RNMF and AGLP into a unified framework for feature representation and classification. Finally, an iterative optimization algorithm is used to solve the objective function. Extensive experiments show that the proposed framework has excellent performance compared with some well-known methods.     

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

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

以非负矩阵分解提取局部特征的SAR目标稀疏表示分类

合成孔径雷达( SAR)目标分类是自动目标识别系统的核心功能之一,对于战场监视等应用具有重要意义。利用SAR图像局部散射明显的特点,提出了通过训练样本的非负矩阵分解获得低维数局部特征编码,并以该编码作为字典进行稀疏表示分类的方法。采用Gotcha项目民用车辆目标的实测数据进行了验证,结果显示在不同信噪比条件下该方法的分类正确率均优于广泛采用的由降采样、随机投影、主成分分析提取低维数特征的稀疏表示分类方法,表明了该方法的性能优势。另外,还通过实验对比分析了非负约束的稀疏表示与标准稀疏表示在分类性能上的差别,结果显示非负约束的稀疏表示导致分类正确率下降,故针对分类问题不宜在稀疏表示时进行非负约束。     

非抽样双树复小波域的BPP-NMF图像融合

提出了一种非抽样双树复小波变换（UDT-CWT）与基于块主元旋转的非负矩阵分解（BPP-NMF）相结合的多聚焦图像融合算法。利用UDT-CWT具有完美的平移不变性及良好的方向选择性,首先对图像进行多尺度、多方向分解并得到低频子带和高频子带系数;然后对低频子带系数采用块主元旋转的非负矩阵分解的融合策略,高频系数则选用高斯加权区域能量与区域标准差一致性选择的融合准则。最后对融合后的系数进行UDT-CWT逆变换得到重构图像。选用多组多聚焦图像进行融合并对融合结果进行主观视觉、客观方面的评价。试验结果表明,该融合算法不仅具有良好的视觉效果,同时在客观评价指标也优于一般的融合策略,验证了该算法的有效性。     

Image annotation using multi-view non-negative matrix factorization with different number of basis vectors

Automatic Image Annotation (AIA) helps image retrieval systems by predicting tags for images. In this paper, we propose an AIA system using Non-negative Matrix Factorization (NMF) framework. The NMF framework discovers a latent space, by factorizing data into a set of non-negative basis and coefficients. To model the images, multiple features are extracted, each one represents images from a specific view. We use multi-view graph regularization NMF and allow NMF to choose a different number of basis vectors for each view. For tag prediction, each test image is mapped onto the multiple latent spaces. The distances of images in these spaces are used to form a unified distance matrix. The weights of distances are learned automatically. Then a search-based method is used to predict tags based on tags of nearest neighbors’. We evaluate our method on three datasets and show that it is competitive with the current state-of-the-art methods.