Abstract
The backprojection-filtration (BPF) algorithm is one of the exact image reconstruction algorithms from cone-beam projections. It can be applied to reconstruct images for a wide class of general scanning trajectories and is capable of reconstructing an image within a region of interest (ROI) from projection data containing truncations. Just like the other 3D image reconstruction algorithms, the BPF algorithm is time consuming. Here we study a parallel computing scheme, which partitions the image data according to PI-planes, to accelerate the BPF algorithm. Several numerical experiments are conducted on a cluster to verify the benefits of parallel implementations.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
