Rapid Simultaneous Algebraic Reconstruction Technique (SART) for Cone-Beam Geometry on Clustering System

An important problem in image processing is to construct a cross section of an object from several images of its transaxial projection. However, the time consuming and the complexity of the reconstruction process are the crucial problems. In addition, the reconstruction process requires very high performance of the computer. Therefore, in this paper, a concept of parallel programming method is employed to speed up a 3D simultaneous algebraic reconstruction technique. The scheduling process in the clustering system is improved. The appropriate amount of work is distributed to each computer (node) in the clustering system using centralized dynamic load balancing and a work-pool scheduling scheme, In this scheme round-robin algorithm for selecting a process is exercised. Our proposed system works successfully with decreasing the reconstruction time up to 78% percent referred to the normal image reconstruction form projection performed on a single computer.