...
首页> 外文期刊>Physics in medicine and biology. >Improved event positioning in a gamma ray detector using an iterative position-weighted centre-of-gravity algorithm
【24h】

Improved event positioning in a gamma ray detector using an iterative position-weighted centre-of-gravity algorithm

机译:使用迭代位置加权重心算法改进了伽马射线探测器中的事件定位

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

获取外文期刊封面封底 >>

       

摘要

An iterative position-weighted centre-of-gravity algorithm was developed and tested for positioning events in a silicon photomultiplier (SiPM)-based scintillation detector for positron emission tomography. The algorithm used a Gaussian-based weighting function centred at the current estimate of the event location. The algorithm was applied to the signals from a 4 × 4 array of SiPM detectors that used individual channel readout and a LYSO:Ce scintillator array. Three scintillator array configurations were tested: single layer with 3.17 mm crystal pitch, matched to the SiPM size; single layer with 1.5 mm crystal pitch; and dual layer with 1.67 mm crystal pitch and a crystal offset in the X and Y directions between the two layers. The flood histograms generated by this algorithm were shown to be superior to those generated by the standard centre of gravity. The width of the Gaussian weighting function of the algorithm was optimized for different scintillator array setups. The optimal width of the Gaussian curve was found to depend on the amount of light spread. The algorithm required less than 20 iterations to calculate the position of an event. The rapid convergence of this algorithm will readily allow for implementation on a front-end detector processing field programmable gate array for use in improved real-time event positioning and identification.
机译:开发了一种迭代位置加权重心算法,并在基于硅光电倍增管(SiPM)的闪烁探测器中对正电子发射断层扫描的定位事件进行了测试。该算法使用了基于高斯的加权函数,该函数以事件位置的当前估计为中心。该算法已应用于来自4×4 SiPM检测器阵列的信号,该阵列使用单独的通道读数和LYSO:Ce闪烁体阵列。测试了三种闪烁体阵列配置:具有3.17 mm晶体节距且与SiPM尺寸匹配的单层;单层晶体间距为1.5毫米;双层具有1.67mm的晶体节距,并且两层之间在X和Y方向上具有晶体偏移。该算法生成的洪水直方图显示出优于标准重心生成的直方图。算法的高斯加权函数的宽度针对不同的闪烁体阵列设置进行了优化。发现高斯曲线的最佳宽度取决于光扩散的量。该算法需要少于20次迭代来计算事件的位置。该算法的快速收敛将很容易实现在前端探测器处理现场可编程门阵列上的实现,以用于改进的实时事件定位和识别。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号