betaFeedback

WorksEngineering

Bayesian PET Reconstruction with Learned Flow Matching Priors via Langevin Sampling

Abstract

Image reconstruction for positron emission tomography (PET) is a challenging inverse problem due to its inherent ill-posedness and Poisson counting noise, particularly in low-dose acquisitions. In this work, we introduce a novel Bayesian PET reconstruction framework that leverages a flow-matching generative prior learned from high-quality PET images. By incorporating this prior, we formulate PET reconstruction as a Bayesian inference problem and solve it via latent-space posterior sampling using the unadjusted Langevin algorithm. We evaluate the proposed method through numerical experiments and benchmark it against classical reconstruction methods and state-of-the-art deep learning-based baselines. The proposed method achieves improved reconstruction performance while enabling posterior uncertainty quantification.

Introduction

Positron emission tomography (PET) is a powerful molecular imaging technique that provides unique insights into biological processes and metabolism [1], [2]. However, reconstructing high-quality PET images from measured sinogram data remains a significant challenge due to the inherent ill-posedness of the inverse problem and the presence of Poisson counting noise. These issues are particularly pronounced in low-dose acquisitions designed to reduce patient exposure to ionizing radiation.

Analytic reconstruction methods, such as filtered backprojection [3], have been applied to PET reconstruction. However, these methods typically rely on simplified imaging models and are therefore prone to noise amplification and artifacts. Statistical iterative reconstruction methods, such as maximum-likelihood (ML) approaches [4], [5], improve upon analytic methods by incorporating more accurate models of imaging systems and noise statistics. Nonetheless, due to the ill-posed nature of the underlying inverse problem, they can still suffer from substantial noise contamination, particularly in low-dose acquisitions. To address this issue, various penalized maximum-likelihood (PML) and maximum a posteriori (MAP) reconstruction methods [6, 7, 8, 9, 10, 11, 12, 13] have been introduced by incorporating hand-crafted priors. Although these methods can improve the signal-to-noise ratio (SNR), they may introduce blocky artifacts and oversmooth anatomical structures.

Over the past decade, deep learning–based reconstruction has emerged as a powerful paradigm for PET imaging [14]. Supervised learning-based methods, including end-to-end reconstruction [15], [16] and deep unrolling [17]–[19], have demonstrated promising performance by learning from paired training data. However, they often require extensive labeled datasets and may have limited generalization capability. In contrast, unsupervised learning-based methods leverage inherent image-structure information—such as the inductive bias of network architectures [20] or implicit continuity [21]—thereby alleviating the need for paired training data. Nonetheless, their performance is often constrained by limited model expressiveness. Recently, generative models [22], [23], especially score-based diffusion models, have demonstrated effectiveness in learning expressive image prior distributions from training data. Although promising results have been obtained in PET reconstruction [24], [25], these methods often rely on sophisticated mechanisms to maintain data consistency and incur high computational costs due to iterative multi-step sampling.

In this work, we introduce a novel Bayesian PET reconstruction method based on posterior sampling guided by a flow-matching generative prior [26], [27]. Flow matching models a continuous-time probability flow via a neural ordinary differential equation (ODE), providing a deterministic and differentiable generative mapping from a simple latent distribution to the target image distribution. Compared with diffusion models [22], [23], flow matching avoids complex noise schedules and stochastic reverse-time sampling in the generative prior. Specifically, the proposed method first learns an expressive image prior from high-quality PET data and subsequently formulates PET reconstruction as a Bayesian inference problem. To solve the resulting posterior inference problem, we develop a latent-space posterior sampling algorithm based on Langevin dynamics. By integrating the imaging system model and Poisson noise statistics with the learned prior within a principled Bayesian framework, the proposed method achieves improved reconstruction performance while enabling posterior uncertainty quantification. We demonstrate the effectiveness of the proposed method through numerical experiments.

Proposed Method

Problem Formulation

PET aims to reconstruct the spatial distribution of the radiotracer concentration x∈R+N\mathbf{x} \in\mathbb{R}_{+}^{N} from sinogram measurements y∈Z+My \in\mathbb{Z}_{+}^{M}, which can be modeled by

y∼Poisson⁡(Ax+r),(1)\mathbf{y} \sim\operatorname{Poisson}(\mathbf{A}\mathbf{x}+\mathbf{r}), \tag*{(1)}

where A∈RM×N\mathbf{A} \in\mathbb{R}^{M \times N} denotes the system matrix, and r∈RM\mathbf{r} \in\mathbb{R}^{M} denotes the expected background events, including scatter and random coincidences. Accordingly, the probability of observing the measurement yiy_i in the ii-th sinogram bin given an image x\mathbf{x} can be written as

p(yi∣x)=([Ax]i+ri)yie−([Ax]i+ri)yi!.(2)p(y_i \mid\mathbf{x})=\frac{\left([\mathbf{A}\mathbf{x}]_i+r_i\right)^{y_i}e^{-\left([\mathbf{A}\mathbf{x}]_i+r_i\right)}}{y_i!}. \tag*{(2)}

Assuming independence across sinogram bins, the log-likelihood function for the entire measurement vector y\mathbf{y} is given by

log⁡p(y∣x)=∑i=1Myilog⁡([Ax]i+ri)−([Ax]i+ri)−log⁡(yi!).(3)\log p(\mathbf{y} \mid\mathbf{x})=\sum_{i=1}^{M}y_i\log\left([\mathbf{A}\mathbf{x}]_i+r_i\right)-\left([\mathbf{A}\mathbf{x}]_i+r_i\right)-\log(y_i!). \tag*{(3)}

Given the above likelihood function that models the underlying imaging system and measurement noise, we can perform ML reconstruction [4], [5]. However, due to the ill-posed nature of the inverse problem, ML reconstruction often suffers from significant noise amplification, which compromises its utility. To address this issue, we introduce a Bayesian approach by incorporating an image prior distribution p(x)p(\mathbf{x}).

Specifically, we represent the image prior implicitly using a flow-matching generative model [26] trained on a set of high-quality PET images. Flow matching is a state-of-the-art generative modeling framework, which learns a mapping Gθ(⋅)G_{\theta}(\cdot) that transforms a simple base distribution p0(x0)p_0(\mathbf{x}_0) (e.g., a standard normal distribution) to the target distribution p1(x1)p_1(\mathbf{x}_1) via the following ODE:

dxtdt=vtθ(xt),where t∈[0,1].(4)\frac{\mathrm{d}\mathbf{x}_t}{\mathrm{d}t}=v_t^{\theta}(\mathbf{x}_t),\qquad\text{where }t\in[0,1]. \tag*{(4)}

Here vtθ(⋅)v_t^{\theta}(\cdot) denotes a velocity field parameterized by a neural network with parameters θ\theta. We learn θ\theta by minimizing the following conditional flow matching loss [26]:

LCFM(θ)=Et,x1,xt[∥vtθ(xt)−vttarget(xt∣x1)∥2],(5)\mathcal{L}_{\mathrm{CFM}}(\theta)=\mathbb{E}_{t,\mathbf{x}_1,\mathbf{x}_t}\left[\left\|v_t^{\theta}(\mathbf{x}_t)-v_t^{\mathrm{target}}(\mathbf{x}_t\mid\mathbf{x}_1)\right\|^2\right], \tag*{(5)}

where vttarget(xt∣x1)v_t^{\mathrm{target}}(\mathbf{x}_t\mid\mathbf{x}_1) denotes the target velocity field, which is the conditional velocity field of the prescribed flow along the conditional probability path pt(xt∣x1)p_t(\mathbf{x}_t\mid\mathbf{x}_1) and the above expectation is taken over t∼Unif⁡[0,1]t\sim\operatorname{Unif}[0,1], x1∼p1(x1)\mathbf{x}_1\sim p_1(\mathbf{x}_1), and xt∼p(xt∣x1)\mathbf{x}_t\sim p(\mathbf{x}_t\mid\mathbf{x}_1).

We further adopt the Gaussian conditional optimal transport path, in which intermediate points are linearly interpolated as

xt=tx1+(1−t)x0.(6)\mathbf{x}_t=t\mathbf{x}_1+(1-t)\mathbf{x}_0. \tag*{(6)}

Let x0∼N(0,I)\mathbf{x}_0\sim\mathcal{N}(0,\mathbf{I}) and x1∼p1(x1)\mathbf{x}_1\sim p_1(\mathbf{x}_1). Then pt(xt∣x1)=N(tx1,(1−t)2I)p_t(\mathbf{x}_t\mid\mathbf{x}_1)=\mathcal{N}(t\mathbf{x}_1,(1-t)^2\mathbf{I}). The corresponding target velocity field is

vttarget(xt∣x1)=dxtdt=x1−x0.(7)v_t^{\mathrm{target}}(\mathbf{x}_t\mid\mathbf{x}_1)=\frac{\mathrm{d}\mathbf{x}_t}{\mathrm{d}t}=\mathbf{x}_1-\mathbf{x}_0. \tag*{(7)}

Accordingly, (5) can be rewritten as

LCFM(θ)=Et,x1,x0[∥vtθ(xt)−(x1−x0)∥2],(8)\mathcal{L}_{\mathrm{CFM}}(\theta)=\mathbb{E}_{t,\mathbf{x}_1,\mathbf{x}_0}\left[\left\|v_t^{\theta}(\mathbf{x}_t)-(\mathbf{x}_1-\mathbf{x}_0)\right\|^2\right], \tag*{(8)}

where the expectation is taken over t∼Unif⁡[0,1]t\sim\operatorname{Unif}[0,1], x1∼p1(x1)\mathbf{x}_1\sim p_1(\mathbf{x}_1), and x0∼N(0,I)\mathbf{x}_0\sim\mathcal{N}(0,\mathbf{I}).

After training, we solve the ODE from t=0t=0 to t=1t=1 as follows:

x1=x0+∫01vtθ(xt) dt.(9)\mathbf{x}_1=\mathbf{x}_0+\int_0^1v_t^{\theta}(\mathbf{x}_t)\,\mathrm{d}t. \tag*{(9)}

The solution in (9) induces a deterministic and differentiable mapping, x=x1=Gθ(x0)\mathbf{x}=\mathbf{x}_1=G_{\theta}(\mathbf{x}_0), which transports an initial latent noise vector x0∼N(0,I)\mathbf{x}_0\sim\mathcal{N}(0,\mathbf{I}) to a sample x∼p(x)\mathbf{x}\sim p(\mathbf{x}). In practice, we solve the ODE numerically, and in this work, we use the forward Euler method with Δt=1/L\Delta t=1/L, which yields the following iterative update:

xt+Δt=xt+Δt⋅vtθ(xt).(10)\mathbf{x}_{t+\Delta t}=\mathbf{x}_t+\Delta t\cdot v_t^{\theta}(\mathbf{x}_t). \tag*{(10)}

With the implicit prior p(x)p(\mathbf{x}) induced by flow matching, the image reconstruction problem is cast as a Bayesian inference problem with the posterior density formally given by

p(x∣y)=p(x)p(y∣x)p(y)∝p(y∣x)p(x).(11)p(\mathbf{x}\mid\mathbf{y})=\frac{p(\mathbf{x})p(\mathbf{y}\mid\mathbf{x})}{p(\mathbf{y})}\propto p(\mathbf{y}\mid\mathbf{x})p(\mathbf{x}). \tag*{(11)}

Solution Algorithm

We develop a posterior sampling algorithm to solve the resulting inference problem in (11). Since the evidence term p(y)p(\mathbf{y}) in the denominator of (11) is intractable, we cannot directly sample x\mathbf{x} from p(x∣y)p(\mathbf{x}\mid\mathbf{y}). To avoid evaluating the evidence term, we employ gradient-based MCMC methods, which use the gradient of the log-posterior:

∇xlog⁡p(x∣y)=∇xlog⁡p(x)+∇xlog⁡p(y∣x).(12)\nabla_{\mathbf{x}}\log p(\mathbf{x}\mid\mathbf{y})=\nabla_{\mathbf{x}}\log p(\mathbf{x})+\nabla_{\mathbf{x}}\log p(\mathbf{y}\mid\mathbf{x}). \tag*{(12)}

Several off-the-shelf gradient-based MCMC samplers are available [28, 29, 30, 31, 32]. In this work, we adopt the unadjusted Langevin algorithm (ULA) [28], [32], which is obtained by discretizing the Langevin diffusion.

Moreover, for the implicit flow-matching prior, the image-space prior density p(x)p(\mathbf{x}) and its score ∇xlog⁡p(x)\nabla_{\mathbf{x}}\log p(\mathbf{x}) are not directly available. Therefore, we perform posterior sampling in the latent space. After drawing posterior samples in the latent space, we map them to the image space using the generator Gθ(⋅)G_{\theta}(\cdot), i.e., x=Gθ(x0)\mathbf{x}=G_{\theta}(\mathbf{x}_0). Specifically, with an initialization x00∼N(0,I)\mathbf{x}_0^0\sim\mathcal{N}(0,\mathbf{I}), the update of the latent-space ULA is given by

x0k+1=x0k+ϵ∇x0log⁡p(x0k∣y)+2ϵwk,(13)\mathbf{x}_0^{k+1}=\mathbf{x}_0^k+\epsilon\nabla_{\mathbf{x}_0}\log p(\mathbf{x}_0^k\mid\mathbf{y})+\sqrt{2\epsilon}\mathbf{w}_k, \tag*{(13)}

where ϵ\epsilon is the step size and wk∼N(0,I)\mathbf{w}_k\sim\mathcal{N}(0,\mathbf{I}) is a random noise vector.

According to Bayes’ theorem, the posterior distribution over x0\mathbf{x}_0 can be written as

log⁡p(x0∣y)=log⁡p0(x0)+log⁡p(y∣Gθ(x0))+C=−12∥x0∥22+∑i=1Myilog⁡([AGθ(x0)]i+ri)−∑i=1M([AGθ(x0)]i+ri)+C′,(14)\begin{aligned} \log p(\mathbf{x}_0\mid\mathbf{y})=\log p_0(\mathbf{x}_0)+\log p(\mathbf{y}\mid G_{\theta}(\mathbf{x}_0))+C \\ &=-\frac{1}{2}\|\mathbf{x}_0\|_2^2+\sum_{i=1}^{M}y_i\log\left([\mathbf{A}G_{\theta}(\mathbf{x}_0)]_i+r_i\right) -\sum_{i=1}^{M}\left([\mathbf{A}G_{\theta}(\mathbf{x}_0)]_i+r_i\right)+C', \tag*{(14)} \end{aligned}

where CC and C′C' are two constants independent of x0\mathbf{x}_0. Consequently, the log-posterior gradient in (13) is given by

∇x0log⁡p(x0∣y)=JGθ(x0)TAT(yAGθ(x0)+r−1)−x0,(15)\nabla_{\mathbf{x}_0} \log p(\mathbf{x}_0 \mid\mathbf{y}) = J_{G_\theta}(\mathbf{x}_0)^T A^T \left( \frac{\mathbf{y}}{A G_\theta(\mathbf{x}_0) + \mathbf{r}} - \mathbf{1} \right) - \mathbf{x}_0, \tag*{(15)}

where the division is element-wise and 1\mathbf{1} denotes the all-ones vector. Here JGθ(x0)J_{G_\theta}(\mathbf{x}_0) denotes the Jacobian of the generator Gθ(⋅)G_\theta(\cdot) evaluated at x0\mathbf{x}_0. In practice, the corresponding vector-Jacobian product can be efficiently computed by automatic differentiation without explicitly forming the full Jacobian.

After discarding an initial burn-in period to allow the Markov chain to approach its stationary regime, we perform Bayesian reconstruction using posterior image samples obtained by mapping the latent samples through Gθ(⋅)G_\theta(\cdot). Moreover, this sampling-based inference approach enables various Bayesian estimators to be formed from the posterior samples. For instance, given posterior samples {x0s}s=1S\{\mathbf{x}_0^s\}_{s=1}^{S} in the latent space, we can form the minimum mean-square error (MMSE) estimate of x\mathbf{x} by

x^MMSE=1S∑s=1SGθ(x0s).(16)\hat{\mathbf{x}}_{\mathrm{MMSE}} = \frac{1}{S} \sum_{s=1}^{S} G_\theta(\mathbf{x}_0^s). \tag*{(16)}

Additionally, this approach allows for quantification of uncertainty in the reconstruction process. For example, we can calculate the voxel-wise statistics, such as posterior variance, across the reconstructed samples.

Numerical Results

Experiment Setup

Dataset. A realistic 3D digital brain phantom (128×128×60128 \times128 \times60 voxels, 2 mm isotropic voxel size), derived from the Zubal anthropomorphic phantom [33], was used for simulation studies. The phantom was augmented with three spherical lesions (radii of 1.5–2.5 voxels) exhibiting elevated radiotracer uptake. Time-activity curves were simulated using a two-tissue compartment model, with kinetic parameters randomly sampled from normal distributions (with a coefficient of variation of 30%) to introduce biological variability across voxels. The 10th frame (5 min post-injection) was selected to represent a static PET acquisition. Scanner geometry was modeled after a Siemens Biograph mCT [34], with sinograms comprising 256 radial bins and 224 projection angles. A spatially-invariant Gaussian point spread function (PSF) with 4.5 mm full-width at half-maximum (FWHM) was applied. Attenuation and detector sensitivity effects were incorporated using precomputed correction factors for each line of response.

A low-count acquisition corresponding to 10% of the full dose was generated by scaling the number of true coincidences from a reference full-dose acquisition containing 4×1064 \times10^6 counts. Additional uniformly distributed random and scatter events, corresponding to 30% of the true coincidences, were added to all simulations.

To train the prior, a dataset of 12,000 high-quality 2D slices was generated by reconstructing full-dose data using the EM algorithm. The same dataset was used to train the supervised baseline. Evaluation was performed on a separate test set of 2,000 images.

Implementation details. The velocity field vtθ(xt)v_t^\theta(\mathbf{x}_t) for flow matching was represented using a four-layer U-Net [35], and was trained using the Adam optimizer [36] with an initial learning rate of 1×10−41 \times10^{-4}. During reconstruction, we solved the ODE using the forward-Euler method with 20 time steps. For ULA sampling, we set the step size ϵ=10−3\epsilon= 10^{-3} and employed a total number of T=150,000T = 150{,}000 iterations, including a burn-in period of Tburn=50,000T_{\mathrm{burn}} = 50{,}000 and a sampling period of Tsample=100,000T_{\mathrm{sample}} = 100{,}000. All experiments were conducted on a Linux server equipped with two NVLink-connected NVIDIA H100 NVL GPUs (each with 96 GB of HBM3 memory) and 1.5 TB of DDR5 RAM, running PyTorch 2.8.0 and Python 3.10.

Method Comparison. The proposed method was compared with: 1) ML reconstruction [4]; 2) TV reconstruction [11]; 3) deep unrolling reconstruction (FBSEM [19]); 4) score-based diffusion posterior sampling reconstruction (DPS [24, 37]). To facilitate a fair comparison with the proposed reconstruction method, we used the same U-Net architecture and trained the diffusion model for 3 hours to ensure convergence and optimize performance. During inference, the total sampling time of the proposed method (5 hours for 150,000 samples, including 50,000 burn-in samples) was matched to that of DPS, which generated 800 samples within the same time budget. Quantitative comparisons were performed using the MMSE estimates computed from the corresponding posterior sample sets. We evaluated all methods using three quantitative metrics: normalized root mean square error (NRMSE), peak signal-to-noise ratio (PSNR), and structural similarity index (SSIM) [38].

Results

Figure 1 shows reconstructed images and corresponding error maps obtained using ML, TV, FBSEM, DPS, and the proposed method at the 10% dose level. Table I summarizes

Comparison of reconstruction methods at the 10% dose level

Figure 1. Comparison of reconstruction methods at the 10% dose level. (a) Ground-truth. (b) Reconstructions and corresponding error maps for ML, TV, FBSEM, DPS (MMSE estimate), and the proposed method (MMSE estimate).

#MethodNRMSE (↓)PSNR (↑)SSIM (↑)
1ML20.46%26.140.861
2TV17.09%27.710.876
3FBSEM13.32%29.870.922
4DPS8.29%33.990.981
5Proposed7.35%35.040.983

Table I. Quantitative comparison of reconstruction methods at the 10% dose level. The best results are highlighted in bold.

the quantitative results of these methods. As can be seen, the ML reconstruction is severely corrupted by noise and artifacts. TV reconstruction improves upon the ML reconstruction, but suffers from excessive smoothing and edge artifacts. In contrast, the three deep learning–based methods demonstrate significantly better performance at this low-dose acquisition. Notably, the proposed method outperforms FBSEM and DPS both qualitatively and quantitatively.

Figure 2 further compares posterior sampling results obtained by DPS and the proposed method. The proposed method produces posterior samples with visibly fewer artifacts and lower reconstruction error than DPS. In addition, the estimated posterior standard deviation provides voxel-wise uncertainty information, demonstrating the capability of the proposed Bayesian framework to quantify reconstruction uncertainty.

Figure 2. Reconstruction results and uncertainty visualization at the 10% dose level: (a) voxel-wise posterior standard deviation estimated by DPS; (b) five representative samples drawn from the DPS posterior, with the corresponding error maps shown below; (c) voxel-wise posterior standard deviation estimated by the proposed ULA-based method; (d) five representative samples drawn from the ULA posterior, with the corresponding error maps shown below. It is clear that the proposed method produces posterior samples with lower error and reduced artifacts.

Conclusion

In this paper, we presented a Bayesian PET reconstruction method that leverages a learned flow-matching prior. By incorporating this prior, the proposed method performs PET reconstruction via latent-space posterior sampling using the unadjusted Langevin algorithm, while enabling posterior uncertainty quantification. Numerical experiments demonstrate that the proposed method outperforms both classical reconstruction methods and state-of-the-art deep learning-based baselines. In future work, we will validate our method on in vivo data and improve its computational efficiency by developing more advanced inference algorithms.

Acknowledgment

This work was supported, in part, by the National Natural Science Foundation of China under Grant 62427807 and the Zhejiang Provincial ‘Jianbing Lingyan+X’ Science and Technology Program under Grant 2025C01127.

References

  1. [1]S. R. Cherry, J. A. Sorenson, and M. E. Phelps, Physics in Nuclear Medicine, 4th ed. Elsevier, 2012.
  2. [2]P. E. Valk, D. Delbeke, D. L. Bailey, D. W. Townsend, and M. N. Maisey, Eds., Positron Emission Tomography: Clinical Practice. Springer, 2006.
  3. [3]M. N. Wernick and J. N. Aarsvold, Eds., Emission Tomography: The Fundamentals of PET and SPECT. Elsevier, 2004.
  4. [4]L. A. Shepp and Y. Vardi, “Maximum Likelihood Reconstruction for Emission Tomography,” IEEE Trans. Med. Imag., vol. 1, no. 2, pp. 113–122, 1982.
  5. [5]H. M. Hudson and R. S. Larkin, “Accelerated image reconstruction using ordered subsets of projection data,” IEEE Trans. Med. Imag., vol. 13, no. 4, pp. 601–609, 1994.pubmed.ncbi.nlm.nih.gov/18218538
  6. [6]E. Levitan and G. T. Herman, “A maximum a posteriori probability expectation maximization algorithm for image reconstruction in emission tomography,” IEEE Trans. Med. Imag., vol. 6, no. 3, pp. 185–192, 1987.pubmed.ncbi.nlm.nih.gov/18244020
  7. [7]T. Hebert and R. Leahy, “A generalized EM algorithm for 3-D Bayesian reconstruction from Poisson data using Gibbs priors,” IEEE Trans. Med. Imag., vol. 8, no. 2, pp. 194–202, 1989.pubmed.ncbi.nlm.nih.gov/18230517
  8. [8]P. J. Green, “Bayesian reconstructions from emission tomography data using a modified EM algorithm,” IEEE Trans. Med. Imag., vol. 9, no. 1, pp. 84–93, 1990.pubmed.ncbi.nlm.nih.gov/18222753
  9. [9]J. A. Fessler and A. O. Hero, “Penalized maximum-likelihood image reconstruction using space-alternating generalized EM algorithms,” IEEE Trans. Image Process., vol. 4, no. 10, pp. 1417–1429, 1995.
  10. [10]J. Zhou, J. L. C. Arouxse, A. Bousse, H. Shu, and L. Luo, “A Bayesian MAP-EM algorithm for PET image reconstruction using wavelet transform,” IEEE Trans. Nucl. Sci., vol. 54, no. 5, pp. 1660–1669, 2007.DOI
  11. [11]M. Burger, J. Müller, E. Papoutsellis, and C.-B. Schönlieb, “Total Variation Regularization in Measurement and Image Space for PET Reconstruction,” Inverse Problems, vol. 30, no. 10, p. 105003, 2014.DOI
  12. [12]G. Wang and J. Qi, “PET Image Reconstruction Using Kernel Method,” IEEE Trans. Med. Imag., vol. 34, no. 1, pp. 61–71, 2015.
  13. [13]S. Chen, H. Liu, P. Shi, and Y. Chen, “Sparse Representation and Dictionary Learning Penalized Image Reconstruction for Positron Emission Tomography,” Phys. Med. Biol., vol. 60, no. 2, pp. 807–824, 2015.DOI
  14. [14]A. J. Reader, G. Corda, A. Mehranian, C. da Costa-Luis, S. Ellis, and J. A. Schnabel, “Deep learning for PET image reconstruction,” IEEE Trans. Radiat. Plasma Med. Sci., vol. 5, no. 1, pp. 1–25, 2020.DOI
  15. [15]I. Häggrström, C. R. Schmidtlein, G. Campanella, T. J. Fuchs, “DeepPET: A Deep Encoder-Decoder Network for Directly Solving the PET Image Reconstruction Inverse Problem,” Med. Image Anal., vol. 54, pp. 253–262, 2019.
  16. [16]Z. Hu, H. Xue, Q. Zhang, J. Gao, N. Zhang, S. Zou, Y. Teng, X. Liu, Y. Yang, D. Liang et al., “DIPR-Net: Direct PET Image Reconstruction Based on the Wasserstein Generative Adversarial Network,” IEEE Trans. Radiat. Plasma Med. Sci., vol. 5, no. 1, pp. 35–43, 2021.DOI
  17. [17]R. Hu, J. Cui, C. Li, C. Yu, Y. Chen, and H. Liu, “Dynamic Low-Count PET Image Reconstruction Using Spatio-Temporal Primal Dual Network,” Phys. Med. Biol., vol. 68, no. 13, p. 135015, 2023.DOI
  18. [19]A. Mehranian and A. J. Reader, “Model-based deep learning PET image reconstruction using forward–backward splitting expectation–maximization,” IEEE Trans. Radiat. Plasma Med. Sci., vol. 5, no. 1, pp. 54–64, 2020.DOI
  19. [20]K. Gong, C. Catana, J. Qi, and Q. Li, “PET image reconstruction using deep image prior,” IEEE Trans. Med. Imag., vol. 38, no. 7, pp. 1655–1665, 2018.DOI
  20. [21]Y. Moussaoui, D. Mateus, N. Taheri, S. Moussaoui, T. Carlier, and S. Stute, “Implicit Neural Representations for End-to-End PET Reconstruction,” in Proc. IEEE Int. Symp. Biomed. Imag., 2025, pp. 1–5.arxiv.org/abs/2503.21825
  21. [22]J. Ho, A. Jain, and P. Abbeel, “Denoising diffusion probabilistic models,” in Proc. Adv. Neural Inf. Process. Syst., 2020.arxiv.org/abs/2006.11239
  22. [23]Y. Song, J. Sohl-Dickstein, D. P. Kingma, A. Kumar, S. Ermon, and B. Poole, “Score-based generative modeling through stochastic differential equations,” in Proc. Int. Conf. Learn. Represent., 2021.
  23. [24]I. R. D. Singh, A. Denker, R. Barbano, Ž. Kereta, B. J. Kin, K. Thielemans, P. Maass, and S. Arridge, “Score-based generative models for PET image reconstruction,” Mach. Learn. Biomed. Imag., vol. 2, pp. 547–585, 2024.DOI
  24. [25]G. Webber, Y. Mizuno, O. D. Howes, A. Hammers, A. P. King, and A. J. Reader, “Likelihood-scheduled score-based generative modeling for fully 3D PET image reconstruction,” IEEE Trans. Med. Imag., vol. 44, no. 11, pp. 4445–4456, 2025.DOI
  25. [26]Y. Lipman, R. T. Q. Chen, H. Ben-Hamu, M. Nickel, and M. Le, “Flow matching for generative modeling,” in Proc. Int. Conf. Learn. Represent., 2023.arxiv.org/abs/2210.02747
  26. [27]X. Liu, C. Gong, and Q. Liu, “Flow straight and fast: Learning to generate and transfer data with rectified flow,” in Proc. Int. Conf. Learn. Represent., 2023.arxiv.org/abs/2209.03003
  27. [28]G. O. Roberts and R. L. Tweedie, “Exponential convergence of Langevin distributions and their discrete approximations,” Bernoulli, vol. 2, no. 4, pp. 341–363, 1996.DOI
  28. [29]M. Welling and Y. W. Teh, “Bayesian learning via stochastic gradient Langevin dynamics,” in Proc. Int. Conf. Mach. Learn., 2011, pp. 681–688.
  29. [30]M. Girolami and B. Calderhead, “Riemann manifold langevin and hamiltonian monte carlo methods,” J. R. Stat. Soc. Ser. B, vol. 73, no. 2, pp. 123–214, 2011.DOI
  30. [31]M. Pereyra, P. Schniter, É. Chouzenoux, J.-C. Pesquet, J.-Y. Tourneret, A. O. Hero, and S. McLaughlin, “A survey of stochastic simulation and optimization methods in signal processing,” IEEE J. Sel. Top. Signal Process., vol. 10, no. 2, pp. 224–241, 2016.DOI
  31. [32]A. Durmus and E. Moulines, “Nonsasymptotic convergence analysis for the unadjusted Langevin algorithm,” Ann. Appl. Probab., vol. 27, no. 3, pp. 1551–1587, 2017.DOI
  32. [33]I. G. Zubal, C. R. Harrell, E. O. Smith, Z. Rattner, G. Gindi, and P. B. Hoffer, “Computerized Three-Dimensional Segmented Human Anatomy,” Med. Phys., vol. 21, no. 2, pp. 299–302, 1994.
  33. [34]J. Noh, J. A. Fessler, and P. E. Kinahan, “Statistical Sinogram Restoration in Dual-Energy CT for PET Attenuation Correction,” IEEE Trans. Med. Imag., vol. 28, no. 11, pp. 1688–1702, 2009.DOI
  34. [35]O. Ronneberger, P. Fischer, and T. Brox, “U-Net: Convolutional networks for biomedical image segmentation,” in Proc. Med. Image Comput. Comput.-Assist. Intervent., 2015, pp. 234–241.arxiv.org/abs/1505.04597
  35. [36]D. P. Kingma and J. Ba, “Adam: A method for stochastic optimization,” in Proc. Int. Conf. Learn. Representations, 2015.arxiv.org/abs/1412.6980
  36. [37]H. Chung, J. Kim, M. T. McCann, M. L. Klasky, and J. C. Ye, “Diffusion posterior sampling for general noisy inverse problems,” in Proc. Int. Conf. Learn. Represent., 2023.arxiv.org/abs/2209.14687
  37. [38]Z. Wang, A. C. Bovik, H. R. Sheikh, and E. P. Simoncelli, “Image quality assessment: From error visibility to structural similarity,” IEEE Trans. Image Process., vol. 13, no. 4, pp. 600–612, 2004.pubmed.ncbi.nlm.nih.gov/15376593

Paper details

vlnc:W_8n9xjcac
Version
v1 · latest
Published
Fresh — added to the Hub within the last 30 days
Added
License
CC BY 4.0
Usage

views · 10

downloads · 0

A view counts once per browser per day, a download each time the PDF is requested.

  • Engineering

Not recorded for this paper

View statement
Looking for related papers…
Contents