1. 3D Alternating Direction TV-Based Cone-Beam CT Reconstruction with Efficient GPU Implementation
- Author
-
Ailong Cai, Xi Xiaoqi, Min Guan, Jianxin Li, Hanming Zhang, Linyuan Wang, Bin Yan, and Lei Li
- Subjects
Cone beam computed tomography ,Article Subject ,Computer science ,Computation ,Iterative reconstruction ,lcsh:Computer applications to medicine. Medical informatics ,General Biochemistry, Genetics and Molecular Biology ,Mice ,Linearization ,Computer Graphics ,Image Processing, Computer-Assisted ,Animals ,Computer Simulation ,Computer vision ,Image resolution ,Infinite impulse response ,Moore–Penrose pseudoinverse ,Models, Statistical ,General Immunology and Microbiology ,Computers ,Phantoms, Imaging ,business.industry ,X-Rays ,Applied Mathematics ,3D reconstruction ,General Medicine ,Cone-Beam Computed Tomography ,Modeling and Simulation ,Radiographic Image Interpretation, Computer-Assisted ,lcsh:R858-859.7 ,Artificial intelligence ,business ,Algorithm ,Algorithms ,Research Article - Abstract
Iterative image reconstruction (IIR) with sparsity-exploiting methods, such as total variation (TV) minimization, claims potentially large reductions in sampling requirements. However, the computation complexity becomes a heavy burden, especially in 3D reconstruction situations. In order to improve the performance for iterative reconstruction, an efficient IIR algorithm for cone-beam computed tomography (CBCT) with GPU implementation has been proposed in this paper. In the first place, an algorithm based on alternating direction total variation using local linearization and proximity technique is proposed for CBCT reconstruction. The applied proximal technique avoids the horrible pseudoinverse computation of big matrix which makes the proposed algorithm applicable and efficient for CBCT imaging. The iteration for this algorithm is simple but convergent. The simulation and real CT data reconstruction results indicate that the proposed algorithm is both fast and accurate. The GPU implementation shows an excellent acceleration ratio of more than 100 compared with CPU computation without losing numerical accuracy. The runtime for the new 3D algorithm is about 6.8 seconds per loop with the image size of256×256×256and 36 projections of the size of512×512.
- Published
- 2014