WIT Press


Parallel Implementations Of A 3-d Image Reconstruction Algorithm

Price

Free (open access)

Volume

3

Pages

15

Published

1993

Size

1,022 kb

Paper DOI

10.2495/ASE930131

Copyright

WIT Press

Author(s)

L. Pastor, A. Sanchez, F. Fernandez & A. Rodriguez

Abstract

Parallel implementations of a 3-d image reconstruction algorithm L. Pastor", A. Sanchez^ F. Fernandez", A. Rodriguez" " Dipartimento de Tecnologia Fotonica ^ Dipartimento de Lenguajes y sistemas Informdticos del Monte, Madrid, Spain ABSTRACT This paper compares two different parallel implementations of Feldkamp's cone-beam reconstruction method for 3D tomography. The first approach is based on a vector-parallel shared-memory architecture, and the second on a transputer-based distributed-memory architecture. The experimental results have shown the effectiveness of both models for executing this kind of compute intensive parallel algorithms. 1. INTRODUCTION From a computational point of view, 3D image reconstruction is a very demanding task. For example, for reconstructing an object with N* voxels (volume elements), the cone-beam backprojection operation, the most time- consuming stage on filtered backprojection methods (Feldkamp et al. [4]), requires around 60N* FLOP

Keywords