论文标题
受到优化问题启发的高光谱脉络网络
Hyperspectral Unmixing Network Inspired by Unfolding an Optimization Problem
论文作者
论文摘要
高光谱图像(HSI)Unmixing任务本质上是一个反问题,通常在预定义(非)线性混合模型下通过优化算法来解决。尽管这些优化算法表现出令人印象深刻的性能,但由于通常依赖迭代更新方案,它们的计算要求非常高。最近,神经网络的兴起激发了许多基于学习的算法的融合文学算法。但是,他们中的大多数缺乏可解释性,需要大量的培训数据集。然后出现一个自然的问题:一个人能否利用基于模型的算法和基于学习的算法来实现HSI UMINGING问题的可解释和快速算法?在本文中,我们提出了两种新型的网络体系结构,分别是u-admm-aenet和u-admm-bunet,分别通过结合常规的基于基于优化模型的Unmixing方法以及基于上升的学习Unmixing方法,分别为丰度估计和盲目的Umbining。我们首先考虑具有稀疏性约束的线性混合模型,然后我们展开乘数(ADMM)算法的交替方向方法以构建Unmixing网络结构。我们还表明,展开的结构可以在机器学习文献中找到相应的解释,这进一步证明了提议的方法的有效性。从解释中受益,可以通过合并有关HSI数据的先前信息来初始化所提出的网络。与传统展开网络不同,我们为提出的网络提出了一种新的培训策略,以更好地适合HSI应用程序。广泛的实验表明,与最先进的算法相比,即使使用较小的训练数据,提出的方法也可以达到更快的收敛性和竞争性能。
The hyperspectral image (HSI) unmixing task is essentially an inverse problem, which is commonly solved by optimization algorithms under a predefined (non-)linear mixture model. Although these optimization algorithms show impressive performance, they are very computational demanding as they often rely on an iterative updating scheme. Recently, the rise of neural networks has inspired lots of learning based algorithms in unmixing literature. However, most of them lack of interpretability and require a large training dataset. One natural question then arises: can one leverage the model based algorithm and learning based algorithm to achieve interpretable and fast algorithm for HSI unmixing problem? In this paper, we propose two novel network architectures, named U-ADMM-AENet and U-ADMM-BUNet, for abundance estimation and blind unmixing respectively, by combining the conventional optimization-model based unmixing method and the rising learning based unmixing method. We first consider a linear mixture model with sparsity constraint, then we unfold Alternating Direction Method of Multipliers (ADMM) algorithm to construct the unmixing network structures. We also show that the unfolded structures can find corresponding interpretations in machine learning literature, which further demonstrates the effectiveness of proposed methods. Benefit from the interpretation, the proposed networks can be initialized by incorporating prior information about the HSI data. Different from traditional unfolding networks, we propose a new training strategy for proposed networks to better fit in the HSI applications. Extensive experiments show that the proposed methods can achieve much faster convergence and competitive performance even with very small size of training data, when compared with state-of-art algorithms.