z-logo
open-access-imgOpen Access
High throughput software-based gradient tree boosting positioning for PET systems
Author(s) -
Christian Wassermann,
Florian Mueller,
Thomas Dey,
Janko Lambertus,
David Schug,
Volkmar Schulz,
Julian Miller
Publication year - 2021
Publication title -
biomedical physics and engineering express
Language(s) - English
Resource type - Journals
ISSN - 2057-1976
DOI - 10.1088/2057-1976/ac11c0
Subject(s) - computer science , throughput , gradient boosting , boosting (machine learning) , hyperparameter , software , speedup , feature selection , real time computing , artificial intelligence , machine learning , parallel computing , random forest , operating system , wireless
The supervised machine learning technique Gradient Tree Boosting (GTB) has shown good accuracy for position estimation of gamma interaction in PET crystals for bench-top experiments while its computational requirements can easily be adjusted. Transitioning to preclinical and clinical applications requires near real-time processing in the scale of full PET systems. In this work, a high throughput GTB-based singles positioning C++ implementation is proposed and a series of optimizations are evaluated regarding their effect on the achievable processing throughput. Moreover, the crucial feature and parameter selection for GTB is investigated for the segmented detectors of the Hyperion II D PET insert with two main models and a range of GTB hyperparameters. The proposed framework achieves singles positioning throughputs of more than 9.5 GB/s for smaller models and of 240 MB/s for more complex models on a recent Intel Skylake server. Detailed throughput analysis reveals the key performance limiting factors, and an empirical throughput model is derived to guide the GTB model selection process and scanner design decisions. The throughput model allows for throughput estimations with a mean absolute error (MAE) of 175.78 MB/s.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.
Having issues? You can contact us here