Accelerated barrier optimization compressed sensing (ABOCS) reconstruction for cone-beam CT: phantom studies

Reconstruction of Sparse-View X-ray Computed Tomography Based on Adaptive Total Variation Minimization

Sparse-view reconstruction has garnered significant interest in X-ray computed tomography (CT) imaging owing to its ability to lower radiation doses and enhance detection efficiency. Among current methods for sparse-view CT reconstruction, an algorithm utilizing iterative reconstruction based on full variational regularization demonstrates good performance. The optimized direction and number of computations for the gradient operator of the regularization term play a crucial role in determining not only the reconstructed image quality but also the convergence speed of the iteration process. The conventional TV approach solely accounts for the vertical and horizontal directions of the two-dimensional plane in the gradient direction. When projection data decrease, the edges of the reconstructed image become blurred. Exploring too many gradient directions for TV terms often comes at the expense of more computational costs. To enhance the balance of computational cost and reconstruction quality, this study suggests a novel TV computation model that is founded on a four-direction gradient operator. In addition, selecting appropriate iteration parameters significantly impacts the quality of the reconstructed image. We propose a nonparametric control method utilizing the improved TV approach as a solution to the tedious manual parameter optimization issue. The relaxation parameters of projection onto convex sets (POCS) are determined according to the scanning number and numerical proportion of the projection data; according to the image error before and after iterations, the gradient descent step of the TV item is adaptively adjusted. Compared with several representative iterative reconstruction algorithms, the experimental results show that the algorithm can effectively preserve edges and suppress noise in sparse-view CT reconstruction.

A CT reconstruction method based on constrained data fidelity range estimation

For the CT iterative reconstruction, choosing the parameters of different regularization terms has been a difficult problem. Transforming the reconstruction problem into constrained optimization can solve this problem, but determining the constraint range and accurately solving it remains a challenge. This paper proposes a CT reconstruction method based on constrained data fidelity term, which estimates the distribution of the constraint function by Taylor expansion to determine the constraint range. We respectively use Douglas-Rachford splitting (DRS) and Projection-based primal-dual algorithm (PPD) to split the reconstruction problem and solve the data fidelity subproblem. This method can accurately estimate the constrained range of data fidelity terms to ensure reconstruction accuracy and use different regularization terms for reconstruction without parameter adjustment. Three regularization terms are used for reconstruction experiments, and simulation results show that the proposed method can converge stably, and its reconstruction quality is better than the filtered back-projection.

Deep Interactive Denoiser (DID) for X-Ray Computed Tomography

Low-dose computed tomography (LDCT) is desirable for both diagnostic imaging and image-guided interventions. Denoisers are widely used to improve the quality of LDCT. Deep learning (DL)-based denoisers have shown state-of-the-art performance and are becoming mainstream methods. However, there are two challenges to using DL-based denoisers: 1) a trained model typically does not generate different image candidates with different noise-resolution tradeoffs, which are sometimes needed for different clinical tasks; and 2) the model's generalizability might be an issue when the noise level in the testing images differs from that in the training dataset. To address these two challenges, in this work, we introduce a lightweight optimization process that can run on top of any existing DL-based denoiser during the testing phase to generate multiple image candidates with different noise-resolution tradeoffs suitable for different clinical tasks in real time. Consequently, our method allows users to interact with the denoiser to efficiently review various image candidates and quickly pick the desired one; thus, we termed this method deep interactive denoiser (DID). Experimental results demonstrated that DID can deliver multiple image candidates with different noise-resolution tradeoffs and shows great generalizability across various network architectures, as well as training and testing datasets with various noise levels.

Multi-Material Decomposition for Single Energy CT Using Material Sparsity Constraint

Multi-material decomposition (MMD) decomposes CT images into basis material images, and is a promising technique in clinical diagnostic CT to identify material compositions within the human body. MMD could be implemented on measurements obtained from spectral CT protocol, although spectral CT data acquisition is not readily available in most clinical environments. MMD methods using single energy CT (SECT), broadly applied in radiological departments of most hospitals, have been proposed in the literature while challenged by the inferior decomposition accuracy and the limited number of material bases due to the constrained material information in the SECT measurement. In this paper, we propose an image-domain SECT MMD method using material sparsity as an assistance under the condition that each voxel of the CT image contains at most two different elemental materials. L₀ norm represents the material sparsity constraint (MSC) and is integrated into the decomposition objective function with a least-square data fidelity term, total variation term, and a sum-to-one constraint of material volume fractions. An accelerated primal-dual (APD) algorithm with line-search scheme is applied to solve the problem. The pixelwise direct inversion method with the two-material assumption (TMA) is applied to estimate the initials. We validate the proposed method on phantom and patient data. Compared with the TMA method, the proposed MSC method increases the volume fraction accuracy (VFA) from 92.0% to 98.5% in the phantom study. In the patient study, the calcification area can be clearly visualized in the virtual non-contrast image generated by the proposed method, and has a similar shape to that in the ground-truth contrast-free CT image. The high decomposition image quality from the proposed method substantially facilitates the SECT-based MMD clinical applications.

Probabilistic self-learning framework for low-dose CT denoising

PURPOSE

Despite the indispensable role of x-ray computed tomography (CT) in diagnostic medicine, the associated harmful ionizing radiation dose is a major concern, as it may cause genetic diseases and cancer. Decreasing patients' exposure can reduce the radiation dose and hence the related risks, but it would inevitably induce higher quantum noise. Supervised deep learning techniques have been used to train deep neural networks for denoising low-dose CT (LDCT) images, but the success of such strategies requires massive sets of pixel-level paired LDCT and normal-dose CT (NDCT) images, which are rarely available in real clinical practice. Our purpose is to mitigate the data scarcity problem for deep learning-based LDCT denoising.

METHODS

To solve this problem, we devised a shift-invariant property-based neural network that uses only the LDCT images to characterize both the inherent pixel correlations and the noise distribution, shaping into our probabilistic self-learning (PSL) framework. The AAPM Low-dose CT Challenge dataset was used to train the network. Both simulated datasets and real dataset were employed to test the denoising performance as well as the model generalizability. The performance was compared to a conventional method (total variation (TV)-based), a popular self-learning method (noise2void (N2V)), and a well-known unsupervised learning method (CycleGAN) by using both qualitative visual inspection and quantitative metrics including peak signal-noise-ratio (PSNR), structural similarity index (SSIM) and contrast-to-noise-ratio (CNR). The standard deviations (STD) of selected flat regions were also calculated for comparison.

RESULTS

The PSL method can improve the averaged PSNR/SSIM values from 27.61/0.5939 (LDCT) to 30.50/0.6797. By contrast, the averaged PSNR/SSIM values were 31.49/0.7284 (TV), 29.43/0.6699 (N2V), and 29.79/0.6992 (CycleGAN). The averaged STDs of selected flat regions were calculated to be 132.3 HU (LDCT), 25.77 HU (TV), 19.95 HU (N2V), 75.06 HU (CycleGAN), 60.62 HU (PSL) and 57.28 HU (NDCT). As for the low-contrast lesion detectability quantification, the CNR were calculated to be 0.202 (LDCT), 0.356 (TV), 0.372 (N2V), 0.383 (CycleGAN), 0.399 (PSL), and 0.359 (NDCT). By visual inspection, we observed that the proposed PSL method can deliver a noise-suppressed and detail-preserved image, while the TV-based method would lead to the blocky artifact, the N2V method would produce over-smoothed structures and CT value biased effect, and the CycleGAN method would generate slightly noisy results with inaccurate CT values. We also verified the generalizability of the PSL method, which exhibited superior denoising performance among various testing datasets with different data distribution shifts.

CONCLUSIONS

A deep learning-based convolutional neural network can be trained without paired datasets. Qualitatively visual inspection showed the proposed PSL method can achieve superior denoising performance than all the competitors, despite that the employed quantitative metrics in terms of PSNR, SSIM and CNR did not always show consistently better values.

A review on medical imaging synthesis using deep learning and its clinical applications

This paper reviewed the deep learning-based studies for medical imaging synthesis and its clinical application. Specifically, we summarized the recent developments of deep learning-based methods in inter- and intra-modality image synthesis by listing and highlighting the proposed methods, study designs, and reported performances with related clinical applications on representative studies. The challenges among the reviewed studies were then summarized with discussion.

Defect-Induced in Situ Atomic Doping in Transition Metal Dichalcogenides via Liquid-Phase Synthesis toward Efficient Electrochemical Activity

Transition metal dichalcogenides (TMDs), due to their fascinating properties, have emerged as potential next-generation semiconducting nanomaterials across diverse fields of applications. When combined with other material systems, precise control of the intrinsic properties of the TMDs plays a vital role in maximizing their performance. Defect-induced atomic doping through introduction of a chalcogen vacancy into the TMDs lattices is known to be a promising strategy for modulating their characteristic properties. As a result, there is a need to develop tunable and scalable synthesis routes to achieve vacancy-modulated TMDs. Herein, we propose a facile liquid-phase ligand exchange approach for scalable, uniform, and vacancy-tunable synthesis of TMDs films. Varying the relative molar ratio of the chalcogen to transition metal precursors enabled the in situ modulation of the chalcogen vacancy concentrations without necessitating additional post-treatments. When employed as the electrocatalyst in the hydrogen evolution reaction (HER), the vacancy-modulated TMDs, exhibiting a synergetic effect on the energy level matching to the reduction potential of water and optimized free energy differences in the HER pathways, showed a significant enhancement in the hydrogen production via the improved charge transfer kinetics and increased active sites. The proposed approach for synthesizing tunable vacancy-modulated TMDs with wafer-scale synthesis capability is, therefore, promising for better practical applications of TMDs.

Deep learning-based real-time volumetric imaging for lung stereotactic body radiation therapy: a proof of concept study

Due to the inter- and intra- variation of respiratory motion, it is highly desired to provide real-time volumetric images during the treatment delivery of lung stereotactic body radiation therapy (SBRT) for accurate and active motion management. In this proof-of-concept study, we propose a novel generative adversarial network integrated with perceptual supervision to derive instantaneous volumetric images from a single 2D projection. Our proposed network, named TransNet, consists of three modules, i.e. encoding, transformation and decoding modules. Rather than only using image distance loss between the generated 3D images and the ground truth 3D CT images to supervise the network, perceptual loss in feature space is integrated into loss function to force the TransNet to yield accurate lung boundary. Adversarial supervision is also used to improve the realism of generated 3D images. We conducted a simulation study on 20 patient cases, who had received lung SBRT treatments in our institution and undergone 4D-CT simulation, and evaluated the efficacy and robustness of our method for four different projection angles, i.e. 0°, 30°, 60° and 90°. For each 3D CT image set of a breathing phase, we simulated its 2D projections at these angles. For each projection angle, a patient's 3D CT images of 9 phases and the corresponding 2D projection data were used to train our network for that specific patient, with the remaining phase used for testing. The mean absolute error of the 3D images obtained by our method are 99.3 ± 14.1 HU. The peak signal-to-noise ratio and structural similarity index metric within the tumor region of interest are 15.4 ± 2.5 dB and 0.839 ± 0.090, respectively. The center of mass distance between the manual tumor contours on the 3D images obtained by our method and the manual tumor contours on the corresponding 3D phase CT images are within 2.6 mm, with a mean value of 1.26 mm averaged over all the cases. Our method has also been validated in a simulated challenging scenario with increased respiratory motion amplitude and tumor shrinkage, and achieved acceptable results. Our experimental results demonstrate the feasibility and efficacy of our 2D-to-3D method for lung cancer patients, which provides a potential solution for in-treatment real-time on-board volumetric imaging for tumor tracking and dose delivery verification to ensure the effectiveness of lung SBRT treatment.

Cone-beam breast computed tomography using ultra-fast image reconstruction with constrained, total-variation minimization for suppression of artifacts

Compressed sensing based iterative reconstruction algorithms for computed tomography such as adaptive steepest descent-projection on convex sets (ASD-POCS) are attractive due to their applicability in incomplete datasets such as sparse-view data and can reduce radiation dose to the patients while preserving image quality. Although IR algorithms reduce image noise compared to analytical Feldkamp-Davis-Kress (FDK) algorithm, they may generate artifacts, particularly along the periphery of the object. One popular solution is to use finer image-grid followed by down-sampling. This approach is computationally intensive but may be compensated by reducing the field of view. Our proposed solution is to replace the algebraic reconstruction technique within the original ASD-POCS by ordered subsets-simultaneous algebraic reconstruction technique (OS-SART) and with initialization using FDK image. We refer to this method as Fast, Iterative, TV-Regularized, Statistical reconstruction Technique (FIRST). In this study, we investigate FIRST for cone-beam dedicated breast CT with large image matrix. The signal-difference to noise ratio (SDNR), the difference of the mean value and the variance of adipose and fibroglandular tissues for both FDK and FIRST reconstructions were determined. With FDK serving as the reference, the root-mean-square error (RMSE), bias, and the full-width at half-maximum (FWHM) of microcalcifications in two orthogonal directions were also computed. Our results suggest that FIRST is competitive to the finer image-grid method with shorter reconstruction time. Images reconstructed using the FIRST do not exhibit artifacts and outperformed FDK in terms of image noise. This suggests the potential of this approach for radiation dose reduction in cone-beam breast CT.

Hybrid Optimization Method (HOM) Reconstruction with limited angle in Dual Energy Breast CT

Limited angle Breast Computed Tomography uses lower energy and low projection angle to detect early breast cancer or other malignant tissues in the breast. The sensitivity of breast CT can be improved by applying dual energy technology. The general challenge which hampers full exploration of dual energy imaging is noise accumulation as a result of spectral overlaps from two different images. The author proposed hybrid optimization method (HOM) which leverages on fast convergence of simultaneous algebraic reconstruction techniques (SART) and good de-noising and artefacts removal of dictionary learning (DL) to minimizes noise in each image of dual energy and then apply decomposition on the noiseless dual data. The HOM algorithm is formulated as optimization problem which find good atoms from the dictionary obtained and dictionary atom are learned from training data set. The reconstructed images which are noise-free are then decomposed using DECT algorithm into two material basis. 2D phantom known as mbat-phantom consisting of two material basis (microcalcification and normal breast tissue) were simulated to test the algorithm. Noisy projection data were also simulated under the same condition by adding poison noise. The performance of the method was evaluated by estimating some image quality indices on reconstructed images and decomposed images. The proposed method shows the highest average structural similarity index map (SSIM) of 0.9987 and 0.9921 and peak signal to-noise ratio (PSNR) of 49.24 and 46.96 for reconstructed image without noise and noisy image respectively. Also, there is a reduction in average standard deviation (STD) error of decomposed image. Our method performs excellently in streak artefact removal and noise suppression which is capable of reconstructing faithful image in presence of noisy data.

Material decomposition for simulated dual-energy breast computed tomography via hybrid optimization method

BACKGROUND

Dual-energy breast CT reconstruction has a potential application that includes separation of microcalcification from healthy breast tissue for assisting early breast cancer detection.

OBJECTIVE

To investigate and validate the noise suppression algorithm applied in the decomposition of the simulated breast phantom into microcalcification and healthy breast.

METHODS

The proposed hybrid optimization method (HOM) uses a simultaneous algebraic reconstruction technique (SART) output as a prior image, which is then incorporated into the self-adaptive dictionary learning. This self-adaptive dictionary learning seeks each group of patches to faithfully represent the learned dictionary, and the sparsity and non-local similarity of group patches are used to enforce the image regularization term of the prior image. We simulate a numerical phantom by adding different levels of Gaussian noise to test performance of the proposed method.

RESULTS

The mean value of peak signal-to-noise ratio (PSNR), structural similarity (SSIM), and root mean square error (RMSE) for the proposed method are (49.043±1.571), (0.997±0.002), (0.003±0.001) and (51.329±1.998), (0.998±0.002), (0.003±0.001) for 35 kVp and 49 kVp, respectively. The PSNR of the proposed method shows greater improvement over TWIST (5.2%), SART (34.6%), FBP (40.4%) and TWIST (3.7%), SART (39.9%), FBP (50.3%) for 35 kVp and 49 kVp energy images, respectively. For the proposed method, the signal-to-noise ratio (SNR) of decomposed normal breast tissue (NBT) is (22.036±1.535), which exceeded that of TWIST, SART, and FBP by 7.5%, 49.6%, and 96.4%, respectively. The results reveal that the proposed algorithm achieves the best performance in both reconstructed and decomposed images under different levels of noise and the performance is due to the high sparsity and good denoising ability of minimization exploited to solve the convex optimization problem.

CONCLUSIONS

This study demonstrates the potential of applying dual-energy reconstruction in breast CT to detect and separate clustered MCs from healthy breast tissues without noise amplification. Compared to other competing methods, the proposed algorithm achieves the best noise suppression performance for both reconstructed and decomposed images.

Deep learning-based image quality improvement for low-dose computed tomography simulation in radiation therapy

Low-dose computed tomography (CT) is desirable for treatment planning and simulation in radiation therapy. Multiple rescanning and replanning during the treatment course with a smaller amount of dose than a single conventional full-dose CT simulation is a crucial step in adaptive radiation therapy. We developed a machine learning-based method to improve image quality of low-dose CT for radiation therapy treatment simulation. We used a residual block concept and a self-attention strategy with a cycle-consistent adversarial network framework. A fully convolution neural network with residual blocks and attention gates (AGs) was used in the generator to enable end-to-end transformation. We have collected CT images from 30 patients treated with frameless brain stereotactic radiosurgery (SRS) for this study. These full-dose images were used to generate projection data, which were then added with noise to simulate the low-mAs scanning scenario. Low-dose CT images were reconstructed from this noise-contaminated projection data and were fed into our network along with the original full-dose CT images for training. The performance of our network was evaluated by quantitatively comparing the high-quality CT images generated by our method with the original full-dose images. When mAs is reduced to 0.5% of the original CT scan, the mean square error of the CT images obtained by our method is ∼ 1.6 % , with respect to the original full-dose images. The proposed method successfully improved the noise, contract-to-noise ratio, and nonuniformity level to be close to those of full-dose CT images and outperforms a state-of-the-art iterative reconstruction method. Dosimetric studies show that the average differences of dose-volume histogram metrics are < 0.1    Gy ( p > 0.05 ). These quantitative results strongly indicate that the denoised low-dose CT images using our method maintains image accuracy and quality and are accurate enough for dose calculation in current CT simulation of brain SRS treatment. We also demonstrate the great potential for low-dose CT in the process of simulation and treatment planning.

4D digital tomosynthesis image reconstruction using brute force-based adaptive total variation (BF-ATV) in a prototype LINAC system

Respiratory-correlated cone-beam CT (CBCT) not only inhibits rapid scanning due to the slow speed of the LINAC head gantry rotation, but its implementation for routine patient imaging is impractical because of the high radiation dose delivered during the process. Digital tomosynthesis (DTS) is a potentially faster technique that delivers a much lower radiation dose by reducing the number of projections in a limited angular range. Unfortunately, 4D-DTS introduces strong aliasing artifacts in the reconstructed images due to the sparsely sampled projections in each respiratory phase bin. The authors hereby suggest a novel low-dose 4D-DTS image reconstruction method that achieves a compromise between the occurrence of aliasing artifacts and image smoothing using a brute force-based adaptive weighting parameter searching technique. We used a prototype LINAC system mounted with a flat-panel detector to acquire tomosynthesis projections of respiratory motion in a phantom in the anterior-posterior (AP) and lateral views. Three different 4D-DTS image reconstruction schemes that included conventional filtered back-projection (FBP), adaptive steepest descent projection onto convex sets (ASD-POCS), and the proposed brute force-based adaptive total variation (BF-ATV) were implemented in four different respiratory phase bins for both AP and lateral views. All reconstructions were accelerated using a single GPU card to reduce the computation time. To study the performance of the algorithm under various sparse conditions, we operated the prototype system in three different gantry sweep modes. The results indicate that the proposed BF-ATV method yields the largest structural similarities in the differenced image between the ground-truth dataset acquired using the slow gantry sweep mode and the sparse dataset from both moderate and fast sweep modes. In addition, the proposed method maintained the object sharpness with less streaking lines and small loss of sharpness compared to the conventional FBP and ASD-POCS methods. In conclusion, the proposed low-dose 4D-DTS reconstruction scheme may provide better performance due in part to its rapid scanning. Therefore, it is potentially applicable to practical 4D imaging for radiotherapy.

Single-Scan Dual-Energy CT Using Primary Modulation

Compared with conventional computed tomography (CT), dual-energy CT (DECT) provides better material differentiation but requires projection data acquired with two different effective x-ray spectra, limiting DECT applications to specialized scanners. We propose a hardware-based method, known as PM-DECT, which utilizes primary beam modulation to enable single-scan DECT on a conventional CT scanner. PM-DECT inserts an attenuation sheet with a spatially varying pattern-primary beam modulator-between the x-ray source and imaged object. During a CT scan, the modulator selectively hardens the x-ray beam, thereby increasing the average photon energy at specific detector pixel locations. Thus, PM-DECT simultaneously acquires high and low energy data at each projection angle. From the sparse projection data, high and low energy CT images are jointly reconstructed and simultaneously decomposed into basis materials via an iterative CT reconstruction algorithm with gradient weighting and an improved version of similarity based regularization. Studies on Catphan 600 and anthropomorphic head phantoms demonstrate that PM-DECT retains a high level of spatial resolution compared with conventional CT scans. Electron density values calculated from decomposed images indicate a limited error of 1.12% for PM-DECT. Comparison against a two-scan DECT technique shows that PM-DECT's image reconstruction from sparse data sets contributes only 0.66% error. By granting the opportunity for high-quality single-scan DECT on conventional CT scanners via limited hardware modification, PM-DECT has the potential to liberate DECT from specialized scanners, extending clinical availability, and implementation.

Assessment of prior image induced nonlocal means regularization for low-dose CT reconstruction: Change in anatomy

PURPOSE

Repeated computed tomography (CT) scans are prescribed for some clinical applications such as lung nodule surveillance. Several studies have demonstrated that incorporating a high-quality prior image into the reconstruction of subsequent low-dose CT (LDCT) acquisitions can either improve image quality or reduce data fidelity requirements. Our proposed previous normal-dose image induced nonlocal means (ndiNLM) regularization method for LDCT is an example of such a method. However, one major concern with prior image based methods is that they might produce false information when the prior image and the current LDCT image show different structures (for example, if a lung nodule emerges, grows, shrinks, or disappears over time). This study aims to assess the performance of the ndiNLM regularization method in situations with change in anatomy.

METHOD

We incorporated the ndiNLM regularization into the statistical image reconstruction (SIR) framework for reconstruction of subsequent LDCT images. Because of its patch-based search mechanism, a rough registration between the prior image and the current LDCT image is adequate for the SIR-ndiNLM method. We assessed the performance of the SIR-ndiNLM method in lung nodule surveillance for two different scenarios: (a) the nodule was not found in a baseline exam but appears in a follow-up LDCT scan; (b) the nodule was present in a baseline exam but disappears in a follow-up LDCT scan. We further investigated the effect of nodule size on the performance of the SIR-ndiNLM method.

RESULTS

We found that a relatively large search-window (e.g., 33 × 33) should be used for the SIR-ndiNLM method to account for misalignment between the prior image and the current LDCT image, and to ensure that enough similar patches can be found in the prior image. With proper selection of other parameters, experimental results with two patient datasets demonstrated that the SIR-ndiNLM method did not miss true nodules nor introduce false nodules in the lung nodule surveillance scenarios described above. We also found that the SIR-ndiNLM reconstruction shows improved image quality when the prior image is similar to the current LDCT image in anatomy. These gains in image quality might appear small upon visual inspection, but they can be detected using quantitative measures. Finally, the SIR-ndiNLM method also performed well in ultra-low-dose conditions and with different nodule sizes.

CONCLUSIONS

This study assessed the performance of the SIR-ndiNLM method in situations in which the prior image and the current LDCT image show substantial anatomical differences, specifically, changes in lung nodules. The experimental results demonstrate that the SIR-ndiNLM method does not introduce false lung nodules nor miss true nodules, which relieves the concern that this method might produce false information. However, there is insufficient evidence that these findings will hold true for all kinds of anatomical changes.

On the data acquisition, image reconstruction, cone beam artifacts, and their suppression in axial MDCT and CBCT - A review

PURPOSE

In the clinic, computed tomography (CT) has evolved into an essential modality for diagnostic imaging by multidetector row CT (MDCT) and image guided intervention by cone beam CT (CBCT). Recognizing the increasing importance of axial MDCT/CBCT in clinical and preclinical applications, and the existence of CB artifacts in MDCT/CBCT images, we provide a review of CB artifacts' root causes, rendering mechanisms and morphology, and possible solutions for elimination and/or reduction of the artifacts.

METHODS

By examining the null space in Radon and Fourier domain, the root cause of CB artifacts (i.e., data insufficiency) in axial MDCT/CBCT is analytically investigated, followed by a review of the data sufficiency conditions and the "circle +" source trajectories. The rendering mechanisms and morphology of CB artifacts in axial MDCT/CBCT and their special cases (e.g., half/short scan and full scan with latitudinally displaced detector) are then analyzed, followed by a survey of the potential solutions to suppress the artifacts. The phenomenon of imaged zone indention and its variation over FBP, BPF/DBPF, two-pass and iterative CB reconstruction algorithms and/or schemes are discussed in detail.

RESULTS

An interdomain examination of the null space provides an insightful understanding of the root cause of CB artifacts in axial MDCT/CBCT. The decomposition of CB artifacts rendering mechanisms facilitates understanding of the artifacts' behavior under different conditions and the potential solutions to suppress them. An inspection of the imaged zone intention phenomenon provides guidance on the design and implementation of CB image reconstruction algorithms and schemes for CB artifacts suppression in axial MDCT/CBCT.

CONCLUSIONS

With increasing importance of axial MDCT/CBCT in clinical and preclinical applications, this review article can update the community with in-depth information and clarification on the latest progress in dealing with CB artifacts and thus increase clinical/preclinical confidence.

Z-Index Parameterization for Volumetric CT Image Reconstruction via 3-D Dictionary Learning

Despite the rapid developments of X-ray cone-beam CT (CBCT), image noise still remains a major issue for the low dose CBCT. To suppress the noise effectively while retain the structures well for low dose CBCT image, in this paper, a sparse constraint based on the 3-D dictionary is incorporated into a regularized iterative reconstruction framework, defining the 3-D dictionary learning (3-DDL) method. In addition, by analyzing the sparsity level curve associated with different regularization parameters, a new adaptive parameter selection strategy is proposed to facilitate our 3-DDL method. To justify the proposed method, we first analyze the distributions of the representation coefficients associated with the 3-D dictionary and the conventional 2-D dictionary to compare their efficiencies in representing volumetric images. Then, multiple real data experiments are conducted for performance validation. Based on these results, we found: 1) the 3-D dictionary-based sparse coefficients have three orders narrower Laplacian distribution compared with the 2-D dictionary, suggesting the higher representation efficiencies of the 3-D dictionary; 2) the sparsity level curve demonstrates a clear Z-shape, and hence referred to as Z-curve, in this paper; 3) the parameter associated with the maximum curvature point of the Z-curve suggests a nice parameter choice, which could be adaptively located with the proposed Z-index parameterization (ZIP) method; 4) the proposed 3-DDL algorithm equipped with the ZIP method could deliver reconstructions with the lowest root mean squared errors and the highest structural similarity index compared with the competing methods; 5) similar noise performance as the regular dose FDK reconstruction regarding the standard deviation metric could be achieved with the proposed method using (1/2)/(1/4)/(1/8) dose level projections. The contrast-noise ratio is improved by ~2.5/3.5 times with respect to two different cases under the (1/8) dose level compared with the low dose FDK reconstruction. The proposed method is expected to reduce the radiation dose by a factor of 8 for CBCT, considering the voted strongly discriminated low contrast tissues.

A review of GPU-based medical image reconstruction

Tomographic image reconstruction is a computationally demanding task, even more so when advanced models are used to describe a more complete and accurate picture of the image formation process. Such advanced modeling and reconstruction algorithms can lead to better images, often with less dose, but at the price of long calculation times that are hardly compatible with clinical workflows. Fortunately, reconstruction tasks can often be executed advantageously on Graphics Processing Units (GPUs), which are exploited as massively parallel computational engines. This review paper focuses on recent developments made in GPU-based medical image reconstruction, from a CT, PET, SPECT, MRI and US perspective. Strategies and approaches to get the most out of GPUs in image reconstruction are presented as well as innovative applications arising from an increased computing capacity. The future of GPU-based image reconstruction is also envisioned, based on current trends in high-performance computing.

Combining Acceleration Techniques for Low-Dose X-Ray Cone Beam Computed Tomography Image Reconstruction

Background and Objective

Over the past decade, image quality in low-dose computed tomography has been greatly improved by various compressive sensing- (CS-) based reconstruction methods. However, these methods have some disadvantages including high computational cost and slow convergence rate. Many different speed-up techniques for CS-based reconstruction algorithms have been developed. The purpose of this paper is to propose a fast reconstruction framework that combines a CS-based reconstruction algorithm with several speed-up techniques.

Methods

First, total difference minimization (TDM) was implemented using the soft-threshold filtering (STF). Second, we combined TDM-STF with the ordered subsets transmission (OSTR) algorithm for accelerating the convergence. To further speed up the convergence of the proposed method, we applied the power factor and the fast iterative shrinkage thresholding algorithm to OSTR and TDM-STF, respectively.

Results

Results obtained from simulation and phantom studies showed that many speed-up techniques could be combined to greatly improve the convergence speed of a CS-based reconstruction algorithm. More importantly, the increased computation time (≤10%) was minor as compared to the acceleration provided by the proposed method.

Conclusions

In this paper, we have presented a CS-based reconstruction framework that combines several acceleration techniques. Both simulation and phantom studies provide evidence that the proposed method has the potential to satisfy the requirement of fast image reconstruction in practical CT.

Pixel-wise estimation of noise statistics on iterative CT reconstruction from a single scan

PURPOSE

As iterative CT reconstruction continues to advance, the spatial distribution of noise standard deviation (STD) and accurate noise power spectrum (NPS) on the reconstructed CT images become important for method evaluation as well as optimization of algorithm parameters. Using a single CT scan, we propose a practical method for pixel-wise calculation of noise statistics on an iteratively reconstructed CT image, which enables accurate calculation of noise STD for each pixel and NPS.

METHOD

We first derive the noise propagation from measured projections to an iteratively reconstructed CT image provided that the projection noise is known. We then show that the model of noise propagation remains approximately unchanged for extra simulated noise added on the measured projections. To compute the noise STD map and the NPS map on an iteratively reconstructed CT image from a single scan, we first iteratively reconstruct the CT image from the measured projections using an existing reconstruction algorithm. The same measured projections are added by different sets (a total of 32 sets in our implementation) of projection noise simulated from an estimated projection noise model, and are then used to iteratively reconstruct different CT images. The calculations of the noise STD map and the NPS map are finally performed on the entire stack of these different reconstruction images.

RESULTS

We evaluate our method on an anthropomorphic head phantom, and demonstrate the clinical utility on a set of head and neck patient CT data, using two iterative CT reconstruction algorithms: the penalized weighted least-square (PWLS) algorithm and the total-variation (TV) regularization. In the head phantom case, repeated scans are acquired to generate the ground truths of noise STD and NPS maps. Using only one single scan, the proposed method accurately calculates the noise STD maps with a root-mean-square error (RMSE) of less than 5HU. In the NPS map estimation, we compare the result of our proposed method with that of the conventional method which calculates the NPS maps on a uniform region of interest on one CT image. Our method outperforms the conventional method on the NPS map estimation with RMSE reduced by 92%. The implementation of the proposed method on the patient data successfully provides the noise STD values around complex structures and a high-quality NPS map.

CONCLUSION

The proposed method accurately calculates noise STD for each pixel and NPS on an iteratively reconstructed CT image, with no requirement of repeated CT scans. It provides a detailed evaluation of imaging performance of different iterative reconstruction methods on the same CT dataset.

Fast alternating projection methods for constrained tomographic reconstruction

The alternating projection algorithms are easy to implement and effective for large-scale complex optimization problems, such as constrained reconstruction of X-ray computed tomography (CT). A typical method is to use projection onto convex sets (POCS) for data fidelity, nonnegative constraints combined with total variation (TV) minimization (so called TV-POCS) for sparse-view CT reconstruction. However, this type of method relies on empirically selected parameters for satisfactory reconstruction and is generally slow and lack of convergence analysis. In this work, we use a convex feasibility set approach to address the problems associated with TV-POCS and propose a framework using full sequential alternating projections or POCS (FS-POCS) to find the solution in the intersection of convex constraints of bounded TV function, bounded data fidelity error and non-negativity. The rationale behind FS-POCS is that the mathematically optimal solution of the constrained objective function may not be the physically optimal solution. The breakdown of constrained reconstruction into an intersection of several feasible sets can lead to faster convergence and better quantification of reconstruction parameters in a physical meaningful way than that in an empirical way of trial-and-error. In addition, for large-scale optimization problems, first order methods are usually used. Not only is the condition for convergence of gradient-based methods derived, but also a primal-dual hybrid gradient (PDHG) method is used for fast convergence of bounded TV. The newly proposed FS-POCS is evaluated and compared with TV-POCS and another convex feasibility projection method (CPTV) using both digital phantom and pseudo-real CT data to show its superior performance on reconstruction speed, image quality and quantification.

Monochromatic-beam-based dynamic X-ray microtomography based on OSEM-TV algorithm

Monochromatic-beam-based dynamic X-ray computed microtomography (CT) was developed to observe evolution of microstructure inside samples. However, the low flux density results in low efficiency in data collection. To increase efficiency, reducing the number of projections should be a practical solution. However, it has disadvantages of low image reconstruction quality using the traditional filtered back projection (FBP) algorithm. In this study, an iterative reconstruction method using an ordered subset expectation maximization-total variation (OSEM-TV) algorithm was employed to address and solve this problem. The simulated results demonstrated that normalized mean square error of the image slices reconstructed by the OSEM-TV algorithm was about 1/4 of that by FBP. Experimental results also demonstrated that the density resolution of OSEM-TV was high enough to resolve different materials with the number of projections less than 100. As a result, with the introduction of OSEM-TV, the monochromatic-beam-based dynamic X-ray microtomography is potentially practicable for the quantitative and non-destructive analysis to the evolution of microstructure with acceptable efficiency in data collection and reconstructed image quality.

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.

A fast method based on NESTA to accurately reconstruct CT image from highly undersampled projection measurements

BACKGROUND

The CT image reconstruction algorithm based compressed sensing (CS) can be formulated as an optimization problem that minimizes the total-variation (TV) term constrained by the data fidelity and image nonnegativity. There are a lot of solutions to this problem, but the computational efficiency and reconstructed image quality of these methods still need to be improved.

OBJECTIVE

To investigate a faster and more accurate mathematical algorithm to settle TV term minimization problem of CT image reconstruction.

METHOD

A Nesterov's algorithm (NESTA) is a fast and accurate algorithm for solving TV minimization problem, which can be ascribed to the use of most notably Nesterov's smoothing technique and a subtle averaging of sequences of iterates, which has been shown to improve the convergence properties of standard gradient-descent algorithms. In order to demonstrate the superior performance of NESTA on computational efficiency and image quality, a comparison with Simultaneous Algebraic Reconstruction Technique-TV (SART-TV) and Split-Bregman (SpBr) algorithm is made using a digital phantom study and two physical phantom studies from highly undersampled projection measurements.

RESULTS

With only 25% of conventional full-scan dose and, NESTA method reduces the average CT number error from 51.76HU to 9.98HU on Shepp-Logan phantom and reduces the average CT number error from 50.13HU to 0.32HU on Catphan 600 phantom. On an anthropomorphic head phantom, the average CT number error is reduced from 84.21HU to 1.01HU in the central uniform area.

CONCLUSIONS

To the best of our knowledge this is the first work that apply the NESTA method into CT reconstruction based CS. Research shows that this method is of great potential, further studies and optimization are necessary.

Dual energy CT with one full scan and a second sparse-view scan using structure preserving iterative reconstruction (SPIR)

Conventional dual-energy CT (DECT) reconstruction requires two full-size projection datasets with two different energy spectra. In this study, we propose an iterative algorithm to enable a new data acquisition scheme which requires one full scan and a second sparse-view scan for potential reduction in imaging dose and engineering cost of DECT. A bilateral filter is calculated as a similarity matrix from the first full-scan CT image to quantify the similarity between any two pixels, which is assumed unchanged on a second CT image since DECT scans are performed on the same object. The second CT image from reduced projections is reconstructed by an iterative algorithm which updates the image by minimizing the total variation of the difference between the image and its filtered image by the similarity matrix under data fidelity constraint. As the redundant structural information of the two CT images is contained in the similarity matrix for CT reconstruction, we refer to the algorithm as structure preserving iterative reconstruction (SPIR). The proposed method is evaluated on both digital and physical phantoms, and is compared with the filtered-backprojection (FBP) method, the conventional total-variation-regularization-based algorithm (TVR) and prior-image-constrained-compressed-sensing (PICCS). SPIR with a second 10-view scan reduces the image noise STD by a factor of one order of magnitude with same spatial resolution as full-view FBP image. SPIR substantially improves over TVR on the reconstruction accuracy of a 10-view scan by decreasing the reconstruction error from 6.18% to 1.33%, and outperforms TVR at 50 and 20-view scans on spatial resolution with a higher frequency at the modulation transfer function value of 10% by an average factor of 4. Compared with the 20-view scan PICCS result, the SPIR image has 7 times lower noise STD with similar spatial resolution. The electron density map obtained from the SPIR-based DECT images with a second 10-view scan has an average error of less than 1%.

A general framework of noise suppression in material decomposition for dual-energy CT

PURPOSE

As a general problem of dual-energy CT (DECT), noise amplification in material decomposition severely reduces the signal-to-noise ratio on the decomposed images compared to that on the original CT images. In this work, the authors propose a general framework of noise suppression in material decomposition for DECT. The method is based on an iterative algorithm recently developed in their group for image-domain decomposition of DECT, with an extension to include nonlinear decomposition models. The generalized framework of iterative DECT decomposition enables beam-hardening correction with simultaneous noise suppression, which improves the clinical benefits of DECT.

METHODS

The authors propose to suppress noise on the decomposed images of DECT using convex optimization, which is formulated in the form of least-squares estimation with smoothness regularization. Based on the design principles of a best linear unbiased estimator, the authors include the inverse of the estimated variance-covariance matrix of the decomposed images as the penalty weight in the least-squares term. Analytical formulas are derived to compute the variance-covariance matrix for decomposed images with general-form numerical or analytical decomposition. As a demonstration, the authors implement the proposed algorithm on phantom data using an empirical polynomial function of decomposition measured on a calibration scan. The polynomial coefficients are determined from the projection data acquired on a wedge phantom, and the signal decomposition is performed in the projection domain.

RESULTS

On the Catphan(®)600 phantom, the proposed noise suppression method reduces the average noise standard deviation of basis material images by one to two orders of magnitude, with a superior performance on spatial resolution as shown in comparisons of line-pair images and modulation transfer function measurements. On the synthesized monoenergetic CT images, the noise standard deviation is reduced by a factor of 2-3. By using nonlinear decomposition on projections, the authors' method effectively suppresses the streaking artifacts of beam hardening and obtains more uniform images than their previous approach based on a linear model. Similar performance of noise suppression is observed in the results of an anthropomorphic head phantom and a pediatric chest phantom generated by the proposed method. With beam-hardening correction enabled by their approach, the image spatial nonuniformity on the head phantom is reduced from around 10% on the original CT images to 4.9% on the synthesized monoenergetic CT image. On the pediatric chest phantom, their method suppresses image noise standard deviation by a factor of around 7.5, and compared with linear decomposition, it reduces the estimation error of electron densities from 33.3% to 8.6%.

CONCLUSIONS

The authors propose a general framework of noise suppression in material decomposition for DECT. Phantom studies have shown the proposed method improves the image uniformity and the accuracy of electron density measurements by effective beam-hardening correction and reduces noise level without noticeable resolution loss.

Common-mask guided image reconstruction (c-MGIR) for enhanced 4D cone-beam computed tomography

Compared to 3D cone beam computed tomography (3D CBCT), the image quality of commercially available four-dimensional (4D) CBCT is severely impaired due to the insufficient amount of projection data available for each phase. Since the traditional Feldkamp-Davis-Kress (FDK)-based algorithm is infeasible for reconstructing high quality 4D CBCT images with limited projections, investigators had developed several compress-sensing (CS) based algorithms to improve image quality. The aim of this study is to develop a novel algorithm which can provide better image quality than the FDK and other CS based algorithms with limited projections. We named this algorithm 'the common mask guided image reconstruction' (c-MGIR).In c-MGIR, the unknown CBCT volume is mathematically modeled as a combination of phase-specific motion vectors and phase-independent static vectors. The common-mask matrix, which is the key concept behind the c-MGIR algorithm, separates the common static part across all phase images from the possible moving part in each phase image. The moving part and the static part of the volumes were then alternatively updated by solving two sub-minimization problems iteratively. As the novel mathematical transformation allows the static volume and moving volumes to be updated (during each iteration) with global projections and 'well' solved static volume respectively, the algorithm was able to reduce the noise and under-sampling artifact (an issue faced by other algorithms) to the maximum extent. To evaluate the performance of our proposed c-MGIR, we utilized imaging data from both numerical phantoms and a lung cancer patient. The qualities of the images reconstructed with c-MGIR were compared with (1) standard FDK algorithm, (2) conventional total variation (CTV) based algorithm, (3) prior image constrained compressed sensing (PICCS) algorithm, and (4) motion-map constrained image reconstruction (MCIR) algorithm, respectively. To improve the efficiency of the algorithm, the code was implemented with a graphic processing unit for parallel processing purposes.Root mean square error (RMSE) between the ground truth and reconstructed volumes of the numerical phantom were in the descending order of FDK, CTV, PICCS, MCIR, and c-MGIR for all phases. Specifically, the means and the standard deviations of the RMSE of FDK, CTV, PICCS, MCIR and c-MGIR for all phases were 42.64  ±  6.5%, 3.63  ±  0.83%, 1.31%  ±  0.09%, 0.86%  ±  0.11% and 0.52 %  ±  0.02%, respectively. The image quality of the patient case also indicated the superiority of c-MGIR compared to other algorithms.The results indicated that clinically viable 4D CBCT images can be reconstructed while requiring no more projection data than a typical clinical 3D CBCT scan. This makes c-MGIR a potential online reconstruction algorithm for 4D CBCT, which can provide much better image quality than other available algorithms, while requiring less dose and potentially less scanning time.

Noise Suppression for Dual-Energy CT Through Entropy Minimization

In dual energy CT (DECT), noise amplification during signal decomposition significantly limits the utility of basis material images. Since clinically relevant objects typically contain a limited number of different materials, we propose an Image-domain Decomposition method through Entropy Minimization (IDEM) for noise suppression in DECT. Pixels of decomposed images are first linearly transformed into 2D clusters of data points, which are highly asymmetric due to strong signal correlation. An optimal axis is identified in the 2D space via numerical search such that the projection of data clusters onto the axis has minimum entropy. Noise suppression is performed on each image pixel by estimating the center-of-mass value of each data cluster along the direction perpendicular to the projection axis. The IDEM method is distinct from other noise suppression techniques in that it does not suppress pixel noise by reducing spatial variation between neighboring pixels. As supported by studies on Catphan©600 and anthropomorphic head phantoms, this feature endows our algorithm with a unique capability of reducing noise standard deviation on DECT decomposed images by approximately one order of magnitude while preserving spatial resolution and image noise power spectra (NPS). Compared with a filtering method and recently developed iterative method at the same level of noise suppression, the IDEM algorithm obtains high-resolution images with less artifacts. It also maintains accuracy of electron density measurements with less than 2% bias error. The IDEM method effectively suppresses noise of DECT for quantitative use, with appealing features on preservation of image spatial resolution and NPS.

Few-View Prereconstruction Guided Tube Current Modulation Strategy Based on the Signal-to-Noise Ratio of the Sinogram

The radiation dose reduction without sacrificing the image quality as an important issue has raised the attention of CT manufacturers and different automatic exposure control (AEC) strategies have been adopted in their products. In this paper, we focus on the strategy of tube current modulation. It is deduced based on the signal-to-noise (SNR) of the sinogram. The main idea behind the proposed modulation strategy is to keep the SNR of the sinogram proximately invariable using the few-view reconstruction as a good reference because it directly affects the noise level of the reconstructions. The numerical experiment results demonstrate that, compared with constant tube current, the noise distribution is more uniform and the SNR and CNR of the reconstruction are better when the proposed strategy is applied. Furthermore it has the potential to distinguish the low-contrast target and to reduce the radiation dose.

CT brush and CancerZap!: two video games for computed tomography dose minimization

BACKGROUND

X-ray dose from computed tomography (CT) scanners has become a significant public health concern. All CT scanners spray x-ray photons across a patient, including those using compressive sensing algorithms. New technologies make it possible to aim x-ray beams where they are most needed to form a diagnostic or screening image. We have designed a computer game, CT Brush, that takes advantage of this new flexibility. It uses a standard MART algorithm (Multiplicative Algebraic Reconstruction Technique), but with a user defined dynamically selected subset of the rays. The image appears as the player moves the CT brush over an initially blank scene, with dose accumulating with every "mouse down" move. The goal is to find the "tumor" with as few moves (least dose) as possible.

RESULTS

We have successfully implemented CT Brush in Java and made it available publicly, requesting crowdsourced feedback on improving the open source code. With this experience, we also outline a "shoot 'em up game" CancerZap! for photon limited CT.

CONCLUSIONS

We anticipate that human computing games like these, analyzed by methods similar to those used to understand eye tracking, will lead to new object dependent CT algorithms that will require significantly less dose than object independent nonlinear and compressive sensing algorithms that depend on sprayed photons. Preliminary results suggest substantial dose reduction is achievable.

Improving thoracic four-dimensional cone-beam CT reconstruction with anatomical-adaptive image regularization (AAIR)

Total-variation (TV) minimization reconstructions can significantly reduce noise and streaks in thoracic four-dimensional cone-beam computed tomography (4D CBCT) images compared to the Feldkamp-Davis-Kress (FDK) algorithm currently used in practice. TV minimization reconstructions are, however, prone to over-smoothing anatomical details and are also computationally inefficient. The aim of this study is to demonstrate a proof of concept that these disadvantages can be overcome by incorporating the general knowledge of the thoracic anatomy via anatomy segmentation into the reconstruction. The proposed method, referred as the anatomical-adaptive image regularization (AAIR) method, utilizes the adaptive-steepest-descent projection-onto-convex-sets (ASD-POCS) framework, but introduces an additional anatomy segmentation step in every iteration. The anatomy segmentation information is implemented in the reconstruction using a heuristic approach to adaptively suppress over-smoothing at anatomical structures of interest. The performance of AAIR depends on parameters describing the weighting of the anatomy segmentation prior and segmentation threshold values. A sensitivity study revealed that the reconstruction outcome is not sensitive to these parameters as long as they are chosen within a suitable range. AAIR was validated using a digital phantom and a patient scan and was compared to FDK, ASD-POCS and the prior image constrained compressed sensing (PICCS) method. For the phantom case, AAIR reconstruction was quantitatively shown to be the most accurate as indicated by the mean absolute difference and the structural similarity index. For the patient case, AAIR resulted in the highest signal-to-noise ratio (i.e. the lowest level of noise and streaking) and the highest contrast-to-noise ratios for the tumor and the bony anatomy (i.e. the best visibility of anatomical details). Overall, AAIR was much less prone to over-smoothing anatomical details compared to ASD-POCS and did not suffer from residual noise/streaking and motion blur migrated from the prior image as in PICCS. AAIR was also found to be more computationally efficient than both ASD-POCS and PICCS, with a reduction in computation time of over 50% compared to ASD-POCS. The use of anatomy segmentation was, for the first time, demonstrated to significantly improve image quality and computational efficiency for thoracic 4D CBCT reconstruction. Further developments are required to facilitate AAIR for practical use.

Combined iterative reconstruction and image-domain decomposition for dual energy CT using total-variation regularization

PURPOSE

Dual-energy CT (DECT) is being increasingly used for its capability of material decomposition and energy-selective imaging. A generic problem of DECT, however, is that the decomposition process is unstable in the sense that the relative magnitude of decomposed signals is reduced due to signal cancellation while the image noise is accumulating from the two CT images of independent scans. Direct image decomposition, therefore, leads to severe degradation of signal-to-noise ratio on the resultant images. Existing noise suppression techniques are typically implemented in DECT with the procedures of reconstruction and decomposition performed independently, which do not explore the statistical properties of decomposed images during the reconstruction for noise reduction. In this work, the authors propose an iterative approach that combines the reconstruction and the signal decomposition procedures to minimize the DECT image noise without noticeable loss of resolution.

METHODS

The proposed algorithm is formulated as an optimization problem, which balances the data fidelity and total variation of decomposed images in one framework, and the decomposition step is carried out iteratively together with reconstruction. The noise in the CT images from the proposed algorithm becomes well correlated even though the noise of the raw projections is independent on the two CT scans. Due to this feature, the proposed algorithm avoids noise accumulation during the decomposition process. The authors evaluate the method performance on noise suppression and spatial resolution using phantom studies and compare the algorithm with conventional denoising approaches as well as combined iterative reconstruction methods with different forms of regularization.

RESULTS

On the Catphan©600 phantom, the proposed method outperforms the existing denoising methods on preserving spatial resolution at the same level of noise suppression, i.e., a reduction of noise standard deviation by one order of magnitude. This improvement is mainly attributed to the high noise correlation in the CT images reconstructed by the proposed algorithm. Iterative reconstruction using different regularization, including quadratic orq-generalized Gaussian Markov random field regularization, achieves similar noise suppression from high noise correlation. However, the proposed TV regularization obtains a better edge preserving performance. Studies of electron density measurement also show that our method reduces the average estimation error from 9.5% to 7.1%. On the anthropomorphic head phantom, the proposed method suppresses the noise standard deviation of the decomposed images by a factor of ∼14 without blurring the fine structures in the sinus area.

CONCLUSIONS

The authors propose a practical method for DECT imaging reconstruction, which combines the image reconstruction and material decomposition into one optimization framework. Compared to the existing approaches, our method achieves a superior performance on DECT imaging with respect to decomposition accuracy, noise reduction, and spatial resolution.

Iterative image-domain decomposition for dual-energy CT

PURPOSE

Dual energy CT (DECT) imaging plays an important role in advanced imaging applications due to its capability of material decomposition. Direct decomposition via matrix inversion suffers from significant degradation of image signal-to-noise ratios, which reduces clinical values of DECT. Existing denoising algorithms achieve suboptimal performance since they suppress image noise either before or after the decomposition and do not fully explore the noise statistical properties of the decomposition process. In this work, the authors propose an iterative image-domain decomposition method for noise suppression in DECT, using the full variance-covariance matrix of the decomposed images.

METHODS

The proposed algorithm is formulated in the form of least-square estimation with smoothness regularization. Based on the design principles of a best linear unbiased estimator, the authors include the inverse of the estimated variance-covariance matrix of the decomposed images as the penalty weight in the least-square term. The regularization term enforces the image smoothness by calculating the square sum of neighboring pixel value differences. To retain the boundary sharpness of the decomposed images, the authors detect the edges in the CT images before decomposition. These edge pixels have small weights in the calculation of the regularization term. Distinct from the existing denoising algorithms applied on the images before or after decomposition, the method has an iterative process for noise suppression, with decomposition performed in each iteration. The authors implement the proposed algorithm using a standard conjugate gradient algorithm. The method performance is evaluated using an evaluation phantom (Catphan©600) and an anthropomorphic head phantom. The results are compared with those generated using direct matrix inversion with no noise suppression, a denoising method applied on the decomposed images, and an existing algorithm with similar formulation as the proposed method but with an edge-preserving regularization term.

RESULTS

On the Catphan phantom, the method maintains the same spatial resolution on the decomposed images as that of the CT images before decomposition (8 pairs/cm) while significantly reducing their noise standard deviation. Compared to that obtained by the direct matrix inversion, the noise standard deviation in the images decomposed by the proposed algorithm is reduced by over 98%. Without considering the noise correlation properties in the formulation, the denoising scheme degrades the spatial resolution to 6 pairs/cm for the same level of noise suppression. Compared to the edge-preserving algorithm, the method achieves better low-contrast detectability. A quantitative study is performed on the contrast-rod slice of Catphan phantom. The proposed method achieves lower electron density measurement error as compared to that by the direct matrix inversion, and significantly reduces the error variation by over 97%. On the head phantom, the method reduces the noise standard deviation of decomposed images by over 97% without blurring the sinus structures.

CONCLUSIONS

The authors propose an iterative image-domain decomposition method for DECT. The method combines noise suppression and material decomposition into an iterative process and achieves both goals simultaneously. By exploring the full variance-covariance properties of the decomposed images and utilizing the edge predetection, the proposed algorithm shows superior performance on noise suppression with high image spatial resolution and low-contrast detectability.

Effects of sparse sampling schemes on image quality in low-dose CT

PURPOSE

Various scanning methods and image reconstruction algorithms are actively investigated for low-dose computed tomography (CT) that can potentially reduce a health-risk related to radiation dose. Particularly, compressive-sensing (CS) based algorithms have been successfully developed for reconstructing images from sparsely sampled data. Although these algorithms have shown promises in low-dose CT, it has not been studied how sparse sampling schemes affect image quality in CS-based image reconstruction. In this work, the authors present several sparse-sampling schemes for low-dose CT, quantitatively analyze their data property, and compare effects of the sampling schemes on the image quality.

METHODS

Data properties of several sampling schemes are analyzed with respect to the CS-based image reconstruction using two measures: sampling density and data incoherence. The authors present five different sparse sampling schemes, and simulated those schemes to achieve a targeted dose reduction. Dose reduction factors of about 75% and 87.5%, compared to a conventional scan, were tested. A fully sampled circular cone-beam CT data set was used as a reference, and sparse sampling has been realized numerically based on the CBCT data.

RESULTS

It is found that both sampling density and data incoherence affect the image quality in the CS-based reconstruction. Among the sampling schemes the authors investigated, the sparse-view, many-view undersampling (MVUS)-fine, and MVUS-moving cases have shown promising results. These sampling schemes produced images with similar image quality compared to the reference image and their structure similarity index values were higher than 0.92 in the mouse head scan with 75% dose reduction.

CONCLUSIONS

The authors found that in CS-based image reconstructions both sampling density and data incoherence affect the image quality, and suggest that a sampling scheme should be devised and optimized by use of these indicators. With this strategic approach, one can acquire optimally sampled sparse data so that the CS-based algorithms can best perform in terms of image quality.

Effect of compressed sensing reconstruction on target and organ delineation in cone-beam CT of head-and-neck and breast cancer patients

BACKGROUND AND PURPOSE

Compressed sensing (CS) based cone-beam computed tomography (CBCT) reconstruction techniques have been shown to improve image quality. This study was to investigate possible improvements of CBCTCS on manual delineation uncertainties of targets and organs-at-risk.

PATIENTS AND METHODS

Eight H&N and eight breast cancer patients were selected. Each H&N or breast cancer patient had planning-CT (pCT), repeat-CT (rCT), and CBCT reconstructed by both Feldkamp (CBCTFDK) and compressed sensing methods. On each scan, targets and organs-at-risk were delineated by a radiation oncologist. The impact of reconstruction technique was quantitatively assessed by dice similarity coefficient (DSC) and the shortest perpendicular distance (SPD) between contours of two corresponding scans.

RESULTS

The mean CBCTCS-to-rCT DSC was 7.2% and 8.0% bigger than the CBCTFDK-to-rCT for H&N and breast cancer patients respectively. The mean CBCTCS-to-rCT SPD was 16.6% and 25.4% smaller than CBCTFDK-to-rCT SPD. Due to anatomical changes, delineation accuracy reduced in reference to pCT, but no time trend was observed in CBCT based delineation accuracy in reference to rCT.

CONCLUSION

This study demonstrated that CBCTCS has the potential to improve delineation accuracy in H&N and breast cancer patients over CBCTFDK, and CBCTCS thus has potential for adaptive radiotherapy.

Sparse CT reconstruction based on multi-direction anisotropic total variation (MDATV)

Background

The sparse CT (Computed Tomography), inspired by compressed sensing, means to introduce a prior information of image sparsity into CT reconstruction to reduce the input projections so as to reduce the potential threat of incremental X-ray dose to patients’ health. Recently, many remarkable works were concentrated on the sparse CT reconstruction from sparse (limited-angle or few-view style) projections. In this paper we would like to incorporate more prior information into the sparse CT reconstruction for improvement of performance. It is known decades ago that the given projection directions can provide information about the directions of edges in the restored CT image. ATV (Anisotropic Total Variation), a TV (Total Variation) norm based regularization, could use the prior information of image sparsity and edge direction simultaneously. But ATV can only represent the edge information in few directions and lose much prior information of image edges in other directions.

Methods

To sufficiently use the prior information of edge directions, a novel MDATV (Multi-Direction Anisotropic Total Variation) is proposed. In this paper we introduce the 2D-IGS (Two Dimensional Image Gradient Space), and combined the coordinate rotation transform with 2D-IGS to represent edge information in multiple directions. Then by incorporating this multi-direction representation into ATV norm we get the MDATV regularization. To solve the optimization problem based on the MDATV regularization, a novel ART (algebraic reconstruction technique) + MDATV scheme is outlined. And NESTA (NESTerov’s Algorithm) is proposed to replace GD (Gradient Descent) for minimizing the TV-based regularization.

Results

The numerical and real data experiments demonstrate that MDATV based iterative reconstruction improved the quality of restored image. NESTA is more suitable than GD for minimization of TV-based regularization.

Conclusions

MDATV regularization can sufficiently use the prior information of image sparsity and edge information simultaneously. By incorporating more prior information, MDATV based approach could reconstruct the image more exactly.

Sparse-view x-ray CT reconstruction via total generalized variation regularization

Sparse-view CT reconstruction algorithms via total variation (TV) optimize the data iteratively on the basis of a noise- and artifact-reducing model, resulting in significant radiation dose reduction while maintaining image quality. However, the piecewise constant assumption of TV minimization often leads to the appearance of noticeable patchy artifacts in reconstructed images. To obviate this drawback, we present a penalized weighted least-squares (PWLS) scheme to retain the image quality by incorporating the new concept of total generalized variation (TGV) regularization. We refer to the proposed scheme as 'PWLS-TGV' for simplicity. Specifically, TGV regularization utilizes higher order derivatives of the objective image, and the weighted least-squares term considers data-dependent variance estimation, which fully contribute to improving the image quality with sparse-view projection measurement. Subsequently, an alternating optimization algorithm was adopted to minimize the associative objective function. To evaluate the PWLS-TGV method, both qualitative and quantitative studies were conducted by using digital and physical phantoms. Experimental results show that the present PWLS-TGV method can achieve images with several noticeable gains over the original TV-based method in terms of accuracy and resolution properties.

Simultaneous motion estimation and image reconstruction (SMEIR) for 4D cone-beam CT

PURPOSE

Image reconstruction and motion model estimation in four-dimensional cone-beam CT (4D-CBCT) are conventionally handled as two sequential steps. Due to the limited number of projections at each phase, the image quality of 4D-CBCT is degraded by view aliasing artifacts, and the accuracy of subsequent motion modeling is decreased by the inferior 4D-CBCT. The objective of this work is to enhance both the image quality of 4D-CBCT and the accuracy of motion model estimation with a novel strategy enabling simultaneous motion estimation and image reconstruction (SMEIR).

METHODS

The proposed SMEIR algorithm consists of two alternating steps: (1) model-based iterative image reconstruction to obtain a motion-compensated primary CBCT (m-pCBCT) and (2) motion model estimation to obtain an optimal set of deformation vector fields (DVFs) between the m-pCBCT and other 4D-CBCT phases. The motion-compensated image reconstruction is based on the simultaneous algebraic reconstruction technique (SART) coupled with total variation minimization. During the forward- and backprojection of SART, measured projections from an entire set of 4D-CBCT are used for reconstruction of the m-pCBCT by utilizing the updated DVF. The DVF is estimated by matching the forward projection of the deformed m-pCBCT and measured projections of other phases of 4D-CBCT. The performance of the SMEIR algorithm is quantitatively evaluated on a 4D NCAT phantom. The quality of reconstructed 4D images and the accuracy of tumor motion trajectory are assessed by comparing with those resulting from conventional sequential 4D-CBCT reconstructions (FDK and total variation minimization) and motion estimation (demons algorithm). The performance of the SMEIR algorithm is further evaluated by reconstructing a lung cancer patient 4D-CBCT.

RESULTS

Image quality of 4D-CBCT is greatly improved by the SMEIR algorithm in both phantom and patient studies. When all projections are used to reconstruct a 3D-CBCT by FDK, motion-blurring artifacts are present, leading to a 24.4% relative reconstruction error in the NACT phantom. View aliasing artifacts are present in 4D-CBCT reconstructed by FDK from 20 projections, with a relative error of 32.1%. When total variation minimization is used to reconstruct 4D-CBCT, the relative error is 18.9%. Image quality of 4D-CBCT is substantially improved by using the SMEIR algorithm and relative error is reduced to 7.6%. The maximum error (MaxE) of tumor motion determined from the DVF obtained by demons registration on a FDK-reconstructed 4D-CBCT is 3.0, 2.3, and 7.1 mm along left-right (L-R), anterior-posterior (A-P), and superior-inferior (S-I) directions, respectively. From the DVF obtained by demons registration on 4D-CBCT reconstructed by total variation minimization, the MaxE of tumor motion is reduced to 1.5, 0.5, and 5.5 mm along L-R, A-P, and S-I directions. From the DVF estimated by SMEIR algorithm, the MaxE of tumor motion is further reduced to 0.8, 0.4, and 1.5 mm along L-R, A-P, and S-I directions, respectively.

CONCLUSIONS

The proposed SMEIR algorithm is able to estimate a motion model and reconstruct motion-compensated 4D-CBCT. The SMEIR algorithm improves image reconstruction accuracy of 4D-CBCT and tumor motion trajectory estimation accuracy as compared to conventional sequential 4D-CBCT reconstruction and motion estimation.

Accelerated barrier optimization compressed sensing (ABOCS) for CT reconstruction with improved convergence

Recently, we proposed a new algorithm of accelerated barrier optimization compressed sensing (ABOCS) for iterative CT reconstruction. The previous implementation of ABOCS uses gradient projection (GP) with a Barzilai-Borwein (BB) step-size selection scheme (GP-BB) to search for the optimal solution. The algorithm does not converge stably due to its non-monotonic behavior. In this paper, we further improve the convergence of ABOCS using the unknown-parameter Nesterov (UPN) method and investigate the ABOCS reconstruction performance on clinical patient data. Comparison studies are carried out on reconstructions of computer simulation, a physical phantom and a head-and-neck patient. In all of these studies, the ABOCS results using UPN show more stable and faster convergence than those of the GP-BB method and a state-of-the-art Bregman-type method. As shown in the simulation study of the Shepp-Logan phantom, UPN achieves the same image quality as those of GP-BB and the Bregman-type methods, but reduces the iteration numbers by up to 50% and 90%, respectively. In the Catphan©600 phantom study, a high-quality image with relative reconstruction error (RRE) less than 3% compared to the full-view result is obtained using UPN with 17% projections (60 views). In the conventional filtered-backprojection reconstruction, the corresponding RRE is more than 15% on the same projection data. The superior performance of ABOCS with the UPN implementation is further demonstrated on the head-and-neck patient. Using 25% projections (91 views), the proposed method reduces the RRE from 21% as in the filtered backprojection (FBP) results to 7.3%. In conclusion, we propose UPN for ABOCS implementation. As compared to GP-BB and the Bregman-type methods, the new method significantly improves the convergence with higher stability and fewer iterations.

Constrained TpV Minimization for Enhanced Exploitation of Gradient Sparsity: Application to CT Image Reconstruction

Exploiting sparsity in the image gradient magnitude has proved to be an effective means for reducing the sampling rate in the projection view angle in computed tomography (CT). Most of the image reconstruction algorithms, developed for this purpose, solve a nonsmooth convex optimization problem involving the image total variation (TV). The TV seminorm is the ℓ₁ norm of the image gradient magnitude, and reducing the ℓ₁ norm is known to encourage sparsity in its argument. Recently, there has been interest in employing nonconvex ℓ_p quasinorms with 0<p<1 for sparsity exploiting image reconstruction, which is potentially more effective than ℓ₁ because nonconvex ℓ_p is closer to ℓ₀-a direct measure of sparsity. This paper develops algorithms for constrained minimization of the total p-variation (TpV), ℓ_p of the image gradient. Use of the algorithms is illustrated in the context of breast CT-an imaging modality that is still in the research phase and for which constraints on X-ray dose are extremely tight. The TpV-based image reconstruction algorithms are demonstrated on computer simulated data for exploiting gradient magnitude sparsity to reduce the projection view angle sampling. The proposed algorithms are applied to projection data from a realistic breast CT simulation, where the total X-ray dose is equivalent to two-view digital mammography. Following the simulation survey, the algorithms are then demonstrated on a clinical breast CT data set.

A novel CT imaging system with adjacent double X-ray sources

Current computed tomography (CT) scanners rotate fast to reduce motion artifact. X-ray tube must work in a high power to make the image clear under short exposure time. However, the life span of such a tube may be shortened. In this paper, we propose a novel double sources CT imaging system, which puts two of the same X-ray sources closely with each other. The system is different from current dual source CT with orthogonal X-ray sources. In our system, each projection is taken twice by these two sources to enhance the exposure value and then recovered to a single source projection for image reconstruction. The proposed system can work like normal single source CT system, while halving down the working power for each tube.