LGCVITIVOct 2, 2023

Batch-less stochastic gradient descent for compressive learning of deep regularization for image denoising

arXiv:2310.03085v11 citationsh-index: 37
Originality Incremental advance
AI Analysis

This work addresses computational efficiency in learning deep regularization for image denoising, which is an incremental improvement for researchers in compressive learning and image processing.

The paper tackles the problem of learning deep regularizers for image denoising from compressed databases by proposing two variants of stochastic gradient descent (SGD) that reduce computational burden and outperform prior methods limited to low-dimensional signals, enabling application to patch-based image denoising.

We consider the problem of denoising with the help of prior information taken from a database of clean signals or images. Denoising with variational methods is very efficient if a regularizer well adapted to the nature of the data is available. Thanks to the maximum a posteriori Bayesian framework, such regularizer can be systematically linked with the distribution of the data. With deep neural networks (DNN), complex distributions can be recovered from a large training database.To reduce the computational burden of this task, we adapt the compressive learning framework to the learning of regularizers parametrized by DNN. We propose two variants of stochastic gradient descent (SGD) for the recovery of deep regularization parameters from a heavily compressed database. These algorithms outperform the initially proposed method that was limited to low-dimensional signals, each iteration using information from the whole database. They also benefit from classical SGD convergence guarantees. Thanks to these improvements we show that this method can be applied for patch based image denoising.}

Foundations

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

Your Notes