Comprehensive Analysis of High-Performance Computing Methods for Filtered Back-Projection

Authors

  • Christian B. Mendl Technische Universität München Mathematics Department M7 Boltzmannstraße 3 85748 Garching bei München Germany
  • Steven N. Eliuk Servier Virtual Cardiac Centre, Department of Radiology and Diagnostic Imaging, University of Alberta, Canada
  • Michelle Noga Servier Virtual Cardiac Centre, Department of Radiology and Diagnostic Imaging, University of Alberta, Canada
  • Pierre Boulanger Servier Virtual Cardiac Centre, Department of Radiology and Diagnostic Imaging, University of Alberta, Canada

Abstract

This paper provides an extensive analysis concerning runtime, accuracy and noise of High-Performance Computing (HPC) frameworks for Computed Tomography (CT) reconstruction tasks: "conventional" multi-core, multi threaded CPUs, the Compute Unified Device Architecture (CUDA) on GPUs, and the graphics pipeline of GPUs as facilitated by the DirectX or OpenGL programming interfaces, exploiting various built-in hardwired features like rasterization and texture filtering. We compare implementations of the Filtered Back-Projection (FBP) algorithm with fan-beam geometry on all these HPC frameworks. Specifically, an ACR-accredited phantom is reconstructed from the raw attenuation data acquired by a clinical CT scanner. Our analysis shows that a single GPU can run the FBP algorithm for reconstructing a 1024 x 1024 image considerably faster than a 64-core, multi-threaded CPU machine. Moreover, employing the graphics pipeline further increases performance as compared to CUDA, albeit with slightly lower accuracy due to "fast math" operations.

Keywords

X-ray imaging and computed tomography, image reconstruction -- analytical methods, parallel computing

Author Biography

Christian B. Mendl, Technische Universität München Mathematics Department M7 Boltzmannstraße 3 85748 Garching bei München Germany

Postdoctoral Fellow

Published

2013-03-04

Downloads

Download data is not yet available.