首页> 外文会议>Algorithms and Technologies for Multispectral, Hyperspectral, and Ultraspectral Imagery XIV >A Full Algorithm to Compute the Constrained PositiveMatrix Factorization and its Application in UnsupervisedUnmixing of Hyperspectral Imagery
【24h】

A Full Algorithm to Compute the Constrained PositiveMatrix Factorization and its Application in UnsupervisedUnmixing of Hyperspectral Imagery

机译:约束正矩阵分解的完整算法及其在高光谱图像无监督混合中的应用

获取原文
获取原文并翻译 | 示例

摘要

This paper presents a full algorithm to compute the solution for the unsupervised unmixing problem based on the positive matrix factorization. The algorithm estimates the number of endmembers as the rank of the matrix. The algorithm has an initialization stage using the SVD subset selection algorithm. Testing and validation with real and simulated data show the effectiveness of the method. Application of the approach to environmental remote sensing is shown.
机译:本文提出了一种基于正矩阵分解的无监督解混问题求解的完整算法。该算法将端成员数估计为矩阵的秩。该算法具有使用SVD子集选择算法的初始化阶段。使用真实和模拟数据进行测试和验证表明了该方法的有效性。显示了该方法在环境遥感中的应用。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号