arXiv subjects

Jean-François Giovannelli

Publications and source records attributed to Jean-François Giovannelli.

12 recordsLinked to original sources

arXiv2026

Getting Your Guidance Weights Right in diffusion and flow-matching posterior sampling

Training-free posterior sampling methods, also known as Plug-and-Play methods, leverage pretrained unconditional diffusion or flow-matching models to solve inverse problems. Most existing approaches rely on guidance weights to balance, at each time step, prior information from the unconditional score or velocity network with measurement consistency, yet the tuning of these weights is often not discussed and is largely left to heuristics. We introduce a simple and principled offline strategy for automatically tuning these guidance weights. Our key observation is that, at each time step, the conditional denoising score-matching objective for diffusion models, or the conditional flow-matching objective for flow-matching models, is a least-squares objective. Therefore, when the conditional prediction is expressed as a weighted sum of the unconditional network output and a measurement-guidance term, optimizing over these weights reduces to a two-dimensional linear least-squares problem. The resulting time-dependent guidance weights can be optimized offline for a given measurement operator, noise level and sampler at the cost of a single minibatch of sampling trajectories, without retraining or fine-tuning the pretrained generative model. Instantiated with the standard Tweedie-based measurement-consistency term, our approach improves posterior sampling and achieves state-of-the-art reconstruction performance across diffusion- and flow-matching-based methods. Moreover, the optimized guidance weights enable diffusion samplers to reduce the number of sampling steps from 1000 to 50 with no significant degradation in reconstruction quality. Code will be made available.

cs.LG↗

arXiv2026

A Gibbs posterior sampler for inverse problem based on prior diffusion model

This paper addresses the issue of inversion in cases where (1) the observation system is modeled by a linear transformation and additive error, (2) the problem is ill-posed and regularization relies on a Bayesian strategy, (3)~the prior is modeled by a diffusion process adjusted on an available large set of examples. In this context, it is known that the issue of posterior sampling is a thorny one and the paper introduces a Gibbs algorithm. It appears that this avenue has not been explored, and we show that it is particularly effective and remarkably simple. In addition, it provides clear elements regarding convergence guarantees in a specific case and arguments supporting such guarantees in practical cases. The results are clearly confirmed by numerical simulations based on a toy example.

stat.ML↗

arXiv2026

Estimation of instrument and noise parameters for inverse problem based on prior diffusion model

This article addresses the issue of estimating observation parameters (response and error parameters) in inverse problems. The focus is on cases where regularization is introduced in a Bayesian framework and the prior is modeled by a diffusion process. In this context, the issue of posterior sampling is known to be thorny, and a recent paper proposes a notably simple and effective solution. Additionally, it opens an remarkable flexibility when it comes to estimating observation parameters. The proposed strategy enables to define an optimal estimator for both observation parameters and image of interest. Furthermore, the strategy provides a means for uncertainty quantification. In addition, MCMC algorithms allow for the computation of estimates and properties of posteriors, while offering some guarantees. The paper presents several numerical experiments that clearly confirm the computational efficiency and the quality of both estimates and uncertainty quantification.

stat.ML↗

arXiv2025

Evaluating the Posterior Sampling Ability of Plug&Play Diffusion Methods in Sparse-View CT

Plug&Play (PnP) diffusion models are state-of-the-art methods in computed tomography (CT) reconstruction. Such methods usually consider applications where the sinogram contains a sufficient amount of information for the posterior distribution to be concentrated around a single mode, and consequently are evaluated using image-to-image metrics such as PSNR/SSIM. Instead, we are interested in reconstructing compressible flow images from sinograms having a small number of projections, which results in a posterior distribution no longer concentrated or even multimodal. Thus, in this paper, we aim at evaluating the approximate posterior of PnP diffusion models and introduce two posterior evaluation properties. We quantitatively evaluate three PnP diffusion methods on three different datasets for several numbers of projections. We surprisingly find that, for each method, the approximate posterior deviates from the true posterior when the number of projections decreases.

eess.IV↗

arXiv2024

A stochastic optimisation unadjusted Langevin method for empirical Bayesian estimation in semi-blind image deblurring problems

This paper presents a novel stochastic optimisation methodology to perform empirical Bayesian inference in semi-blind image deconvolution problems. Given a blurred image and a parametric class of possible operators, the proposed optimisation approach automatically calibrates the parameters of the blur model by maximum marginal likelihood estimation, followed by (non-blind) image deconvolution by maximum-a-posteriori estimation conditionally to the estimated model parameters. In addition to the blur model, the proposed approach also automatically calibrates the noise variance as well as any regularisation parameters. The marginal likelihood of the blur, noise variance, and regularisation parameters is generally computationally intractable, as it requires calculating several integrals over the entire solution space. Our approach addresses this difficulty by using a stochastic approximation proximal gradient optimisation scheme, which iteratively solves such integrals by using a Moreau-Yosida regularised unadjusted Langevin Markov chain Monte Carlo algorithm. This optimisation strategy can be easily and efficiently applied to any model that is log-concave, and by using the same gradient and proximal operators that are required to compute the maximum-a-posteriori solution by convex optimisation. We provide convergence guarantees for the proposed optimisation scheme under realistic and easily verifiable conditions and subsequently demonstrate the effectiveness of the approach with a series of deconvolution experiments and comparisons with alternative strategies from the state of the art.

stat.AP↗

arXiv2023

A Statistical Framework to Investigate the Optimality of Signal-Reconstruction Methods

We present a statistical framework to benchmark the performance of reconstruction algorithms for linear inverse problems, in particular, neural-network-based methods that require large quantities of training data. We generate synthetic signals as realizations of sparse stochastic processes, which makes them ideally matched to variational sparsity-promoting techniques. We derive Gibbs sampling schemes to compute the minimum mean-square error estimators for processes with Laplace, Student's t, and Bernoulli-Laplace innovations. These allow our framework to provide quantitative measures of the degree of optimality (in the mean-square-error sense) for any given reconstruction method. We showcase our framework by benchmarking the performance of some well-known variational methods and convolutional neural network architectures that perform direct nonlinear reconstructions in the context of deconvolution and Fourier sampling. Our experimental results support the understanding that, while these neural networks outperform the variational methods and achieve near-optimal results in many settings, their performance deteriorates severely for signals associated with heavy-tailed distributions.

eess.SP↗

arXiv2020

Bayesian model selection for unsupervised image deconvolution with structured Gaussian priors

This paper considers the objective comparison of stochastic models to solve inverse problems, more specifically image restoration. Most often, model comparison is addressed in a supervised manner, that can be time-consuming and partly arbitrary. Here we adopt an unsupervised Bayesian approach and objectively compare the models based on their posterior probabilities, directly from the data without ground truth available. The probabilities depend on the marginal likelihood or "evidence" of the models and we resort to the Chib approach including a Gibbs sampler. We focus on the family of Gaussian models with circulant covariances and unknown hyperparameters, and compare different types of covariance matrices for the image and noise.

stat.CO↗

arXiv2015

Gradient Scan Gibbs Sampler: an efficient algorithm for high-dimensional Gaussian distributions

This paper deals with Gibbs samplers that include high dimensional conditional Gaussian distributions. It proposes an efficient algorithm that avoids the high dimensional Gaussian sampling and relies on a random excursion along a small set of directions. The algorithm is proved to converge, i.e. the drawn samples are asymptotically distributed according to the target distribution. Our main motivation is in inverse problems related to general linear observation models and their solution in a hierarchical Bayesian framework implemented through sampling algorithms. It finds direct applications in semi-blind/unsupervised methods as well as in some non-Gaussian methods. The paper provides an illustration focused on the unsupervised estimation for super-resolution methods.

stat.CO↗

arXiv2015

Fast 3D Synthetic Aperture Radar Imaging from Polarization-Diverse Measurements

An innovative 3-D radar imaging technique is developed for fast and efficient identification and characterization of radar backscattering components of complex objects, when the collected scattered field is made of polarization-diverse measurements. In this context, all the polarimetric information seems irretrievably mixed. A direct model, derived from a simple but original extension of the widespread "multiple scattering model" leads to a high dimensional linear inverse problem. It is solved by a fast dedicated imaging algorithm that performs to determine at a time three huge 3-D scatterer maps which correspond to HH, VV and HV polarizations at emission and reception. It is applied successfully to various mock-ups and data sets collected from an accurate and dedicated 3D spherical experimental layout that provides concentric polarization-diverse RCS measurements.

cs.IT↗

arXiv2012

Bayesian hierarchical reconstruction of protein profiles including a digestion model

Introduction : Mass spectrometry approaches are very attractive to detect protein panels in a sensitive and high speed way. MS can be coupled to many proteomic separation techniques. However, controlling technological variability on these analytical chains is a critical point. Adequate information processing is mandatory for data analysis to take into account the complexity of the analysed mixture, to improve the measurement reliability and to make the technology user friendly. Therefore we develop a hierarchical parametric probabilistic model of the LC-MS analytical chain including the technological variability. We introduce a Bayesian reconstruction methodology to recover the protein biomarkers content in a robust way. We will focus on the digestion step since it brings a major contribution to technological variability. Method : In this communication, we introduce a hierarchical model of the LC-MS analytical chain. Such a chain is a cascade of molecular events depicted by a graph structure, each node being associated to a molecular state such as protein, peptide and ion and each branch to a molecular processing such as digestion, ionisation and LC-MS separation. This molecular graph defines a hierarchical mixture model. We extend the Bayesian statistical framework we have introduced previously [1] to this hierarchical description. As an example, we will consider the digestion step. We describe the digestion process on a pair of peptides within the targeted protein as a Bernoulli random process associated with a cleavage probability controlled by the digestion kinetic law.

q-bio.GN↗

arXiv2009

Point target detection and subpixel position estimation in optical imagery

This paper addresses the issue of detecting point objects in a clutter background and estimating their position by image processing. We are interested in the specific context where the object signature significantly varies with its random subpixel location because of aliasing. Conventional matched filter neglects this phenomenon and causes consistent loss of detection performance. Thus, alternative detectors are proposed and numerical results show the improvement brought by approximate and generalized likelihood ratio tests in comparison with pixel matched filtering. We also study the performance of two types of subpixel position estimators. Finally, we put forward the major influence of sensor design on both estimation and point object detection performance.

stat.AP↗

arXiv2009

Image Reconstruction in Optical Interferometry

This tutorial paper describes the problem of image reconstruction from interferometric data with a particular focus on the specific problems encountered at optical (visible/IR) wavelengths. The challenging issues in image reconstruction from interferometric data are introduced in the general framework of inverse problem approach. This framework is then used to describe existing image reconstruction algorithms in radio interferometry and the new methods specifically developed for optical interferometry.

astro-ph.IM↗