Graph Laplacian Regularization for Image Denoising: Analysis in the Continuous Domain
From MaRDI portal
Abstract: Inverse imaging problems are inherently under-determined, and hence it is important to employ appropriate image priors for regularization. One recent popular prior---the graph Laplacian regularizer---assumes that the target pixel patch is smooth with respect to an appropriately chosen graph. However, the mechanisms and implications of imposing the graph Laplacian regularizer on the original inverse problem are not well understood. To address this problem, in this paper we interpret neighborhood graphs of pixel patches as discrete counterparts of Riemannian manifolds and perform analysis in the continuous domain, providing insights into several fundamental aspects of graph Laplacian regularization for image denoising. Specifically, we first show the convergence of the graph Laplacian regularizer to a continuous-domain functional, integrating a norm measured in a locally adaptive metric space. Focusing on image denoising, we derive an optimal metric space assuming non-local self-similarity of pixel patches, leading to an optimal graph Laplacian regularizer for denoising in the discrete domain. We then interpret graph Laplacian regularization as an anisotropic diffusion scheme to explain its behavior during iterations, e.g., its tendency to promote piecewise smooth signals under certain settings. To verify our analysis, an iterative image denoising algorithm is developed. Experimental results show that our algorithm performs competitively with state-of-the-art denoising methods such as BM3D for natural images, and outperforms them significantly for piecewise smooth images.
Cited in
(17)- A novel blind restoration and reconstruction approach for CT images based on sparse representation and hierarchical Bayesian-MAP
- Graph Laplacian for image deblurring
- Progressive Image Denoising Through Hybrid Graph Laplacian Regularization: A Unified Framework
- Structure-Based Low-Rank Model With Graph Nuclear Norm Regularization for Noise Removal
- Doubly stochastic normalization of the Gaussian kernel is robust to heteroskedastic noise
- Split-Douglas-Rachford algorithm for composite monotone inclusions and split-ADMM
- Deep Graph-Convolutional Image Denoising
- The Steerable Graph Laplacian and its Application to Filtering Image Datasets
- Laplacian pair-weight vector projection for semi-supervised learning
- Robust Inference of Manifold Density and Geometry by Doubly Stochastic Scaling
- Fractional graph Laplacian for image reconstruction
- A fractional graph \(\mathrm{La}+\varPsi\) approach to image reconstruction
- A spatially variable coupled PDE-based model for image denoising using a split Bregman algorithm
- Dip-based anisotropic total variation regularization for image denoising
- Channel interaction graph Laplacian regularizer for blind color image deblurring
- Local and nonlocal discrete regularization on weighted graphs for image and mesh processing
- Nonlocal video denoising, simplification and inpainting using discrete regularization on graphs
This page was built for publication: Graph Laplacian Regularization for Image Denoising: Analysis in the Continuous Domain
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4618723)
