arXivDaily arXiv每日学术速递 周一至周五更新
北美退伍军人节(Veterans Day),12 日无更新
arXiv 1409.0685cs.CV
收藏

基于鲁棒表示和学习稀疏度的有效谱分解

Effective Spectral Unmixing via Robust Representation and Learning-based Sparsity

National Laboratory of Pattern Recognition, Institute of Automation, Chinese Academy of Sciences(中国科学院自动化研究所模式识别国家重点实验室)

Feiyun Zhu, Ying Wang, Bin Fan, Gaofeng Meng, Chunhong Pan

摘要:

高光谱解混是高光谱应用的基础。由于离群通道的普遍存在和大的解决方案空间,它仍然是具有挑战性的。为了解决上述两个问题,我们提出了一种新的模型,强调鲁棒表示和基于学习的稀疏性。具体来说,我们应用$\ell_{2,1}$ -范数来测量表示误差,防止离群通道主导我们的目标。通过这种方式,极大地缓解了离群通道的副作用。此外,我们观察到,每个像素的混合水平不同的图像网格。基于这一观察,我们利用基于学习的稀疏性方法同时学习HU结果和稀疏的指导地图。通过该引导图,根据每个像素的学习混合水平自适应地施加$\ell_{p}\!\left(\!0\!<\! p\!\leq\!1\right)$范数中的稀疏约束。与现有方法相比,该模型更符合实际情况,从而有望取得更好的HU结果。所得到的目标是高度非凸和非光滑的,因此很难优化。作为一个深刻的理论贡献,我们提出了一个有效的算法来解决它,同时,收敛性证明和计算复杂性分析系统提供。广泛的评估验证,我们的方法是非常有前途的HU任务-它实现了非常准确的指导地图和更好的HU结果相比,国家的最先进的方法。

英文摘要:

Hyperspectral unmixing (HU) plays a fundamental role in a wide range of hyperspectral applications. It is still challenging due to the common presence of outlier channels and the large solution space. To address the above two issues, we propose a novel model by emphasizing both robust representation and learning-based sparsity. Specifically, we apply the $\ell_{2,1}$-norm to measure the representation error, preventing outlier channels from dominating our objective. In this way, the side effects of outlier channels are greatly relieved. Besides, we observe that the mixed level of each pixel varies over image grids. Based on this observation, we exploit a learning-based sparsity method to simultaneously learn the HU results and a sparse guidance map. Via this guidance map, the sparsity constraint in the $\ell_{p}\!\left(\!0\!<\! p\!\leq\!1\right)$-norm is adaptively imposed according to the learnt mixed level of each pixel. Compared with state-of-the-art methods, our model is better suited to the real situation, thus expected to achieve better HU results. The resulted objective is highly non-convex and non-smooth, and so it is hard to optimize. As a profound theoretical contribution, we propose an efficient algorithm to solve it. Meanwhile, the convergence proof and the computational complexity analysis are systematically provided. Extensive evaluations verify that our method is highly promising for the HU task---it achieves very accurate guidance maps and much better HU results compared with state-of-the-art methods.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑