RWTH Publications (RWTH Aachen) · 2019 · 75 citations · 47 references
Open access
EngineeringComputer EngineeringNuclear MedicineBiomedical ImagingDiagnostic ImagingField-programmable Gate ArraysDetector TechnologyField-programmable Gate Array ArchitectureFpga ArchitecturePositron Emission TomographyRadiation Imaging DetectorsScintillation DetectorsAstigmatismDetector Spatial ResolutionGradient BoostingGradient Boosting TreesParallax CorrectionPet Detector TechnologyPositron Emission Tomography ScintillatorsScintillator Crystals
Monolithic crystals are examined as an alternative to segmented scintillator arrays in positron emission tomography (PET). Monoliths provide good energy, timing, and spatial resolution including intrinsic depth of interaction (DOI) encoding. DOI allows reducing parallax errors (radial astigmatism) at off-center positions within a PET ring. We present a novel DOI-estimation approach based on the supervised machine learning algorithm gradient tree boosting (GTB). GTB builds predictive regression models based on sequential binary comparisons (decision trees). GTB models have been shown to be implementable in FPGA if the memory requirement fits the available resources. We propose two optimization scenarios for the best possible positioning performance: One restricting the available memory to enable a future FPGA implementation and one without any restrictions. The positioning performance of the GTB models is compared with a DOI estimation method based on a single DOI observable (SO) comparable to other methods presented in literature. For a 12 mm high monolith, we achieve an averaged spatial resolution of 2.15 mm and 2.12 mm FWHM for SO and GTB models, respectively. In contrast to SO models, GTB models show a nearly uniform positioning performance over the whole crystal depth.
47
Scikit-learn: Machine Learning in Python
Fabián Pedregosa, Gaël Varoquaux, Alexandre Gramfort et al. · arXiv (Cornell University) · 2012 · 63.7K citations · Full text
Matplotlib: A 2D Graphics Environment
John D. Hunter · Computing in Science & Engineering · 2007 · 39.6K citations
Greedy function approximation: A gradient boosting machine.
Jerome H. Friedman · The Annals of Statistics · 2001 · 29K citations · Full text