Article

Compressed sensing based cone-beam computed tomography reconstruction with a first-order method

Department of Electrical Engineering, Stanford University, Stanford, California 94305, USA.
Medical Physics (Impact Factor: 3.01). 09/2010; 37(9):5113-25. DOI: 10.1118/1.3481510
Source: PubMed

ABSTRACT This article considers the problem of reconstructing cone-beam computed tomography (CBCT) images from a set of undersampled and potentially noisy projection measurements.
The authors cast the reconstruction as a compressed sensing problem based on l1 norm minimization constrained by statistically weighted least-squares of CBCT projection data. For accurate modeling, the noise characteristics of the CBCT projection data are used to determine the relative importance of each projection measurement. To solve the compressed sensing problem, the authors employ a method minimizing total-variation norm, satisfying a prespecified level of measurement consistency using a first-order method developed by Nesterov.
The method converges fast to the optimal solution without excessive memory requirement, thanks to the method of iterative forward and back-projections. The performance of the proposed algorithm is demonstrated through a series of digital and experimental phantom studies. It is found a that high quality CBCT image can be reconstructed from undersampled and potentially noisy projection data by using the proposed method. Both sparse sampling and decreasing x-ray tube current (i.e., noisy projection data) lead to the reduction of radiation dose in CBCT imaging.
It is demonstrated that compressed sensing outperforms the traditional algorithm when dealing with sparse, and potentially noisy, CBCT projection views.

Download full-text

Full-text

Available from: Lei Zhu, Aug 22, 2014
0 Followers
 · 
139 Views
  • Source
    [Show abstract] [Hide abstract]
    ABSTRACT: A wavelet-based sparsity-promoting reconstruction method is studied in the context of tomography with severely limited projection data. Such imaging problems are ill-posed inverse problems, or very sensitive to measurement and modeling errors. The reconstruction method is based on minimizing a sum of a data discrepancy term based on an 2 -norm and another term containing an 1 -norm of a wavelet coefficient vector. Depending on the viewpoint, the method can be considered (i) as finding the Bayesian maximum a posteriori (MAP) estimate using a Besov-space B 1 11 (T 2) prior, or (ii) as deterministic regularization with a Besov-norm penalty. The minimization is performed using a tailored primal-dual path following interior-point method, which is applicable to problems larger in scale than commercially available general-purpose optimization package algorithms. The choice of "regularization parameter" is done by a novel technique called the S-curve method, which can be used to incorporate a priori information on the sparsity of the unknown target to the recon-struction process. Numerical results are presented, focusing on uniformly sampled sparse-angle data. Both simulated and measured data are considered, and noise-robust and edge-preserving multireso-lution reconstructions are achieved. In sparse-angle cases with simulated data the proposed method offers a significant improvement in reconstruction quality (measured in relative square norm error) over filtered back-projection (FBP) and Tikhonov regularization.
    SIAM Journal on Scientific Computing 05/2013; 35(3):644-665. DOI:10.1137/120876277 · 1.94 Impact Factor
  • Source
    [Show abstract] [Hide abstract]
    ABSTRACT: Iterative image reconstruction with sparsity-exploiting methods, such as total variation (TV) minimization, investigated in compressive sensing claim potentially large reductions in sampling requirements. Quantifying this claim for computed tomography (CT) is nontrivial, because both full sampling in the discrete-to-discrete imaging model and the reduction in sampling admitted by sparsity-exploiting methods are ill-defined. The present article proposes definitions of full sampling by introducing four sufficient-sampling conditions (SSCs). The SSCs are based on the condition number of the system matrix of a linear imaging model and address invertibility and stability. In the example application of breast CT, the SSCs are used as reference points of full sampling for quantifying the undersampling admitted by reconstruction through TV-minimization. In numerical simulations, factors affecting admissible undersampling are studied. Differences between few-view and few-detector bin reconstruction as well as a relation between object sparsity and admitted undersampling are quantified.
    IEEE Transactions on Medical Imaging 02/2013; 32(2):460-473. DOI:10.1109/TMI.2012.2230185 · 3.80 Impact Factor
  • Source
    [Show abstract] [Hide abstract]
    ABSTRACT: Image reconstruction methods based on exploiting image sparsity, motivated by compressed sensing (CS), allow reconstruction from a significantly reduced number of projections in X-ray computed tomography (CT). However, CS provides neither theoretical guarantees of accurate CT reconstruction, nor any relation between sparsity and a sufficient number of measurements for recovery. In this paper, we demonstrate empirically through computer simulations that minimization of the image 1-norm allows for recovery of sparse images from fewer measurements than unknown pixels, without relying on artificial random sampling patterns. We establish quantitatively an average-case relation between image sparsity and sufficient number of measurements for recovery, and we show that the transition from non-recovery to recovery is sharp within well-defined classes of simple and semi-realistic test images. The specific behavior depends on the type of image, but the same quantitative relation holds independently of image size.