SearcharxivSearch

arXiv subjects

Charles Stearns

Publications and source records attributed to Charles Stearns.

2 recordsLinked to original sources

Object independent scatter sensitivities for PET, applied to scatter estimation through fast Monte Carlo simulation

Scattered coincidences introduce quantitative bias in positron emission tomography (PET) and must be compensated during reconstruction. Conventional scatter estimates typically rely on simplified cylindrical scanner models that omit detector physics. Incorporating detector sensitivities for scatter is challenging because scattered events exhibit less constrained properties, such as incidence angles, compared to true coincidences. We integrated a 5D single-photon detection probability lookup table (LUT) accounting for photon energy, incidence angle, and detector location into the simulator logic. The resulting scatter sinogram is scaled by a precomputed, LUT-specific scatter sensitivity sinogram. Scatter was simulated using MCGPU-PET, a fast Monte Carlo (MC) simulator with a simplified scanner model, and applied to phantom data from a simulated GE Signa PET/MR in GATE. We evaluated three scenarios: (1) high-count MC simulations from a known activity distribution; (2) limited-count simulations; and (3) joint estimation of activity and scatter under low-count conditions. The method was also tested on two real Signa PET/MR acquisitions. In scenario 1, scatter-compensated reconstructions achieved <1% global bias in all active regions. In scenario 2, noisy scatter estimates caused positive bias, but Gaussian smoothing restored accuracy to scenario 1 levels. In scenario 3, joint estimation maintained <1% bias in nearly all regions. For real scans, the MC-based scatter estimate closely matched the vendor-provided scatter estimate. This proof-of-concept demonstrates that scatter sensitivity modeling can enhance simulators by incorporating detector physics. It supports the feasibility of using fast MC simulations for real scans, offering improved accuracy and robustness to acquisition noise in clinical PET reconstruction.

physics.med-ph

A Fast Convergent Ordered-Subsets Algorithm with Subiteration-Dependent Preconditioners for PET Image Reconstruction

We investigated the imaging performance of a fast convergent ordered-subsets algorithm with subiteration-dependent preconditioners (SDPs) for positron emission tomography (PET) image reconstruction. In particular, we considered the use of SDP with the block sequential regularized expectation maximization (BSREM) approach with the relative difference prior (RDP) regularizer due to its prior clinical adaptation by vendors. Because the RDP regularization promotes smoothness in the reconstructed image, the directions of the gradients in smooth areas more accurately point toward the objective function's minimizer than those in variable areas. Motivated by this observation, two SDPs have been designed to increase iteration step-sizes in the smooth areas and reduce iteration step-sizes in the variable areas relative to a conventional expectation maximization preconditioner. The momentum technique used for convergence acceleration can be viewed as a special case of SDP. We have proved the global convergence of SDP-BSREM algorithms by assuming certain characteristics of the preconditioner. By means of numerical experiments using both simulated and clinical PET data, we have shown that the SDP-BSREM algorithms substantially improve the convergence rate, as compared to conventional BSREM and a vendor's implementation as Q.Clear. Specifically, SDP-BSREM algorithms converge 35\%-50\% faster in reaching the same objective function value than conventional BSREM and commercial Q.Clear algorithms. Moreover, we showed in phantoms with hot, cold and background regions that the SDP-BSREM algorithms approached the values of a highly converged reference image faster than conventional BSREM and commercial Q.Clear algorithms.

math.NA