arXiv Computer Vision

A Globally Convergent Algorithm for Total Scaled-Gradient Variation via Cone-Constrained Bilinear Decomposition

arXiv Computer Vision
Aug 27

Learning spatially varying regularisation parameters of low regularity for image reconstruction

The article reviews how spatially adaptive regularisation weight functions can be incorporated into variational image reconstruction models like Total Variation and Total Generalised Variation. It discusses the regularity properties of these weights—constant, continuous, or piecewise constant—and how they influence edge and detail preservation. The authors highlight recent hybrid methods that learn low‑regularity weights via deep neural networks, demonstrating their effectiveness in image denoising and MRI reconstruction.

By Kostas Papafitsoros, Luca Calatroni, Andreas Kofler
arXiv Machine Learning
1d ago

Convergent Plug-and-Play Image Restoration with Annealed Noise Levels

The paper presents convergence guarantees for Plug-and-Play (PnP) image restoration algorithms that use annealed noise levels, covering both deterministic and stochastic methods. It identifies explicit nonconvex objectives linked to the final denoising level and proves that iterates become asymptotically stationary with respect to these objectives, without requiring a specific noise decay schedule. The authors validate their theory experimentally on tasks such as inpainting, super‑resolution, demosaicing, and tomography.

By Samuel Hurault
arXiv Machine Learning
Sep 11

Sublinear Variational Optimization of Gaussian Mixture Models with Millions to Billions of Parameters

The paper introduces a highly efficient variational approximation for Gaussian Mixture Models (GMMs) with arbitrary covariances, integrated with mixtures of factor analyzers. This method reduces the per‑iteration runtime from ≠O(NCD^2) to a complexity that scales linearly with dimensionality D and sublinearly with the product NC. Experiments demonstrate sublinear scaling across the entire optimization, order‑of‑magnitude speed‑ups on large benchmarks, training of GMMs with over 10 billion parameters in under nine hours on a single CPU, and competitive zero‑shot image denoising performance.

By Sebastian Salwig, Till Kahlke, Florian Hirschberger, Dennis Forster, J\"org L\"ucke
Hugging Face Trending Papers
Jun 29

A Dual-domain Refinement Network with FBP-based Jacobian Learning for Sparse-view Dual-Energy CT Material Decomposition

Dual-energy CT (DECT) exploits attenuation differences across different X-ray spectra to provide richer material information and has been widely used in medical imaging. While sparse-view acquisition can lower radiation exposure, it makes DECT material decomposition even more challenging, as the problem is nonlinear and ill-posed.

arXiv Machine Learning
Jun 4

Plug-and-Play Diffusion Meets ADMM: Dual-Variable Coupling for Robust Medical Image Reconstruction

arXiv:2602. 23214v2 Announce Type: replace-cross Abstract: Plug-and-Play diffusion prior (PnPDP) frameworks have emerged as a powerful paradigm for solving imaging inverse problems by treating pretrained generative models as modular priors.

By Chenhe Du, Xuanyu Tian, Qing Wu, Muyu Liu, Jingyi Yu, Hongjiang Wei, Yuyao Zhang
Hugging Face Trending Papers
Jun 21

Projection-Volume Fidelity Divergence: Diagnosing and Controlling Optimization Drift in Sparse-View 3D Gaussian Tomography

Sparse-view computed tomography is a severely ill-posed inverse problem, where recent 3D Gaussian Splatting methods offer an efficient explicit representation for tomographic reconstruction. However, we find that projection-domain optimization can be misleading in this setting: the rendered projections may continue to improve while the reconstructed volume deteriorates.