Learning of Patch-Based Smooth-Plus-Sparse Models for Image Reconstruction

Stanislas Ducotterd, Sebastian Neumayer, Michael Unser
12/17/2024
eess.IVcs.CVcs.LG

No official code found. Best implementation: StanislasDucotterd/Smooth_Plus_Sparse_Model (0 stars, MIT, last commit 2025-06-30).

Abstract

We aim at the solution of inverse problems in imaging, by combining a penalized sparse representation of image patches with an unconstrained smooth one. This allows for a straightforward interpretation of the reconstruction. We formulate the optimization as a bilevel problem. The inner problem deploys classical algorithms while the outer problem optimizes the dictionary and the regularizer parameters through supervised learning. The process is carried out via implicit differentiation and gradient-based optimization. We evaluate our method for denoising, super-resolution, and compressed-sensing magnetic-resonance imaging. We compare it to other classical models as well as deep-learning-based methods and show that it always outperforms the former and also the latter in some instances.

View on arXivView PDF

Code Implementations(1)

MIT
00PythonNov 27, 20241 years agoMIT

Similar Papers

Cite this paper

@article{ducotterd2024learning,
  title  = {Learning of Patch-Based Smooth-Plus-Sparse Models for Image Reconstruction},
  author = {Stanislas Ducotterd and Sebastian Neumayer and Michael Unser},
  year   = {2024},
  eprint = {2412.13070},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2412.13070v2}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/2412.13070.svg)](https://codeofpaper.com/paper/2412.13070)

Discussion