Fast algorithm for list mode back-projection of Compton scatter camera data
Fast algorithm for list mode back-projection of Compton scatter camera data
复制标题
康普顿散射相机数据列表模式反投影的快速算法
DOI：
--
复制
发表时间：
1997
期刊：
影响因子：
--
通讯作者：
J. Engdahl
中科院分区：
文献类型：
--
作者：
S. Wilderman;W. Rogers;G. Knoll;J. Engdahl
提出了一种快速算法，用于康普顿相机投影数据的反投影在列表模式的方式，每个光子每个图像切片的操作的数量尺度小于图像空间的维度。该方法集中于描绘像素（或体素）边界的网格线的网格，而不是像素本身，并且涉及仅与图像空间边界和图像空间的每个平面的边界交点附近的那些网格线的反投影康普顿锥的交点的计算。取决于反向投影的锥体和图像网格线的取向，每个光子每个图像切片需要锥体/网格交叉的4次和N +4次之间的确定（通过二次解），其中N是图像空间的维度。因此，该方法的浮点运算总数为4到N +4倍，是每个光子求解二次方程的运算次数。用于层析重建的反投影可以通过步进通过平行于康普顿孔径的图像空间中的平面序列而容易地获得。背投影图像，使用蒙特卡罗模拟的实际探测器配置和各种源分布所产生的数据。
A fast algorithm is presented for back-projection of Compton camera projection data in a list mode fashion for which the number of operations per photon per image slice scales at less than the dimension of the image space. The method focuses on the mesh of grid lines which delineate pixel (or voxel) boundaries, rather than on the pixels themselves, and involves computation of the intersection of back-projected Compton cones with just the image space boundaries and those grid lines near the boundary intersection points for each plane of the image space. Depending on the orientation of the back projected cone and the image grid lines, between 4 and N+4 determinations (by quadratic solution) of cone/mesh intersections are required per image slice per photon, where N is the dimension of the image space. Thus the total number of floating point operations for this method from 4 to N+4 times the number of operations in solving a quadratic for each photon. Back-projections for tomographic reconstructions can be readily obtained by stepping through the sequence of planes n the image space parallel to the Compton aperture. Back-projected images are presented, using data generated by Monte Carlo simulation of a practical detector configuration and various source distributions.
DOI：
10.1364/josaa.14.002914
发表时间：
1997-11-01
影响因子：
1.9
作者：
Barrett, HH;White, T;Parra, LC
通讯作者：
Parra, LC