...
首页> 外文期刊>Journal of Applied Remote Sensing >Library-aided bilinear unmixing of hyperspectral image using subspace clustering and multistep pruning
【24h】

Library-aided bilinear unmixing of hyperspectral image using subspace clustering and multistep pruning

机译:利用子空间聚类和多步修剪的库辅助双线性解密的高光谱图像

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

摘要

The bilinear mixing model is a more realistic, generalized model that can represent a wide range of real-world hyperspectral images with tolerable accuracy. The use of a spectral library makes the problem more tractable. However, the high mutual coherence of the spectral library creates computational as well as performance issues in library-aided bilinear unmixing. Besides, the high mutual coherence of the spectral library reduces the accuracy of these unmixing methods, and the high cardinality of the spectral library increases the computational complexity. We propose a computationally efficient, two-phase library pruning approach for unmixing hyperspectral image, which also withstands a highly coherent spectral library. In this work, we first segregate the data into pixels generated due to linear and bilinear interaction using the subspace clustering method and subsequent rank estimation strategy. We subsequently reduce the mutual coherence of the spectral library and prune the linear interactions. In the next stage, we create a library corresponding to the bilinear components assuming that only the secondary reflections of the pruned library elements may be prevalent in these pixels. We perform pruning using a novel, low-rank based, sequential approach. Finally, we compute the abundance of the matrix by exploiting sparseness of the abundance matrix and include its low-rankness, and spatial structural similarity as regularization. We validate the overall advantages of our proposed framework on several real and synthetic data experiments. (C) 2019 Society of Photo-Optical Instrumentation Engineers (SPIE)
机译:双线性混合模型是一种更现实的广义模型,可以代表具有可容忍精度的广泛的实际高光谱图像。使用光谱库使得更具易行的问题。然而,光谱库的高相干性共同共同创造了图书馆辅助Bilinear解密中的计算以及性能问题。此外,光谱库的高相干性降低了这些解密方法的准确性,并且光谱库的高基数增加了计算复杂性。我们提出了一种用于解密高光谱图像的计算有效的两相图形修剪方法,这也承受了高度相干的光谱库。在这项工作中,我们首先使用子空间聚类方法和后续等级估计策略将数据分离为由于线性和双线性交互而产生的像素。我们随后降低了光谱库的相互相干性并修剪了线性相互作用。在下一阶段,我们创建对应于双线性组件的库,假设仅在这些像素中仅普遍的次要库元素的二次反射可能是普遍的。我们使用小说,低级别的顺序方法进行修剪。最后,我们通过利用丰度矩阵的稀疏来计算矩阵的丰度,并包括其低排名和空间结构相似性作为正规化。我们验证了我们拟议的框架的整体优势在几个实际和合成数据实验中。 (c)2019年光学仪表工程师协会(SPIE)

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号