arXiv subjects

Jacques Froment

Publications and source records attributed to Jacques Froment.

8 recordsLinked to original sources

arXiv2025

Material Decomposition in Photon-Counting Computed Tomography with Diffusion Models: Comparative Study and Hybridization with Variational Regularizers

Photon-counting computed tomography (PCCT) has emerged as a promising imaging technique, enabling spectral imaging and material decomposition (MD). However, images typically suffer from a low signal-to-noise ratio (SNR) due to constraints such as low photon counts and sparse-view settings which provoke artifacts. To prevent this, variational methods minimize a data-fit function coupled with handcrafted regularizers that mimic a prior by enforcing image properties such as gradient sparsity. In the last few years, diffusion models (DMs) have become predominant in the field of generative models and have been used as a learned prior for image reconstruction. This work investigates the use of DMs as regularizers for MD tasks in PCCT, specifically using diffusion posterior sampling (DPS) guidance. Three DPS-based approaches -- image-domain two-step DPS (im-TDPS), projection-domain two-step DPS (proj-TDPS), and one-step DPS (ODPS) -- are evaluated. The first two methods achieve MD in two steps by performing reconstruction and MD separately. The last method, ODPS, samples the material images directly from the measurement data. The results indicate that ODPS achieves superior performance compared to im-TDPS and proj-TDPS, providing sharper, noise-free and crosstalk-free images. Furthermore, we introduce a novel hybrid method for scenarios involving materials absent from the training dataset which combines DM priors with standard variational handcrafted regularizers for the materials unknown to the DM. This hybrid method demonstrates improved MD quality compared to a standard variational method and does not require additional training of the DM neural network (NN).

physics.med-ph↗

arXiv2024

Spectral CT Two-step and One-step Material Decomposition using Diffusion Posterior Sampling

This paper proposes a novel approach to spectral computed tomography (CT) material decomposition that uses the recent advances in generative diffusion models (DMs) for inverse problems. Spectral CT and more particularly photon-counting CT (PCCT) can perform transmission measurements at different energy levels which can be used for material decomposition. It is an ill-posed inverse problem and therefore requires regularization. DMs are a class of generative model that can be used to solve inverse problems via diffusion posterior sampling (DPS). In this paper we adapt DPS for material decomposition in a PCCT setting. We propose two approaches, namely Two-step Diffusion Posterior Sampling (TDPS) and One-step Diffusion Posterior Sampling (ODPS). Early results from an experiment with simulated low-dose PCCT suggest that DPSs have the potential to outperform state-of-the-art model-based iterative reconstruction (MBIR). Moreover, our results indicate that TDPS produces material images with better peak signal-to-noise ratio (PSNR) than images produced with ODPS with similar structural similarity (SSIM).

physics.med-ph↗

arXiv2024

Diffusion Posterior Sampling for Synergistic Reconstruction in Spectral Computed Tomography

Using recent advances in generative artificial intelligence (AI) brought by diffusion models, this paper introduces a new synergistic method for spectral computed tomography (CT) reconstruction. Diffusion models define a neural network to approximate the gradient of the log-density of the training data, which is then used to generate new images similar to the training ones. Following the inverse problem paradigm, we propose to adapt this generative process to synergistically reconstruct multiple images at different energy bins from multiple measurements. The experiments suggest that using multiple energy bins simultaneously improves the reconstruction by inverse diffusion and outperforms state-of-the-art synergistic reconstruction techniques.

physics.med-ph↗

arXiv2023

Uconnect: Synergistic Spectral CT Reconstruction with U-Nets Connecting the Energy bins

Spectral computed tomography (CT) offers the possibility to reconstruct attenuation images at different energy levels, which can be then used for material decomposition. However, traditional methods reconstruct each energy bin individually and are vulnerable to noise. In this paper, we propose a novel synergistic method for spectral CT reconstruction, namely Uconnect. It utilizes trained convolutional neural networks (CNNs) to connect the energy bins to a latent image so that the full binned data is used synergistically. We experiment on two types of low-dose data: simulated and real patient data. Qualitative and quantitative analysis show that our proposed Uconnect outperforms state-of-art model-based iterative reconstruction (MBIR) techniques as well as CNN-based denoising.

physics.med-ph↗

arXiv2019

Spatial-Frequency Domain Nonlocal Total Variation for Image Denoising

Following the pioneering works of Rudin, Osher and Fatemi on total variation (TV) and of Buades, Coll and Morel on non-local means (NL-means), the last decade has seen a large number of denoising methods mixing these two approaches, starting with the nonlocal total variation (NLTV) model. The present article proposes an analysis of the NLTV model for image denoising as well as a number of improvements, the most important of which being to apply the denoising both in the space domain and in the Fourier domain, in order to exploit the complementarity of the representation of image data in both domains. A local version obtained by a regionwise implementation followed by an aggregation process, called Local Spatial-Frequency NLTV (L- SFNLTV) model, is finally proposed as a new reference algorithm for image denoising among the family of approaches mixing TV and NL operators. The experiments show the great performance of L-SFNLTV, both in terms of image quality and of computational speed, comparing with other recently proposed NLTV-related methods.

eess.IV↗

arXiv2015

A note on patch-based low-rank minimization for fast image denoising

Patch-based low-rank minimization for image processing attracts much attention in recent years. The minimization of the matrix rank coupled with the Frobenius norm data fidelity can be solved by the hard thresholding filter with principle component analysis (PCA) or singular value decomposition (SVD). Based on this idea, we propose a patch-based low-rank minimization method for image denoising. The main denoising process is stated in three equivalent way: PCA, SVD and low-rank minimization. Compared to recent patch-based sparse representation methods, experiments demonstrate that the proposed method is rather rapid, and it is effective for a variety of natural grayscale images and color images, especially for texture parts in images. Further improvements of this method are also given. In addition, due to the simplicity of this method, we could provide an explanation of the choice of the threshold parameter, estimation of PSNR values, and give other insights into this method.

cs.CV↗

arXiv2013

Non-Local means est un algorithme de débruitage local (Non-Local means is a local image denoising algorithm)

The Non-Local Means (NLM) image denoising algorithm pushed the limits of denoising. But it introduced a new paradigm, according to which one could capture the similarity of images with the NLM weights. We show that, contrary to the prevailing opinion, the NLM weights do not allow to get a reliable measure of the similarity in a noisy image, unless one add a locality constraint. As an image denoising method, the Non-Local Means prove to be local. Some works had already pointed out that to get the best denoising performances with the NLM algorithm, one should run it locally. But no general conclusion has been yet proposed and the only explanation that was proposed to justify the experimental results is not sufficient. Our study based on experimental evidence proves that, on average on natural images, the bias of the NLM estimator is an increasing function of the radius of the similarity searching zone. The reason for this phenomenon is that noise disrupts the order of similarity between patches. Hence the mean squared error between the original image and the NLM estimation, which is the sum of the bias, the variance and the covariance of the estimator, has an absolute minimum for a disk of radius 3 to 4 pixels.

math.ST↗

arXiv2013

Un algorithme de débruitage Non-Local means espace-fréquence (A space-frequency Non-Local means image denoising algorithm)

The efficiency of the Non-Local means (NLM) image denoising algorithm relies on the identification of similar original pixels from noisy similar patches. Hence fine details and low-contrasted structures are badly recovered after the application of NLM. But as these structures tend to correspond to redundant ones in the Fourier domain, NLM filtering in this domain allows one to better denoise them. A mixed space-frequency approach improves the denoising performances of NLM because it ensures that the information is redundant enough, in the spatial domain or in the frequency domain. Our approach is simple : it consists in running two times the NLM algorithm (firstly in the frequency domain and secondly in the spatial domain). For fine textures and isolated points we get a better visual reconstruction than with the original NLM. In terms of PSNR, the improvement can be over 1 dB. Our approach gives intermediate results between the original NLM and state-of-the-art methods while at the same time having moderate complexity and leading to few visual artifacts.

math.FA↗