首页> 外文期刊>IEEE Transactions on Medical Imaging >A Fast Fully 4-D Incremental Gradient Reconstruction Algorithm for List Mode PET Data
【24h】

A Fast Fully 4-D Incremental Gradient Reconstruction Algorithm for List Mode PET Data

机译:列表模式PET数据的快速全4D增量梯度重建算法

获取原文
获取原文并翻译 | 示例
           

摘要

We describe a fast and globally convergent fully four-dimensional incremental gradient (4DIG) algorithm to estimate the continuous-time tracer density from list mode positron emission tomography (PET) data. Detection of 511-keV photon pairs produced by positron-electron annihilation is modeled as an inhomogeneous Poisson process whose rate function is parameterized using cubic B-splines. The rate functions are estimated by minimizing the cost function formed by the sum of the negative log-likelihood of arrival times, spatial and temporal roughness penalties, and a negativity penalty. We first derive a computable bound for the norm of the optimal temporal basis function coefficients. Based on this bound we then construct and prove convergence of an incremental gradient algorithm. Fully 4-D simulations demonstrate the substantially faster convergence behavior of the 4DIG algorithm relative to preconditioned conjugate gradient. Four-dimensional reconstructions of real data are also included to illustrate the performance of this method
机译:我们描述了一种快速且全局收敛的全二维增量梯度(4DIG)算法,以从列表模式正电子发射断层扫描(PET)数据估计连续时间示踪剂密度。将通过正电子电子ni灭产生的511-keV光子对的检测建模为不均匀的Poisson过程,其泊松速率函数使用三次B样条参数化。通过最小化到达时间的对数似然可能性,空间和时间粗糙度惩罚以及负性惩罚的总和形成的成本函数,可以估算费率函数。我们首先导出最优时间基函数系数范数的可计算界。然后,基于此界限,我们构造并证明了增量梯度算法的收敛性。完全的4-D模拟表明,相对于预处理的共轭梯度,4DIG算法的收敛速度快得多。还包括真实数据的四维重建,以说明此方法的性能

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号