EMPIRICAL AVERAGE-CASE RELATION BETWEEN UNDERSAMPLING AND SPARSITY IN X-RAY CT

Efficient solving algorithm for determining the exact sampling condition of limited-angle computed tomography reconstruction

Total variation (TV) regularization-based iterative reconstruction algorithms have an impressive potential to solve limited-angle computed tomography with insufficient sampling projections. The analysis of exact reconstruction sampling conditions for a TV-minimization reconstruction model can determine the minimum number of scanning angle and minimize the scanning range. However, the large-scale matrix operations caused by increased testing phantom size are the computation bottleneck in determining the exact reconstruction sampling conditions in practice. When the size of the testing phantom increases to a certain scale, it is very difficult to analyze quantitatively the exact reconstruction sampling condition using existing methods. In this paper, we propose a fast and efficient algorithm to determine the exact reconstruction sampling condition for large phantoms. Specifically, the sampling condition of a TV minimization model is modeled as a convex optimization problem, which is derived from the sufficient and necessary condition of solution uniqueness for the L1 minimization model. An effective alternating direction minimization algorithm is developed to optimize the objective function by alternatively solving two sub-problems split from the convex problem. The Cholesky decomposition method is used in solving the first sub-problem to reduce computational complexity. Experimental results show that the proposed method can efficiently solve the verification problem of the accurate reconstruction sampling condition. Furthermore, we obtain the lower bounds of scanning angle range for the exact reconstruction of a specific phantom with the larger size.

Noise-robust Mojette reconstruction using sparse-view CT projections

Sparse-view Computed Tomography (CT) has important significance in industrial inspection and medical diagnosis. Mojette transform is a kind of discrete Radon transform that can yield exact reconstructions instead of an approximate solution due to finite Radon sampling. However, the image is iteratively reconstructed pixel by pixel from corner to center, and the image error is proportional to the number of iterations. In this paper, we propose that there exist different sets of projection combinations to recover the original image within the close-to-minimal iterations. And a scheme is given to obtain multiple projection sets, each of which has the same number of minimum iterations and can recover a CT image with a similar level of small noise but different distributions. These images can be used further to restore the final CT image by counteracting noise with each other. The accuracy and validity of the proposed algorithm are verified by comparison with both other Mojette inversion algorithms and the classical SART algorithm.

A local Fourier slice equation

We present a local Fourier slice equation that enables local and sparse projection of a signal. Our result exploits that a slice in frequency space is an iso-parameter set in spherical coordinates. The projection of suitable wavelets defined separably in these coordinates can therefore be computed analytically, yielding a sequence of wavelets closed under projection. Our local Fourier slice equation then realizes projection as reconstruction with "sliced" wavelets with computational costs that scale linearly in the complexity of the projected signal. We numerically evaluate the performance of our local Fourier slice equation for synthetic test data and tomographic reconstruction, demonstrating that locality and sparsity can significantly reduce computation times and memory requirements.

Sampling limits for electron tomography with sparsity-exploiting reconstructions

Electron tomography (ET) has become a standard technique for 3D characterization of materials at the nano-scale. Traditional reconstruction algorithms such as weighted back projection suffer from disruptive artifacts with insufficient projections. Popularized by compressed sensing, sparsity-exploiting algorithms have been applied to experimental ET data and show promise for improving reconstruction quality or reducing the total beam dose applied to a specimen. Nevertheless, theoretical bounds for these methods have been less explored in the context of ET applications. Here, we perform numerical simulations to investigate performance of ℓ₁-norm and total-variation (TV) minimization under various imaging conditions. From 36,100 different simulated structures, our results show specimens with more complex structures generally require more projections for exact reconstruction. However, once sufficient data is acquired, dividing the beam dose over more projections provides no improvements-analogous to the traditional dose-fraction theorem. Moreover, a limited tilt range of ±75° or less can result in distorting artifacts in sparsity-exploiting reconstructions. The influence of optimization parameters on reconstructions is also discussed.

Priority-based Mojette reconstruction from sparse noisy projections

Sparse-view Computed Tomography (CT) plays an important role in industrial inspection and medical diagnosis. However, the established reconstruction equations based on traditional Radon transform are ill-posed and obtain an approximate solution in the case of finite sampling angles. By contrast, Mojette transform is considered as the discrete geometry of the projection and reconstruction lattice. It determines the geometrical conditions for ensuring a unique solution instead of solving an ill-posed problem from the start. Therefore, Mojette transform results in theoretical exact image reconstruction in the discrete domain, and approximately gets the minimum number of projections, as well as their directions. However, the reconstruction method utilizing Mojette transform is very sensitive to noise. To address the problem, the paper proposes a sparse-view Mojette inversion algorithm based on the minimum noise accumulation by selecting the prioritized projections for an image reconstruction. Experimental results show that the proposed method can effectively suppress the noise accumulation without increasing the number of projections and produce better reconstruction results than traditional corner-based Mojette inversion (CBI).

A sparsity-based iterative algorithm for reconstruction of micro-CT images from highly undersampled projection datasets obtained with a synchrotron X-ray source

Synchrotron X-ray Micro Computed Tomography (Micro-CT) is an imaging technique which is increasingly used for non-invasive in vivo preclinical imaging. However, it often requires a large number of projections from many different angles to reconstruct high-quality images leading to significantly high radiation doses and long scan times. To utilize this imaging technique further for in vivo imaging, we need to design reconstruction algorithms that reduce the radiation dose and scan time without reduction of reconstructed image quality. This research is focused on using a combination of gradient-based Douglas-Rachford splitting and discrete wavelet packet shrinkage image denoising methods to design an algorithm for reconstruction of large-scale reduced-view synchrotron Micro-CT images with acceptable quality metrics. These quality metrics are computed by comparing the reconstructed images with a high-dose reference image reconstructed from 1800 equally spaced projections spanning 180°. Visual and quantitative-based performance assessment of a synthetic head phantom and a femoral cortical bone sample imaged in the biomedical imaging and therapy bending magnet beamline at the Canadian Light Source demonstrates that the proposed algorithm is superior to the existing reconstruction algorithms. Using the proposed reconstruction algorithm to reduce the number of projections in synchrotron Micro-CT is an effective way to reduce the overall radiation dose and scan time which improves in vivo imaging protocols.

How little data is enough? Phase-diagram analysis of sparsity-regularized X-ray computed tomography

We introduce phase-diagram analysis, a standard tool in compressed sensing (CS), to the X-ray computed tomography (CT) community as a systematic method for determining how few projections suffice for accurate sparsity-regularized reconstruction. In CS, a phase diagram is a convenient way to study and express certain theoretical relations between sparsity and sufficient sampling. We adapt phase-diagram analysis for empirical use in X-ray CT for which the same theoretical results do not hold. We demonstrate in three case studies the potential of phase-diagram analysis for providing quantitative answers to questions of undersampling. First, we demonstrate that there are cases where X-ray CT empirically performs comparably with a near-optimal CS strategy, namely taking measurements with Gaussian sensing matrices. Second, we show that, in contrast to what might have been anticipated, taking randomized CT measurements does not lead to improved performance compared with standard structured sampling patterns. Finally, we show preliminary results of how well phase-diagram analysis can predict the sufficient number of projections for accurately reconstructing a large-scale image of a given sparsity by means of total-variation regularization.

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

BACKGROUND

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

RESULTS

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

CONCLUSIONS

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

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.