1 / 36

Proton Computed Tomography The Positive Medical Imaging Technique

Proton Computed Tomography The Positive Medical Imaging Technique. Keith Evan Schubert Professor of Computer Science and Engineering California State University, San Bernardino. Why Protons?. 100. Photon. Proton. Dose %. Electron. Depth in Tissue. pCT Scanner. Problem Flow.

teryl
Download Presentation

Proton Computed Tomography The Positive Medical Imaging Technique

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript


  1. Proton Computed TomographyThe Positive Medical Imaging Technique Keith Evan Schubert Professor of Computer Science and Engineering California State University, San Bernardino

  2. Why Protons? 100 Photon Proton Dose % Electron Depth in Tissue

  3. pCT Scanner

  4. Problem Flow

  5. Discretized Area

  6. A Proton Path

  7. Problem Size ~107voxels ~ 108 proton paths (min) ~ 400 voxels/paths Thus: Size(A) ~107108 = 1 PB (dense) Computation SVD ~ 107107108 = 1010Tflops/Cycle

  8. Problem Size ~107voxels ~ 108 proton paths (min) ~ 400 voxels/paths Thus: Size(A) ~ 108 103 =100 GB Computation ART ~ 103103108 = 102Tflops/Cycle

  9. Problem Flow

  10. Convex Hull

  11. Convex Hull

  12. Convex Hull

  13. Convex Hull

  14. Convex Hull

  15. Convex Hull

  16. Simulation Space Carving Filtered Back Projection No Noise Noise

  17. Actual Scans Space Carving Filtered Back Projection Pediatric Head Phantom Rat Head

  18. Calculating Entry and Exit Points

  19. Problem Flow

  20. The Most Likely Path (1)

  21. The Most Likely Path (2) • 79 flops / step • Redundant calculations (Sigma/R) • 1600 possible (20.0 cm depth x 0.125 mm step) • 108 -109histories • Precalculate all Sigma/R terms • 7 flops/step

  22. Proton Histories vs. Depth

  23. Reconstruction • Sparse Sequential algorithm • ART • Sparse Parallel algorithm • Fully simultaneous algorithms • Cimmino, CAV • Block iterative • BIP, BICAV, DROP, OS-SART • String averaged • SAP, CARP

  24. ART x1 x0 x0 x6 x5 x2 x4 x3

  25. Cimmino x0 x0 x1

  26. Block Iterative Projections x0 x0 x1

  27. Block Iterative Projections x0 x0 x1 x2

  28. String Averaged Projections x0 x0 x1

  29. BIP Xk+1 xk ai

  30. Fermi

  31. Iteration Calculate Residual Sync Blocks Update x x += c AT R b - A x = R -

  32. Summing In Inner Product 0 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 8 10 12 14 16 18 20 22 24 28 32 36 56 64 120

  33. SAP Number of Histories Protons=5 voxels Protons=voxels Protons=10 voxels Protons=20 voxels

  34. SAP Relaxation Parameter 0.01 0.1 0.2 0.5

  35. Conclusions • A simple convex hull calculation is fast and precise • GPGPU acceleration yields a three order of magnitude increase in speed • Pre-calculating and binning yields a two order of magnitude increase in speed • SAP gives good convergence and image quality • 2D (single machine) 12 hours to a few seconds • 3D (cluster) day to under 30 minutes • More to do…

More Related