CUDA Based Parallel Implementation of BPF Algorithm
Author:
Affiliation:

Funding:

Ethical statement:

  • Article
  • |
  • Figures
  • |
  • Metrics
  • |
  • Reference
  • |
  • Related
  • |
  • Cited by
  • |
  • Materials
    Abstract:

    Based on its region-of-interest (ROI) reconstruction advantage, backprojection-filter algorithm has been used in cone-beam CT recently. However, because of its complexity and computation, there is memory insufficiency in the implementation of GPU acceleration. Hence, CUDA-based parallel implementation for BPF algorithm was proposed. Meanwhile, an accelerated projection scheme and other accelerated techniques were included as well, such as features of BPF for acceleration. Besides, video memory pool was introduced to optimize the implementation. With an efficient structure, the simulation results show that it takes only 8.055 seconds by using the new structure to reconstruct 512×512×512 data and only 4.566 seconds for the ROI reconstruction. The output of first block data takes only 1.523 seconds. With a great decrease of memory occupation from 2.5 GB to less than 100 MB, the new scheme is suitable for big data reconstruction.

    Reference
    Related
    Cited by
Get Citation

WU Shaojia, CHEN Hao, LIAO Li, et al. CUDA Based Parallel Implementation of BPF Algorithm[J]. Journal of Integration Technology,2014,3(5):61-68

Copy
Share
Article Metrics
  • Abstract:
  • PDF:
  • HTML:
History
  • Received:
  • Revised:
  • Adopted:
  • Online: September 25,2014
  • Published:
Baidu
map