arXiv subjects

Andrea Sebastiani

Publications and source records attributed to Andrea Sebastiani.

11 recordsLinked to original sources

arXiv2026

Plug-and-Play blind super-resolution of real MRI images for improved multiple sclerosis diagnosis

Magnetic resonance imaging (MRI) is central to the diagnosis of multiple sclerosis, where the identification of biomarkers such as the central vein sign benefits from high-resolution images. However, most clinical brain MRI scans are performed using 1.5 T scanners, which provide lower sensitivity compared to higher-field systems. We propose a blind super-resolution framework to enhance real 1.5 T MRI images acquired in clinical settings, where only post-processed data are available and the degradation model is not fully known. The problem is formulated as a non-convex blind inverse problem involving the joint estimation of the high-resolution image and the blur kernel. Image regularization is handled through a Plug-and-Play strategy based on a pretrained denoiser, while suitable constraints are imposed on the blur kernel. To solve the resulting model, we design a heterogeneous alternating block-coordinate method in which the two variables are updated using different types of algorithms. Convergence properties are rigorously established. Experiments on FLAIR and SWI sequences acquired at 1.5 T show improved structural definition and enhanced visibility of clinically relevant features, with visual comparison against 3 T images.

math.OC↗

arXiv2026

Block-coordinate Plug-And-Play Methods with Armijo-like line-search for Image Restoration

In this paper, we develop a class of block-coordinate forward-backward methods for solving non-convex and non-separable composite optimization problems, and specialize them to imaging inverse problems within the Plug-and-Play (PnP) framework based on Gradient Step (GS) denoisers. The block-coordinate strategy is designed to reduce the high memory consumption associated with the computation of GS denoisers, whose implementation typically requires storing large computational graphs. The proposed methods allow for the joint use of inertial acceleration, variable metric strategies, inexact proximal computations, and adaptive steplength selection via an appropriate line-search procedure. Under mild assumptions on the objective function, we establish a sublinear convergence rate and the stationarity of the limit points. Moreover, convergence of the entire sequence of the iterates is guaranteed under a Kurdyka-{\L}ojasiewicz assumption. Numerical experiments on ill-posed imaging problems, including deblurring and super-resolution, demonstrate that the proposed PnP approach achieves state-of-the-art reconstruction quality while substantially reducing GPU memory requirements, making it particularly suitable for large-scale and resource-constrained imaging applications.

math.OC↗

arXiv2025

RELD: Regularization by Latent Diffusion Models for Image Restoration

In recent years, Diffusion Models have become the new state-of-the-art in deep generative modeling, ending the long-time dominance of Generative Adversarial Networks. Inspired by the Regularization by Denoising principle, we introduce an approach that integrates a Latent Diffusion Model, trained for the denoising task, into a variational framework using Half-Quadratic Splitting, exploiting its regularization properties. This approach, under appropriate conditions that can be easily met in various imaging applications, allows for reduced computational cost while achieving high-quality results. The proposed strategy, called Regularization by Latent Denoising (RELD), is then tested on a dataset of natural images, for image denoising, deblurring, and super-resolution tasks. The numerical experiments show that RELD is competitive with other state-of-the-art methods, particularly achieving remarkable results when evaluated using perceptual quality metrics.

eess.IV↗

arXiv2025

TomoSelfDEQ: Self-Supervised Deep Equilibrium Learning for Sparse-Angle CT Reconstruction

Deep learning has emerged as a powerful tool for solving inverse problems in imaging, including computed tomography (CT). However, most approaches require paired training data with ground truth images, which can be difficult to obtain, e.g., in medical applications. We present TomoSelfDEQ, a self-supervised Deep Equilibrium (DEQ) framework for sparse-angle CT reconstruction that trains directly on undersampled measurements. We establish theoretical guarantees showing that, under suitable assumptions, our self-supervised updates match those of fully-supervised training with a loss including the (possibly non-unitary) forward operator like the CT forward map. Numerical experiments on sparse-angle CT data confirm this finding, also demonstrating that TomoSelfDEQ outperforms existing self-supervised methods, achieving state-of-the-art results with as few as 16 projection angles.

eess.IV↗

arXiv2025

Revisiting $\Psi$DONet: microlocally inspired filters for incomplete-data tomographic reconstructions

In this paper, we revisit a supervised learning approach based on unrolling, known as $\Psi$DONet, by providing a deeper microlocal interpretation for its theoretical analysis, and extending its study to the case of sparse-angle tomography. Furthermore, we refine the implementation of the original $\Psi$DONet considering special filters whose structure is specifically inspired by the streak artifact singularities characterizing tomographic reconstructions from incomplete data. This allows to considerably lower the number of (learnable) parameters while preserving (or even slightly improving) the same quality for the reconstructions from limited-angle data and providing a proof-of-concept for the case of sparse-angle tomographic data.

math.OC↗

arXiv2025

Adaptive Weighted Total Variation boosted by learning techniques in few-view tomographic imaging

This study presents the development of a spatially adaptive weighting strategy for Total Variation regularization, aimed at addressing under-determined linear inverse problems. The method leverages the rapid computation of an accurate approximation of the true image (or its gradient magnitude) through a neural network. Our approach operates without requiring prior knowledge of the noise intensity in the data and avoids the iterative recomputation of weights. Additionally, the paper includes a theoretical analysis of the proposed method, establishing its validity as a regularization approach. This framework integrates advanced neural network capabilities within a regularization context, thereby making the results of the networks interpretable. The results are promising as they enable high-quality reconstructions from limited-view tomographic measurements.

math.NA↗

arXiv2024

Space-Variant Total Variation boosted by learning techniques in few-view tomographic imaging

This paper focuses on the development of a space-variant regularization model for solving an under-determined linear inverse problem. The case study is a medical image reconstruction from few-view tomographic noisy data. The primary objective of the proposed optimization model is to achieve a good balance between denoising and the preservation of fine details and edges, overcoming the performance of the popular and largely used Total Variation (TV) regularization through the application of appropriate pixel-dependent weights. The proposed strategy leverages the role of gradient approximations for the computation of the space-variant TV weights. For this reason, a convolutional neural network is designed, to approximate both the ground truth image and its gradient using an elastic loss function in its training. Additionally, the paper provides a theoretical analysis of the proposed model, showing the uniqueness of its solution, and illustrates a Chambolle-Pock algorithm tailored to address the specific problem at hand. This comprehensive framework integrates innovative regularization techniques with advanced neural network capabilities, demonstrating promising results in achieving high-quality reconstructions from low-sampled tomographic data.

eess.IV↗

arXiv2023

Bilevel learning of regularization models and their discretization for image deblurring and super-resolution

Bilevel learning is a powerful optimization technique that has extensively been employed in recent years to bridge the world of model-driven variational approaches with data-driven methods. Upon suitable parametrization of the desired quantities of interest (e.g., regularization terms or discretization filters), such approach computes optimal parameter values by solving a nested optimization problem where the variational model acts as a constraint. In this work, we consider two different use cases of bilevel learning for the problem of image restoration. First, we focus on learning scalar weights and convolutional filters defining a Field of Experts regularizer to restore natural images degraded by blur and noise. For improving the practical performance, the lower-level problem is solved by means of a gradient descent scheme combined with a line-search strategy based on the Barzilai-Borwein rule. As a second application, the bilevel setup is employed for learning a discretization of the popular total variation regularizer for solving image restoration problems (in particular, deblurring and super-resolution). Numerical results show the effectiveness of the approach and their generalization to multiple tasks.

math.NA↗

arXiv2021

DeepCEL0 for 2D Single Molecule Localization in Fluorescence Microscopy

In fluorescence microscopy, Single Molecule Localization Microscopy (SMLM) techniques aim at localizing with high precision high density fluorescent molecules by stochastically activating and imaging small subsets of blinking emitters. Super Resolution (SR) plays an important role in this field since it allows to go beyond the intrinsic light diffraction limit. In this work, we propose a deep learning-based algorithm for precise molecule localization of high density frames acquired by SMLM techniques whose $\ell_{2}$-based loss function is regularized by positivity and $\ell_{0}$-based constraints. The $\ell_{0}$ is relaxed through its Continuous Exact $\ell_{0}$ (CEL0) counterpart. The arising approach, named DeepCEL0, is parameter-free, more flexible, faster and provides more precise molecule localization maps if compared to the other state-of-the-art methods. We validate our approach on both simulated and real fluorescence microscopy data.

cs.LG↗

arXiv2021

Plug-and-Play gradient-based denoisers applied to CT image enhancement

Blur and noise corrupting Computed Tomography (CT) images can hide or distort small but important details, negatively affecting the diagnosis. In this paper, we present a novel gradient-based Plug-and-Play algorithm, constructed on the Half-Quadratic Splitting scheme, and we apply it to restore CT images. In particular, we consider different schemes encompassing external and internal denoisers as priors, defined on the image gradient domain. The internal prior is based on the Total Variation functional. The external denoiser is implemented by a deep Convolutional Neural Network (CNN) trained on the gradient domain (and not on the image one, as in state-of-the-art works). We also prove a general fixed-point convergence theorem under weak assumptions on both internal and external denoisers. The experiments confirm the effectiveness of the proposed framework in restoring blurred noisy CT images, both in simulated and real medical settings. The achieved enhancements in the restored images are really remarkable, if compared to the results of many state-of-the-art methods.

math.NA↗

arXiv2020

Combining Weighted Total Variation and Deep Image Prior for natural and medical image restoration via ADMM

In the last decades, unsupervised deep learning based methods have caught researchers attention, since in many real applications, such as medical imaging, collecting a great amount of training examples is not always feasible. Moreover, the construction of a good training set is time consuming and hard because the selected data have to be enough representative for the task. In this paper, we focus on the Deep Image Prior (DIP) framework and we propose to combine it with a space-variant Total Variation regularizer with an automatic estimation of the local regularization parameters. Differently from other existing approaches, we solve the arising minimization problem via the flexible Alternating Direction Method of Multipliers (ADMM). Furthermore, we provide a specific implementation also for the standard isotropic Total Variation. The promising performances of the proposed approach, in terms of PSNR and SSIM values, are addressed through several experiments on simulated as well as real natural and medical corrupted images.

eess.IV↗