Fast and memory-efficient reconstruction of sparse Poisson data in listmode with non-smooth priors with application to time-of-flight PET
Georg Schramm, Martin Holler

TL;DR
This paper introduces a memory-efficient listmode SPDHG algorithm for reconstructing sparse Poisson data in TOF PET, significantly reducing memory usage and enabling faster, GPU-based reconstructions suitable for clinical practice.
Contribution
The paper presents a novel listmode extension of the SPDHG algorithm that handles sparse TOF PET data efficiently, reducing memory requirements and enabling GPU acceleration.
Findings
LM-SPDHG reduces memory from ~56GB to 0.7GB for short frames.
Convergence speed of LM-SPDHG matches original SPDHG.
Enables GPU-based reconstruction for clinical PET systems.
Abstract
Complete time of flight (TOF) sinograms of state-of-the-art TOF PET scanners have a large memory footprint. Currently, they contain ~4e9 data bins which amount to ~17GB in 32bit floating point precision. Using iterative algorithms to reconstruct such enormous TOF sinograms becomes increasingly challenging due to the memory requirements and the computation time needed to evaluate the forward model for every data bin. This is especially true for more advanced optimization algorithms such as the SPDHG algorithm which allows for the use of non-smooth priors using subsets with guaranteed convergence. SPDHG requires the storage of additional sinograms in memory, which severely limits its application to data sets from state-of-the-art TOF PET systems. Motivated by the generally sparse nature of the TOF sinograms, we propose and analyze a new listmode (LM) extension of the SPDHG algorithm for…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
