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

• URL: http://arxiv.org/abs/2412.13070v1
• Date: Tue, 17 Dec 2024 16:34:32 GMT
• Title: Learning of Patch-Based Smooth-Plus-Sparse Models for Image Reconstruction
• Authors: Stanislas Ducotterd, Sebastian Neumayer, Michael Unser,
• Abstract summary: We formulate the optimization as a bilevel problem. We evaluate our method for denoising, super-resolution, and compressed-sensing magnetic-resonance imaging.
• Score: 14.93489065234423
• License:
• 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.

Related papers

• DDGM: Solving inverse problems by Diffusive Denoising of Gradient-based Minimization [4.209801809583906]
  A recent trend is to train a convolutional net to denoise images, and use this net as a prior when solving the inverse problem. Here we propose a simpler approach that combines the traditional gradient-based minimization of reconstruction error with denoising. We show that high accuracy can be achieved with as few as 50 denoising steps.
  arXiv  Detail & Related papers  (2023-07-11T00:21:38Z)
• On Measuring and Controlling the Spectral Bias of the Deep Image Prior [63.88575598930554]
  The deep image prior has demonstrated the remarkable ability that untrained networks can address inverse imaging problems. It requires an oracle to determine when to stop the optimization as the performance degrades after reaching a peak. We study the deep image prior from a spectral bias perspective to address these problems.
  arXiv  Detail & Related papers  (2021-07-02T15:10:42Z)
• Efficient and Differentiable Shadow Computation for Inverse Problems [64.70468076488419]
  Differentiable geometric computation has received increasing interest for image-based inverse problems. We propose an efficient yet efficient approach for differentiable visibility and soft shadow computation. As our formulation is differentiable, it can be used to solve inverse problems such as texture, illumination, rigid pose, and deformation recovery from images.
  arXiv  Detail & Related papers  (2021-04-01T09:29:05Z)
• Learned Block Iterative Shrinkage Thresholding Algorithm for Photothermal Super Resolution Imaging [52.42007686600479]
  We propose a learned block-sparse optimization approach using an iterative algorithm unfolded into a deep neural network. We show the benefits of using a learned block iterative shrinkage thresholding algorithm that is able to learn the choice of regularization parameters.
  arXiv  Detail & Related papers  (2020-12-07T09:27:16Z)
• Generalized Intersection Algorithms with Fixpoints for Image Decomposition Learning [1.237556184089774]
  We formalize a general class of intersection point problems encompassing a wide range of (learned) image decomposition models. This class generalizes classical model-based variational problems, such as TV-l2 -model or the more general TV-Hilbert model.
  arXiv  Detail & Related papers  (2020-10-16T22:55:34Z)
• Deep Variational Network Toward Blind Image Restoration [60.45350399661175]
  Blind image restoration is a common yet challenging problem in computer vision. We propose a novel blind image restoration method, aiming to integrate both the advantages of them. Experiments on two typical blind IR tasks, namely image denoising and super-resolution, demonstrate that the proposed method achieves superior performance over current state-of-the-arts.
  arXiv  Detail & Related papers  (2020-08-25T03:30:53Z)
• Learnable Descent Algorithm for Nonsmooth Nonconvex Image Reconstruction [4.2476585678737395]
  We propose a general learning based framework for solving nonsmooth non image reconstruction problems. We show that the proposed is-efficient convergence state-of-the-art methods in an image problems in training.
  arXiv  Detail & Related papers  (2020-07-22T07:59:07Z)
• A Flexible Framework for Designing Trainable Priors with Adaptive Smoothing and Game Encoding [57.1077544780653]
  We introduce a general framework for designing and training neural network layers whose forward passes can be interpreted as solving non-smooth convex optimization problems. We focus on convex games, solved by local agents represented by the nodes of a graph and interacting through regularization functions. This approach is appealing for solving imaging problems, as it allows the use of classical image priors within deep models that are trainable end to end.
  arXiv  Detail & Related papers  (2020-06-26T08:34:54Z)
• The Power of Triply Complementary Priors for Image Compressive Sensing [89.14144796591685]
  We propose a joint low-rank deep (LRD) image model, which contains a pair of complementaryly trip priors. We then propose a novel hybrid plug-and-play framework based on the LRD model for image CS. To make the optimization tractable, a simple yet effective algorithm is proposed to solve the proposed H-based image CS problem.
  arXiv  Detail & Related papers  (2020-05-16T08:17:44Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.