计算机应用 ›› 2019, Vol. 39 ›› Issue (10): 3100-3106.DOI: 10.11772/j.issn.1001-9081.2019030534

• 应用前沿、交叉与综合 • 上一篇    

基于超像素的流形正则化稀疏约束NMF混合像元分解算法

李登刚1, 陈香香2, 李华丽3, 王忠美1   

  1. 1. 湖南工业大学 交通工程学院, 湖南 株洲 412007;
    2. 联发软件设计(深圳)有限公司, 广东 深圳 518063;
    3. 湖南大学 电气与信息工程学院, 长沙 410082
  • 收稿日期:2019-04-02 修回日期:2019-05-22 发布日期:2019-05-31 出版日期:2019-10-10
  • 通讯作者: 陈香香
  • 作者简介:李登刚(1991-),男,湖南永州人,讲师,硕士,主要研究方向:高光谱图像处理;陈香香(1992-),女,湖南邵阳人,工程师,硕士,主要研究方向:数字图像处理、模式识别;李华丽(1984-),女,湖北孝感人,副教授,博士,主要研究方向:高光谱图像处理、模式识别;王忠美(1984-),男,湖北荆州人,讲师,博士,主要研究方向:高光谱图像处理、模式识别。
  • 基金资助:
    湖南省教育厅科学研究项目(18C0513)。

Manifold regularized sparse constraint nonnegative matrix factorization with superpixel algorithm for hyperspectral unmixing

LI Denggang1, CHEN Xiangxiang2, LI Huali3, WANG Zhongmei1   

  1. 1. College of Traffic Engineering, Hunan University of Technology, Zhuzhou Hunan 410082, China;
    2. MediaTek(Shenzhen) Incorporated, Shenzhen Guangdong 518063, China;
    3. College of Electrical and Information Engineering, Hunan University, Changsha Hunan 410002, China
  • Received:2019-04-02 Revised:2019-05-22 Online:2019-05-31 Published:2019-10-10
  • Supported by:
    This work is partially supported by the Scientific Research Project of Hunan Provinical Education Department (18C0513).

摘要: 针对传统非负矩阵分解(NMF)法用于高光谱图像混合像元分解时产生的分解结果精度不高、对噪声敏感等问题,提出一种基于超像素的流形正则化稀疏约束NMF混合像元分解算法——MRS-NMF。首先,通过基于熵率的超像素分割来构造高光谱图像的流形结构,把原图像分割为k个超像素块并把每个超像素块中具有相似性质的数据点标上相同的标签,定义像素块内有相同标签的任意两个数据点之间的权重矩阵,然后将权重矩阵应用于NMF的目标函数中以构造出流形正则化约束项;第二,在目标函数中添加二次抛物线函数以完成稀疏约束;最后,采用乘法迭代更新法则求解目标函数以得到端元矩阵和丰度矩阵的求解公式,同时设置最大迭代次数和容忍误差阈值,迭代运算得到最终结果。该方法有效利用了高光谱图像的光谱和空间信息。实验结果表明,在模拟的高光谱数据中,与传统的流形稀疏约束的非负矩阵分解(GLNMF)、L1/2-NMF和顶点成分分析-全约束最小二乘法(VCA-FCLS)等方法相比,MRS-NMF可以提高0.016~0.063的端元分解精度和0.01~0.05的丰度分解精度;而在真实的高光谱图像中,MRS-NMF较传统的GLNMF、顶点成分分析法(VCA)、最小体积约束的非负矩阵分解(MVCNMF)等方法可以平均提高0.001~0.0437的端元分解精度。所提MRS-NMF算法有效地提高了混合像元分解的精度,同时具有较好的抗噪性能。

关键词: 混合像元分解, 非负矩阵分解, 超像素分割, 流形正则化, 稀疏性

Abstract: For the problems such as poor unmixing results and sensitivity to noise of traditional Nonnegative Matrix Factorization (NMF) applied to hyperspectral unmixing, a Manifold Regularized Sparse NMF with superpixel (MRS-NMF) algorithm for hyperspectral unmixing was proposed. Firstly, the manifold structure of hyperspectral image was constructed by superpixel segmentation based on entropy. The original image was divided into k-superpixel blocks, and the data points in each superpixel block with same property were labeled the same label. Weight matrices were defined between any two data points with the similar label in a superpixel block, and then the weight matrices were applied to the objective function of NMF to construct the manifold regularization constraint. Secondly, a quadratic parabola function was added to the objective function to complete the sparse constraint. Finally, the multiplicative iterative update rule was used to solve the objective function to obtain the solution formulas of endmember matrix and abundance matrix. At the same time, maximum iteration times and tolerate error threshold were set to get the final results by iterative operation. The proposed method makes full use of spectral and spatial information of hyperspectral images. Experimental results show that on synthetic data the unmixing accuracies of endmember and abundance based on proposed MRS-NMF are 0.016-0.063 and 0.01-0.05 respectively higher than those based on traditional methods like Graph-regularized L1/2-Nonnegative Matrix Factorization (GLNMF), L1/2NMF and Vertex Component Analysis-Fully Constrained Least Squares (VCA-FCLS); while on real hyperspectral images, the average unmixing accurary of endmember based on proposed MRS-NMF is 0.001-0.0437 higher than that of traditional GLNMF, Vertex Component Analysis (VCA) and Minimum Volume Constrained Nonnegative Matrix Factorization (MVCNMF). This proposed algorithm improves the accuracy of unmixing effectively with good robustness to noise.

Key words: hyperspectral unmixing, Nonnegative Matrix Factorization (NMF), superpixel segmentation, manifold regularization, sparseness

中图分类号: