CVJul 31, 2018

Deep Graph Laplacian Regularization for Robust Denoising of Real Images

arXiv:1807.11637v339 citations
Originality Incremental advance
AI Analysis

This addresses the problem of limited real image denoising applications in deep learning due to data sensitivity and noise complexity, offering an incremental improvement.

The paper tackled real image denoising by combining graph Laplacian regularization with deep learning to reduce overfitting and improve robustness, achieving state-of-the-art performance with strong cross-domain generalization.

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.

Code Implementations1 repo
Foundations

The foundational work for this paper's niche, ranked by how specifically the neighbourhood builds on it — not by global fame.

Your Notes