Mining structural priors in data is a widely recognized technique for hyperspectral image (HSI) denoising tasks, whose typical ways include model-based methods and data-based methods. The model-based methods have good generalization ability, while the runtime cannot meet the fast processing requirements of the practical situations due to the large size of an HSI data $ \mathbf{X} \in \mathbb{R}^{MN\times B}$. For the data-based methods, they perform very fast on new test data once they have been trained. However, their generalization ability is always insufficient. In this paper, we propose a fast model-based HSI denoising approach. Specifically, we propose a novel regularizer named Representative Coefficient Total Variation (RCTV) to simultaneously characterize the low rank and local smooth properties. The RCTV regularizer is proposed based on the observation that the representative coefficient matrix $\mathbf{U}\in\mathbb{R}^{MN\times R} (R\ll B)$ obtained by orthogonally transforming the original HSI $\mathbf{X}$ can inherit the strong local-smooth prior of $\mathbf{X}$. Since $R/B$ is very small, the HSI denoising model based on the RCTV regularizer has lower time complexity. Additionally, we find that the representative coefficient matrix $\mathbf{U}$ is robust to noise, and thus the RCTV regularizer can somewhat promote the robustness of the HSI denoising model. Extensive experiments on mixed noise removal demonstrate the superiority of the proposed method both in denoising performance and denoising speed compared with other state-of-the-art methods. Remarkably, the denoising speed of our proposed method outperforms all the model-based techniques and is comparable with the deep learning-based approaches.
翻译:数据中的采矿结构前端是被广泛承认的超光谱图像( HISI) 去除任务的技术, 典型的方法包括基于模型的方法和基于数据的方法。 基于模型的方法具有很好的概括能力, 而运行时间无法满足实际情况下的快速处理要求, 因为 HSI 数据规模很大 $\ mathbf{X} 在 mathbb{ R ⁇ MN\ times B} 。 对于基于数据的方法, 它们一旦经过培训, 它们就会在新的测试数据上运行非常快。 然而, 它们的总化能力总是不够。 在本文中, 我们提出一个基于快速模型的基于 HSI 方法的快速性能, 而运行时间不能满足实际情况的快速处理要求 。 RCTV 依据以下观察建议: 具有代表性的系数矩阵 $mathb{ Uncreax} 模型基于所有基于模型的 Rmathbbb{ RNMY{ RN\tib} R\ll B) 方法, 它们总能力总是不够。 我们的普通化的基于原始的HSI $ $\\\\\\ demax deal smoudal roal slation 方法, mode demodeal smodeal sweal modeal lade lad lad lax the sweal sweal lax romode lade s lad de de de lad s s be s be lax be lax be supal romod lad de de de romode lad lad lade lad rogy lad lad rogy rog rogy rogy lax be s be s be be be be be be be be be be s real de s laut laut laut su su lauts m sub laut the s mal de lautd laut the s be be s be s be s be s be de de de de de de de de de de de de de de de de de de de de de de h be de de de de de d laut the de de d ex a mal de de de de de de de de de de de