SU-F-BRCD-09: Total Variation (TV) Based Fast Convergent Iterative CBCT Reconstruction with GPU Acceleration

Fast Statistical Iterative Reconstruction for Mega-voltage Computed Tomography

Statistical iterative reconstruction is expected to improve the image quality of computed tomography (CT). However, one of the challenges of iterative reconstruction is its large computational cost. The purpose of this review is to summarize a fast iterative reconstruction algorithm by optimizing reconstruction parameters. Megavolt projection data was acquired from a TomoTherapy system and reconstructed using in-house statistical iterative reconstruction algorithm. Total variation was used as the regularization term and the weight of the regularization term was determined by evaluating signal-to-noise ratio (SNR), contrast-to-noise ratio (CNR), and visual assessment of spatial resolution using Gammex and Cheese phantoms. Gradient decent with an adaptive convergence parameter, ordered subset expectation maximization (OSEM), and CPU/GPU parallelization were applied in order to accelerate the present reconstruction algorithm. The SNR and CNR of the iterative reconstruction were several times better than that of filtered back projection (FBP). The GPU parallelization code combined with the OSEM algorithm reconstructed an image several hundred times faster than a CPU calculation. With 500 iterations, which provided good convergence, our method produced a 512 × 512 pixel image within a few seconds. The image quality of the present algorithm was much better than that of FBP for patient data. J. Med. Invest. 67 : 30-39, February, 2020.

Accelerated fast iterative shrinkage thresholding algorithms for sparsity-regularized cone-beam CT image reconstruction

PURPOSE

The development of iterative image reconstruction algorithms for cone-beam computed tomography (CBCT) remains an active and important research area. Even with hardware acceleration, the overwhelming majority of the available 3D iterative algorithms that implement nonsmooth regularizers remain computationally burdensome and have not been translated for routine use in time-sensitive applications such as image-guided radiation therapy (IGRT). In this work, two variants of the fast iterative shrinkage thresholding algorithm (FISTA) are proposed and investigated for accelerated iterative image reconstruction in CBCT.

METHODS

Algorithm acceleration was achieved by replacing the original gradient-descent step in the FISTAs by a subproblem that is solved by use of the ordered subset simultaneous algebraic reconstruction technique (OS-SART). Due to the preconditioning matrix adopted in the OS-SART method, two new weighted proximal problems were introduced and corresponding fast gradient projection-type algorithms were developed for solving them. We also provided efficient numerical implementations of the proposed algorithms that exploit the massive data parallelism of multiple graphics processing units.

RESULTS

The improved rates of convergence of the proposed algorithms were quantified in computer-simulation studies and by use of clinical projection data corresponding to an IGRT study. The accelerated FISTAs were shown to possess dramatically improved convergence properties as compared to the standard FISTAs. For example, the number of iterations to achieve a specified reconstruction error could be reduced by an order of magnitude. Volumetric images reconstructed from clinical data were produced in under 4 min.

CONCLUSIONS

The FISTA achieves a quadratic convergence rate and can therefore potentially reduce the number of iterations required to produce an image of a specified image quality as compared to first-order methods. We have proposed and investigated accelerated FISTAs for use with two nonsmooth penalty functions that will lead to further reductions in image reconstruction times while preserving image quality. Moreover, with the help of a mixed sparsity-regularization, better preservation of soft-tissue structures can be potentially obtained. The algorithms were systematically evaluated by use of computer-simulated and clinical data sets.

Fast Megavoltage Computed Tomography: A Rapid Imaging Method for Total Body or Marrow Irradiation in Helical Tomotherapy

PURPOSE

Megavoltage computed tomographic (MVCT) imaging has been widely used for the 3-dimensional (3-D) setup of patients treated with helical tomotherapy (HT). One drawback of MVCT is its very long imaging time, the result of slow couch speeds of approximately 1 mm/s, which can be difficult for the patient to tolerate. We sought to develop an MVCT imaging method allowing faster couch speeds and to assess its accuracy for image guidance for HT.

METHODS AND MATERIALS

Three cadavers were scanned 4 times with couch speeds of 1, 2, 3, and 4 mm/s. The resulting MVCT images were reconstructed using an iterative reconstruction (IR) algorithm with a penalty term of total variation and with a conventional filtered back projection (FBP) algorithm. The MVCT images were registered with kilovoltage CT images, and the registration errors from the 2 reconstruction algorithms were compared. This fast MVCT imaging was tested in 3 cases of total marrow irradiation as a clinical trial.

RESULTS

The 3-D registration errors of the MVCT images reconstructed with the IR algorithm were smaller than the errors of images reconstructed with the FBP algorithm at fast couch speeds (2, 3, 4 mm/s). The scan time and imaging dose at a speed of 4 mm/s were reduced to 30% of those from a conventional coarse mode scan. For the patient imaging, faster MVCT (3 mm/s couch speed) scanning reduced the imaging time and still generated images useful for anatomic registration.

CONCLUSIONS

Fast MVCT with the IR algorithm is clinically feasible for large 3-D target localization, which may reduce the overall time for the treatment procedure. This technique may also be useful for calculating daily dose distributions or organ motion analyses in HT treatment over a wide area. Automated integration of this imaging is at least needed to further assess its clinical benefits.

Boundary-enhancement in propagation-based x-ray phase-contrast tomosynthesis improves depth position characterization

Propagation-based x-ray phase-contrast (PB XPC) tomosynthesis combines the concepts of tomosynthesis and XPC imaging to realize the advantages of both for biological imaging applications. Tomosynthesis permits reductions in acquisition times compared with full-view tomography, while XPC imaging provides the opportunity to resolve weakly absorbing structures. In this note, an investigation of the depth resolving properties of PB XPC tomosynthesis is conducted. The results demonstrate that in-plane structures display strong boundary-enhancement while out-of-plane structures do not. This effect can facilitate the identification of in-plane structures in PB XPC tomosynthesis that could normally not be distinguished from out-of-plane structures in absorption-based tomosynthesis.

Sparsity-regularized image reconstruction of decomposed K-edge data in spectral CT

The development of spectral computed tomography (CT) using binned photon-counting detectors has garnered great interest in recent years and has enabled selective imaging of K-edge materials. A practical challenge in CT image reconstruction of K-edge materials is the mitigation of image artifacts that arise from reduced-view and/or noisy decomposed sinogram data. In this note, we describe and investigate sparsity-regularized penalized weighted least squares-based image reconstruction algorithms for reconstructing K-edge images from few-view decomposed K-edge sinogram data. To exploit the inherent sparseness of typical K-edge images, we investigate use of a total variation (TV) penalty and a weighted sum of a TV penalty and an ℓ1-norm with a wavelet sparsifying transform. Computer-simulation and experimental phantom studies are conducted to quantitatively demonstrate the effectiveness of the proposed reconstruction algorithms.