This paper presents a novel Bayesian approach for hyperspectral image unmixing. The observed pixels are modeled by a linear combination of material signatures weighted by their corresponding abundances. A spike-and-slab abundance prior is adopted to promote sparse mixtures and an Ising prior model is used to capture spatial correlation of the mixture support across pixels. We approximate the posterior distribution of the abundances using the expectation-propagation (EP) method. We show that it can significantly reduce the computational complexity of the unmixing stage and meanwhile provide uncertainty measures, compared to expensive Monte Carlo strategies traditionally considered for uncertainty quantification. Moreover, many variational parameters within each EP factor can be updated in a parallel manner, which enables mapping of efficient algorithmic architectures based on graphics processing units (GPU). Under the same approximate Bayesian framework, we then extend the proposed algorithm to semi-supervised unmixing, whereby the abundances are viewed as latent variables and the expectation-maximization (EM) algorithm is used to refine the endmember matrix. Experimental results on synthetic data and real hyperspectral data illustrate the benefits of the proposed framework over state-of-art linear unmixing methods.
翻译:本文展示了一种新颖的超光谱图像混合学方法。 观测到的像素是由按相应丰度加权的线性材料特征组合成的线性特征模型。 之前采用过一个钉和丝的丰度,以促进稀释混合物, 并且使用Ising 先前模型, 捕捉混合物支持跨像素的空间相关性。 我们用预期- 分析法( EP) 来比较这些丰度的外表分布。 我们显示, 它可以大大降低未混合阶段的计算复杂性, 并同时提供与传统上为不确定性量化考虑的昂贵的蒙特卡洛战略相比的不确定性计量。 此外, 还可以同时更新每个 EP 中的许多变异参数, 以便能够根据图形处理器( GPU) 绘制高效的算法结构图 。 在同样的近似 Bayes 的框架内, 我们随后将拟议的算法扩展为半超导的解混合法, 从而将丰度视为潜在的变量, 而期望- 最大化算法( EM) 被用来改进最终成员矩阵。 合成数据实验结果和真实的超谱线性线性数据 数据 说明拟议框架的效益。