位置:成果数据库 > 期刊 > 期刊详情页
基于约束非负矩阵分解的高光谱图像解混快速算法
  • ISSN号:0732-2112
  • 期刊名称:电子学报
  • 时间:0
  • 页码:-
  • 分类:TP751[自动化与计算机技术—控制科学与工程;自动化与计算机技术—检测技术与自动化装置]
  • 作者机构:[1]南京理工大学计算机科学与技术学院,江苏南京210094
  • 相关基金:国家自然科学基金(No.61101194 No.61071146); 江苏省自然科学基金(No.BK20110224); 江苏省博士后科研基金(No.0901008B); 中国地质调查局工作项目(No.1212011120227)
  • 相关项目:基于空谱联合稀疏性的高光谱解混理论与算法
中文摘要:

约束非负矩阵分解是高光谱图像解混中常用的方法.该方法的求解通常采用投影梯度法,其收敛速度、求解精度和算法稳定性都有待提高.为此,本文针对较优的最小体积约束,提出一种基于约束非负矩阵分解的高光谱图像解混快速算法.首先优化原有的最小体积约束模型,然后设计了基于交替方向乘子法的非凸项约束非负矩阵分解算法,最后通过奇异值分解优化迭代步骤.模拟和实际数据实验结果验证了本文算法的有效性.

英文摘要:

Constrained nonnegative matrix factorization was an excellent method for hyperspectral unmixing.The traditional algorithm of this method was based on projected gradient method,and its convergence rate,accuracy and stability needed to be improved.To this end,we considered the excellent minimum volume constraint,and proposed a fast algorithm for hyperspectral unmixing based on constrained nonnegative matrix factorization.First the minimum volume constrained model of the original problem was optimized,then an alternating direction method of multipliers was used to solve the non-convex constrained nonnegative matrix factorization,and at last we modified the iteration steps by singular value decomposition.Experimental results on simulated and real hyperspectral data demonstrate the superiority of the proposed algorithm.

同期刊论文项目
同项目期刊论文