Fast parallel algorithm for three-dimensional distance-driven model in iterative computed tomography reconstruction |
Fast algorithm for forward projection operation in 3D cases. When | x 2 − x 1| > | y 2 − y 1| and | x 2 − x 1| > | z 2 − z 1|, we divide the 3D domain of ( N x , N y , N z ) voxels into the x planes, and the intersections can be up to three consecutive voxels contained in a 2 × 2 box; (a) the case with one intersecting voxel along both the y direction (when viewed in the x – y projection plane) and the z direction (when viewed in the x – z projection plane); (b) the case with one intersecting voxel along the y direction and two intersecting voxels along the z direction; (c) the case with two intersecting voxels along the y direction and one intersecting voxel along the z direction; and (d) cases with two intersecting voxels along both y and z directions. |