期刊
SIGNAL PROCESSING
卷 201, 期 -, 页码 -出版社
ELSEVIER
DOI: 10.1016/j.sigpro.2022.108733
关键词
Low-rank matrix factorization; Low-rank tensor factorization; Hyperspectral image denoising
资金
- National Key Research and Development Program of China [2018AAA0102201]
- Fundamental Research Funds for the Central Universities [D5000220060]
- National Natural Science Foundation of China [61976174]
This paper proposes a new method for hyperspectral image denoising, called Hyper-Laplacian spectral-spatial total variation (HTV), and designs two low-rank models. Experimental results demonstrate the superiority of the HTV method over traditional TV regularization methods and other commonly used hyperspectral image denoising algorithms.
The total variation (TV) regularized low-rank models have emerged as a powerful tool for hyperspectral image (HSI) denoising. TV, defined by the pound 1-norm of gradients, is assumed that gradients obey the Lapla-cian distribution from the statistics point of view. By investigating the histogram of HSI's gradients, we find that gradients in real HSIs are actually distributed as the hyper-Laplacian distribution with the power parameter q = 1 1 2 . Taking this prior into account, a hyper-Laplacian spectral-spatial total variation (HTV), defined by the pound 1 1 2-norm of gradients, is proposed for HSI denoising. Furthermore, by incorporating HTV as the regularizer, a low-rank matrix model and a low-rank tensor model are proposed. The two models can be solved by the augmented Lagrange multiplier algorithm. To validate the effectiveness of HTV, we formulate baseline models by replacing HTV with pound 1-norm and pound 0-norm based TV regularizations, and it is revealed that our proposed HTV outperforms them. Furthermore, compared with several popular HSI denoising algorithms, the experiments conducted on both the simulated and real data demonstrate the superiority of proposed models.(c) 2022 Elsevier B.V. All rights reserved.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据