DEALing with Image Reconstruction: Deep Attentive Least Squares

• URL: http://arxiv.org/abs/2502.04079v1
• Date: Thu, 06 Feb 2025 13:43:28 GMT
• Title: DEALing with Image Reconstruction: Deep Attentive Least Squares
• Authors: Mehrsa Pourya, Erich Kobler, Michael Unser, Sebastian Neumayer,
• Abstract summary: We propose a data-driven reconstruction method inspired by the classic Tikhonov regularization. Our approach iteratively refines intermediate reconstructions by solving a sequence of quadratic problems. Our method achieves performance on par with leading plug-and-play and learned regularizer approaches.
• Score: 15.746202603806852
• License:
• Abstract: State-of-the-art image reconstruction often relies on complex, highly parameterized deep architectures. We propose an alternative: a data-driven reconstruction method inspired by the classic Tikhonov regularization. Our approach iteratively refines intermediate reconstructions by solving a sequence of quadratic problems. These updates have two key components: (i) learned filters to extract salient image features, and (ii) an attention mechanism that locally adjusts the penalty of filter responses. Our method achieves performance on par with leading plug-and-play and learned regularizer approaches while offering interpretability, robustness, and convergent behavior. In effect, we bridge traditional regularization and deep learning with a principled reconstruction approach.

Related papers

• Learning of Patch-Based Smooth-Plus-Sparse Models for Image Reconstruction [14.93489065234423]
  We formulate the optimization as a bilevel problem. We evaluate our method for denoising, super-resolution, and compressed-sensing magnetic-resonance imaging.
  arXiv  Detail & Related papers  (2024-12-17T16:34:32Z)
• ReMatching Dynamic Reconstruction Flow [55.272357926111454]
  We introduce the ReMatching framework, designed to improve generalization quality by incorporating deformation priors into dynamic reconstruction models. The framework is highly adaptable and can be applied to various dynamic representations. Our evaluations on popular benchmarks involving both synthetic and real-world dynamic scenes demonstrate a clear improvement in reconstruction accuracy of current state-of-the-art models.
  arXiv  Detail & Related papers  (2024-11-01T16:09:33Z)
• Iteratively Refined Image Reconstruction with Learned Attentive Regularizers [14.93489065234423]
  We propose a regularization scheme for image reconstruction that leverages the power of deep learning. Our scheme is interpretable because it corresponds to the minimization of a series of convex problems. We offer a promising balance between interpretability, theoretical guarantees, reliability, and performance.
  arXiv  Detail & Related papers  (2024-07-09T07:22:48Z)
• Nest-DGIL: Nesterov-optimized Deep Geometric Incremental Learning for CS Image Reconstruction [9.54126979075279]
  We propose a deep geometric incremental learning framework based on the second Nesterov proximal gradient optimization. Our reconstruction framework is decomposed into four modules including general linear reconstruction, cascade geometric incremental restoration, Nesterov acceleration, and post-processing.
  arXiv  Detail & Related papers  (2023-08-06T15:47:03Z)
• Rank-Enhanced Low-Dimensional Convolution Set for Hyperspectral Image Denoising [50.039949798156826]
  This paper tackles the challenging problem of hyperspectral (HS) image denoising. We propose rank-enhanced low-dimensional convolution set (Re-ConvSet) We then incorporate Re-ConvSet into the widely-used U-Net architecture to construct an HS image denoising method.
  arXiv  Detail & Related papers  (2022-07-09T13:35:12Z)
• Learning Discriminative Shrinkage Deep Networks for Image Deconvolution [122.79108159874426]
  We propose an effective non-blind deconvolution approach by learning discriminative shrinkage functions to implicitly model these terms. Experimental results show that the proposed method performs favorably against the state-of-the-art ones in terms of efficiency and accuracy.
  arXiv  Detail & Related papers  (2021-11-27T12:12:57Z)
• Deep Reparametrization of Multi-Frame Super-Resolution and Denoising [167.42453826365434]
  We propose a deep reparametrization of the maximum a posteriori formulation commonly employed in multi-frame image restoration tasks. Our approach is derived by introducing a learned error metric and a latent representation of the target image. We validate our approach through comprehensive experiments on burst denoising and burst super-resolution datasets.
  arXiv  Detail & Related papers  (2021-08-18T17:57:02Z)
• End-to-end reconstruction meets data-driven regularization for inverse problems [2.800608984818919]
  We propose an unsupervised approach for learning end-to-end reconstruction operators for ill-posed inverse problems. The proposed method combines the classical variational framework with iterative unrolling. We demonstrate with the example of X-ray computed tomography (CT) that our approach outperforms state-of-the-art unsupervised methods.
  arXiv  Detail & Related papers  (2021-06-07T12:05:06Z)
• Learning local regularization for variational image restoration [3.5557219875516655]
  We propose a framework to learn a local regularization model for solving general image restoration problems. This regularizer is defined with a fully convolutional neural network that sees the image through a receptive field corresponding to small image patches. The regularizer is then learned as a critic between unpaired distributions of clean and degraded patches using a Wasserstein generative adversarial networks based energy.
  arXiv  Detail & Related papers  (2021-02-11T17:55:08Z)
• Shared Prior Learning of Energy-Based Models for Image Reconstruction [69.72364451042922]
  We propose a novel learning-based framework for image reconstruction particularly designed for training without ground truth data. In the absence of ground truth data, we change the loss functional to a patch-based Wasserstein functional. In shared prior learning, both aforementioned optimal control problems are optimized simultaneously with shared learned parameters of the regularizer.
  arXiv  Detail & Related papers  (2020-11-12T17:56:05Z)
• 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)

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.