An investigation of 4D cone-beam CT algorithms for slowly rotating scanners

• Published in: Medical physics (Lancaster) Vol. 37; no. 9; p. 5044
• Main Authors: Bergner, Frank, Berkus, Timo, Oelhafen, Markus, Kunz, Patrik, Pa, Tinsu, Grimmer, Rainer, Ritschl, Ludwig, Kachelriess, Marc
• Format: Journal Article
• Language: English
• Published: United States 01.09.2010
• Subjects: Algorithms; Cone-Beam Computed Tomography - instrumentation; Cone-Beam Computed Tomography - methods; Four-Dimensional Computed Tomography - instrumentation; Four-Dimensional Computed Tomography - methods; Humans; Image Processing, Computer-Assisted; Phantoms, Imaging; Rotation; Time Factors
• ISSN: 0094-2405
• DOI: 10.1118/1.3480986

To evaluate several algorithms for 4D cone-beam computed tomography (4D CBCT) with slow rotating devices. 4D CBCT is used to perform phase-correlated (PC) reconstructions of moving objects, such as breathing patients, for example. Such motion phase-dependent reconstructions are especially useful for updating treatment plans in radiation therapy. The treatment plan can be registered more precisely to the motion of the tumor and, in consequence, the irradiation margins for the treatment, the so-called planning target volume, can be reduced significantly In the study, several algorithms were evaluated for kilovoltage cone-beam CT units attached to linear particle accelerators. The reconstruction algorithms were the conventional PC reconstruction, the McKinnon-Bates (MKB) algorithm, the prior image constrained compressed sensing (PICCS) approach, a total variation minimization (ASD-POCS) algorithm, and the auto-adaptive phase correlation (AAPC) algorithm. For each algorithm, the same motion-affected raw data were used, i.e., one simulated and one measured data set. The reconstruction results from the authors' implementation of these algorithms were evaluated regarding their noise and artifact levels, their residual motion blur, and their computational complexity and convergence. In general, it turned out that the residual motion blur was lowest in those algorithms which exclusively use data from a single motion phase. Algorithms using the image from the full data set as initialization or as a reference for the reconstruction were not capable of fully removing the motion blurring. The iterative algorithms, especially approaches based on total variation minimization, showed lower noise and artifact levels but were computationally complex. The conventional methods based on a single filtered backprojection were computationally inexpensive but suffered from higher noise and streak artifacts which limit the usability. In contrast, these methods showed to be less demanding and more predictable in their outcome than the total variation minimization based approaches. The reconstruction algorithms including at least one iterative step can reduce the 4 CBCT specific artifacts. Nevertheless, the algorithms that use the full data set, at least for initialization, such as MKB and PICCS in the authors' implementation, are only a trade-off and may not fully achieve the optimal temporal resolution. A predictable image quality as seen in conventional reconstruction methods, i.e., without total variation minimization, is a desirable property for reconstruction algorithms. Fast, iterative approaches such as the MKB can therefore be seen as a suitable tradeoff.