Optimal design in dynamic PET data acquisition: a new approach using simulated annealing and component-wise Metropolis updating

• Published in: IEEE transactions on nuclear science Vol. 49; no. 5; pp. 2291 - 2296
• Main Authors: Liao, W.-H., Lange, K., Bergsneider, M., Huang, S.-C.
• Format: Journal Article
• Language: English
• Published: New York IEEE 01.10.2002; The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
• Subjects: Algorithms; Biological system modeling; Combinatorial analysis; Computer simulation; Data acquisition; Design for experiments; Design optimization; Dynamics; In vivo; Monte Carlo methods; Monte Carlo simulation; Noise level; Optimization; Positron emission tomography; Sampling; Sampling methods; Schedules; Signal to noise ratio; Simulated annealing; Studies
• ISSN: 0018-9499; 1558-1578
• DOI: 10.1109/TNS.2002.803813

Dynamic positron emission tomography (PET) is a powerful tool of measuring biological activities in vivo. Due to the inherent high noise level, there are always concerns about how to increase the signal-to-noise ratio. One possible approach is to optimize the experimental design. In this paper, we propose a discretized representation of the experimental design and transform it to a combinatorial problem. This combinatorial optimization problem then can be solved using simulated annealing with component-wise Metropolis Monte Carlo simulation. We showed that using this novel approach one can design an optimal input function as well as an optimal sampling schedule efficiently. Our results show that the current dynamic scanning of approximately 20 frames does not give us much more information than an optimized four-frame schedule, and needlessly increases storage requirements. This is consistent with the conclusion given by Li et al. (1996). We also reproduced the optimal sampling schedule for the fluorodeoxy-glucose (FDG) study proposed. Moreover, we show that the single bolus injection is almost optimal in the sense of D-optimal design, as well as many other measures.