# Graph Laplacian Regularization for Image Denoising: Analysis in the Continuous Domain

arXiv: https://arxiv.org/abs/1604.07948 · HTML: https://mlsanity.com/paper/1604.07948/

## Key facts

- Cited by 15 papers in the map (data through 14 Oct 2026).
- First posted on arXiv 27 Apr 2016.

## Built on by (most cited first, 15 of 15)

- [Interpretable Lightweight Transformer via Unrolling of Learned Graph Smoothness Priors](https://mlsanity.com/paper/2406.04090/) (2024)
- [Efficient Signed Graph Sampling via Balancing & Gershgorin Disc Perfect Alignment](https://mlsanity.com/paper/2208.08726/) (2022)
- [Efficient Learning of Balanced Signed Graphs via Iterative Linear Programming](https://mlsanity.com/paper/2409.07794/) (2024)
- [Sparse Graph Learning with Spectrum Prior for Deep Graph Convolutional Networks](https://mlsanity.com/paper/2202.13526/) (2022)
- [Retinex-based Image Denoising / Contrast Enhancement using Gradient Graph Laplacian Regularizer](https://mlsanity.com/paper/2307.02625/) (2023)
- [Projection-free Graph-based Classifier Learning using Gershgorin Disc Perfect Alignment](https://mlsanity.com/paper/2106.01642/) (2021)
- [Unfolding Projection-free SDP Relaxation of Binary Graph Classifier via GDPA Linearization](https://mlsanity.com/paper/2109.04697/) (2021)
- [Fast Computation of Generalized Eigenvectors for Manifold Graph Embedding](https://mlsanity.com/paper/2112.07862/) (2021)
- [Graph Spatio-Spectral Total Variation Model for Hyperspectral Image Denoising](https://mlsanity.com/paper/2207.11050/) (2022)
- [Unsupervised Graph Spectral Feature Denoising for Crop Yield Prediction](https://mlsanity.com/paper/2208.02714/) (2022)
- [Constructing an Interpretable Deep Denoiser by Unrolling Graph Laplacian Regularizer](https://mlsanity.com/paper/2409.06676/) (2024)
- [Lightweight and Interpretable Transformer via Mixed Graph Algorithm Unrolling for Traffic Forecast](https://mlsanity.com/paper/2505.13102/) (2025)
- [Efficient Learning of Balanced Signed Graphs via Sparse Linear Programming](https://mlsanity.com/paper/2506.01826/) (2025)
- [Unrolling Nonconvex Graph Total Variation for Image Denoising](https://mlsanity.com/paper/2506.02381/) (2025)
- [Lightweight Transformer for EEG Classification via Balanced Signed Graph Algorithm Unrolling](https://mlsanity.com/paper/2510.03027/) (2025)

## Abstract (arXiv)

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.