Image reconstruction on hypercube computers

Abstract

The problem of the 3-D reconstruction of an object from its 2-D projection images using filtered backprojection is addressed. The implementation of the filtered backprojection method on hypercube computers is analyzed. It is shown that the parallel algorithm is general in the sense that it does not impose any restriction on the problem space dimensions and is adaptable to any hypercube dimension. The flexibility of the algorithm is rooted in the methodology developed for embedding algorithms into hypercubes. The algorithmic complexity is analyzed. Because the data redundancy associated with the replication of the projection images in all the PEs has allowed the process of simple backprojection to be designed without routing, an optimum algorithmic complexity is obtained.<>