TY - GEN
T1 - Joint amplitude and timing estimation for scintillation pulses in GPU
AU - Ruiz-Gonzalez, Maria
AU - Caucci, Luca
AU - Furenlid, Lars R.
N1 - Publisher Copyright:
© 2016 IEEE.
PY - 2017/10/16
Y1 - 2017/10/16
N2 - We present an implementation on a graphics processing unit (GPUs) of a maximum-likelihood (ML) contractinggrid algorithm that performs joint estimation of amplitude and time of scintillation pulses. ML estimation consists in finding the parameters that maximizes the likelihood. We proposed a multivariate normal model for the likelihood, which implies that we need mean pulses and covariance matrices for every parameter variation. In a previous work, we performed a Fisher information analysis to determine the minimum number of samples that contains the most timing information in a digital pulse, for a given acquisition rate. Here, we use just the right amount of samples to reduce the size of mean pulses and covariance matrices. In order to reduce the number of precomputed mean pulses and covariance matrices, we take advantage of the linearity of scintillation pulses, which allows us to scale a normalized pulse to obtain mean pulses of any amplitude. We make use of this information to limit the amount of computation and shared memory used in our GPU code, while preserving full timing performance. We developed our code on an Nvidia Tesla C2075 GPU and we were able to process 1.5 million events per second. The estimation algorithm and GPU implementation can be used in real-time for systems that require high temporal resolution such as time-of-flight positron emission tomography or in processes that have high gamma-ray count rate.
AB - We present an implementation on a graphics processing unit (GPUs) of a maximum-likelihood (ML) contractinggrid algorithm that performs joint estimation of amplitude and time of scintillation pulses. ML estimation consists in finding the parameters that maximizes the likelihood. We proposed a multivariate normal model for the likelihood, which implies that we need mean pulses and covariance matrices for every parameter variation. In a previous work, we performed a Fisher information analysis to determine the minimum number of samples that contains the most timing information in a digital pulse, for a given acquisition rate. Here, we use just the right amount of samples to reduce the size of mean pulses and covariance matrices. In order to reduce the number of precomputed mean pulses and covariance matrices, we take advantage of the linearity of scintillation pulses, which allows us to scale a normalized pulse to obtain mean pulses of any amplitude. We make use of this information to limit the amount of computation and shared memory used in our GPU code, while preserving full timing performance. We developed our code on an Nvidia Tesla C2075 GPU and we were able to process 1.5 million events per second. The estimation algorithm and GPU implementation can be used in real-time for systems that require high temporal resolution such as time-of-flight positron emission tomography or in processes that have high gamma-ray count rate.
UR - http://www.scopus.com/inward/record.url?scp=85041703196&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=85041703196&partnerID=8YFLogxK
U2 - 10.1109/NSSMIC.2016.8069435
DO - 10.1109/NSSMIC.2016.8069435
M3 - Conference contribution
AN - SCOPUS:85041703196
T3 - 2016 IEEE Nuclear Science Symposium, Medical Imaging Conference and Room-Temperature Semiconductor Detector Workshop, NSS/MIC/RTSD 2016
BT - 2016 IEEE Nuclear Science Symposium, Medical Imaging Conference and Room-Temperature Semiconductor Detector Workshop, NSS/MIC/RTSD 2016
PB - Institute of Electrical and Electronics Engineers Inc.
T2 - 2016 IEEE Nuclear Science Symposium, Medical Imaging Conference and Room-Temperature Semiconductor Detector Workshop, NSS/MIC/RTSD 2016
Y2 - 29 October 2016 through 6 November 2016
ER -