A faster image reconstruction method for cone-beam CT using smallest 3D convex package of measured object

The introduction of the full paper reviews a number of papers in the open literature on fast image reconstruction and then proposes what we believe to be a faster reconstruction method, which is explained in sections 1 and 2. Section 1 presents the characteristics of the Z-line data priority reconstruction algorithm. The core of section 2 consists of: (1) we give the definition of the smallest 3D convex package, which is shown in Fig. 3; (2) on the basis of the projection relationship of cone-beam CT and the characteristics of the smallest 3D convex package of measured object, we put forward the algorithm for determining its three basic parameters; (3) we reconstruct only the voxels inside the smallest 3D convex package, thus greatly reducing its computational redundancy; for the complicated measured objects with varying cross-section shapes, we determine the smallest 3D convex packages section by section to further reduce their computational redundancy. To verify the effectiveness of our method, section 3 presents two sets of numerical simulation examples; the simulation results, given in Figs. 5 and 6 and Table 1, and their analysis show preliminarily that our method can effectively enhance the reconstruction speed of cone-beam CT and has good adaptability for complicated object measurement.