Reweighted Low-Rank Matrix Analysis With Structural Smoothness for Image Denoising

2018 ◽  
Vol 27 (4) ◽  
pp. 1777-1792 ◽  
Author(s):  
Hengyou Wang ◽  
Yigang Cen ◽  
Zhiquan He ◽  
Zhihai He ◽  
Ruizhen Zhao ◽  
...  
Author(s):  
Daichi Kitamura ◽  
Shinichi Mogami ◽  
Yoshiki Mitsui ◽  
Norihiro Takamune ◽  
Hiroshi Saruwatari ◽  
...  

2021 ◽  
Vol 13 (4) ◽  
pp. 827
Author(s):  
Fang Yang ◽  
Xin Chen ◽  
Li Chai

Hyperspectral image (HSI) is easily corrupted by different kinds of noise, such as stripes, dead pixels, impulse noise, Gaussian noise, etc. Due to less consideration of the structural specificity of stripes, many existing HSI denoising methods cannot effectively remove the heavy stripes in mixed noise. In this paper, we classify the noise on HSI into three types: sparse noise, stripe noise, and Gaussian noise. The clean image and different types of noise are treated as independent components. In this way, the image denoising task can be naturally regarded as an image decomposition problem. Thanks to the structural characteristic of stripes and the low-rank property of HSI, we propose to destripe and denoise the HSI by using stripe and spectral low-rank matrix recovery and combine it with the global spatial-spectral TV regularization (SSLR-SSTV). By considering different properties of different HSI ingredients, the proposed method separates the original image from the noise components perfectly. Both simulation and real image denoising experiments demonstrate that the proposed method can achieve a satisfactory denoising result compared with the state-of-the-art methods. Especially, it outperforms the other methods in the task of stripe noise removal visually and quantitatively.


Entropy ◽  
2021 ◽  
Vol 23 (2) ◽  
pp. 158
Author(s):  
Jiucheng Xu ◽  
Yihao Cheng ◽  
Yuanyuan Ma

Traditional image denoising algorithms obtain prior information from noisy images that are directly based on low rank matrix restoration, which pays little attention to the nonlocal self-similarity errors between clear images and noisy images. This paper proposes a new image denoising algorithm based on low rank matrix restoration in order to solve this problem. The proposed algorithm introduces the non-local self-similarity error between the clear image and noisy image into the weighted Schatten p-norm minimization model using the non-local self-similarity of the image. In addition, the low rank error is constrained by using Schatten p-norm to obtain a better low rank matrix in order to improve the performance of the image denoising algorithm. The results demonstrate that, on the classic data set, when comparing with block matching 3D filtering (BM3D), weighted nuclear norm minimization (WNNM), weighted Schatten p-norm minimization (WSNM), and FFDNet, the proposed algorithm achieves a higher peak signal-to-noise ratio, better denoising effect, and visual effects with improved robustness and generalization.


Sign in / Sign up

Export Citation Format

Share Document