期刊文献+

基于稀疏和正交约束非负矩阵分解的高光谱解混 被引量:5

Hyperspectral unmixing based on sparse and orthogonal constrained non-negative matrix factorization
下载PDF
导出
摘要 针对基于非负矩阵分解(NMF)的高光谱解混存在的容易陷入局部极小值和受初始值影响较大的问题,提出一种稀疏和正交约束相结合的NMF的线性解混算法SONMF。首先,从传统的基于NMF的高光谱线性解混方法出发,分析高光谱数据本身的理化特性;然后,结合丰度的稀疏性和端元的独立性两个方面,将稀疏非负矩阵分解(SNMF)和正交非负矩阵分解(ONMF)两种方法结合应用到高光谱解混当中。模拟数据和真实数据实验表明,相比顶点成分分析法(VCA)、SNMF和ONMF这三种参考解混算法,所提算法提高了线性解混的性能;其中,评价指标光谱角距离(SAD)降低了0.012~0.145。SONMF能够结合两种约束条件的优势,弥补传统基于NMF线性解混方法对高光谱数据表达的不足,取得较好的效果。 Aiming at the problem that hyperspectral unmixing based on Non-negative Matrix Factorization (NMF) is easy to fall into local minimum and greatly affected by initial value,a linear unmixing algorithm based on Sparse and Orthogonal constrained Non-negative Matrix Factorization (SONMF) was proposed.Firstly,based on the traditional NMF hyperspectral linear unmixing method,the physical and chemical properties of the hyperspectral data was analyzed.Then the sparsity of the abundance and the independence of the endmember were combined together,two methods of Sparse Non-negative Matrix Factorization (SNMF) and Orthogonal Non-negative Matrix Factorization (ONMF) were combined and applied into hyperspectral unmixing.The experiments on simulation data and real data show that,compared with the three reference unmixing algorithms of Vertex Component Analysis (VCA),SNMF and ONMF,the proposed algorithm has improved the performance of linear unmixing,in which the Spectral Angle Distance (SAD) is reduced by 0.012 to 0.145.SONMF can combine the advantages of the two constraints to make up for the lack the expression of hyperspectral data by traditional NMF based linear unmixing methods,and achieve good results.
作者 陈善学 储成泉 CHEN Shanxue;CHU Chengquan(School of Communication and Information Engineering,Chongqing University of Posts and Telecommunications,Chongqing 400065,China)
出处 《计算机应用》 CSCD 北大核心 2019年第8期2276-2280,共5页 journal of Computer Applications
关键词 非负矩阵分解 高光谱解混 稀疏 正交 独立性 Non-negative Matrix Factorization (NMF) hyperspectral unmixing sparsity orthogonality independence
  • 相关文献

参考文献3

二级参考文献24

  • 1刘维湘,郑南宁,游屈波.非负矩阵分解及其在模式识别中的应用[J].科学通报,2006,51(3):241-250. 被引量:38
  • 2LlU Weixiang ZHENG Nanning YOU Qubo.Nonnegative matrix factorization and its applications in pattern recognition[J].Chinese Science Bulletin,2006,51(1):7-18. 被引量:21
  • 3Seung H S,Lee D D.Learning the parts of objects by non-negative matrix factorization[J].Nature,1999,401(6755):788-791.
  • 4Chu M,Plemmons R J.Nonnegative matrix factorization and applications[J].Image,2005,34:1-5.
  • 5Tang J,Ceng X,Peng B.New Methods of Data Clustering and Classification Based on NMF[C]∥2011 International Confe-rence on Business Computing and Global Informatization.IEEE Computer Society,2011:432-435.
  • 6Cichocki A,Amari S I,Zdunek R,et al.Extended SMART Algo-rithms for Non-negative Matrix Factorization[M]∥Artificial Intelligence and Soft Computing(ICAISC 2006).Springer Berlin Heidelberg,2006.
  • 7Ma Hui-fang,Zhao Wei-zhong,Tan Qing,et al.OrthogonalNonnegative Matrix Tri-factorization for Semi-supervised Document Co-clustering[C]∥Proceedings of the 14th Pacific-Asia Conference on Knowledge Discovery and Data Mining(PAKDD2010).2010:189-200.
  • 8Chen Y H,Wang L J,Dong M.Semi-supervised Document Clustering with Simultaneous Text Representation and Categorization[C]∥Buntine W,Grobelnik M,Mladeni D,eds.Machine Learning and Knowledge Discovery in Databases:Lecture Nates in Computer Science.Springer,Heidelberg.2009:211-226.
  • 9Stadlthanner K,Theis F J,Puntonet C G,et al.Extended sparse nonnegative matrix factorization[M]∥Computational Intelligence and Bioinspired Systems.Springer Berlin Heidelberg,2005:249-256.
  • 10Lee D D,Seung H S.Algorithms for Non-negative Matrix Factorization[J].Nips,2000,32(6):556-562.

共引文献6

同被引文献43

引证文献5

二级引证文献7

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部