High-speed cone-beam reconstruction on PC

Publisher Website
Google Scholar
Abstract
Cone beam reconstruction has attracted a great deal of attention in the medical imaging community. However, high-resolution cone beam reconstruction (CBR) involves a huge set of data and very time consuming computing. It usually needs customized hardware or a large-scale computer to achieve acceptable speed. Although the Feldkamp algorithm is an approximate CBR algorithm, it is a practical and efficient 3D reconstruction algorithm and is a basic component in several exact cone-beam reconstruction algorithms (CBRA). In this paper, we present a practical implementation for high-speed CBR on a commercially available PC based on hybrid computing (HC). We implement Feldkamp CBR with multi-level acceleration. We use HC utilizing single instruction multiple data (SIMD) and making execution units (EU) in the processor work effectively. We also utilize the multi-thread and fiber support on the operating system, which automatically enable the reconstruction parallelism in the multi-processor environment, and makes data I/O to the hard disk more effective. Memory and cache access optimization is done by properly data partition. This approach was tested on an Intel Pentium III 500Mhz computer and was compared to the traditional implementation. It decreases more than 75% the filtering time for 288 pieces projections, saves more than 60% of the reconstruction time for the 5123 cube, and maintains good precision with less than 0.08% average error. Our system is cost-effective and high-speed. An effective reconstruction engine can be built with a market-available Symmetric Multi-processor (SMP) computer. This is an easy and cheap upgrade and is compatible with newer PC processors.

This publication has 0 references indexed in Scilit: