论文标题
基于低级矩阵近似的高光谱图像剥夺框架的不确定性定量
Uncertainty Quantification for Hyperspectral Image Denoising Frameworks based on Low-rank Matrix Approximation
论文作者
论文摘要
基于滑动窗口的低级矩阵近似(LRMA)是一种广泛用于高光谱图像(HSIS)降级或完成的技术。但是,迄今为止尚未解决恢复的HSI的不确定性量化。对固定的HSI的准确不确定性量化促进了诸如多源或多尺度数据融合,数据同化和产品不确定性量化之类的应用,因为这些应用需要一种准确的方法来描述输入数据的统计分布。因此,我们提出了一种基于LRMA的HSI恢复的先前无封闭形式的不确定性定量方法。我们的封闭形式算法克服了由常规LRMA过程中使用的滑动窗口策略引起的HSI补丁混合问题的难度。所提出的方法仅需要观察到的HSI的不确定性,并且提供的不确定性相对较快,并且计算复杂性与LRMA技术相似。我们进行了广泛的实验,以验证提出的封闭形式不确定性方法的估计准确性。与LRMA相比,该方法以额外处理时间的10-20%的成本为10%的随机脉冲噪声至少可靠。该实验表明,所提出的封闭形式的不确定性定量方法比基线蒙特卡洛测试更适用于现实世界应用,该测试在计算上昂贵。该代码在附件中可用,将在接受本文后发布。
Sliding-window based low-rank matrix approximation (LRMA) is a technique widely used in hyperspectral images (HSIs) denoising or completion. However, the uncertainty quantification of the restored HSI has not been addressed to date. Accurate uncertainty quantification of the denoised HSI facilitates to applications such as multi-source or multi-scale data fusion, data assimilation, and product uncertainty quantification, since these applications require an accurate approach to describe the statistical distributions of the input data. Therefore, we propose a prior-free closed-form element-wise uncertainty quantification method for LRMA-based HSI restoration. Our closed-form algorithm overcomes the difficulty of the HSI patch mixing problem caused by the sliding-window strategy used in the conventional LRMA process. The proposed approach only requires the uncertainty of the observed HSI and provides the uncertainty result relatively rapidly and with similar computational complexity as the LRMA technique. We conduct extensive experiments to validate the estimation accuracy of the proposed closed-form uncertainty approach. The method is robust to at least 10% random impulse noise at the cost of 10-20% of additional processing time compared to the LRMA. The experiments indicate that the proposed closed-form uncertainty quantification method is more applicable to real-world applications than the baseline Monte Carlo test, which is computationally expensive. The code is available in the attachment and will be released after the acceptance of this paper.