3D forward and back-projection for X-ray CT using separable footprints

AAPM Truth-based CT (TrueCT) reconstruction grand challenge

BACKGROUND

This Special Report summarizes the 2022, AAPM grand challenge on Truth-based CT image reconstruction.

PURPOSE

To provide an objective framework for evaluating CT reconstruction methods using virtual imaging resources consisting of a library of simulated CT projection images of a population of human models with various diseases.

METHODS

Two hundred unique anthropomorphic, computational models were created with varied diseases consisting of 67 emphysema, 67 lung lesions, and 66 liver lesions. The organs were modeled based on clinical CT images of real patients. The emphysematous regions were modeled using segmentations from patient CT cases in the COPDGene Phase I dataset. For the lung and liver lesion cases, 1-6 malignant lesions were created and inserted into the human models, with lesion diameters ranging from 5.6 to 21.9 mm for lung lesions and 3.9 to 14.9 mm for liver lesions. The contrast defined between the liver lesions and liver parenchyma was 82 ± 12 HU, ranging from 50 to 110 HU. Similarly, the contrast between the lung lesions and the lung parenchyma was defined as 781 ± 11 HU, ranging from 725 to 805 HU. For the emphysematous regions, the defined HU values were -950 ± 17 HU ranging from -918 to -979 HU. The developed human models were imaged with a validated CT simulator. The resulting CT sinograms were shared with the participants. The participants reconstructed CT images from the sinograms and sent back their reconstructed images. The reconstructed images were then scored by comparing the results against the corresponding ground truth values. The scores included both task-generic (root mean square error [RMSE] and structural similarity matrix [SSIM]), and task-specific (detectability index [d'] and lesion volume accuracy) metrics. For the cases with multiple lesions, the measured metric was averaged across all the lesions. To combine the metrics with each other, each metric was normalized to a range of 0 to 1 per disease type, with "0" and "1" being the worst and best measured values across all cases of the disease type for all received reconstructions.

RESULTS

The True-CT challenge attracted 52 participants, out of which 5 successfully completed the challenge and submitted the requested 200 reconstructions. Across all participants and disease types, SSIM absolute values ranged from 0.22 to 0.90, RMSE from 77.6 to 490.5 HU, d' from 0.1 to 64.6, and volume accuracy ranged from 1.2 to 753.1 mm3. The overall scores demonstrated that participant "A" had the best performance in all categories, except for the metrics of d' for lung lesions and RMSE for liver lesions. Participant "A" had an average normalized score of 0.41 ± 0.22, 0.48 ± 0.32, and 0.42 ± 0.33 for the emphysema, lung lesion, and liver lesion cases, respectively.

CONCLUSIONS

The True-CT challenge successfully enabled objective assessment of CT reconstructions with the unique advantage of access to a diverse population of diseased human models with known ground truth. This study highlights the significant potential of virtual imaging trials in objective assessment of medical imaging technologies.

RBP-DIP: Residual back projection with deep image prior for ill-posed CT reconstruction

The success of deep image prior (DIP) in a number of image processing tasks has motivated their application in image reconstruction problems in computed tomography (CT). In this paper, we introduce a residual back projection technique (RBP) that improves the performance of deep image prior framework in iterative CT reconstruction, especially when the reconstruction problem is highly ill-posed. The RBP-DIP framework uses an untrained U-net in conjunction with a novel residual back projection connection to minimize the objective function while improving reconstruction accuracy. In each iteration, the weights of the untrained U-net are optimized, and the output of the U-net in the current iteration is used to update the input of the U-net in the next iteration through the proposed RBP connection. The introduction of the RBP connection strengthens the regularization effects of the DIP framework in the context of iterative CT reconstruction leading to improvements in accuracy. Our experiments demonstrate that the RBP-DIP framework offers improvements over other state-of-the-art conventional IR methods, as well as pre-trained and untrained models with similar network structures under multiple conditions. These improvements are particularly significant in the few-view and limited-angle CT reconstructions, where the corresponding inverse problems are highly ill-posed and the training data is limited. Furthermore, RBP-DIP has the potential for further improvement. Most existing IR algorithms, pre-trained models, and enhancements applicable to the original DIP algorithm can also be integrated into the RBP-DIP framework.

Real space iterative reconstruction for vector tomography (RESIRE-V)

Tomography has had an important impact on the physical, biological, and medical sciences. To date, most tomographic applications have been focused on 3D scalar reconstructions. However, in some crucial applications, vector tomography is required to reconstruct 3D vector fields such as the electric and magnetic fields. Over the years, several vector tomography methods have been developed. Here, we present the mathematical foundation and algorithmic implementation of REal Space Iterative REconstruction for Vector tomography, termed RESIRE-V. RESIRE-V uses multiple tilt series of projections and iterates between the projections and a 3D reconstruction. Each iteration consists of a forward step using the Radon transform and a backward step using its transpose, then updates the object via gradient descent. Incorporating with a 3D support constraint, the algorithm iteratively minimizes an error metric, defined as the difference between the measured and calculated projections. The algorithm can also be used to refine the tilt angles and further improve the 3D reconstruction. To validate RESIRE-V, we first apply it to a simulated data set of the 3D magnetization vector field, consisting of two orthogonal tilt series, each with a missing wedge. Our quantitative analysis shows that the three components of the reconstructed magnetization vector field agree well with the ground-truth counterparts. We then use RESIRE-V to reconstruct the 3D magnetization vector field of a ferromagnetic meta-lattice consisting of three tilt series. Our 3D vector reconstruction reveals the existence of topological magnetic defects with positive and negative charges. We expect that RESIRE-V can be incorporated into different imaging modalities as a general vector tomography method. To make the algorithm accessible to a broad user community, we have made our RESIRE-V MATLAB source codes and the data freely available at https://github.com/minhpham0309/RESIRE-V .

Iterative image reconstruction with polar coordinate discretized system matrix for optical CT radiochromic gel dosimetry

BACKGROUND

Gel dosimeters are a potential tool for measuring the complex dose distributions that characterize modern radiotherapy. A prototype tabletop solid-tank fan-beam optical CT scanner for readout of gel dosimeters was recently developed. This scanner does not have a straight raypath from source to detector, thus images cannot be reconstructed using filtered backprojection (FBP) and iterative techniques are required. Iterative image reconstruction requires a system matrix that describes the geometry of the imaging system. Stored system matrices can become immensely large, making them impractical for storage on a typical desktop computer.

PURPOSE

Here we develop a method to reduce the storage size of optical CT system matrices through use of polar coordinate discretization while accounting for the refraction in optical CT systems.

METHODS

A ray tracing simulator was developed to track the path of light rays as they traverse the different mediums of the optical CT scanner. Cartesian coordinate discretized system matrices (CCDSMs) and polar coordinate discretized system matrices (PCDSMs) were generated by discretizing the reconstruction area of the optical CT scanner into a Cartesian pixel grid and a polar coordinate pixel grid, respectively. The length of each ray through each pixel was calculated and used to populate the system matrices. To ensure equal weighting during iterative reconstruction, the radial rings of PCDSMs were asymmetrically spaced such that the area of each polar pixel was constant. Two clinical phantoms and several synthetic phantoms were produced and used to evaluate the reconstruction techniques under known conditions. Reconstructed images were analyzed in terms of spatial resolution, signal-to-noise ratio (SNR), contrast-to-noise ratio (CNR), signal nonuniformity (SNU), and Gamma map pass percentage.

RESULTS

A storage size reduction of 99.72% was found when comparing a PCDSM to a CCDSM with the same total number of pixels. Images reconstructed with a PCDSM were found to have superior SNR, CNR, SNU, and Gamma (1 mm, 1%) pass percentage compared to those reconstructed with a CCDSM. Increasing spatial resolution in the radial direction with increasing radial distance was found in both PCDSM and CCDSM reconstructions due to the outer regions refracting light more severely. Images reconstructed with a PCDSM showed a decrease in spatial resolution in the azimuthal directions as radial distance increases, due to the widening of the polar pixels. However, this can be mitigated with only a slight increase in storage size by increasing the number of projections. A loss of spatial resolution in the radial direction within 5 mm radially from center was found when reconstructing with a PCDSM, due to the large innermost pixels. However, this was remedied by increasing the number of radial rings within the PCDSM, yielding radial spatial resolution on par with images reconstructed with a CCDSM and a storage size reduction of 99.26%.

CONCLUSIONS

Discretizing the image pixel elements in polar coordinates achieved a system matrix storage size reduction of 99.26% with only minimal reduction in the image quality.

MCR toolkit: A GPU-based toolkit for multi-channel reconstruction of preclinical and clinical x-ray CT data

BACKGROUND

The advancement of x-ray CT into the domains of photon counting spectral imaging and dynamic cardiac and perfusion imaging has created many new challenges and opportunities for clinicians and researchers. To address challenges such as dose constraints and scanning times while capitalizing on opportunities such as multi-contrast imaging and low-dose coronary angiography, these multi-channel imaging applications require a new generation of CT reconstruction tools. These new tools should exploit the relationships between imaging channels during reconstruction to set new image quality standards while serving as a platform for direct translation between the preclinical and clinical domains.

PURPOSE

We outline and demonstrate a new Multi-Channel Reconstruction (MCR) Toolkit for GPU-based analytical and iterative reconstruction of preclinical and clinical multi-energy and dynamic x-ray CT data. To promote open science, open-source distribution of the Toolkit will coincide with the release of this publication (GPL v3; gitlab.oit.duke.edu/dpc18/mcr-toolkit-public).

METHODS

The MCR Toolkit source code is implemented in C/C++ and NVIDIA's CUDA GPU programming interface, with scripting support from MATLAB and Python. The Toolkit implements matched, separable footprint CT reconstruction operators for projection and backprojection in two geometries: planar, cone-beam CT (CBCT) and 3rd generation, cylindrical multi-detector row CT (MDCT). Analytical reconstruction is performed using filtered backprojection (FBP) for circular CBCT, weighted FBP (WFBP) for helical CBCT, and cone-parallel projection rebinning followed by WFBP for MDCT. Arbitrary combinations of energy and temporal channels are iteratively reconstructed under a generalized multi-channel signal model for joint reconstruction. We solve this generalized model algebraically using the split Bregman optimization method and the BiCGSTAB(l) linear solver interchangeably for both CBCT and MDCT data. Rank-sparse kernel regression (RSKR) and patch-based singular value thresholding (pSVT) are used to regularize the energy and time dimensions, respectively. Under a Gaussian noise model, regularization parameters are estimated automatically from the input data, dramatically reducing algorithm complexity for end users. Multi-GPU parallelization of the reconstruction operators is supported to manage reconstruction times.

RESULTS

Denoising with RSKR and pSVT and post-reconstruction material decomposition are illustrated with preclinical and clinical cardiac photon-counting (PC)CT data. A digital MOBY mouse phantom with cardiac motion is used to illustrate single energy (SE), multi-energy (ME), time resolved (TR), and combined multi-energy and time-resolved (METR) helical, CBCT reconstruction. A fixed set of projection data is used across all reconstruction cases to demonstrate the Toolkit's robustness to increasing data dimensionality. Identical reconstruction code is applied to in vivo cardiac PCCT data acquired in a mouse model of atherosclerosis (METR). Clinical cardiac CT reconstruction is illustrated using the XCAT phantom and the DukeSim CT simulator, while dual-source, dual-energy CT reconstruction is illustrated for data acquired with a Siemens Flash scanner. Benchmarking results with NVIDIA RTX 8000 GPU hardware demonstrate 61%-99% efficiency in scaling computation from one to four GPUs for these reconstruction problems.

CONCLUSIONS

The MCR Toolkit provides a robust solution for temporal and spectral x-ray CT reconstruction problems and was built from the ground up to facilitate translation of CT research and development between preclinical and clinical applications.

Sparse-view and limited-angle CT reconstruction with untrained networks and deep image prior

BACKGROUND AND OBJECTIVE

Neural network based image reconstruction methods are becoming increasingly popular. However, limited training data and the lack of theoretical guarantees for generalizability raised concerns, especially in biomedical imaging applications. These challenges are known to lead to an unstable reconstruction process that poses significant problems in biomedical image reconstruction. In this paper, we present a new framework that uses untrained generator networks to tackle this challenge, leveraging the structure of deep networks for regularizing solutions based on a technique known as Deep Image Prior (DIP).

METHODS

To achieve a high reconstruction accuracy, we propose a framework optimizing both the latent vector and the weights of a generator network during the reconstruction process. We also propose the corresponding reconstruction strategies to improve the stability and convergent performance of the proposed framework. Furthermore, instead of calculating forward projection in each iteration, we propose implementing its normal operator as a convolutional kernel under parallel beam geometry, thus greatly accelerating the calculation.

RESULTS

Our experiments show that the proposed framework has significant improvements over other state-of-the-art conventional, pre-trained, and untrained methods under sparse-view, limited-angle, and low-dose conditions.

CONCLUSIONS

Applying to parallel beam X-ray imaging, our framework shows advantages in speed, accuracy, and stability of the reconstruction process. We also show that the proposed framework is compatible with all differentiable regularizations that are commonly used in biomedical image reconstruction literature. Our framework can also be used as a post-processing technique to further improve the reconstruction generated by any other reconstruction methods. Furthermore, the proposed framework requires no training data and can be adjusted on-demand to adapt to different conditions (e.g. noise level, geometry, and imaged object).

Reference-free learning-based similarity metric for motion compensation in cone-beam CT

Purpose. Patient motion artifacts present a prevalent challenge to image quality in interventional cone-beam CT (CBCT). We propose a novel reference-free similarity metric (DL-VIF) that leverages the capability of deep convolutional neural networks (CNN) to learn features associated with motion artifacts within realistic anatomical features. DL-VIF aims to address shortcomings of conventional metrics of motion-induced image quality degradation that favor characteristics associated with motion-free images, such as sharpness or piecewise constancy, but lack any awareness of the underlying anatomy, potentially promoting images depicting unrealistic image content. DL-VIF was integrated in an autofocus motion compensation framework to test its performance for motion estimation in interventional CBCT.Methods. DL-VIF is a reference-free surrogate for the previously reported visual image fidelity (VIF) metric, computed against a motion-free reference, generated using a CNN trained using simulated motion-corrupted and motion-free CBCT data. Relatively shallow (2-ResBlock) and deep (3-Resblock) CNN architectures were trained and tested to assess sensitivity to motion artifacts and generalizability to unseen anatomy and motion patterns. DL-VIF was integrated into an autofocus framework for rigid motion compensation in head/brain CBCT and assessed in simulation and cadaver studies in comparison to a conventional gradient entropy metric.Results. The 2-ResBlock architecture better reflected motion severity and extrapolated to unseen data, whereas 3-ResBlock was found more susceptible to overfitting, limiting its generalizability to unseen scenarios. DL-VIF outperformed gradient entropy in simulation studies yielding average multi-resolution structural similarity index (SSIM) improvement over uncompensated image of 0.068 and 0.034, respectively, referenced to motion-free images. DL-VIF was also more robust in motion compensation, evidenced by reduced variance in SSIM for various motion patterns (σDL-VIF = 0.008 versusσgradient entropy = 0.019). Similarly, in cadaver studies, DL-VIF demonstrated superior motion compensation compared to gradient entropy (an average SSIM improvement of 0.043 (5%) versus little improvement and even degradation in SSIM, respectively) and visually improved image quality even in severely motion-corrupted images.Conclusion: The studies demonstrated the feasibility of building reference-free similarity metrics for quantification of motion-induced image quality degradation and distortion of anatomical structures in CBCT. DL-VIF provides a reliable surrogate for motion severity, penalizes unrealistic distortions, and presents a valuable new objective function for autofocus motion compensation in CBCT.

A novel use of time separation technique to improve flat detector CT perfusion imaging in stroke patients

BACKGROUND

CT perfusion imaging (CTP) is used in the diagnostic workup of acute ischemic stroke (AIS). CTP may be performed within the angio suite using flat detector CT (FDCT) to help reduce patient management time.

PURPOSE

In order to significantly improve FDCT perfusion (FDCTP) imaging, data-processing algorithms need to be able to compensate for the higher levels of noise, slow rotation speed, and a lower frame rate of current FDCT devices.

METHODS

We performed a realistic simulation of FDCTP acquisition based on CTP data from seven subjects. We used the time separation technique (TST) as a model-based approach for FDCTP data processing. We propose a novel dimension reduction in which we approximate the time attenuation curves by a linear combination of trigonometric functions. Our goal was to show that the TST can be used even without prior assumptions on the shape of the attenuation profiles.

RESULTS

We first demonstrated that a trigonometric basis is suitable for dimension reduction of perfusion data. Using simulated FDCTP data, we have shown that a trigonometric basis in the TST provided better results than the classical straightforward processing even with additional noise. Average correlation coefficients of perfusion maps were improved for cerebral blood flow (CBF), cerebral blood volume, mean transit time (MTT) maps. In a moderate noise scenario, the average Pearson's coefficient for the CBF map was improved using the TST from 0.76 to 0.81. For the MTT map, it was improved from 0.37 to 0.45. Furthermore, we achieved a total processing time from the reconstruction of FDCTP data to the generation of perfusion maps of under 5 min.

CONCLUSIONS

In our study cohort, perfusion maps created from FDCTP data using the TST with a trigonometric basis showed equivalent perfusion deficits to classic CT perfusion maps. It follows, that this novel FDCTP technique has potential to provide fast and accurate FDCTP imaging for AIS patients.

Exact gram filtering and efficient back projection for iterative CT reconstruction

PURPOSE

Forward and back-projections are the basis of all model-based iterative reconstruction (MBIR) methods. However, computing these accurately is time consuming. In this paper, we present a method for model-based iterative reconstruction in parallel X-ray beam geometry that utilizes a Gram filter to efficiently implement forward and back projection.

METHODS

We propose using voxel-basis and modeling its footprint in a box spline framework to calculate the Gram filter exactly and improve the performance of back-projection. In the special case of parallel X-ray beam geometry, the forward and back-projection can be implemented by an estimated Gram filter efficiently if the sinogram signal is bandlimited. In this paper, a specialized sinogram interpolation method is proposed to eliminate the bandlimited prerequisite and thus improve the reconstruction accuracy. We build on this idea by utilizing the continuity of the voxel-basis' footprint, which provides a more accurate sinogram interpolation and further improves the efficiency and quality of back-projection. In addition, the detector blur effect can be efficiently accounted for in our method to better handle realistic scenarios.

RESULTS

The proposed method is tested on both phantom and real CT images under different resolutions, sinogram sampling steps, and noise levels. The proposed method consistently outperforms other state-of-the-art projection models in terms of speed and accuracy for both back-projection and reconstruction.

CONCLUSIONS

We proposed a iterative reconstruction methodology for 3D parallel-beam X-ray CT reconstruction. Our experimental results demonstrate that the proposed methodology is accurate, fast, and reproducible, and outperforms alternative state-of-the-art projection models on both back-projection and reconstruction results significantly. This article is protected by copyright. All rights reserved.

Fast parallel implementation for total variation constrained algebraic reconstruction technique

In computed tomography (CT), the total variation (TV) constrained algebraic reconstruction technique (ART) can obtain better reconstruction quality when the projection data are sparse and noisy. However, the ART-TV algorithm remains time-consuming since it requires large numbers of iterations, especially for the reconstruction of high-resolution images. In this work, we propose a fast algorithm to calculate the system matrix for line intersection model and apply this algorithm to perform the forward-projection and back-projection operations of the ART. Then, we utilize the parallel computing techniques of multithreading and graphics processing units (GPU) to accelerate the ART iteration and the TV minimization, respectively. Numerical experiments show that our proposed parallel implementation approach is very efficient and accurate. For the reconstruction of a 2048 × 2048 image from 180 projection views of 2048 detector bins, it takes about 2.2 seconds to perform one iteration of the ART-TV algorithm using our proposed approach on a ten-core platform. Experimental results demonstrate that our new approach achieves a speedup of 23 times over the conventional single-threaded CPU implementation that using the Siddon algorithm.

Mutual Information-Based Non-Local Total Variation Denoiser for Low-Dose Cone-Beam Computed Tomography

Conventional non-local total variation (NLTV) approaches use the weight of a non-local means (NLM) filter, which degrades performance in low-dose cone-beam computed tomography (CBCT) images generated with a low milliampere-seconds (mAs) parameter value because a local patch used to determine the pixel weights comprises noisy-damaged pixels that reduce the similarity between corresponding patches. In this paper, we propose a novel type of NLTV based on a combination of mutual information (MI): MI-NLTV. It is based on a statistical measure for a similarity calculation between the corresponding bins of non-local patches vs. a reference patch. The weight is determined in terms of a statistical measure comprising the MI value between corresponding non-local patches and the reference-patch entropy. The MI-NLTV denoising process is applied to CBCT images generated by the analytical reconstruction algorithm using a ray-driven backprojector (RDB). The MI-NLTV objective function is minimized based on the steepest gradient descent optimization to augment the difference between a real structure and noise, cleaning noisy pixels without significant loss of the fine structure and details that remain in the reconstructed images. The proposed method was evaluated using patient data and actual phantom measurement data acquired with lower mAs. The results show that integrating the RDB further enhances the MI-NLTV denoising-based analytical reconstruction algorithm to achieve a higher CBCT image quality when compared with those generated by NLTV denoising-based approach, with an average of 15.97% higher contrast-to-noise ratio, 2.67% lower root mean square error, 0.12% lower spatial non-uniformity, 1.14% higher correlation, and an average of 18.11% higher detectability index. These quantitative results indicate that the incorporation of MI makes the NLTV more stable and robust than the conventional NLM filter for low-dose CBCT imaging. In addition, achieving clinically acceptable CBCT image quality despite low-mAs projection acquisition can reduce the burden on common online CBCT imaging, improving patient safety throughout the course of radiotherapy.

Magnification-driven B-spline interpolation for cone-beam projection and backprojection

PURPOSE

Discretizing tomographic forward and backward operations is a crucial step in the design of model-based reconstruction algorithms. Standard projectors rely on linear interpolation, whose adjoint introduces discretization errors during backprojection. More advanced techniques are obtained through geometric footprint models that may present a high computational cost and an inner logic that is not suitable for implementation on massively parallel computing architectures. In this work, we take a fresh look at the discretization of resampling transforms and focus on the issue of magnification-induced local sampling variations by introducing a new magnification-driven interpolation approach for tomography.

METHODS

Starting from the existing literature on spline interpolation for magnification purposes, we provide a mathematical formulation for discretizing a one-dimensional homography. We then extend our approach to two-dimensional representations in order to account for the geometry of cone-beam computed tomography with a flat panel detector. Our new method relies on the decomposition of signals onto a space generated by nonuniform B-splines so as to capture the spatially varying magnification that locally affects sampling. We propose various degrees of approximations for a rapid implementation of the proposed approach. Our framework allows us to define a novel family of projector/backprojector pairs parameterized by the order of the employed B-splines. The state-of-the-art distance-driven interpolation appears to fit into this family thus providing new insight and computational layout for this scheme. The question of data resampling at the detector level is handled and integrated with reconstruction in a single framework.

RESULTS

Results on both synthetic data and real data using a quality assurance phantom, were performed to validate our approach. We show experimentally that our approximate implementations are associated with reduced complexity while achieving a near-optimal performance. In contrast with linear interpolation, B-splines guarantee full usage of all data samples, and thus the X-ray dose, leading to more uniform noise properties. In addition, higher-order B-splines allow analytical and iterative reconstruction to reach higher resolution. These benefits appear more significant when downsampling frames acquired by X-ray flat-panel detectors with small pixels.

CONCLUSIONS

Magnification-driven B-spline interpolation is shown to provide high-accuracy projection operators with good-quality adjoints for iterative reconstruction. It equally applies to backprojection for analytical reconstruction and detector data downsampling.

Adaptive weight matrix and phantom intensity learning for computed tomography of chemiluminescence

Classic algebraic reconstruction technique (ART) for computed tomography requires pre-determined weights of the voxels for the projected pixel values to build the equations. However, such weights cannot be accurately obtained in the application of chemiluminescence measurements due to the high physical complexity and computation resources required. Moreover, streaks arise in the results from ART method especially with imperfect projections. In this study, we propose a semi-case-wise learning-based method named Weight Encode Reconstruction Network (WERNet) to co-learn the target phantom intensities and the adaptive weight matrix of the case without labeling the target voxel set and thus offers a more applicable solution for computed tomography problems. Both numerical and experimental validations were conducted to evaluate the algorithm. In the numerical test, with the help of gradient normalization, the WERNet reconstructed voxel set with a high accuracy and showed a higher capability of denoising compared to the classic ART methods. In the experimental test, WERNet produces comparable results to the ART method while having a better performance in avoiding the streaks. Furthermore, with the adaptive weight matrix, WERNet is not sensitive to the ensemble intensity of the projection which shows much better robustness than ART method.

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.

Low-dose cone-beam CT (LD-CBCT) reconstruction for image-guided radiation therapy (IGRT) by three-dimensional dual-dictionary learning

BACKGROUND

To develop a low-dose cone beam CT (LD-CBCT) reconstruction method named simultaneous algebraic reconstruction technique and dual-dictionary learning (SART-DDL) joint algorithm for image guided radiation therapy (IGRT) and evaluate its imaging quality and clinical application ability.

METHODS

In this retrospective study, 62 CBCT image sets from February 2018 to July 2018 at west china hospital were randomly collected from 42 head and neck patients (mean [standard deviation] age, 49.7 [11.4] years, 12 females and 30 males). All image sets were retrospectively reconstructed by SART-DDL (resultant D-CBCT image sets) with 18% less clinical raw projections. Reconstruction quality was evaluated by quantitative parameters compared with SART and Total Variation minimization (SART-TV) joint reconstruction algorithm with paired t test. Five-grade subjective grading evaluations were done by two oncologists in a blind manner compared with clinically used Feldkamp-Davis-Kress algorithm CBCT images (resultant F-CBCT image sets) and the grading results were compared by paired Wilcoxon rank test. Registration results between D-CBCT and F-CBCT were compared. D-CBCT image geometry fidelity was tested.

RESULTS

The mean peak signal to noise ratio of D-CBCT was 1.7 dB higher than SART-TV reconstructions (P < .001, SART-DDL vs SART-TV, 36.36 ± 0.55 dB vs 34.68 ± 0.28 dB). All D-CBCT images were recognized as clinically acceptable without significant difference with F-CBCT in subjective grading (P > .05). In clinical registration, the maximum translational and rotational difference was 1.8 mm and 1.7 degree respectively. The horizontal, vertical and sagittal geometry fidelity of D-CBCT were acceptable.

CONCLUSIONS

The image quality, geometry fidelity and clinical application ability of D-CBCT are comparable to that of the F-CBCT for head-and-neck patients with 18% less projections by SART-DDL.

Cone-beam CT for imaging of the head/brain: Development and assessment of scanner prototype and reconstruction algorithms

PURPOSE

Our aim was to develop a high-quality, mobile cone-beam computed tomography (CBCT) scanner for point-of-care detection and monitoring of low-contrast, soft-tissue abnormalities in the head/brain, such as acute intracranial hemorrhage (ICH). This work presents an integrated framework of hardware and algorithmic advances for improving soft-tissue contrast resolution and evaluation of its technical performance with human subjects.

METHODS

Four configurations of a CBCT scanner prototype were designed and implemented to investigate key aspects of hardware (including system geometry, antiscatter grid, bowtie filter) and technique protocols. An integrated software pipeline (c.f., a serial cascade of algorithms) was developed for artifact correction (image lag, glare, beam hardening and x-ray scatter), motion compensation, and three-dimensional image (3D) reconstruction [penalized weighted least squares (PWLS), with a hardware-specific statistical noise model]. The PWLS method was extended in this work to accommodate multiple, independently moving regions with different resolution (to address both motion compensation and image truncation). Imaging performance was evaluated quantitatively and qualitatively with 41 human subjects in the neurosciences critical care unit (NCCU) at our institution.

RESULTS

The progression of four scanner configurations exhibited systematic improvement in the quality of raw data by variations in system geometry (source-detector distance), antiscatter grid, and bowtie filter. Quantitative assessment of CBCT images in 41 subjects demonstrated: ~70% reduction in image nonuniformity with artifact correction methods (lag, glare, beam hardening, and scatter); ~40% reduction in motion-induced streak artifacts via the multi-motion compensation method; and ~15% improvement in soft-tissue contrast-to-noise ratio (CNR) for PWLS compared to filtered backprojection (FBP) at matched resolution. Each of these components was important to improve contrast resolution for point-of-care cranial imaging.

CONCLUSIONS

This work presents the first application of a high-quality, point-of-care CBCT system for imaging of the head/ brain in a neurological critical care setting. Hardware configuration iterations and an integrated software pipeline for artifacts correction and PWLS reconstruction mitigated artifacts and noise to achieve image quality that could be valuable for point-of-care detection and monitoring of a variety of intracranial abnormalities, including ICH and hydrocephalus.

Accelerated Stimulated Raman Projection Tomography by Sparse Reconstruction From Sparse-View Data

OBJECTIVE

Stimulated Raman projection tomography (SRPT), a recently developed label-free volumetric chemical imaging technology, has been reported to quantitatively reconstruct the distribution of chemicals in a three-dimensional (3D) complex system. The current image reconstruction scheme used in SRPT is based on a filtered back projection (FBP) algorithm that requires at least 180 angular-dependent projections to rebuild a reasonable SRPT image, resulting in a long total acquisition time. This is a big limitation for longitudinal studies on live systems.

METHODS

We present a sparse-view data-based sparse reconstruction scheme, in which sparsely sampled projections at 180 degrees were used to reconstruct the volumetric information. In the scheme, the simultaneous algebra reconstruction technique (SART), combined with total variation regularization, was used for iterative reconstruction. To better describe the projection process, a pixel vertex driven model (PVDM) was developed to act as projectors, whose performance was compared with those of the distance driven model (DDM).

RESULTS

We evaluated our scheme with numerical simulations and validated it for SRPT by mapping lipid contents in adipose cells. Simulation results showed that the PVDM performed better than the DDM in the case of using sparse-view data. Our scheme could maintain the quality of the reconstructed images even when the projection number was reduced to 15. The cell-based experimental results demonstrated that the proposed scheme can improve the imaging speed of the current FBP-based SRPT scheme by a factor of 9-12 without sacrificing discernible imaging details.

CONCLUSION

Our proposed scheme significantly reduces the total acquisition time required for SRPT at a speed of one order of magnitude faster than the currently used scheme. This significant improvement in imaging speed would potentially promote the applicability of SRPT for imaging living organisms.

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.

Accelerating iterative coordinate descent using a stored system matrix

PURPOSE

The computational burden associated with model-based iterative reconstruction (MBIR) is still a practical limitation. Iterative coordinate descent (ICD) is an optimization approach for MBIR that has sometimes been thought to be incompatible with modern computing architectures, especially graphics processing units (GPUs). The purpose of this work is to accelerate the previously released open-source FreeCT_ICD to include GPU acceleration and to demonstrate computational performance with ICD that is comparable with simultaneous update approaches.

METHODS

FreeCT_ICD uses a stored system matrix (SSM), which precalculates the forward projector in the form of a sparse matrix and then reconstructs on a rotating coordinate grid to exploit helical symmetry. In our GPU ICD implementation, we shuffle the sinogram memory ordering such that data access in the sinogram coalesce into fewer transactions. We also update N_S voxels in the xy-plane simultaneously to improve occupancy. Conventional ICD updates voxels sequentially (N_S  = 1). Using N_S  > 1 eliminates existing convergence guarantees. Convergence behavior in a clinical dataset was therefore studied empirically.

RESULTS

On a pediatric dataset with sinogram size of 736 × 16 × 13860 reconstructed to a matrix size of 512 × 512 × 128, our code requires about 20 s per iteration on a single GPU compared to 2300 s per iteration for a 6-core CPU using FreeCT_ICD. After 400 iterations, the proposed and reference codes converge within 2 HU RMS difference (RMSD). Using a wFBP initialization, convergence within 10 HU RMSD is achieved within 4 min. Convergence is similar with N_S values between 1 and 256, and N_S  = 16 was sufficient to achieve maximum performance. Divergence was not observed until N_S  > 1024.

CONCLUSIONS

With appropriate modifications, ICD may be able to achieve computational performance competitive with simultaneous update algorithms currently used for MBIR.

Computationally Efficient System Matrix Calculation Techniques in Computed Tomography Iterative Reconstruction

Background:

Relative to classical methods in computed tomography, iterative reconstruction techniques enable significantly improved image qualities and/or lowered patient doses. However, the computational speed is a major concern for these iterative techniques. In the present study, we present a method for fast system matrix calculation based on the line integral model (LIM) to speed up the computations without compromising the image quality. In addition, we develop a hybrid line–area integral model (AIM) that highlights the advantages of both LIM and AIMs.

Methods:

The contributing detectors for a given pixel and a given projection view, and the length of corresponding intersection lines with pixels, are calculated using our proposed algorithm. For the hybrid method, the respective narrow-angle fan beam was modeled by multiple equally spaced lines. The computed system matrix was evaluated in the context of reconstruction using the simultaneous algebraic reconstruction technique (SART) as well as maximum likelihood expectation maximization (MLEM).

Results:

The proposed LIM offers a considerable reduction in calculation times compared to the standard Siddon algorithm: 2.9 times faster. Differences in root mean square error and peak signal-to-noise ratio were not significant between the proposed LIM and the Siddon algorithm for both SART and MLEM reconstruction methods (P > 0.05). Meanwhile, the proposed hybrid method resulted in significantly improved image qualities relative to LIM and the Siddon algorithm (P < 0.05), though computations were 4.9 times more intensive than the proposed LIM.

Conclusion:

We have proposed two fast algorithms to calculate the system matrix. The first is based on LIM and was faster than the Siddon algorithm, with matched image quality, whereas the second method is a hybrid LIM–AIM that achieves significantly improved images though with its computational requirements.

SPULTRA: Low-Dose CT Image Reconstruction With Joint Statistical and Learned Image Models

Low-dose CT image reconstruction has been a popular research topic in recent years. A typical reconstruction method based on post-log measurements is called penalized weighted-least squares (PWLS). Due to the underlying limitations of the post-log statistical model, the PWLS reconstruction quality is often degraded in low-dose scans. This paper investigates a shifted-Poisson (SP) model based likelihood function that uses the pre-log raw measurements that better represents the measurement statistics, together with a data-driven regularizer exploiting a Union of Learned TRAnsforms (SPULTRA). Both the SP induced data-fidelity term and the regularizer in the proposed framework are nonconvex. The proposed SPULTRA algorithm uses quadratic surrogate functions for the SP induced data-fidelity term. Each iteration involves a quadratic subproblem for updating the image, and a sparse coding and clustering subproblem that has a closed-form solution. The SPULTRA algorithm has a similar computational cost per iteration as its recent counterpart PWLS-ULTRA that uses post-log measurements, and it provides better image reconstruction quality than PWLS-ULTRA, especially in low-dose scans.

Reduction of beam hardening artifacts on real C-arm CT data using polychromatic statistical image reconstruction

PURPOSE

This work aims at the compensation of beam hardening artifacts by the means of an extended three-dimensional polychromatic statistical reconstruction to be applied for flat panel cone-beam CT.

METHODS

We implemented this reconstruction technique as being introduced by Elbakri et al. (2002) [1] for a multi-GPU system, assuming the underlying object consists of several well-defined materials. Furthermore, we assume one voxel can only contain an overlap of at most two materials, depending on its density value. Given the X-ray spectrum, the procedure enables to reconstruct the energy-dependent attenuation values of the volume.

RESULTS

We evaluated the method by using flat-panel cone-beam CT measurements of structures containing small metal objects and clinical head scan data. In comparison with the water-corrected filtered backprojection, as well as a maximum likelihood reconstruction with a consistency-based beam hardening correction, our method features clearly reduced beam hardening artifacts and a more accurate shape of metal objects.

CONCLUSIONS

Our multi-GPU implementation of the polychromatic reconstruction, which does not require any image pre-segmentation, clearly outperforms the standard reconstructions of objects, with respect to beam hardening even in the presence of metal objects inside the volume. However, remaining artifacts, caused mainly by the limited dynamic range of the detector, may have to be addressed in future work.

Volume-of-interest imaging with dynamic fluence modulation using multiple aperture devices

Volume-of-interest (VOI) imaging is a strategy in computed tomography (CT) that restricts x-ray fluence to particular anatomical targets via dynamic beam modulation. This permits dose reduction while retaining image quality within the VOI. VOI-CT implementation has been challenged, in part, by a lack of hardware solutions for tailoring the incident fluence to the patient and anatomical site, as well as difficulties involving interior tomography reconstruction of truncated projection data. We propose a general VOI-CT imaging framework using multiple aperture devices (MADs), an emerging beam filtration scheme based on two binary x-ray filters. Location of the VOI is prescribed using two scout views at anterior-posterior (AP) and lateral perspectives. Based on a calibration of achievable fluence field patterns, MAD motion trajectories were designed using an optimization objective that seeks to maximize the relative fluence in the VOI subject to minimum fluence constraints. A modified penalized-likelihood method is developed for reconstruction of heavily truncated data using the full-field scout views to help solve the interior tomography problem. Physical experiments were conducted to show the feasibility of noncentered and elliptical VOI in two applications-spine and lung imaging. Improved dose utilization and retained image quality are validated with respect to standard full-field protocols. We observe that the contrast-to-noise ratio (CNR) is 40% higher compared with low-dose full-field scans at the same dose. The total dose reduction is 50% for equivalent image quality (CNR) within the VOI.

Image reconstruction for interrupted-beam x-ray CT on diagnostic clinical scanners

Low-dose x-ray CT is a major research area with high clinical impact. Compressed sensing using view-based sparse sampling and sparsity-promoting regularization has shown promise in simulations, but these methods can be difficult to implement on diagnostic clinical CT scanners since the x-ray beam cannot be switched on and off rapidly enough. An alternative to view-based sparse sampling is interrupted-beam sparse sampling. SparseCT is a recently-proposed interrupted-beam scheme that achieves sparse sampling by blocking a portion of the beam using a multislit collimator (MSC). The use of an MSC necessitates a number of modifications to the standard compressed sensing reconstruction pipeline. In particular, we find that SparseCT reconstruction is feasible within a model-based image reconstruction framework that incorporates data fidelity weighting to consider penumbra effects and source jittering to consider the effect of partial source obstruction. Here, we present these modifications and demonstrate their application in simulations and real-world prototype scans. In simulations compared to conventional low-dose acquisitions, SparseCT is able to achieve smaller normalized root-mean square differences and higher structural similarity measures on two reduction factors. In prototype experiments, we successfully apply our reconstruction modifications and maintain image resolution at quarter-dose reduction level. The SparseCT design requires only small hardware modifications to current diagnostic clinical scanners, opening up new possibilities for CT dose reduction.

Known-component 3D image reconstruction for improved intraoperative imaging in spine surgery: A clinical pilot study

PURPOSE

Intraoperative imaging plays an increased role in support of surgical guidance and quality assurance for interventional approaches. However, image quality sufficient to detect complications and provide quantitative assessment of the surgical product is often confounded by image noise and artifacts. In this work, we translated a three-dimensional model-based image reconstruction (referred to as "Known-Component Reconstruction," KC-Recon) for the first time to clinical studies with the aim of resolving both limitations.

METHODS

KC-Recon builds upon a penalized weighted least-squares (PWLS) method by incorporating models of surgical instrumentation ("known components") within a joint image registration-reconstruction process to improve image quality. Under IRB approval, a clinical pilot study was conducted with 17 spine surgery patients imaged under informed consent using the O-arm cone-beam CT system (Medtronic, Littleton MA) before and after spinal instrumentation. Volumetric images were generated for each patient using KC-Recon in comparison to conventional filtered backprojection (FBP). Imaging performance prior to instrumentation ("preinstrumentation") was evaluated in terms of soft-tissue contrast-to-noise ratio (CNR) and spatial resolution. The quality of images obtained after the instrumentation ("postinstrumentation") was assessed by quantifying the magnitude of metal artifacts (blooming and streaks) arising from pedicle screws. The potential low-dose advantages of the algorithm were tested by simulating low-dose data (down to one-tenth of the dose of standard protocols) from images acquired at normal dose.

RESULTS

Preinstrumentation images (at normal clinical dose and matched resolution) exhibited an average 24.0% increase in soft-tissue CNR with KC-Recon compared to FBP (N = 16, P = 0.02), improving visualization of paraspinal muscles, major vessels, and other soft-tissues about the spine and abdomen. For a total of 72 screws in postinstrumentation images, KC-Recon yielded a significant reduction in metal artifacts: 66.3% reduction in overestimation of screw shaft width due to blooming (P < 0.0001) and reduction in streaks at the screw tip (65.8% increase in attenuation accuracy, P < 0.0001), enabling clearer depiction of the screw within the pedicle and vertebral body for an assessment of breach. Depending on the imaging task, dose reduction up to an order of magnitude appeared feasible while maintaining soft-tissue visibility and metal artifact reduction.

CONCLUSIONS

KC-Recon offers a promising means to improve visualization in the presence of surgical instrumentation and reduce patient dose in image-guided procedures. The improved soft-tissue visibility could facilitate the use of cone-beam CT to soft-tissue surgeries, and the ability to precisely quantify and visualize instrument placement could provide a valuable check against complications in the operating room (cf., postoperative CT).

Convergence criterion for MBIR based on the local noise-power spectrum: Theory and implementation in a framework for accelerated 3D image reconstruction with a morphological pyramid

Model-based iterative reconstruction (MBIR) offers improved noise-resolution tradeoffs and artifact reduction in cone-beam CT compared to analytical reconstruction, but carries increased computational burden. An important consideration in minimizing computation time is reliable selection of the stopping criterion to perform the minimum number of iterations required to obtain the desired image quality. Most MBIR methods rely on a fixed number of iterations or relative metrics on image or cost-function evolution, and it would be desirable to use metrics that are more representative of the underlying image properties. A second front for reduction of computation time is the use of acceleration techniques (e.g. subsets or momentum). However, most of these techniques do not strictly guarantee convergence of the resulting MBIR method. A data-dependent analytical model of noise-power spectrum (NPS) for penalized weighted least squares (PWLS) reconstruction is proposed as an absolute metric of image properties for the fully converged volume. Distance to convergence is estimated as the root mean squared error (RMSE) between the estimated NPS and an NPS measured on a uniform region of interest (ROI) in the evolving volume. Iterations are stopped when the RMSE falls below a threshold directly related with the properties of the target image. Further acceleration was achieved by combining the spectral stopping criterion with a morphological pyramid (mPyr) in which the minimization of the PWLS cost-function is divided in a cascade of stages. The algorithm parameters (voxel size in this work) change between stages to achieve faster evolution in early stages, and a final stage with the target parameters to guarantee convergence. Transition between stages is governed by the spectral stopping criterion. The approach was evaluated on simulated CBCT data of a realistic digital abdomen phantom. Accuracy of the NPS model and evolution with time of the distance from the measured NPS was assessed in two ROIs. Performance of the spectrally-driven mPyr architecture was compared to a conventional, single stage, PWLS, and to two mPyr designs running a fixed number of iterations. The spectrally-driven mPyr achieved faster convergence, with 40% lower RMSE than the single stage PWLS, and between 10% and 20% RMSE reduction compared to other mPyr designs. The proposed spectral stopping criterion proved to be a suitable choice for a stopping rule, and, in particular, to govern mPyr stage transition.

Predicting image properties in penalized-likelihood reconstructions of flat-panel CBCT

PURPOSE

Model-based iterative reconstruction (MBIR) algorithms such as penalized-likelihood (PL) methods exhibit data-dependent and shift-variant properties. Image quality predictors have been derived to prospectively estimate local noise and spatial resolution, facilitating both system hardware design and tuning of reconstruction methods. However, current MBIR image quality predictors rely on idealized system models, ignoring physical blurring effects and noise correlations found in real systems. In this work, we develop and validate a new set of predictors using a physical system model specific to flat-panel cone-beam CT (FP-CBCT).

METHODS

Physical models appropriate for integration with MBIR analysis are developed and parameterized to represent nonidealities in FP projection data including focal spot blur, scintillator blur, detector aperture effect, and noise correlations. Flat-panel-specific predictors for local spatial resolution and local noise properties in PL reconstructions are developed based on these realistic physical models. Estimation accuracy of conventional (idealized) and FP-specific predictors is investigated and validated against experimental CBCT measurements using specialized phantoms.

RESULTS

Validation studies show that flat-panel-specific predictors can accurately estimate the local spatial resolution and noise properties, while conventional predictors show significant deviations in the magnitude and scale of the spatial resolution and local noise. The proposed predictors show accurate estimations over a range of imaging conditions including varying x-ray technique and regularization strength. The conventional spatial resolution prediction is sharper than ground truth. Using conventional spatial resolution predictor, the full width at half maximum (FWHM) of local point spread function (PSF) is underestimated by 0.2 mm. This mismatch is mostly eliminated in FP-specific prediction. The general shape and amplitude of local noise power spectrum (NPS) FP-specific predictions are consistent with measurement, while the conventional predictions underestimated the noise level by 70%.

CONCLUSION

The proposed image quality predictors permit accurate estimation of local spatial resolution and noise properties for PL reconstruction, accounting for dependencies on the system geometry, x-ray technique, and patient-specific anatomy in real FP-CBCT. Such tools enable prospective analysis of image quality for a range of goals including novel system and acquisition design, adaptive and task-driven imaging, and tuning of MBIR for robust and reliable behavior.

Structure tensor total variation for CBCT reconstruction

The total variation (TV) regularization has been widely used in statistically iterative cone-beam computed tomography (CBCT) reconstruction, showing ability to preserve object edges. However, the TV regularization can also produce staircase effect and tend to over-smooth the reconstructed images due to its piecewise constant assumption. In this study, we proposed to use the structure tensor total variation (STV) that penalizes the eigenvalues of the structure tensor for CBCT reconstruction. The STV penalty extends the TV penalty, with many important properties maintained such as convexity and rotation and translation invariance. The STV penalty utilizes gradient information more effectively and has a stronger ability to capture local image structural variation. The objective function was constructed with the penalized weighted least-square (PWLS) strategy and the gradient descent (GD) method was used to optimize the objective function. Besides, we investigated whether the norms involved in the STV penalty affected the reconstruction performance and found that the l1-norm gave the better performance than the l2-norm and l ∞-norm. We also examined performance of the STV penalties constructed using different kernel functions and found that the STV with the Gaussian kernel had the best performance, and the STVs with Uniform, Logistic, and Sigmoid kernels had similar performance to each other. We evaluated our reconstruction method with the STV penalty on computer simulated phantoms and physical phantoms. The results demonstrated that STV led to better reconstruction performance than TV, both visually and quantitatively. For the Catphan 600 physical phantom, the STV1 penalty was 175% and 623% better than the low-dose FDK and the high-dose FDK, and 14% better than the TV penalty at the matched noise level, according to the average contrast-to-noise ratio (CNR); while for the Compressed Sensing simulation phantom, the peak signal to noise ratio (PSNR) of reconstructed results using STV1, STV2, and STV ∞ were 40.67 dB, 38.72 dB, and 37.40 dB, respectively, all being significantly better than 36.84 dB using TV.

Quantitative cone-beam CT reconstruction with polyenergetic scatter model fusion

Scatter can account for large errors in cone-beam CT (CBCT) due to its wide field of view, and its complicated nature makes its compensation difficult. Iterative polyenergetic reconstruction algorithms offer the potential to provide quantitative imaging in CT, but they are usually incompatible with scatter contaminated measurements. In this work, we introduce a polyenergetic convolutional scatter model that is directly fused into the reconstruction process, and exploits information readily available at each iteration for a fraction of additional computational cost. We evaluate this method with numerical and real CBCT measurements, and show significantly enhanced electron density estimation and artifact mitigation over pre-calculated fast adaptive scatter kernel superposition (fASKS). We demonstrate our approach has two levels of benefit: reducing the bias introduced by estimating scatter prior to reconstruction; and adapting to the spectral and spatial properties of the specimen.

Image quality and dose characteristics for an O-arm intraoperative imaging system with model-based image reconstruction

PURPOSE

To assess the imaging performance and radiation dose characteristics of the O-arm CBCT imaging system (Medtronic Inc., Littleton MA) and demonstrate the potential for improved image quality and reduced dose via model-based image reconstruction (MBIR).

METHODS

Two main studies were performed to investigate previously unreported characteristics of the O-arm system. First is an investigation of dose and 3D image quality achieved with filtered back-projection (FBP) - including enhancements in geometric calibration, handling of lateral truncation and detector saturation, and incorporation of an isotropic apodization filter. Second is implementation of an MBIR algorithm based on Huber-penalized likelihood estimation (PLH) and investigation of image quality improvement at reduced dose. Each study involved measurements in quantitative phantoms as a basis for analysis of contrast-to-noise ratio and spatial resolution as well as imaging of a human cadaver to test the findings under realistic imaging conditions.

RESULTS

View-dependent calibration of system geometry improved the accuracy of reconstruction as quantified by the full-width at half maximum of the point-spread function - from 0.80 to 0.65 mm - and yielded subtle but perceptible improvement in high-contrast detail of bone (e.g., temporal bone). Standard technique protocols for the head and body imparted absorbed dose of 16 and 18 mGy, respectively. For low-to-medium contrast (<100 HU) imaging at fixed spatial resolution (1.3 mm edge-spread function) and fixed dose (6.7 mGy), PLH improved CNR over FBP by +48% in the head and +35% in the body. Evaluation at different dose levels demonstrated 30% increase in CNR at 62% of the dose in the head and 90% increase in CNR at 50% dose in the body.

CONCLUSIONS

A variety of improvements in FBP implementation (geometric calibration, truncation and saturation effects, and isotropic apodization) offer the potential for improved image quality and reduced radiation dose on the O-arm system. Further gains are possible with MBIR, including improved soft-tissue visualization, low-dose imaging protocols, and extension to methods that naturally incorporate prior information of patient anatomy and/or surgical instrumentation.

Statistical Iterative CBCT Reconstruction Based on Neural Network

Cone-beam computed tomography (CBCT) plays an important role in radiation therapy. Statistical iterative reconstruction (SIR) algorithms with specially designed penalty terms provide good performance for low-dose CBCT imaging. Among others, the total variation (TV) penalty is the current state-of-the-art in removing noises and preserving edges, but one of its well-known limitations is its staircase effect. Recently, various penalty terms with higher order differential operators were proposed to replace the TV penalty to avoid the staircase effect, at the cost of slightly blurring object edges. We developed a novel SIR algorithm using a neural network for CBCT reconstruction. We used a data-driven method to learn the "potential regularization term" rather than design a penalty term manually. This approach converts the problem of designing a penalty term in the traditional statistical iterative framework to designing and training a suitable neural network for CBCT reconstruction. We proposed using transfer learning to overcome the data deficiency problem and an iterative deblurring approach specially designed for the CBCT iterative reconstruction process during which the noise level and resolution of the reconstructed images may change. Through experiments conducted on two physical phantoms, two simulation digital phantoms, and patient data, we demonstrated the excellent performance of the proposed network-based SIR for CBCT reconstruction, both visually and quantitatively. Our proposed method can overcome the staircase effect, preserve both edges and regions with smooth intensity transition, and provide reconstruction results at high resolution and low noise level.

Technical Note: FreeCT_ICD: An open-source implementation of a model-based iterative reconstruction method using coordinate descent optimization for CT imaging investigations

PURPOSE

To facilitate investigations into the impacts of acquisition and reconstruction parameters on quantitative imaging, radiomics and CAD using CT imaging, we previously released an open-source implementation of a conventional weighted filtered backprojection reconstruction called FreeCT_wFBP. Our purpose was to extend that work by providing an open-source implementation of a model-based iterative reconstruction method using coordinate descent optimization, called FreeCT_ICD.

METHODS

Model-based iterative reconstruction offers the potential for substantial radiation dose reduction, but can impose substantial computational processing and storage requirements. FreeCT_ICD is an open-source implementation of a model-based iterative reconstruction method that provides a reasonable tradeoff between these requirements. This was accomplished by adapting a previously proposed method that allows the system matrix to be stored with a reasonable memory requirement. The method amounts to describing the attenuation coefficient using rotating slices that follow the helical geometry. In the initially proposed version, the rotating slices are themselves described using blobs. We have replaced this description by a unique model that relies on trilinear interpolation together with the principles of Joseph's method. This model offers an improvement in memory requirement while still allowing highly accurate reconstruction for conventional CT geometries. The system matrix is stored column-wise and combined with an iterative coordinate descent (ICD) optimization. The result is FreeCT_ICD, which is a reconstruction program developed on the Linux platform using C++ libraries and released under the open-source GNU GPL v2.0 license. The software is capable of reconstructing raw projection data of helical CT scans. In this work, the software has been described and evaluated by reconstructing datasets exported from a clinical scanner which consisted of an ACR accreditation phantom dataset and a clinical pediatric thoracic scan.

RESULTS

For the ACR phantom, image quality was comparable to clinical reconstructions as well as reconstructions using open-source FreeCT_wFBP software. The pediatric thoracic scan also yielded acceptable results. In addition, we did not observe any deleterious impact in image quality associated with the utilization of rotating slices. These evaluations also demonstrated reasonable tradeoffs in storage requirements and computational demands.

CONCLUSION

FreeCT_ICD is an open-source implementation of a model-based iterative reconstruction method that extends the capabilities of previously released open-source reconstruction software and provides the ability to perform vendor-independent reconstructions of clinically acquired raw projection data. This implementation represents a reasonable tradeoff between storage and computational requirements and has demonstrated acceptable image quality in both simulated and clinical image datasets.

Reconstruction-of-difference (RoD) imaging for cone-beam CT neuro-angiography

Timely evaluation of neurovasculature via CT angiography (CTA) is critical to the detection of pathology such as ischemic stroke. Cone-beam CTA (CBCT-A) systems provide potential advantages in the timely use at the point-of-care, although challenges of a relatively slow gantry rotation speed introduce tradeoffs among image quality, data consistency and data sparsity. This work describes and evaluates a new reconstruction-of-difference (RoD) approach that is robust to such challenges. A fast digital simulation framework was developed to test the performance of the RoD over standard reference reconstruction methods such as filtered back-projection (FBP) and penalized likelihood (PL) over a broad range of imaging conditions, grouped into three scenarios to test the trade-off between data consistency, data sparsity and peak contrast. Two experiments were also conducted using a CBCT prototype and an anthropomorphic neurovascular phantom to test the simulation findings in real data. Performance was evaluated primarily in terms of normalized root mean square error (NRMSE) in comparison to truth, with reconstruction parameters chosen to optimize performance in each case to ensure fair comparison. The RoD approach reduced NRMSE in reconstructed images by up to 50%-53% compared to FBP and up to 29%-31% compared to PL for each scenario. Scan protocols well suited to the RoD approach were identified that balance tradeoffs among data consistency, sparsity and peak contrast-for example, a CBCT-A scan with 128 projections acquired in 8.5 s over a 180°  +  fan angle half-scan for a time attenuation curve with ~8.5 s time-to-peak and 600 HU peak contrast. With imaging conditions such as the simulation scenarios of fixed data sparsity (i.e. varying levels of data consistency and peak contrast), the experiments confirmed the reduction of NRMSE by 34% and 17% compared to FBP and PL, respectively. The RoD approach demonstrated superior performance in 3D angiography compared to FBP and PL in all simulation and physical experiments, suggesting the possibility of CBCT-A on low-cost, mobile imaging platforms suitable to the point-of-care. The algorithm demonstrated accurate reconstruction with a high degree of robustness against data sparsity and inconsistency.

High-Fidelity Modeling of Detector Lag and Gantry Motion in CT Reconstruction

Detector lag and gantry motion during x-ray exposure and integration both result in azimuthal blurring in CT reconstructions. These effects can degrade image quality both for high-resolution features as well as low-contrast details. In this work we consider a forward model for model-based iterative reconstruction (MBIR) that is sufficiently general to accommodate both of these physical effects. We integrate this forward model in a penalized, weighted, nonlinear least-square style objective function for joint reconstruction and correction of these blur effects. We show that modeling detector lag can reduce/remove the characteristic lag artifacts in head imaging in both a simulation study and physical experiments. Similarly, we show that azimuthal blur ordinarily introduced by gantry motion can be mitigated with proper reconstruction models. In particular, we find the largest image quality improvement at the periphery of the field-of-view where gantry motion artifacts are most pronounced. These experiments illustrate the generality of the underlying forward model, suggesting the potential application in modeling a number of physical effects that are traditionally ignored or mitigated through pre-corrections to measurement data.

Spatial Resolution and Noise Prediction in Flat-Panel Cone-Beam CT Penalized-likelihood Reconstruction

Purpose

Model based iterative reconstruction (MBIR) algorithms such as penalized-likelihood (PL) methods have data-dependent and shift-variant image properties. Predictors of local reconstructed noise and resolution have found application in a number of methods that seek to understand, control, and optimize CT data acquisition and reconstruction parameters in a prospective fashion (as opposed to studies based on exhaustive evaluation). However, previous MBIR prediction methods have relied on idealized system models. In this work, we develop and validate new predictors using accurate physical models specific to flat-panel CT systems.

Methods

Novel predictors for estimation of local spatial resolution and noise properties are developed for PL reconstruction that include a physical model for blur and correlated noise in flat-panel cone-beam CT (CBCT) acquisitions. Prospective predictions (e.g., without reconstruction) of local point spread function and and local noise power spectrum (NPS) model are applied, compared, and validated using a flat-panel CBCT test bench.

Results

Comparisons between prediction and physical measurements show excellent agreement for both spatial resolution and noise properties. In comparison, traditional prediction methods (that ignore blur/correlation found in flat-panel data) fail to capture important data characteristics and show significant mismatch.

Conclusion

Novel image property predictors permit prospective assessment of flat-panel CBCT using MBIR. Such predictors enable standard and task-based performance assessments, and are well-suited to evaluation, control, and optimization of the CT imaging chain (e.g., x-ray technique, reconstruction parameters, novel data acquisition methods, etc.) for improved imaging performance and/or dose utilization.

Penalized-Likelihood Reconstruction With High-Fidelity Measurement Models for High-Resolution Cone-Beam Imaging

We present a novel reconstruction algorithm based on a general cone-beam CT forward model, which is capable of incorporating the blur and noise correlations that are exhibited in flat-panel CBCT measurement data. Specifically, the proposed model may include scintillator blur, focal-spot blur, and noise correlations due to light spread in the scintillator. The proposed algorithm (GPL-BC) uses a Gaussian Penalized-Likelihood objective function, which incorporates models of blur and correlated noise. In a simulation study, GPL-BC was able to achieve lower bias as compared with deblurring followed by FDK as well as a model-based reconstruction method without integration of measurement blur. In the same study, GPL-BC was able to achieve better line-pair reconstructions (in terms of segmented-image accuracy) as compared with deblurring followed by FDK, a model-based method without blur, and a model-based method with blur but not noise correlations. A prototype extremities quantitative cone-beam CT test-bench was used to image a physical sample of human trabecular bone. These data were used to compare reconstructions using the proposed method and model-based methods without blur and/or correlation to a registered CT image of the same bone sample. The GPL-BC reconstructions resulted in more accurate trabecular bone segmentation. Multiple trabecular bone metrics, including trabecular thickness (Tb.Th.) were computed for each reconstruction approach as well as the CT volume. The GPL-BC reconstruction provided the most accurate Tb.Th. measurement, 0.255 mm, as compared with the CT derived value of 0.193 mm, followed by the GPL-B reconstruction, the GPL-I reconstruction, and then the FDK reconstruction (0.271 mm, 0.309 mm, and 0.335 mm, respectively).

Low-Dose CT Perfusion of the Liver using Reconstruction of Difference

Liver CT perfusion (CTP) is used in the detection, staging, and treatment response analysis of hepatic diseases. Unfortunately, CTP radiation exposures is significant, limiting more widespread use. Traditional CTP data processing reconstructs individual temporal samples, ignoring a large amount of shared anatomical information between temporal samples, suggesting opportunities for improved data processing. We adopt a prior-image-based reconstruction approach called Reconstruction of Difference (RoD) to enable low-exposure CTP acquisition. RoD differs from many algorithms by directly estimating the attenuation changes between the current patient state and a prior CT volume. We propose to use a high-fidelity unenhanced baseline CT image to integrate prior anatomical knowledge into subsequent data reconstructions. Using simulation studies based on a 4D digital anthropomorphic phantom with realistic time-attenuation curves, we compare RoD with conventional filtered-backprojection, penalized-likelihood estimation, and prior image penalized-likelihood estimation. We evaluate each method in comparisons of reconstructions at individual time points, accuracy of estimated time-attenuation curves, and in an analysis of common perfusion metric maps including hepatic arterial perfusion, hepatic portal perfusion, perfusion index, and time-to-peak. Results suggest that RoD enables significant exposure reductions, outperforming standard and more sophisticated model-based reconstruction, making RoD a potentially important tool to enable low-dose liver CTP.

A Look-Up Table-Based Ray Integration Framework for 2-D/3-D Forward and Back Projection in X-Ray CT

Iterative algorithms have become increasingly popular in computed tomography (CT) image reconstruction, since they better deal with the adverse image artifacts arising from low radiation dose image acquisition. But iterative methods remain computationally expensive. The main cost emerges in the projection and back projection operations, where accurate CT system modeling can greatly improve the quality of the reconstructed image. We present a framework that improves upon one particular aspect-the accurate projection of the image basis functions. It differs from current methods in that it substitutes the high computational complexity associated with accurate voxel projection by a small number of memory operations. Coefficients are computed in advance and stored in look-up tables parameterized by the CT system's projection geometry. The look-up tables only require a few kilobytes of storage and can be efficiently accelerated on the GPU. We demonstrate our framework with both numerical and clinical experiments and compare its performance with the current state-of-the-art scheme-the separable footprint method.

Low-dose 4D cardiac imaging in small animals using dual source micro-CT

Micro-CT is widely used in preclinical studies, generating substantial interest in extending its capabilities in functional imaging applications such as blood perfusion and cardiac function. However, imaging cardiac structure and function in mice is challenging due to their small size and rapid heart rate. To overcome these challenges, we propose and compare improvements on two strategies for cardiac gating in dual-source, preclinical micro-CT: fast prospective gating (PG) and uncorrelated retrospective gating (RG). These sampling strategies combined with a sophisticated iterative image reconstruction algorithm provide faster acquisitions and high image quality in low-dose 4D (i.e. 3D  +  Time) cardiac micro-CT. Fast PG is performed under continuous subject rotation which results in interleaved projection angles between cardiac phases. Thus, fast PG provides a well-sampled temporal average image for use as a prior in iterative reconstruction. Uncorrelated RG incorporates random delays during sampling to prevent correlations between heart rate and sampling rate. We have performed both simulations and animal studies to validate these new sampling protocols. Sampling times for 1000 projections using fast PG and RG were 2 and 3 min, respectively, and the total dose was 170 mGy each. Reconstructions were performed using a 4D iterative reconstruction technique based on the split Bregman method. To examine undersampling robustness, subsets of 500 and 250 projections were also used for reconstruction. Both sampling strategies in conjunction with our iterative reconstruction method are capable of resolving cardiac phases and provide high image quality. In general, for equal numbers of projections, fast PG shows fewer errors than RG and is more robust to undersampling. Our results indicate that only 1000-projection based reconstruction with fast PG satisfies a 5% error criterion in left ventricular volume estimation. These methods promise low-dose imaging with a wide range of preclinical applications in cardiac imaging.

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.

Three novel accurate pixel-driven projection methods for 2D CT and 3D EPR imaging

OBJECTIVES

This work aims to explore more accurate pixel-driven projection methods for iterative image reconstructions in order to reduce high-frequency artifacts in the generated projection image.

METHODS

Three new pixel-driven projection methods namely, small-pixel-large-detector (SPLD), linear interpolation based (LIB) and distance anterpolation based (DAB), were proposed and applied to reconstruct images. The performance of these methods was evaluated in both two-dimensional (2D) computed tomography (CT) images via the modified FORBILD phantom and three-dimensional (3D) electron paramagnetic resonance (EPR) images via the 6-spheres phantom. Specifically, two evaluations based on projection generation and image reconstruction were performed. For projection generation, evaluation was using a 2D disc phantom, the modified FORBILD phantom and the 6-spheres phantom. For image reconstruction, evaluations were performed using the FORBILD and 6-spheres phantom. During evaluation, 2 quantitative indices of root-mean-square-error (RMSE) and contrast-to-noise-ratio (CNR) were used.

RESULTS

Comparing to the use of ordinary pixel-driven projection method, RMSE of the SPLD based least-square algorithm was reduced from 0.0701 to 0.0384 and CNR was increased from 5.6 to 19.47 for 2D FORBILD phantom reconstruction. For 3D EPRI, RMSE of SPLD was also reduced from 0.0594 to 0.0498 and CNR was increased from 3.88 to 11.58. In addition, visual evaluation showed that images reconstructed in both 2D and 3D images suffered from high-frequency line-shape artifacts when using the ordinary pixel-driven projection method. However, using 3 new methods all suppressed the artifacts significantly and yielded more accurate reconstructions.

CONCLUSIONS

Three proposed pixel-driven projection methods achieved more accurate iterative image reconstruction results. These new and more accurate methods can also be easily extended to other imaging modalities. Among them, SPLD method should be recommended to 3D and four dimensional (4D) EPR imaging.

System matrix computation vs storage on GPU: A comparative study in cone beam CT

PURPOSE

Iterative reconstruction algorithms in computed tomography (CT) require a fast method for computing the intersection distances between the trajectories of photons and the object, also called ray tracing or system matrix computation. This work focused on the thin-ray model is aimed at comparing different system matrix handling strategies using graphical processing units (GPUs).

METHODS

In this work, the system matrix is modeled by thin rays intersecting a regular grid of box-shaped voxels, known to be an accurate representation of the forward projection operator in CT. However, an uncompressed system matrix exceeds the random access memory (RAM) capacities of typical computers by one order of magnitude or more. Considering the RAM limitations of GPU hardware, several system matrix handling methods were compared: full storage of a compressed system matrix, on-the-fly computation of its coefficients, and partial storage of the system matrix with partial on-the-fly computation. These methods were tested on geometries mimicking a cone beam CT (CBCT) acquisition of a human head. Execution times of three routines of interest were compared: forward projection, backprojection, and ordered-subsets convex (OSC) iteration.

RESULTS

A fully stored system matrix yielded the shortest backprojection and OSC iteration times, with a 1.52× acceleration for OSC when compared to the on-the-fly approach. Nevertheless, the maximum problem size was bound by the available GPU RAM and geometrical symmetries. On-the-fly coefficient computation did not require symmetries and was shown to be the fastest for forward projection. It also offered reasonable execution times of about 176.4 ms per view per OSC iteration for a detector of 512 × 448 pixels and a volume of 384³ voxels, using commodity GPU hardware. Partial system matrix storage has shown a performance similar to the on-the-fly approach, while still relying on symmetries.

CONCLUSION

Partial system matrix storage was shown to yield the lowest relative performance. On-the-fly ray tracing was shown to be the most flexible method, yielding reasonable execution times. A fully stored system matrix allowed for the lowest backprojection and OSC iteration times and may be of interest for certain performance-oriented applications.

GPU-based Branchless Distance-Driven Projection and Backprojection

Projection and backprojection operations are essential in a variety of image reconstruction and physical correction algorithms in CT. The distance-driven (DD) projection and backprojection are widely used for their highly sequential memory access pattern and low arithmetic cost. However, a typical DD implementation has an inner loop that adjusts the calculation depending on the relative position between voxel and detector cell boundaries. The irregularity of the branch behavior makes it inefficient to be implemented on massively parallel computing devices such as graphics processing units (GPUs). Such irregular branch behaviors can be eliminated by factorizing the DD operation as three branchless steps: integration, linear interpolation, and differentiation, all of which are highly amenable to massive vectorization. In this paper, we implement and evaluate a highly parallel branchless DD algorithm for 3D cone beam CT. The algorithm utilizes the texture memory and hardware interpolation on GPUs to achieve fast computational speed. The developed branchless DD algorithm achieved 137-fold speedup for forward projection and 188-fold speedup for backprojection relative to a single-thread CPU implementation. Compared with a state-of-the-art 32-thread CPU implementation, the proposed branchless DD achieved 8-fold acceleration for forward projection and 10-fold acceleration for backprojection. GPU based branchless DD method was evaluated by iterative reconstruction algorithms with both simulation and real datasets. It obtained visually identical images as the CPU reference algorithm.

Low-Dose CBCT Reconstruction Using Hessian Schatten Penalties

Cone-beam computed tomography (CBCT) has been widely used in radiation therapy. For accurate patient setup and treatment target localization, it is important to obtain high-quality reconstruction images. The total variation (TV) penalty has shown the state-of-the-art performance in suppressing noise and preserving edges for statistical iterative image reconstruction, but it sometimes leads to the so-called staircase effect. In this paper, we proposed to use a new family of penalties-the Hessian Schatten (HS) penalties-for the CBCT reconstruction. Consisting of the second-order derivatives, the HS penalties are able to reflect the smooth intensity transitions of the underlying image without introducing the staircase effect. We discussed and compared the behaviors of several convex HS penalties with orders 1, 2, and for CBCT reconstruction. We used the majorization-minimization approach with a primal-dual formulation for the corresponding optimization problem. Experiments on two digital phantoms and two physical phantoms demonstrated the proposed penalty family's outstanding performance over TV in suppressing the staircase effect, and the HS penalty with order 1 had the best performance among the HS penalties tested.

Hybrid Pre-Log and Post-Log Image Reconstruction for Computed Tomography

Tomographic image reconstruction for low-dose computed tomography (CT) is increasingly challenging as dose continues to reduce in clinical applications. Pre-log domain methods and post-log domain methods have been proposed individually and each method has its own disadvantage. While having the potential to improve image quality for low-dose data by using an accurate imaging model, pre-log domain methods suffer slow convergence in practice due to the nonlinear transformation from the image to measurements. In contrast, post-log domain methods have fast convergence speed but the resulting image quality is suboptimal for low dose CT data because the log transformation is extremely unreliable for low-count measurements and undefined for negative values. This paper proposes a hybrid method that integrates the pre-log model and post-log model together to overcome the disadvantages of individual pre-log and post-log methods. We divide a set of CT data into high-count and low-count regions. The post-log weighted least squares model is used for measurements in the high-count region and the pre-log shifted Poisson model for measurements in the low-count region. The hybrid likelihood function can be optimized using an existing iterative algorithm. Computer simulations and phantom experiments show that the proposed hybrid method can achieve faster early convergence than the pre-log shifted Poisson likelihood method and better signal-to-noise performance than the post-log weighted least squares method.

Task-Driven Optimization of Fluence Field and Regularization for Model-Based Iterative Reconstruction in Computed Tomography

This paper presents a joint optimization of dynamic fluence field modulation (FFM) and regularization in quadratic penalized-likelihood reconstruction that maximizes a task-based imaging performance metric. We adopted a task-driven imaging framework for prospective designs of the imaging parameters. A maxi-min objective function was adopted to maximize the minimum detectability index ( ) throughout the image. The optimization algorithm alternates between FFM (represented by low-dimensional basis functions) and local regularization (including the regularization strength and directional penalty weights). The task-driven approach was compared with three FFM strategies commonly proposed for FBP reconstruction (as well as a task-driven TCM strategy) for a discrimination task in an abdomen phantom. The task-driven FFM assigned more fluence to less attenuating anteroposterior views and yielded approximately constant fluence behind the object. The optimal regularization was almost uniform throughout image. Furthermore, the task-driven FFM strategy redistribute fluence across detector elements in order to prescribe more fluence to the more attenuating central region of the phantom. Compared with all strategies, the task-driven FFM strategy not only improved minimum by at least 17.8%, but yielded higher over a large area inside the object. The optimal FFM was highly dependent on the amount of regularization, indicating the importance of a joint optimization. Sample reconstructions of simulated data generally support the performance estimates based on computed . The improvements in detectability show the potential of the task-driven imaging framework to improve imaging performance at a fixed dose, or, equivalently, to provide a similar level of performance at reduced dose.