Optimal graph laplacian regularization for natural image denoising

Author(s):  
Jiahao Pang ◽  
Gene Cheung ◽  
Antonio Ortega ◽  
Oscar C. Au
Author(s):  
Fang Yang ◽  
Xin Chen ◽  
Li Chai

AbstractNon-local Means (NLMs) play essential roles in image denoising, restoration, inpainting, etc., due to its simple theory but effective performance. However, when the noise increases, the denoising accuracy of NLMs decreases significantly. This paper further develop the NLMs-based denoising method to remove noise with less loss of image details. It is realized by embedding an optimal graph edge weights driven NLMs kernel into a multi-layer residual compensation framework. Unlike the patch similarity-based weights in the traditional NLMs filters, the edge weights derived from the optimal graph Laplacian regularization consider (1) the distance between the target pixel and the candidate pixel, (2) the local gradient and (3) the patch similarity. After defining the weights, the graph-based NLMs kernel is then put into a multi-layer framework. The corresponding primal and residual terms at each layer are finally fused with learned weights to recover the image. Experimental results show that our method is effective and robust, especially for piecewise smooth images.


2021 ◽  
Author(s):  
Fang Yang ◽  
Xin Chen ◽  
Li Chai

Abstract Non-Local Means (NLMs) play important roles in image denoising, restoration, inpainting etc. due to its simple theory but effective performance. In this paper, in order to better remove noise without loss of image details, we further develop the NLMs based denoising method. It is realized by introducing a graph Laplacian regularization based weighting model and a multi-layer residual compensation strategy. Unlike the patch similarity based weights in classic NLMs filters, the graph Laplacian regularization defines the weights by considering 1) the distance between target pixel and the candidate pixel, 2) the local gradient and 3) the patch similarity. The proposed NLMs filter performs in a multi-layer framework to better remove the noise and smooth the result. The corresponding residuals at each layer are finally combined with the smooth image with learned weights to recover the image details. Experimental results show that our method is effective and robust, especially for piecewise-smooth images.


2014 ◽  
Vol 23 (4) ◽  
pp. 1491-1503 ◽  
Author(s):  
Xianming Liu ◽  
Deming Zhai ◽  
Debin Zhao ◽  
Guangtao Zhai ◽  
Wen Gao

2015 ◽  
Vol 14 (02) ◽  
pp. 1550017
Author(s):  
Pichid Kittisuwan

The application of image processing in industry has shown remarkable success over the last decade, for example, in security and telecommunication systems. The denoising of natural image corrupted by Gaussian noise is a classical problem in image processing. So, image denoising is an indispensable step during image processing. This paper is concerned with dual-tree complex wavelet-based image denoising using Bayesian techniques. One of the cruxes of the Bayesian image denoising algorithms is to estimate the statistical parameter of the image. Here, we employ maximum a posteriori (MAP) estimation to calculate local observed variance with generalized Gamma density prior for local observed variance and Laplacian or Gaussian distribution for noisy wavelet coefficients. Evidently, our selection of prior distribution is motivated by efficient and flexible properties of generalized Gamma density. The experimental results show that the proposed method yields good denoising results.


2018 ◽  
Vol 23 (17) ◽  
pp. 8013-8027 ◽  
Author(s):  
Asem Khmag ◽  
Abd Rahman Ramli ◽  
Noraziahtulhidayu Kamarudin

Sign in / Sign up

Export Citation Format

Share Document