IEEE Transactions on Radiation and Plasma Medical Sciences · 2018 · 77 citations · 33 references
EngineeringComputer EngineeringNuclear MedicineDiagnostic ImagingField-programmable Gate ArraysReconfigurable ComputingDiagnostic Imaging SystemsField-programmable Gate Array ArchitecturePositron Emission TomographyRadiation Imaging DetectorsRadiation Imaging SystemsScintillation DetectorsDetector Energy ResolutionField-programmable Gate Arrays (Fpgas)Gradient BoostingGradient Boosting TreesPositron Emission Tomography ScintillatorsRadiation Energy ResolutionScintillator CrystalsSystem Energy Resolution
Monolithic crystals are considered as an alternative for complex segmented scintillator arrays in positron emission tomography systems. Monoliths provide high sensitivity, good timing, and energy resolution while being cheaper than highly segmented arrays. Furthermore, monoliths enable intrinsic depth of interaction capabilities and good spatial resolutions (SRs) mostly based on statistical calibrations. To widely translate monoliths into clinical applications, a time-efficient calibration method and a positioning algorithm implementable in system architecture such as field-programmable gate arrays (FPGAs) are required. We present a novel positioning algorithm based on gradient tree boosting (GTB) and a fast fan beam calibration requiring less than 1 h per detector block. GTB is a supervised machine learning technique building a set of sequential binary decisions (decision trees). The algorithm handles different sets of input features, their combinations and partially missing data. GTB models are strongly adaptable influencing both the positioning performance and the memory requirement of trained positioning models. For an FPGA-implementation, the memory requirement is the limiting aspect. We demonstrate a general optimization and propose two different optimization scenarios: one without compromising on positioning performance and one optimizing the positioning performance for a given memory restriction. For a 12 mm high LYSO-block, we achieve an SR better than 1.4 mm FWHM.
33
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
Greedy function approximation: A gradient boosting machine.
Jerome H. Friedman · The Annals of Statistics · 2001 · 29K citations · Full text
Gradient boosting machines, a tutorial
Alexey Natekin, Alois Knoll · Frontiers in Neurorobotics · 2013 · 3.8K citations · Full text