Accelerating ordered subsets image reconstruction for X-ray CT using spatially nonuniform optimization transfer

TD-STrans: Tri-domain sparse-view CT reconstruction based on sparse transformer

BACKGROUND AND OBJECTIVE

Sparse-view computed tomography (CT) speeds up scanning and reduces radiation exposure in medical diagnosis. However, when the projection views are severely under-sampled, deep learning-based reconstruction methods often suffer from over-smoothing of the reconstructed images due to the lack of high-frequency information. To address this issue, we introduce frequency domain information into the popular projection-image domain reconstruction, proposing a Tri-Domain sparse-view CT reconstruction model based on Sparse Transformer (TD-STrans).

METHODS

TD-STrans integrates three essential modules: the projection recovery module completes the sparse-view projection, the Fourier domain filling module mitigates artifacts and over-smoothing by filling in missing high-frequency details; the image refinement module further enhances and preserves image details. Additionally, a multi-domain joint loss function is designed to simultaneously enhance the reconstruction quality in the projection domain, image domain, and frequency domain, thereby further improving the preservation of image details.

RESULTS

The results of simulation experiments on the lymph node dataset and real experiments on the walnut dataset consistently demonstrate the effectiveness of TD-STrans in artifact removal, suppression of over-smoothing, and preservation of structural fidelity.

CONCLUSION

The reconstruction results of TD-STrans indicate that sparse transformer across multiple domains can alleviate over-smoothing and detail loss caused by reduced views, offering a novel solution for ultra-sparse-view CT imaging.

Robust residual-guided iterative reconstruction for sparse-view CT in small animal imaging

Objective. We introduce a robust image reconstruction algorithm named residual-guided Golub-Kahan iterative reconstruction technique (RGIRT) designed for sparse-view computed tomography (CT), which aims at high-fidelity image reconstruction from a limited number of projection views.Approach. RGIRT utilizes an inner-outer dual iteration framework, with a flexible least square QR (FLSQR) algorithm implemented in the inner iteration and a restarted iterative scheme applied in the outer iteration. The inner FLSQR employs a flexible Golub-Kahan bidiagonalization method to reduce the size of the inverse problem, and a weighted generalized cross-validation method to adaptively estimate the regularization hyper-parameter. The inner iteration efficiently yields the intermediate reconstruction result, while the outer iteration minimizes the residual and refines the solution by using the result obtained from the inner iteration.Main results. The reconstruction performance of RGIRT is evaluated and compared to other reference methods (FBPConvNet, SART-TV, and FLSQR) using projection data from both numerical phantoms and real experimental Micro-CT data. The experimental findings, from testing various numbers of projection views and different noise levels, underscore the robustness of RGIRT. Meanwhile, theoretical analysis confirms the convergence of residual for our approach.Significance. We propose a robust iterative reconstruction algorithm for x-ray CT scans with sparse views, thereby shortening scanning time and mitigating excessive ionizing radiation exposure to small animals.

Truncation effect reduction for fast iterative reconstruction in cone-beam CT

Background

Iterative reconstruction for cone-beam computed tomography (CBCT) has been applied to improve image quality and reduce radiation dose. In a case where an object’s actual projection is larger than a flat panel detector, CBCT images contain truncated data or incomplete projections, which degrade image quality inside the field of view (FOV). In this work, we propose truncation effect reduction for fast iterative reconstruction in CBCT imaging.

Methods

The volume matrix size of the FOV and the height of projection images were extrapolated to a suitable size. These extended projections were reconstructed by fast iterative reconstruction. Moreover, a smoothing parameter for noise regularization in iterative reconstruction was modified to reduce the accumulated error while processing. The proposed work was evaluated by image quality measurements and compared with conventional filtered backprojection (FBP). To validate the proposed method, we used a head phantom for evaluation and preliminarily tested on a human dataset.

Results

In the experimental results, the reconstructed images from the head phantom showed enhanced image quality. In addition, fast iterative reconstruction can be run continuously while maintaining a consistent mean-percentage-error value for many iterations. The contrast-to-noise ratio of the soft-tissue images was improved. Visualization of low contrast in the ventricle and soft-tissue images was much improved compared to those from FBP using the same dose index of 5 mGy.

Conclusions

Our proposed method showed satisfactory performance to reduce the truncation effect, especially inside the FOV with better image quality for soft-tissue imaging. The convergence of fast iterative reconstruction tends to be stable for many iterations.

Cone-beam breast CT using an offset detector: effect of detector offset and image reconstruction algorithm

Objective.A dedicated cone-beam breast computed tomography (BCT) using a high-resolution, low-noise detector operating in offset-detector geometry has been developed. This study investigates the effects of varying detector offsets and image reconstruction algorithms to determine the appropriate combination of detector offset and reconstruction algorithm.Approach.Projection datasets (300 projections in 360°) of 30 breasts containing calcified lesions that were acquired using a prototype cone-beam BCT system comprising a 40 × 30 cm flat-panel detector with 1024 × 768 detector pixels were reconstructed using Feldkamp-Davis-Kress (FDK) algorithm and served as the reference. The projection datasets were retrospectively truncated to emulate cone-beam datasets with sinograms of 768×768 and 640×768 detector pixels, corresponding to 5 cm and 7.5 cm lateral offsets, respectively. These datasets were reconstructed using the FDK algorithm with appropriate weights and an ASD-POCS-based Fast, total variation-Regularized, Iterative, Statistical reconstruction Technique (FRIST), resulting in a total of 4 offset-detector reconstructions (2 detector offsets × 2 reconstruction methods). Signal difference-to-noise ratio (SDNR), variance, and full-width at half-maximum (FWHM) of calcifications in two orthogonal directions were determined from all reconstructions. All quantitative measurements were performed on images in units of linear attenuation coefficient (1/cm).Results.The FWHM of calcifications did not differ (P > 0.262) among reconstruction algorithms and detector formats, implying comparable spatial resolution. For a chosen detector offset, the FRIST algorithm outperformed FDK in terms of variance and SDNR (P < 0.0001). For a given reconstruction method, the 5 cm offset provided better results.Significance.This study indicates the feasibility of using the compressed sensing-based, FRIST algorithm to reconstruct sinograms from offset-detectors. Among the reconstruction methods and detector offsets studied, FRIST reconstructions corresponding to a 30 cm × 30 cm with 5 cm lateral offset, achieved the best performance. A clinical prototype using such an offset geometry has been developed and installed for clinical trials.

Accelerated 3D image reconstruction with a morphological pyramid and noise-power convergence criterion

Model-based iterative reconstruction (MBIR) for cone-beam CT (CBCT) offers better noise-resolution tradeoff and image quality than analytical methods for acquisition protocols with low x-ray dose or limited data, but with increased computational burden that poses a drawback to routine application in clinical scenarios. This work develops a comprehensive framework for acceleration of MBIR in the form of penalized weighted least squares optimized with ordered subsets separable quadratic surrogates. The optimization was scheduled on a set of stages forming a morphological pyramid varying in voxel size. Transition between stages was controlled with a convergence criterion based on the deviation between the mid-band noise power spectrum (NPS) measured on a homogeneous region of the evolving reconstruction and that expected for the converged image, computed with an analytical model that used projection data and the reconstruction parameters. A stochastic backprojector was developed by introducing a random perturbation to the sampling position of each voxel for each ray in the reconstruction within a voxel-based backprojector, breaking the deterministic pattern of sampling artifacts when combined with an unmatched Siddon forward projector. This fast, forward and backprojector pair were included into a multi-resolution reconstruction strategy to provide support for objects partially outside of the field of view. Acceleration from ordered subsets was combined with momentum accumulation stabilized with an adaptive technique that automatically resets the accumulated momentum when it diverges noticeably from the current iteration update. The framework was evaluated with CBCT data of a realistic abdomen phantom acquired on an imaging x-ray bench and with clinical CBCT data from an angiography robotic C-arm (Artis Zeego, Siemens Healthineers, Forchheim, Germany) acquired during a liver embolization procedure. Image fidelity was assessed with the structural similarity index (SSIM) computed with a converged reconstruction. The accelerated framework provided accurate reconstructions in 60 s (SSIM = 0.97) and as little as 27 s (SSIM = 0.94) for soft-tissue evaluation. The use of simple forward and backprojectors resulted in 9.3× acceleration. Accumulation of momentum provided extra ∼3.5× acceleration with stable convergence for 6-30 subsets. The NPS-driven morphological pyramid resulted in initial faster convergence, achieving similar SSIM with 1.5× lower runtime than the single-stage optimization. Acceleration of MBIR to provide reconstruction time compatible with clinical applications is feasible via architectures that integrate algorithmic acceleration with approaches to provide stable convergence, and optimization schedules that maximize convergence speed.

Tensor Gradient L₀-Norm Minimization-Based Low-Dose CT and Its Application to COVID-19

Methods to recover high-quality computed tomography (CT) images in low-dose cases will be of great benefit. To reach this goal, sparse-data subsampling is one of the common strategies to reduce radiation dose, which is attracting interest among the researchers in the CT community. Since analytic image reconstruction algorithms may lead to severe image artifacts, the iterative algorithms have been developed for reconstructing images from sparsely sampled projection data. In this study, we first develop a tensor gradient L₀-norm minimization (TGLM) for low-dose CT imaging. Then, the TGLM model is optimized by using the split-Bregman method. The Coronavirus Disease 2019 (COVID-19) has been sweeping the globe, and CT imaging has been deployed for detection and assessing the severity of the disease. Finally, we first apply our proposed TGLM method for COVID-19 to achieve low-dose scan by incorporating the 3-D spatial information. Two COVID-19 patients (64 years old female and 56 years old man) were scanned by the [Formula: see text]CT 528 system, and the acquired projections were retrieved to validate and evaluate the performance of the TGLM.

Impact of the non-negativity constraint in model-based iterative reconstruction from CT data

PURPOSE

Model-based iterative reconstruction is a promising approach to achieve dose reduction without affecting image quality in diagnostic x-ray computed tomography (CT). In the problem formulation, it is common to enforce non-negative values to accommodate the physical non-negativity of x-ray attenuation. Using this a priori information is believed to be beneficial in terms of image quality and convergence speed. However, enforcing non-negativity imposes limitations on the problem formulation and the choice of optimization algorithm. For these reasons, it is critical to understand the value of the non-negativity constraint. In this work, we present an investigation that sheds light on the impact of this constraint.

METHODS

We primarily focus our investigation on the examination of properties of the converged solution. To avoid any possibly confounding bias, the reconstructions are all performed using a provably converging algorithm started from a zero volume. To keep the computational cost manageable, an axial CT scanning geometry with narrow collimation is employed. The investigation is divided into five experimental studies that challenge the non-negativity constraint in various ways, including noise, beam hardening, parametric choices, truncation, and photon starvation. These studies are complemented by a sixth one that examines the effect of using ordered subsets to obtain a satisfactory approximate result within 50 iterations. All studies are based on real data, which come from three phantom scans and one clinical patient scan. The reconstructions with and without the non-negativity constraint are compared in terms of image similarity and convergence speed. In select cases, the image similarity evaluation is augmented with quantitative image quality metrics such as the noise power spectrum and closeness to a known ground truth.

RESULTS

For cases with moderate inconsistencies in the data, associated with noise and bone-induced beam hardening, our results show that the non-negativity constraint offers little benefit. By varying the regularization parameters in one of the studies, we observed that sufficient edge-preserving regularization tends to dilute the value of the constraint. For cases with strong data inconsistencies, the results are mixed: the constraint can be both beneficial and deleterious; in either case, however, the difference between using the constraint or not is small relative to the overall level of error in the image. The results with ordered subsets are encouraging in that they show similar observations. In terms of convergence speed, we only observed one major effect, in the study with data truncation; this effect favored the use of the constraint, but had no impact on our ability to obtain the converged solution without constraint.

CONCLUSIONS

Our results did not highlight the non-negativity constraint as being strongly beneficial for diagnostic CT imaging. Altogether, we thus conclude that in some imaging scenarios, the non-negativity constraint could be disregarded to simplify the optimization problem or to adopt other forward projection models that require complex optimization machinery to be used together with non-negativity.

Ordered subsets Non-Local means constrained reconstruction for sparse view cone beam CT system

Sparse-view sampling scans reduce the patient's radiation dose by reducing the total exposure duration. CT reconstructions under such scan mode are often accompanied by severe artifacts due to the high ill-posedness of the problem. In this paper, we use a Non-Local means kernel as a regularization constraint to reconstruct image volumes from sparse-angle sampled cone-beam CT scans. To overcome the huge computational cost of the 3D reconstruction, we propose a sequential update scheme relying on ordered subsets in the image domain. It is shown through experiments on simulated and real data and comparisons with other methods that the proposed approach is robust enough to deal with the number of views reduced up to 1/10. When coupled with a CUDA parallel computing technique, the computation speed of the iterative reconstruction is greatly improved.

Performance of the sinogram-based iterative reconstruction in sparse view X-ray computed tomography

Performing X-ray computed tomography (CT) examinations with less radiation has recently received increasing interest: in medical imaging this means less (potentially harmful) radiation for the patient; in non-destructive testing of materials/objects such as testing jet engines, the reduction of the number of projection angles (which for large objects is in general high) leads to a substantial decreasing of the experiment time. In the experiment, less radiation is usually achieved by either (1) reducing the radiation dose used at each projection angle or (2) using sparse view X-ray CT, which means significantly less projection angles are used during the examination. In this work, we study the performance of the recently proposed sinogram-based iterative reconstruction algorithm in sparse view X-ray CT and show that it provides, in some cases, reconstruction accuracy better than that obtained by some of the Total Variation regularization techniques. The provided accuracy is obtained with computation times comparable to other techniques. An important feature of the sinogram-based iterative reconstruction algorithm is that it is simpler and without the many parameters specific to other techniques.

Time of flight PET reconstruction using nonuniform update for regional recovery uniformity

PURPOSE

Time of flight (TOF) PET reconstruction is well known to statistically improve the image quality compared to non-TOF PET. Although TOF PET can improve the overall signal to noise ratio (SNR) of the image compared to non-TOF PET, the SNR disparity between separate regions in the reconstructed image using TOF data becomes higher than that using non-TOF data. Using the conventional ordered subset expectation maximization (OS-EM) method, the SNR in the low activity regions becomes significantly lower than in the high activity regions due to the different photon statistics of TOF bins. A uniform recovery across different SNR regions is preferred if it can yield an overall good image quality within small number of iterations in practice. To allow more uniform recovery of regions, a spatially variant update is necessary for different SNR regions.

METHODS

This paper focuses on designing a spatially variant step size and proposes a TOF-PET reconstruction method that uses a nonuniform separable quadratic surrogates (NUSQS) algorithm, providing a straightforward control of spatially variant step size. To control the noise, a spatially invariant quadratic regularization is incorporated, which by itself does not theoretically affect the recovery uniformity. The Nesterov's momentum method with ordered subsets (OS) is also used to accelerate the reconstruction speed. To evaluate the proposed method, an XCAT simulation phantom and clinical data from a pancreas cancer patient with full (ground truth) and 6× downsampled counts were used, where a Poisson thinning process was employed for downsampling. We selected tumor and cold regions of interest (ROIs) and compared the proposed method with the TOF-based conventional OS-EM and OS-SQS algorithms with an early stopping criterion.

RESULTS

In computer simulation, without regularization, hot regions of OS-EM and OS-NUSQS converged similarly, but cold region of OS-EM was noisier than OS-NUSQS after 24 iterations. With regularization, although the overall speeds of OS-EM and OS-NUSQS were similar, recovery ratios of hot and cold regions reconstructed by the OS-NUSQS were more uniform compared to those of the conventional OS-SQS and OS-EM. The OS-NUSQS with Nesterov's momentum converged faster than others while preserving the uniform recovery. In the clinical example, we demonstrated that the OS-NUSQS with Nesterov's momentum provides more uniform recovery ratios of hot and cold ROIs compared to the OS-SQS and OS-EM. Although the cost function of all methods is equivalent, the proposed method has higher structural similarity (SSIM) values of hot and cold regions compared to other methods after 24 iterations. Furthermore, our computing time using graphics processing unit was 80× shorter than the time using quad-core CPUs.

CONCLUSION

This paper proposes a TOF PET reconstruction method using the OS-NUSQS with Nesterov's momentum for uniform recovery of different SNR regions. In particular, the spatially nonuniform step size in the proposed method provides uniform recovery ratios of different SNR regions, and the Nesterov's momentum further accelerates overall convergence while preserving uniform recovery. The computer simulation and clinical example demonstrate that the proposed method converges uniformly across ROIs. In addition, tumor contrast and SSIM of the proposed method were higher than those of the conventional OS-EM and OS-SQS in early iterations.

Detector Blur and Correlated Noise Modeling for Digital Breast Tomosynthesis Reconstruction

This paper describes a new image reconstruction method for digital breast tomosynthesis (DBT). The new method incorporates detector blur into the forward model. The detector blur in DBT causes correlation in the measurement noise. By making a few approximations that are reasonable for breast imaging, we formulated a regularized quadratic optimization problem with a data-fit term that incorporates models for detector blur and correlated noise (DBCN). We derived a computationally efficient separable quadratic surrogate (SQS) algorithm to solve the optimization problem that has a non-diagonal noise covariance matrix. We evaluated the SQS-DBCN method by reconstructing DBT scans of breast phantoms and human subjects. The contrast-to-noise ratio and sharpness of microcalcifications were analyzed and compared with those by the simultaneous algebraic reconstruction technique. The quality of soft tissue lesions and parenchymal patterns was examined. The results demonstrate the potential to improve the image quality of reconstructed DBT images by incorporating the system physics model. This paper is a first step toward model-based iterative reconstruction for DBT.

Task-based statistical image reconstruction for high-quality cone-beam CT

Task-based analysis of medical imaging performance underlies many ongoing efforts in the development of new imaging systems. In statistical image reconstruction, regularization is often formulated in terms to encourage smoothness and/or sharpness (e.g. a linear, quadratic, or Huber penalty) but without explicit formulation of the task. We propose an alternative regularization approach in which a spatially varying penalty is determined that maximizes task-based imaging performance at every location in a 3D image. We apply the method to model-based image reconstruction (MBIR-viz., penalized weighted least-squares, PWLS) in cone-beam CT (CBCT) of the head, focusing on the task of detecting a small, low-contrast intracranial hemorrhage (ICH), and we test the performance of the algorithm in the context of a recently developed CBCT prototype for point-of-care imaging of brain injury. Theoretical predictions of local spatial resolution and noise are computed via an optimization by which regularization (specifically, the quadratic penalty strength) is allowed to vary throughout the image to maximize local task-based detectability index ([Formula: see text]). Simulation studies and test-bench experiments were performed using an anthropomorphic head phantom. Three PWLS implementations were tested: conventional (constant) penalty; a certainty-based penalty derived to enforce constant point-spread function, PSF; and the task-based penalty derived to maximize local detectability at each location. Conventional (constant) regularization exhibited a fairly strong degree of spatial variation in [Formula: see text], and the certainty-based method achieved uniform PSF, but each exhibited a reduction in detectability compared to the task-based method, which improved detectability up to ~15%. The improvement was strongest in areas of high attenuation (skull base), where the conventional and certainty-based methods tended to over-smooth the data. The task-driven reconstruction method presents a promising regularization method in MBIR by explicitly incorporating task-based imaging performance as the objective. The results demonstrate improved ICH conspicuity and support the development of high-quality CBCT systems.

A comparison of linear interpolation models for iterative CT reconstruction

PURPOSE

Recent reports indicate that model-based iterative reconstruction methods may improve image quality in computed tomography (CT). One difficulty with these methods is the number of options available to implement them, including the selection of the forward projection model and the penalty term. Currently, the literature is fairly scarce in terms of guidance regarding this selection step, whereas these options impact image quality. Here, the authors investigate the merits of three forward projection models that rely on linear interpolation: the distance-driven method, Joseph's method, and the bilinear method. The authors' selection is motivated by three factors: (1) in CT, linear interpolation is often seen as a suitable trade-off between discretization errors and computational cost, (2) the first two methods are popular with manufacturers, and (3) the third method enables assessing the importance of a key assumption in the other methods.

METHODS

One approach to evaluate forward projection models is to inspect their effect on discretized images, as well as the effect of their transpose on data sets, but significance of such studies is unclear since the matrix and its transpose are always jointly used in iterative reconstruction. Another approach is to investigate the models in the context they are used, i.e., together with statistical weights and a penalty term. Unfortunately, this approach requires the selection of a preferred objective function and does not provide clear information on features that are intrinsic to the model. The authors adopted the following two-stage methodology. First, the authors analyze images that progressively include components of the singular value decomposition of the model in a reconstructed image without statistical weights and penalty term. Next, the authors examine the impact of weights and penalty on observed differences.

RESULTS

Image quality metrics were investigated for 16 different fan-beam imaging scenarios that enabled probing various aspects of all models. The metrics include a surrogate for computational cost, as well as bias, noise, and an estimation task, all at matched resolution. The analysis revealed fundamental differences in terms of both bias and noise. Task-based assessment appears to be required to appreciate the differences in noise; the estimation task the authors selected showed that these differences balance out to yield similar performance. Some scenarios highlighted merits for the distance-driven method in terms of bias but with an increase in computational cost. Three combinations of statistical weights and penalty term showed that the observed differences remain the same, but strong edge-preserving penalty can dramatically reduce the magnitude of these differences.

CONCLUSIONS

In many scenarios, Joseph's method seems to offer an interesting compromise between cost and computational effort. The distance-driven method offers the possibility to reduce bias but with an increase in computational cost. The bilinear method indicated that a key assumption in the other two methods is highly robust. Last, strong edge-preserving penalty can act as a compensator for insufficiencies in the forward projection model, bringing all models to similar levels in the most challenging imaging scenarios. Also, the authors find that their evaluation methodology helps appreciating how model, statistical weights, and penalty term interplay together.

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.

Accelerating an Ordered-Subset Low-Dose X-Ray Cone Beam Computed Tomography Image Reconstruction with a Power Factor and Total Variation Minimization

In recent years, there has been increased interest in low-dose X-ray cone beam computed tomography (CBCT) in many fields, including dentistry, guided radiotherapy and small animal imaging. Despite reducing the radiation dose, low-dose CBCT has not gained widespread acceptance in routine clinical practice. In addition to performing more evaluation studies, developing a fast and high-quality reconstruction algorithm is required. In this work, we propose an iterative reconstruction method that accelerates ordered-subsets (OS) reconstruction using a power factor. Furthermore, we combine it with the total-variation (TV) minimization method. Both simulation and phantom studies were conducted to evaluate the performance of the proposed method. Results show that the proposed method can accelerate conventional OS methods, greatly increase the convergence speed in early iterations. Moreover, applying the TV minimization to the power acceleration scheme can further improve the image quality while preserving the fast convergence rate.

Accelerated statistical reconstruction for C-arm cone-beam CT using Nesterov's method

PURPOSE

To accelerate model-based iterative reconstruction (IR) methods for C-arm cone-beam CT (CBCT), thereby combining the benefits of improved image quality and/or reduced radiation dose with reconstruction times on the order of minutes rather than hours.

METHODS

The ordered-subsets, separable quadratic surrogates (OS-SQS) algorithm for solving the penalized-likelihood (PL) objective was modified to include Nesterov's method, which utilizes "momentum" from image updates of previous iterations to better inform the current iteration and provide significantly faster convergence. Reconstruction performance of an anthropomorphic head phantom was assessed on a benchtop CBCT system, followed by CBCT on a mobile C-arm, which provided typical levels of incomplete data, including lateral truncation. Additionally, a cadaveric torso that presented realistic soft-tissue and bony anatomy was imaged on the C-arm, and different projectors were assessed for reconstruction speed.

RESULTS

Nesterov's method provided equivalent image quality to OS-SQS while reducing the reconstruction time by an order of magnitude (10.0 ×) by reducing the number of iterations required for convergence. The faster projectors were shown to produce similar levels of convergence as more accurate projectors and reduced the reconstruction time by another 5.3 ×. Despite the slower convergence of IR with truncated C-arm CBCT, comparison of PL reconstruction methods implemented on graphics processing units showed that reconstruction time was reduced from 106 min for the conventional OS-SQS method to as little as 2.0 min with Nesterov's method for a volumetric reconstruction of the head. In body imaging, reconstruction of the larger cadaveric torso was reduced from 159 min down to 3.3 min with Nesterov's method.

CONCLUSIONS

The acceleration achieved through Nesterov's method combined with ordered subsets reduced IR times down to a few minutes. This improved compatibility with clinical workflow better enables broader adoption of IR in CBCT-guided procedures, with corresponding benefits in overcoming conventional limits of image quality at lower dose.

Statistical reconstruction for cone-beam CT with a post-artifact-correction noise model: application to high-quality head imaging

Non-contrast CT reliably detects fresh blood in the brain and is the current front-line imaging modality for intracranial hemorrhage such as that occurring in acute traumatic brain injury (contrast ~40-80 HU, size  >  1 mm). We are developing flat-panel detector (FPD) cone-beam CT (CBCT) to facilitate such diagnosis in a low-cost, mobile platform suitable for point-of-care deployment. Such a system may offer benefits in the ICU, urgent care/concussion clinic, ambulance, and sports and military theatres. However, current FPD-CBCT systems face significant challenges that confound low-contrast, soft-tissue imaging. Artifact correction can overcome major sources of bias in FPD-CBCT but imparts noise amplification in filtered backprojection (FBP). Model-based reconstruction improves soft-tissue image quality compared to FBP by leveraging a high-fidelity forward model and image regularization. In this work, we develop a novel penalized weighted least-squares (PWLS) image reconstruction method with a noise model that includes accurate modeling of the noise characteristics associated with the two dominant artifact corrections (scatter and beam-hardening) in CBCT and utilizes modified weights to compensate for noise amplification imparted by each correction. Experiments included real data acquired on a FPD-CBCT test-bench and an anthropomorphic head phantom emulating intra-parenchymal hemorrhage. The proposed PWLS method demonstrated superior noise-resolution tradeoffs in comparison to FBP and PWLS with conventional weights (viz. at matched 0.50 mm spatial resolution, CNR = 11.9 compared to CNR = 5.6 and CNR = 9.9, respectively) and substantially reduced image noise especially in challenging regions such as skull base. The results support the hypothesis that with high-fidelity artifact correction and statistical reconstruction using an accurate post-artifact-correction noise model, FPD-CBCT can achieve image quality allowing reliable detection of intracranial hemorrhage.

Edge-preserving image denoising via group coordinate descent on the GPU

Image denoising is a fundamental operation in image processing, and its applications range from the direct (photographic enhancement) to the technical (as a subproblem in image reconstruction algorithms). In many applications, the number of pixels has continued to grow, while the serial execution speed of computational hardware has begun to stall. New image processing algorithms must exploit the power offered by massively parallel architectures like graphics processing units (GPUs). This paper describes a family of image denoising algorithms well-suited to the GPU. The algorithms iteratively perform a set of independent, parallel 1D pixel-update subproblems. To match GPU memory limitations, they perform these pixel updates in-place and only store the noisy data, denoised image, and problem parameters. The algorithms can handle a wide range of edge-preserving roughness penalties, including differentiable convex penalties and anisotropic total variation. Both algorithms use the majorize-minimize framework to solve the 1D pixel update subproblem. Results from a large 2D image denoising problem and a 3D medical imaging denoising problem demonstrate that the proposed algorithms converge rapidly in terms of both iteration and run-time.

Comparison of SIRT and SQS for Regularized Weighted Least Squares Image Reconstruction

Tomographic image reconstruction is often formulated as a regularized weighted least squares (RWLS) problem optimized by iterative algorithms that are either inherently algebraic or derived from a statistical point of view. This paper compares a modified version of SIRT (Simultaneous Iterative Reconstruction Technique), which is of the former type, with a version of SQS (Separable Quadratic Surrogates), which is of the latter type. We show that the two algorithms minimize the same criterion function using similar forms of preconditioned gradient descent. We present near-optimal relaxation for both based on eigenvalue bounds and include a heuristic extension for use with ordered subsets. We provide empirical evidence that SIRT and SQS converge at the same rate for all intents and purposes. For context, we compare their performance with an implementation of preconditioned conjugate gradient. The illustrative application is X-ray CT of luggage for aviation security.

Fast X-ray CT image reconstruction using a linearized augmented Lagrangian method with ordered subsets

Augmented Lagrangian (AL) methods for solving convex optimization problems with linear constraints are attractive for imaging applications with composite cost functions due to the empirical fast convergence rate under weak conditions. However, for problems such as X-ray computed tomography (CT) image reconstruction, where the inner least-squares problem is challenging and requires iterations, AL methods can be slow. This paper focuses on solving regularized (weighted) least-squares problems using a linearized variant of AL methods that replaces the quadratic AL penalty term in the scaled augmented Lagrangian with its separable quadratic surrogate function, leading to a simpler ordered-subsets (OS) accelerable splitting-based algorithm, OS-LALM. To further accelerate the proposed algorithm, we use a second-order recursive system analysis to design a deterministic downward continuation approach that avoids tedious parameter tuning and provides fast convergence. Experimental results show that the proposed algorithm significantly accelerates the convergence of X-ray CT image reconstruction with negligible overhead and can reduce OS artifacts when using many subsets.

Combining ordered subsets and momentum for accelerated X-ray CT image reconstruction

Statistical X-ray computed tomography (CT) reconstruction can improve image quality from reduced dose scans, but requires very long computation time. Ordered subsets (OS) methods have been widely used for research in X-ray CT statistical image reconstruction (and are used in clinical PET and SPECT reconstruction). In particular, OS methods based on separable quadratic surrogates (OS-SQS) are massively parallelizable and are well suited to modern computing architectures, but the number of iterations required for convergence should be reduced for better practical use. This paper introduces OS-SQS-momentum algorithms that combine Nesterov's momentum techniques with OS-SQS methods, greatly improving convergence speed in early iterations. If the number of subsets is too large, the OS-SQS-momentum methods can be unstable, so we propose diminishing step sizes that stabilize the method while preserving the very fast convergence behavior. Experiments with simulated and real 3D CT scan data illustrate the performance of the proposed algorithms.

Nonuniform update for sparse target recovery in fluorescence molecular tomography accelerated by ordered subsets

Fluorescence molecular tomography (FMT) is a promising imaging modality and has been actively studied in the past two decades since it can locate the specific tumor position three-dimensionally in small animals. However, it remains a challenging task to obtain fast, robust and accurate reconstruction of fluorescent probe distribution in small animals due to the large computational burden, the noisy measurement and the ill-posed nature of the inverse problem. In this paper we propose a nonuniform preconditioning method in combination with L (1) regularization and ordered subsets technique (NUMOS) to take care of the different updating needs at different pixels, to enhance sparsity and suppress noise, and to further boost convergence of approximate solutions for fluorescence molecular tomography. Using both simulated data and phantom experiment, we found that the proposed nonuniform updating method outperforms its popular uniform counterpart by obtaining a more localized, less noisy, more accurate image. The computational cost was greatly reduced as well. The ordered subset (OS) technique provided additional 5 times and 3 times speed enhancements for simulation and phantom experiments, respectively, without degrading image qualities. When compared with the popular L (1) algorithms such as iterative soft-thresholding algorithm (ISTA) and Fast iterative soft-thresholding algorithm (FISTA) algorithms, NUMOS also outperforms them by obtaining a better image in much shorter period of time.

Metal artifact correction for x-ray computed tomography using kV and selective MV imaging

PURPOSE

The overall goal of this work is to improve the computed tomography (CT) image quality for patients with metal implants or fillings by completing the missing kilovoltage (kV) projection data with selectively acquired megavoltage (MV) data that do not suffer from photon starvation. When both of these imaging systems, which are available on current radiotherapy devices, are used, metal streak artifacts are avoided, and the soft-tissue contrast is restored, even for regions in which the kV data cannot contribute any information.

METHODS

Three image-reconstruction methods, including two filtered back-projection (FBP)-based analytic methods and one iterative method, for combining kV and MV projection data from the two on-board imaging systems of a radiotherapy device are presented in this work. The analytic reconstruction methods modify the MV data based on the information in the projection or image domains and then patch the data onto the kV projections for a FBP reconstruction. In the iterative reconstruction, the authors used dual-energy (DE) penalized weighted least-squares (PWLS) methods to simultaneously combine the kV/MV data and perform the reconstruction.

RESULTS

The authors compared kV/MV reconstructions to kV-only reconstructions using a dental phantom with fillings and a hip-implant numerical phantom. Simulation results indicated that dual-energy sinogram patch FBP and the modified dual-energy PWLS method can successfully suppress metal streak artifacts and restore information lost due to photon starvation in the kV projections. The root-mean-square errors of soft-tissue patterns obtained using combined kV/MV data are 10-15 Hounsfield units smaller than those of the kV-only images, and the structural similarity index measure also indicates a 5%-10% improvement in the image quality. The added dose from the MV scan is much less than the dose from the kV scan if a high efficiency MV detector is assumed.

CONCLUSIONS

The authors have shown that it is possible to improve the image quality of kV CTs for patients with metal implants or fillings by completing the missing kV projection data with selectively acquired MV data that do not suffer from photon starvation. Numerical simulations demonstrated that dual-energy sinogram patch FBP and a modified kV/MV PWLS method can successfully suppress metal streak artifacts and restore information lost due to photon starvation in kV projections. Combined kV/MV images may permit the improved delineation of structures of interest in CT images for patients with metal implants or fillings.

Multi-material decomposition using statistical image reconstruction for spectral CT

Spectral computed tomography (CT) provides information on material characterization and quantification because of its ability to separate different basis materials. Dual-energy (DE) CT provides two sets of measurements at two different source energies. In principle, two materials can be accurately decomposed from DECT measurements. However, many clinical and industrial applications require three or more material images. For triple-material decomposition, a third constraint, such as volume conservation, mass conservation or both, is required to solve three sets of unknowns from two sets of measurements. The recently proposed flexible image-domain (ID) multi-material decomposition) method assumes each pixel contains at most three materials out of several possible materials and decomposes a mixture pixel by pixel. We propose a penalized-likelihood (PL) method with edge-preserving regularizers for each material to reconstruct multi-material images using a similar constraint from sinogram data. We develop an optimization transfer method with a series of pixel-wise separable quadratic surrogate (PWSQS) functions to monotonically decrease the complicated PL cost function. The PWSQS algorithm separates pixels to allow simultaneous update of all pixels, but keeps the basis materials coupled to allow faster convergence rate than our previous proposed material- and pixel-wise SQS algorithms. Comparing with the ID method using 2-D fan-beam simulations, the PL method greatly reduced noise, streak and cross-talk artifacts in the reconstructed basis component images, and achieved much smaller root mean square errors.