This project implements a parallel algorithm for Computed Tomography based on the Algebraic Reconstruction Technique (ART) algorithm. This technique for reconstructing pictures from projections is useful for applications such as Computed Tomography (CT or CAT). The algorithm requires fewer views, and hence less radiation, to produce an image of comparable or better quality. However, the approach is not widely used because of its computationally intensive nature in comparison with rival technologies. A faster ART algorithm could reduce the amount of radiation needed for CT imaging by producing a better image with fewer projections.
A reconstruction from projections version of the ART algorithm for two dimensions was implemented in parallel using the Message Passing Interface (MPI) and OpenMP extensions for C. The message passing implementation did not result in faster reconstructions due to prohibitively long and variant communication latency. The shared memory implementation produced positive results, showing a clear computational advantage for multiple processors and measured efficiency ranging from 60-95%. Consistent with the literature, image quality proved to be significantly better compared to the industry standard Filtered Backprojection algorithm especially when reconstructing from fewer projection angles. / October 2006
| Identifer | oai:union.ndltd.org:LACETR/oai:collectionscanada.gc.ca:MWU.anitoba.ca/dspace#1993/292 |
| Date | 05 October 2007 |
| Creators | Melvin, Cameron |
| Contributors | Thulasiraman, Parimala (Computer Science), McLeod, Robert (Electrical and Computer Engineering) Noghanian, Sima (Electrical and Computer Engineering) |
| Source Sets | Library and Archives Canada ETDs Repository / Centre d'archives des thèses électroniques de Bibliothèque et Archives Canada |
| Language | en_US |
| Detected Language | English |
| Type | Electronic Thesis or Dissertation |
| Format | 1989360 bytes, application/pdf |
Page generated in 0.002 seconds