Efficient 3-D TOF PET reconstruction using view-grouped histo-images: DIRECT-direct image reconstruction for TOF.
Efficient 3-D TOF PET reconstruction using view-grouped histo-images: DIRECT-direct image reconstruction for TOF.
复制标题
DOI:
10.1109/tmi.2008.2012034
复制
发表时间:
2009-05
影响因子:
10.6
通讯作者:
Karp JS
中科院分区:
文献类型:
--
作者:
Matej S;Surti S;Jayanthi S;Daube-Witherspoon ME;Lewitt RM;Karp JS
For modern Time-Of-Flight PET systems, in which the number of possible lines of response and TOF bins is much larger than the number of acquired events, the most appropriate reconstruction approaches are considered to be list-mode methods. However, their shortcomings are relatively high computational costs for reconstruction and for sensitivity matrix calculation. Efficient treatment of TOF data within the proposed DIRECT approach is obtained by 1) angular (azimuthal and co-polar) grouping of TOF events to a set of views as given by the angular sampling requirements for the TOF resolution, and 2) deposition (weighted-histogramming) of these grouped events, and correction data, into a set of “histo-images”, one histo-image per view. The histo-images have the same geometry (voxel grid, size and orientation) as the reconstructed image. The concept is similar to the approach involving binning of the TOF data into angularly sub-sampled histo-projections -projections expanded in the TOF directions. However, unlike binning into histo-projections, the deposition of TOF events directly into the image voxels eliminates the need for tracing and/or interpolation operations during the reconstruction. Together with the performance of reconstruction operations directly in image space, this leads to a very efficient implementation of TOF reconstruction algorithms. Furthermore, the resolution properties are not compromised either, since events are placed into the image elements of the desired size from the beginning. Concepts and efficiency of the proposed data partitioning scheme are demonstrated in this work by using the DIRECT approach in conjunction with the Row-Action Maximum-Likelihood (RAMLA) algorithm.