Iterative Cone-beam CT Reconstruction Research Articles

Fast 4D cone-beam CT from 60 s acquisitions.

Background & purposeFour dimensional Cone beam CT (CBCT) has many potential benefits for radiotherapy but suffers from poor image quality, long acquisition times, and/or long reconstruction times. In this work we present a fast iterative reconstruction algorithm for 4D reconstruction of fast acquisition cone beam CT, as well as a new method for temporal regularization and compare to state of the art methods for 4D CBCT.Materials & methodsRegularization parameters for the iterative algorithms were found automatically via computer optimization on 60 s acquisitions using the XCAT phantom. Nineteen lung cancer patients were scanned with 60 s arcs using the onboard image on a Varian trilogy linear accelerator. Images were reconstructed using an accelerated ordered subset algorithm. A frequency based temporal regularization algorithm was developed and compared to the McKinnon-Bates algorithm, 4D total variation and prior images compressed sensing (PICCS).ResultsAll reconstructions were completed in 60 s or less. The proposed method provided a structural similarity of 0.915, compared with 0.786 for the classic McKinnon-bates method. For the patient study, it provided fewer image artefacts than PICCS, and better spatial resolution than 4D TV.ConclusionFour dimensional iterative CBCT reconstruction was done in less than 60 s, demonstrating the clinical feasibility. The frequency based method outperformed 4D total variation and PICCS on the simulated data, and for patients allowed for tumor location based on 60 s acquisitions, even for slowly breathing patients. It should thus be suitable for routine clinical use.

Shading correction assisted iterative cone-beam CT reconstruction

Recent advances in total variation (TV) technology enable accurate CT image reconstruction from highly under-sampled and noisy projection data. The standard iterative reconstruction algorithms, which work well in conventional CT imaging, fail to perform as expected in cone beam CT (CBCT) applications, wherein the non-ideal physics issues, including scatter and beam hardening, are more severe. These physics issues result in large areas of shading artifacts and cause deterioration to the piecewise constant property assumed in reconstructed images. To overcome this obstacle, we incorporate a shading correction scheme into low-dose CBCT reconstruction and propose a clinically acceptable and stable three-dimensional iterative reconstruction method that is referred to as the shading correction assisted iterative reconstruction. In the proposed method, we modify the TV regularization term by adding a shading compensation image to the reconstructed image to compensate for the shading artifacts while leaving the data fidelity term intact. This compensation image is generated empirically, using image segmentation and low-pass filtering, and updated in the iterative process whenever necessary. When the compensation image is determined, the objective function is minimized using the fast iterative shrinkage-thresholding algorithm accelerated on a graphic processing unit. The proposed method is evaluated using CBCT projection data of the Catphan© 600 phantom and two pelvis patients. Compared with the iterative reconstruction without shading correction, the proposed method reduces the overall CT number error from around 200 HU to be around 25 HU and increases the spatial uniformity by a factor of 20 percent, given the same number of sparsely sampled projections. A clinically acceptable and stable iterative reconstruction algorithm for CBCT is proposed in this paper. Differing from the existing algorithms, this algorithm incorporates a shading correction scheme into the low-dose CBCT reconstruction and achieves more stable optimization path and more clinically acceptable reconstructed image. The method proposed by us does not rely on prior information and thus is practically attractive to the applications of low-dose CBCT imaging in the clinic.

Multiresolution iterative reconstruction in high-resolution extremity cone-beam CT

Application of model-based iterative reconstruction (MBIR) to high resolution cone-beam CT (CBCT) is computationally challenging because of the very fine discretization (voxel size <100 µm) of the reconstructed volume. Moreover, standard MBIR techniques require that the complete transaxial support for the acquired projections is reconstructed, thus precluding acceleration by restricting the reconstruction to a region-of-interest. To reduce the computational burden of high resolution MBIR, we propose a multiresolution penalized-weighted least squares (PWLS) algorithm, where the volume is parameterized as a union of fine and coarse voxel grids as well as selective binning of detector pixels. We introduce a penalty function designed to regularize across the boundaries between the two grids. The algorithm was evaluated in simulation studies emulating an extremity CBCT system and in a physical study on a test-bench. Artifacts arising from the mismatched discretization of the fine and coarse sub-volumes were investigated. The fine grid region was parameterized using 0.15 mm voxels and the voxel size in the coarse grid region was varied by changing a downsampling factor. No significant artifacts were found in either of the regions for downsampling factors of up to 4×. For a typical extremities CBCT volume size, this downsampling corresponds to an acceleration of the reconstruction that is more than five times faster than a brute force solution that applies fine voxel parameterization to the entire volume. For certain configurations of the coarse and fine grid regions, in particular when the boundary between the regions does not cross high attenuation gradients, downsampling factors as high as 10× can be used without introducing artifacts, yielding a ~50× speedup in PWLS. The proposed multiresolution algorithm significantly reduces the computational burden of high resolution iterative CBCT reconstruction and can be extended to other applications of MBIR where computationally expensive, high-fidelity forward models are applied only to a sub-region of the field-of-view.

SU‐D‐206‐01: Employing a Novel Consensus Optimization Strategy to Achieve Iterative Cone Beam CT Reconstruction On a Multi‐GPU Platform

Purpose:While compressed sensing‐based cone‐beam CT (CBCT) iterative reconstruction techniques have demonstrated tremendous capability of reconstructing high‐quality images from undersampled noisy data, its long computation time still hinders wide application in routine clinic. The purpose of this study is to develop a reconstruction framework that employs modern consensus optimization techniques to achieve CBCT reconstruction on a multi‐GPU platform for improved computational efficiency.Methods:Total projection data were evenly distributed to multiple GPUs. Each GPU performed reconstruction using its own projection data with a conventional total variation regularization approach to ensure image quality. In addition, the solutions from GPUs were subject to a consistency constraint that they should be identical. We solved the optimization problem with all the constraints considered rigorously using an alternating direction method of multipliers (ADMM) algorithm. The reconstruction framework was implemented using OpenCL on a platform with two Nvidia GTX590 GPU cards, each with two GPUs. We studied the performance of our method and demonstrated its advantages through a simulation case with a NCAT phantom and an experimental case with a Catphan phantom.Result:Compared with the CBCT images reconstructed using conventional FDK method with full projection datasets, our proposed method achieved comparable image quality with about one third projection numbers. The computation time on the multi‐GPU platform was ∼55 s and ∼ 35 s in the two cases respectively, achieving a speedup factor of ∼ 3.0 compared with single GPU reconstruction.Conclusion:We have developed a consensus ADMM‐based CBCT reconstruction method which enabled performing reconstruction on a multi‐GPU platform. The achieved efficiency made this method clinically attractive.

Iterative CBCT reconstruction using Hessian penalty

Statistical iterative reconstruction algorithms have shown potential to improve cone-beam CT (CBCT) image quality. Most iterative reconstruction algorithms utilize prior knowledge as a penalty term in the objective function. The penalty term greatly affects the performance of a reconstruction algorithm. The total variation (TV) penalty has demonstrated great ability in suppressing noise and improving image quality. However, calculated from the first-order derivatives, the TV penalty leads to the well-known staircase effect, which sometimes makes the reconstructed images oversharpen and unnatural. In this study, we proposed to use a second-order derivative penalty that involves the Frobenius norm of the Hessian matrix of an image for CBCT reconstruction. The second-order penalty retains some of the most favorable properties of the TV penalty like convexity, homogeneity, and rotation and translation invariance, and has a better ability in preserving the structures of gradual transition in the reconstructed images. An effective algorithm was developed to minimize the objective function with the majorization-minimization (MM) approach. The experiments on a digital phantom and two physical phantoms demonstrated the priority of the proposed penalty, particularly in suppressing the staircase effect of the TV penalty.

Parallelizing a Matched Pair of Ray-Tracing Projector and Backprojector for Iterative Cone-Beam CT Reconstruction

Iterative reconstruction methods in X-ray CT can provide better image quality than analytical methods but their applications in practice are still limited due to computationally expensive calculations of repeated projection and backprojection operations. In the past decade, GPU-accelerated methods have been successfully used to reduce the computation time for projection and backprojection. However, it has been of a difficult problem to overcome a trade-off between the accuracy of reconstructed images and the efficiency of parallel computations. For example, when the size of the voxel in the reconstructed volume is larger than that of the detector bin, the use of the conventional unmatched projector-backprojector pair can lower the accuracy of reconstructed images due to the error caused by the mismatch between the projector and backprojector. In this paper, we propose a new GPU-accelerated scheme for the most widely used ray-tracing method (RTM) to perform projection and backprojection operations. Unlike the previous works that accelerate the computation of backprojection by using approximations, our method does not use any approximations for parallelizing the projection and backprojection operations. Since our method is exact, the results are as accurate as those obtained from the nonaccelerated method. We apply our method to iterative reconstruction for dental cone-beam CT systems and test its performance using both the simulated data using a 3-D digital phantom and the real data acquired from an offset flat-panel X-ray CT system. Our experimental results show that, the proposed method achieves a substantially high acceleration rate while retaining the accuracy of the RTM for both projection and backprojection.

WE-G-18A-03: Cone Artifacts Correction in Iterative Cone Beam CT Reconstruction

Purpose: For iterative reconstruction (IR) in cone-beam CT (CBCT) imaging, data truncation along the superior-inferior (SI) direction causes severe cone artifacts in the reconstructed CBCT volume images. Not only does it reduce the effective SI coverage of the reconstructed volume, it also hinders the IR algorithm convergence. This is particular a problem for regularization based IR, where smoothing type regularization operations tend to propagate the artifacts to a large area. It is our purpose to develop a practical cone artifacts correction solution. Methods: We found it is the missing data residing in the truncated cone area that leads to inconsistency between the calculated forward projections and measured projections. We overcome this problem by using FDK type reconstruction to estimate the missing data and design weighting factors to compensate the inconsistency caused by the missing data. We validate the proposed methods in our multi-GPU low-dose CBCT reconstruction system on multiple patients' datasets. Results: Compared to the FDK reconstruction with full datasets, while IR is able to reconstruct CBCT images using a subset of projection data, the severe cone artifacts degrade overall image quality. For head-neck case under a full-fan mode, 13 out of 80 slices are contaminated. It is even moremore » severe in pelvis case under half-fan mode, where 36 out of 80 slices are affected, leading to inferior soft-tissue delineation. By applying the proposed method, the cone artifacts are effectively corrected, with a mean intensity difference decreased from ∼497 HU to ∼39HU for those contaminated slices. Conclusion: A practical and effective solution for cone artifacts correction is proposed and validated in CBCT IR algorithm. This study is supported in part by NIH (1R01CA154747-01)« less

3D dictionary learning based iterative cone beam CT reconstruction

Purpose: This work is to develop a 3D dictionary learning based cone beam CT (CBCT) reconstruction algorithm on graphic processing units (GPU) to improve the quality of sparse-view CBCT reconstruction with high efficiency. Methods : A 3D dictionary containing 256 small volumes (atoms) of 3 × 3 × 3 was trained from a large number of blocks extracted from a high quality volume image. On the basis, we utilized cholesky decomposition based orthogonal matching pursuit algorithm to find the sparse representation of each block. To accelerate the time-consuming sparse coding in the 3D case, we implemented the sparse coding in a parallel fashion by taking advantage of the tremendous computational power of GPU. Conjugate gradient least square algorithm was adopted to minimize the data fidelity term. Evaluations are performed based on a head-neck patient case. FDK reconstruction with full dataset of 364 projections is used as the reference. We compared the proposed 3D dictionary learning based method with tight frame (TF) by performing reconstructions on a subset data of 121 projections. Results: Compared to TF based CBCT reconstruction that shows good overall performance, our experiments indicated that 3D dictionary learning based CBCT reconstruction is able to recover finer structures, remove more streaking artifacts and also induce less blocky artifacts. Conclusion : 3D dictionary learning based CBCT reconstruction algorithm is able to sense the structural information while suppress the noise, and hence to achieve high quality reconstruction under the case of sparse view. The GPU realization of the whole algorithm offers a significant efficiency enhancement, making this algorithm more feasible for potential clinical application. ------------------------------- Cite this article as: Bai T, Yan H, Shi F, Jia X, Lou Y, Xu Q, Jiang S, Mou X. 3D dictionary learning based iterative cone beam CT reconstruction. Int J Cancer Ther Oncol 2014; 2(2):020240. DOI: 10.14319/ijcto.0202.40

GPU based iterative cone-beam CT reconstruction using empty space skipping technique

Iterative reconstruction of high-resolution cone-beam CT data is still a difficult task due to the demand for vast amounts of computer cycles and associated memory. In order to improve the performance of iterative algorithms for cone-beam CT reconstruction, an acceleration approach integrating GPU acceleration, empty space skipping and multi-resolution technique is proposed. The approach divides the reconstructed volume into equally sized blocks, and empty blocks are identified by reconstructing an initial low-resolution volume and segmenting it with threshold method. Then all non-empty blocks are packed into a new volume, which is initialized by interpolating the low resolution volume and reconstructed at full resolution using iterative algorithms. Finally these non-empty blocks are rearranged to get the reconstructed high-resolution volume. The whole process is implemented in parallel based on GPU. Since only the voxels in non-empty blocks are calculated, the number of considered voxels is greatly reduced, which translates directly into substantial computation, memory requirements and data transfer savings. The method is evaluated by reconstructing images from simulated projection data of phantom and CT datasets. The results indicate that our approach significantly improves the performance of iterative reconstruction while maintaining a high image quality, compared to conventional GPU-based approaches.

Cardiac motion-corrected iterative cone-beam CT reconstruction using a semi-automatic minimum cost path-based coronary centerline extraction

In this paper a method which combines iterative computed tomography reconstruction and coronary centerline extraction technique to obtain motion artifact-free reconstructed images of the coronary arteries are proposed and evaluated. The method relies on motion-vector fields derived from a set of coronary centerlines extracted at multiple cardiac phases within the R–R interval. Hereto, start and end points are provided by the user in one time-frame only. Using an elastic image registration, these points are propagated to all the remaining cardiac phases. Consequently, a multi-phase three-dimensional coronary centerline is determined by applying a semi-automatic minimum cost path based extraction method. Corresponding centerline positions are used to determine the relative motion-vector fields from phase to phase. Finally, dense motion-vector fields are achieved by thin-plate-spline interpolation and used to perform a motion-corrected iterative reconstruction of a selected region of interest. The performance of the method is validated on five patients, showing the improved sharpness of cardiac motion-corrected gated iterative reconstructions compared to the results achieved by a classical gated iterative method. The results are also compared to known manual and fully automatic coronary artery motion estimation methods.

GPU-based iterative cone-beam CT reconstruction using tight frame regularization

The x-ray imaging dose from serial cone-beam computed tomography (CBCT) scans raises a clinical concern in most image-guided radiation therapy procedures. It is the goal of this paper to develop a fast graphic processing unit (GPU)-based algorithm to reconstruct high-quality CBCT images from undersampled and noisy projection data so as to lower the imaging dose. For this purpose, we have developed an iterative tight-frame (TF)-based CBCT reconstruction algorithm. A condition that a real CBCT image has a sparse representation under a TF basis is imposed in the iteration process as regularization to the solution. To speed up the computation, a multi-grid method is employed. Our GPU implementation has achieved high computational efficiency and a CBCT image of resolution 512 × 512 × 70 can be reconstructed in ∼5 min. We have tested our algorithm on a digital NCAT phantom and a physical Catphan phantom. It is found that our TF-based algorithm is able to reconstruct CBCT in the context of undersampling and low mAs levels. We have also quantitatively analyzed the reconstructed CBCT image quality in terms of the modulation-transfer function and contrast-to-noise ratio under various scanning conditions. The results confirm the high CBCT image quality obtained from our TF algorithm. Moreover, our algorithm has also been validated in a real clinical context using a head-and-neck patient case. Comparisons of the developed TF algorithm and the current state-of-the-art TV algorithm have also been made in various cases studied in terms of reconstructed image quality and computation efficiency.

TH‐C‐BRA‐03: GPU‐Based Cone Beam CT Reconstruction

Cone‐beam CT (CBCT) has been widely used in image guided radiation therapy (IGRT) to acquire updated volumetric anatomical information before treatment fractions for accurate patient alignment purpose. However the excessive x‐ray imaging doses (a few cGy per scan) delivered to patients from serial CBCT scans raise a clinical concern in most IGRT procedures. This fact has greatly limited exploitation of IGRT's maximal potential. The imaging dose can be effectively reduced by reducing the number of x‐ray projections and/or lowering mAs levels in a CBCT scan. The image quality reconstructed from conventional FDK‐type algorithms however will be highly degraded. Recently total variation (TV) method has demonstrated its ability to reconstruct CBCT images from a few number of noisy x‐ray projections. Nonetheless such a method can hardly be applied in real clinical environments due to its long computational time (a few hours). It is highly desirable to develop a fast reconstruction scheme to obtain high quality CBCT images from undersampled and noisy projection data so as to lower the imaging dose.Utilizing GPU to speed up the computationally intensive tasks in CBCT reconstruction problems has drawn a lot of attention recently. In this talk GPU‐based CBCT reconstruction algorithms will be reviewed with an emphasis on an iterative CBCT reconstruction algorithm via TV regularization. We have recently developed a GPU‐friendly version of the forward‐backward splitting algorithm to solve the TV‐based reconstruction problem. Multi‐grid technique is also employed. It is found that 40 x‐ray projections are sufficient to reconstruct CBCT images with satisfactory quality for IGRT patient alignment purpose. Phantom studies indicate that CBCT images can be successfully reconstructed with our algorithm under as low as 0.1 mAs/projection level. Comparing with currently widely used full‐fan head‐and‐neck scanning protocol of about 360 projections with 0.4 mAs/projection it is estimated that an overall 36 times dose reduction has been achieved. Moreover the reconstruction time is about 130 sec on an NVIDIA Tesla C1060 GPU card which is estimated ∼100 times faster than similar iterative reconstruction approaches. The high computational efficiency and satisfactory image quality make the iterative low dose CBCT reconstruction approach feasible in real clinical environments.Learning Objectives:1. Understand basic concepts of GPU‐based CBCT reconstruction.2. Understand main challenges in GPU‐based iterative CBCT reconstruction approach and how an iterative CBCT reconstruction problem is solved on GPU.Conflict of Interest: The research presented here is partially supported by NVIDIA.

WE-E-201B-01: GPU-Based Fast Cone Beam CT Reconstruction from Undersampled and Noisy Projection Data Via Total Variation

Purpose: Cone-beam CT (CBCT) plays an important role in image guided radiation therapy (IGRT). However, the large radiation dose from serial CBCT scans in most IGRT procedures raises a clinical concern. This excessive imaging dose can be reduced by reducing the number of x-ray projections and/or lowering mAs levels per projection. It is the goal of this work to develop a fast GPU-based algorithm to reconstruct high quality CBCT from undersampled and noisy projection data so as to lower the imaging dose. Method and Materials: The CBCT is reconstructed by minimizing an energy functional consisting of a data fidelity term and a total variation regularization term. We developed a GPU-friendly version of the forward-backward splitting algorithm to solve this model. Multi-grid technique is also employed. Results: It is found that 20∼40 x-ray projections are sufficient to reconstruct images with satisfactory quality for IGRT. The reconstruction time ranges from 77 to 130 sec on an NVIDIA Tesla C1060 GPU card, depending on the number of projections used, which is estimated ∼100 times faster than similar iterative reconstruction approaches. Phantom studies indicate that our algorithm enables the CBCT to be reconstructed under as low as 0.1 mAs/projection level. Comparing with currently widely used full-fan head-and-neck scanning protocol of ∼360 projections with 0.4 mAs/projection, it is estimated that an overall 36∼72 times dose reduction has been achieved. Our algorithm can also be used in CBCT reconstructions in limited field of view scanning protocols for further reducing dose and in limited angle scanning protocols for shortening scanning time. Conclusion: The developed GPU-based CBCT reconstruction algorithm is capable of lowering imaging dose considerably. The high computational efficiency makes this iterative CBCT reconstruction approach applicable in real clinical environments for the first time.

GPU-based fast cone beam CT reconstruction from undersampled and noisy projection data via total variation

Cone-beam CT (CBCT) plays an important role in image guided radiation therapy (IGRT). However, the large radiation dose from serial CBCT scans in most IGRT procedures raises a clinical concern, especially for pediatric patients who are essentially excluded from receiving IGRT for this reason. The goal of this work is to develop a fast GPU-based algorithm to reconstruct CBCT from undersampled and noisy projection data so as to lower the imaging dose. The CBCT is reconstructed by minimizing an energy functional consisting of a data fidelity term and a total variation regularization term. The authors developed a GPU-friendly version of the forward-backward splitting algorithm to solve this model. A multigrid technique is also employed. It is found that 20-40 x-ray projections are sufficient to reconstruct images with satisfactory quality for IGRT. The reconstruction time ranges from 77 to 130 s on an NVIDIA Tesla C1060 (NVIDIA, Santa Clara, CA) GPU card, depending on the number of projections used, which is estimated about 100 times faster than similar iterative reconstruction approaches. Moreover, phantom studies indicate that the algorithm enables the CBCT to be reconstructed under a scanning protocol with as low as 0.1 mA s/projection. Comparing with currently widely used full-fan head and neck scanning protocol of approximately 360 projections with 0.4 mA s/projection, it is estimated that an overall 36-72 times dose reduction has been achieved in our fast CBCT reconstruction algorithm. This work indicates that the developed GPU-based CBCT reconstruction algorithm is capable of lowering imaging dose considerably. The high computation efficiency in this algorithm makes the iterative CBCT reconstruction approach applicable in real clinical environments.