An unrolled graph denoiser combining a truncated Taylor expansion with fixed-step conjugate gradient is proven to realize only polynomial graph filters of degree at most K(m-1), a measure-zero subset of its nominal degree budget.
Deep Graph Laplacian Regularization for Robust Denoising of Real Images
1 Pith paper cite this work. Polarity classification is still indexing.
abstract
Recent developments in deep learning have revolutionized the paradigm of image restoration. However, its applications on real image denoising are still limited, due to its sensitivity to training data and the complex nature of real image noise. In this work, we combine the robustness merit of model-based approaches and the learning power of data-driven approaches for real image denoising. Specifically, by integrating graph Laplacian regularization as a trainable module into a deep learning framework, we are less susceptible to overfitting than pure CNN-based approaches, achieving higher robustness to small datasets and cross-domain denoising. First, a sparse neighborhood graph is built from the output of a convolutional neural network (CNN). Then the image is restored by solving an unconstrained quadratic programming problem, using a corresponding graph Laplacian regularizer as a prior term. The proposed restoration pipeline is fully differentiable and hence can be end-to-end trained. Experimental results demonstrate that our work is less prone to overfitting given small training data. It is also endowed with strong cross-domain generalization power, outperforming the state-of-the-art approaches by a remarkable margin.
citation-role summary
citation-polarity summary
fields
eess.SP 1years
2026 1verdicts
CONDITIONAL 1roles
other 1polarities
unclear 1representative citing papers
citing papers explorer
-
Unrolling a Graph-Laplacian Denoiser Realizes Only Compositions of Polynomial Graph Filters
An unrolled graph denoiser combining a truncated Taylor expansion with fixed-step conjugate gradient is proven to realize only polynomial graph filters of degree at most K(m-1), a measure-zero subset of its nominal degree budget.