论文标题
快速和自适应算法来计算X射线变换
A Fast and Adaptive Algorithm to Compute the X-ray Transform
论文作者
论文摘要
我们提出了一种新算法来计算由单位(Pixel/Voxel)基础函数表示的图像的X射线变换。基本问题是等效地计算与相关单元的射线的交点长度。对于任何给定的射线,我们首先得出了非散布可触及性的足够和必要条件。通过这种情况,我们区分了与射线产生有效相交的单位。仅针对这些单位而不是所有个体,我们通过获得的分析公式来计算交点长度。提出的算法适用于2D/3D平行梁和2D风扇梁。特别是,我们得出转化公式并将算法推广到3D圆形和螺旋锥束。此外,我们讨论了问题本身的内在歧义,并提出了解决方案。该算法不仅具有相对于图像的中心位置,比例和大小的适应性,而且还适合以最佳性并行化。比较研究表明,所提出的算法快速,更完整,并且相对于不同的扫描几何形状和不同的基础功能更为灵活。最后,我们通过上述扫描几何形状验证算法的正确性。
We propose a new algorithm to compute the X-ray transform of an image represented by unit (pixel/voxel) basis functions. The fundamental issue is equivalently calculating the intersection lengths of the ray with associated units. For any given ray, we first derive the sufficient and necessary condition for non-vanishing intersectability. By this condition, we then distinguish the units that produce valid intersections with the ray. Only for those units rather than all the individuals, we calculate the intersection lengths by the obtained analytic formula. The proposed algorithm is adapted to 2D/3D parallel beam and 2D fan beam. Particularly, we derive the transformation formulas and generalize the algorithm to 3D circular and helical cone beams. Moreover, we discuss the intrinsic ambiguities of the problem itself, and present a solution. The algorithm not only possesses the adaptability with regard to the center position, scale and size of the image, but also is suited to parallelize with optimality. The comparison study demonstrates the proposed algorithm is fast, more complete, and is more flexible with respect to different scanning geometries and different basis functions. Finally, we validate the correctness of the algorithm by the aforementioned scanning geometries.