Image reconstruction on hypercube computers

Author

Zapata, E.L. ; Benavides, I. ; Rivera, F.F. ; Bruguera, J.D. ; Carazo, J.M.

Author_Institution

Dept. of Electron., Univ. Santiago de Compostela, Spain

fYear

1990

fDate

8-10 Oct 1990

Firstpage

127

Lastpage

134

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

Keywords

computational complexity; computerised picture processing; parallel algorithms; 2-D projection images; 3-D reconstruction; algorithmic complexity; data redundancy; filtered backprojection; hypercube computers; image reconstruction; parallel algorithm; problem space dimensions; Algorithm design and analysis; Back; Concurrent computing; Convolution; Filtering; Fourier transforms; Hypercubes; Image processing; Image reconstruction; Reconstruction algorithms;

fLanguage

English

Publisher

ieee

Conference_Titel

Frontiers of Massively Parallel Computation, 1990. Proceedings., 3rd Symposium on the

Conference_Location

College Park, MD

Print_ISBN

0-8186-2053-6

Type

conf

DOI

10.1109/FMPC.1990.89448

Filename

89448