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

Single-Scan Dual-Energy CT Using Primary Modulation

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

GPU based parallel acceleration for fast C-arm cone-beam CT reconstruction

BACKGROUND

With the introduction of Flat Panel Detector technology, cone-beam CT (CBCT) has become a novel image modality, and widely applied in clinical practices. C-arm mounted CBCT has shown extra suitability in image guided interventional surgeries. During practice, how to acquire high resolution and high quality 3D images with the real time requirement of clinical applications remain challenging.

METHODS

In this paper, we propose a GPU based accelerated method for fast C-arm CBCT 3D image reconstructions. A filtered back projection method is optimized and implemented with GPU parallel acceleration technique. A distributed system is designed to make full use of the image acquisition consumption to hide the reconstruction delay to further improve system performance.

RESULTS

With the acceleration both in algorithm and system design, we show that our method significantly increases system efficiency. The optimized GPU accelerated FDK algorithm improves the reconstruction efficiency. The system performance is further enhanced with the proposed system design by 26% and reconstruction delay is accelerated by 2.1 times when 90 frames of projections are used. When the number of frames used increases to 120, the numbers are 39% and 3.3 times. We also show that when the projection acquisition consumption increases, the reconstruction acceleration rate increases significantly.

Compressed Sensing With a Gaussian Scale Mixture Model for Limited View Photoacoustic Computed Tomography In Vivo

Photoacoustic computed tomography using an ultrasonic array is an attractive noninvasive imaging modality for many biomedical applications. However, the potentially long data acquisition time of array-based photoacoustic computed tomography—usually due to the required time-multiplexing for multiple laser pulses—decreases its applicability for rapid disease diagnoses and the successive monitoring of physiological functions. Compressed sensing is used to improve the imaging speed of photoacoustic computed tomography by decreasing the amount of acquired data; however, the imaging quality can be limited when fewer measurements are used, as traditional compressed sensing considers only the sparsity of the signals in the imaging process. In this work, an advanced compressed sensing reconstruction framework with a Wiener linear estimation-based Gaussian scale mixture model was developed for limited view photoacoustic computed tomography. In this method, the structure dependencies of signals in the wavelet domain were incorporated into the imaging framework through the Gaussian scale mixture model, and an operator based on the Wiener linear estimation was designed to filter the reconstruction artifacts. Phantom and human forearm imaging were performed to verify the developed method. The results demonstrated that compressed sensing with a Wiener linear estimation-based Gaussian scale mixture model more effectively suppressed the reconstruction artifacts of sparse-sampling photoacoustic computed tomography and recovered photoacoustic images with a higher contrast-to-noise ratio and edge resolution than the traditional compressed sensing method. This work may promote the development of low-cost photoacoustic computed tomography techniques with rapid data acquisition and enhance the performance of photoacoustic computed tomography in various biomedical studies.

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

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

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

Background and Objective

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

Methods

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

Results

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

Conclusions

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

Fast alternating projection methods for constrained tomographic reconstruction

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

Data correlation based noise level estimation for cone beam projection data

BACKGROUND

In regularized iterative reconstruction algorithms, the selection of regularization parameter depends on the noise level of cone beam projection data.

OBJECTIVE

Our aim is to propose an algorithm to estimate the noise level of cone beam projection data.

METHODS

We first derived the data correlation of cone beam projection data in the Fourier domain, based on which, the signal and the noise were decoupled. Then the noise was extracted and averaged for estimation. An adaptive regularization parameter selection strategy was introduced based on the estimated noise level. Simulation and real data studies were conducted for performance validation.

RESULTS

There exists an approximately zero-energy double-wedge area in the 3D Fourier domain of cone beam projection data. As for the noise level estimation results, the averaged relative errors of the proposed algorithm in the analytical/MC/spotlight-mode simulation experiments were 0.8%, 0.14% and 0.24%, respectively, and outperformed the homogeneous area based as well as the transformation based algorithms. Real studies indicated that the estimated noise levels were inversely proportional to the exposure levels, i.e., the slopes in the log-log plot were -1.0197 and -1.049 with respect to the short-scan and half-fan modes. The introduced regularization parameter selection strategy could deliver promising reconstructed image qualities.

CONCLUSIONS

Based on the data correlation of cone beam projection data in Fourier domain, the proposed algorithm could estimate the noise level of cone beam projection data accurately and robustly. The estimated noise level could be used to adaptively select the regularization parameter.

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

PURPOSE

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

METHODS

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

RESULTS

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

CONCLUSIONS

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

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

PURPOSE

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

METHODS

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

RESULTS

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

CONCLUSIONS

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

Improving Low-dose Cardiac CT Images based on 3D Sparse Representation

Cardiac computed tomography (CCT) is a reliable and accurate tool for diagnosis of coronary artery diseases and is also frequently used in surgery guidance. Low-dose scans should be considered in order to alleviate the harm to patients caused by X-ray radiation. However, low dose CT (LDCT) images tend to be degraded by quantum noise and streak artifacts. In order to improve the cardiac LDCT image quality, a 3D sparse representation-based processing (3D SR) is proposed by exploiting the sparsity and regularity of 3D anatomical features in CCT. The proposed method was evaluated by a clinical study of 14 patients. The performance of the proposed method was compared to the 2D spares representation-based processing (2D SR) and the state-of-the-art noise reduction algorithm BM4D. The visual assessment, quantitative assessment and qualitative assessment results show that the proposed approach can lead to effective noise/artifact suppression and detail preservation. Compared to the other two tested methods, 3D SR method can obtain results with image quality most close to the reference standard dose CT (SDCT) images.

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

PURPOSE

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

METHODS

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

RESULTS

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

CONCLUSIONS

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

Total Variation-Based Reduction of Streak Artifacts, Ring Artifacts and Noise in 3D Reconstruction from Optical Projection Tomography

Optical projection tomography (OPT) is a computed tomography technique at optical frequencies for samples of 0.5-15 mm in size, which fills an important "imaging gap" between confocal microscopy (for smaller samples) and large-sample methods such as fluorescence molecular tomography or micro magnetic resonance imaging. OPT operates in either fluorescence or transmission mode. Two-dimensional (2D) projections are taken over 360° with a fixed rotational increment around the vertical axis. Standard 3D reconstruction from 2D OPT uses the filtered backprojection (FBP) algorithm based on the Radon transform. FBP approximates the inverse Radon transform using a ramp filter that spreads reconstructed pixels to neighbor pixels thus producing streak and other types of artifacts, as well as noise. Artifacts increase the variation of grayscale values in the reconstructed images. We present an algorithm that improves the quality of reconstruction even for a low number of projections by simultaneously minimizing the sum of absolute brightness changes in the reconstructed volume (the total variation) and the error between measured and reconstructed data. We demonstrate the efficiency of the method on real biological data acquired on a dedicated OPT device.

Noise Suppression for Dual-Energy CT Through Entropy Minimization

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

Towards the clinical implementation of iterative low-dose cone-beam CT reconstruction in image-guided radiation therapy: cone/ring artifact correction and multiple GPU implementation

PURPOSE

Compressed sensing (CS)-based iterative reconstruction (IR) techniques are able to reconstruct cone-beam CT (CBCT) images from undersampled noisy data, allowing for imaging dose reduction. However, there are a few practical concerns preventing the clinical implementation of these techniques. On the image quality side, data truncation along the superior-inferior direction under the cone-beam geometry produces severe cone artifacts in the reconstructed images. Ring artifacts are also seen in the half-fan scan mode. On the reconstruction efficiency side, the long computation time hinders clinical use in image-guided radiation therapy (IGRT).

METHODS

Image quality improvement methods are proposed to mitigate the cone and ring image artifacts in IR. The basic idea is to use weighting factors in the IR data fidelity term to improve projection data consistency with the reconstructed volume. In order to improve the computational efficiency, a multiple graphics processing units (GPUs)-based CS-IR system was developed. The parallelization scheme, detailed analyses of computation time at each step, their relationship with image resolution, and the acceleration factors were studied. The whole system was evaluated in various phantom and patient cases.

RESULTS

Ring artifacts can be mitigated by properly designing a weighting factor as a function of the spatial location on the detector. As for the cone artifact, without applying a correction method, it contaminated 13 out of 80 slices in a head-neck case (full-fan). Contamination was even more severe in a pelvis case under half-fan mode, where 36 out of 80 slices were affected, leading to poorer soft tissue delineation and reduced superior-inferior coverage. The proposed method effectively corrects those contaminated slices with mean intensity differences compared to FDK results decreasing from ∼497 and ∼293 HU to ∼39 and ∼27 HU for the full-fan and half-fan cases, respectively. In terms of efficiency boost, an overall 3.1 × speedup factor has been achieved with four GPU cards compared to a single GPU-based reconstruction. The total computation time is ∼30 s for typical clinical cases.

CONCLUSIONS

The authors have developed a low-dose CBCT IR system for IGRT. By incorporating data consistency-based weighting factors in the IR model, cone/ring artifacts can be mitigated. A boost in computational efficiency is achieved by multi-GPU implementation.

Compressive sensing in medical imaging

The promise of compressive sensing, exploitation of compressibility to achieve high quality image reconstructions with less data, has attracted a great deal of attention in the medical imaging community. At the Compressed Sensing Incubator meeting held in April 2014 at OSA Headquarters in Washington, DC, presentations were given summarizing some of the research efforts ongoing in compressive sensing for x-ray computed tomography and magnetic resonance imaging systems. This article provides an expanded version of these presentations. Sparsity-exploiting reconstruction algorithms that have gained popularity in the medical imaging community are studied, and examples of clinical applications that could benefit from compressive sensing ideas are provided. The current and potential future impact of compressive sensing on the medical imaging field is discussed.