| CPC G06T 11/008 (2013.01) [A61B 6/037 (2013.01); A61B 6/4417 (2013.01); G06T 2210/41 (2013.01); G06T 2211/424 (2013.01)] | 11 Claims |

|
1. A system, comprising:
a positron emission tomography (PET) imaging modality configured to acquire a PET dataset;
a magnetic resonance imaging (MRI) modality configured to acquire an MRI dataset; and
a processor configured to:
receive the PET dataset and the MRI dataset;
generate an MRI reconstructed image from the MRI dataset, wherein the MRI reconstructed image is registered to the PET dataset;
apply an iterative reconstruction process to the PET dataset and the MRI reconstructed image, wherein the iterative reconstruction process includes one or more similarity coefficients;
calculate an adaptive hyperparameter for each iteration of the iterative reconstruction process; and
output a reconstructed image from the iterative reconstruction process, wherein iterative reconstruction process comprises an optimization algorithm and a potential function,
wherein: (1) the optimization algorithm comprises a one-step-late (OSL) algorithm defined as:
![]() where i is a line-of-response (LOR) index, M is a number of LORs, ri is scatter and random coincidences, ni is a normalization, αi is attenuation factors, gij is a system matrix, β is the adaptive hyperparameter, u is a measured activity distribution, R(u) is the potential function, and i is a voxel index; or
(2) the optimization algorithm comprises a preconditioned gradient ascent (PGA) algorithm defined as:
![]() where i is a line-of-response (LOR) index, M is a number of LORs, ri is scatter and random coincidences, ni is a normalization, αi is attenuation factors, gij is a system matrix, β is the adaptive hyperparameter, u is a measured activity distribution, R(u) is the potential function, and j is a voxel index; or
(3) the optimization algorithm comprises a penalized likelihood based on a separable surrogate (PLSS) algorithm defined as:
![]() where β is the adaptive hyperparameter, u is a measured activity distribution, and uj,EMn+1 is the expectation-maximization estimate of ujn smoothed according to:
![]() Where b is the index for voxels in a neighborhood Nj and ω is a similarity coefficient.
|