arXiv Computer Vision
A Cone-Constrained Bilinear Decomposition for Total Scaled-Gradient Variation Models
Read the original on arXiv Computer Vision →The Flow has not summarised this story yet — read it at arXiv Computer Vision.
Related stories
arXiv Computer Vision
Sep 15
A Globally Convergent Algorithm for Total Scaled-Gradient Variation via Cone-Constrained Bilinear Decomposition
arXiv:2609.00036v2 Announce Type: replace Abstract: The total scaled-gradient variation (TSGV) regularizer, derived from sparse modeling of piecewise-linear structures, has been shown to preserve edg...
arXiv Computer Vision
Sep 23
Directional Total Variation-Regularized Implicit Neural Representations (DTV-INR) for Continuous Super-Resolution in Degraded Imaging Domains
arXiv:2609.25429v1 Announce Type: new Abstract: In this paper, we introduce the Directional Total Variation-Regularized Implicit Neural Representation (DTV-INR), an advanced variational paradigm that...
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.
arXiv Machine Learning
Aug 6
A geometry-based deep equilibrium model for image restoration under multiplicative Gamma noise
arXiv:2608. 04944v1 Announce Type: cross Abstract: We propose a deep learning framework for image restoration from images degraded by both multiplicative Gamma noise and blur.
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.
arXiv Computer Vision
Aug 24
A Dual-domain Refinement Network with FBP-based Jacobian Learning for Sparse-view Dual-Energy CT Material Decomposition
arXiv:2606.30159v2 Announce Type: replace Abstract: Dual-energy CT (DECT) exploits attenuation differences across different X-ray spectra to provide richer material information and has been widely us...