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

  title={Accelerated fast iterative shrinkage thresholding algorithms for sparsity-regularized cone-beam CT image reconstruction.},
  author={Qiaofeng Xu and Deshan Yang and Jun Tan and Alex Sawatzky and Mark A. Anastasio},
  journal={Medical physics},
  volume={43 4},
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… 

Figures from this paper

A fast regularized iterative algorithm for fan-beam CT reconstruction

We propose a fast iterative image reconstruction algorithm for normal, short-scan, and super-short-scan fan-beam computed tomography (CT), which aims at iterative reconstruction for low-dose and

A fast iteration approach to undersampled cone-beam CT reconstruction.

The proposed 3DA-TVAL3 algorithm can perform efficient and fast computation of CBCT reconstruction using the reduced amount of computer memories.

Fast 4D cone-beam CT from 60 s acquisitions

Low Dose CT Image Reconstruction Based on Structure Tensor Total Variation Using Accelerated Fast Iterative Shrinkage Thresholding Algorithm

This paper introduces the structure tensor total variation (STV1) penalty into SIR framework for low dose CT image reconstruction and develops an accelerated fast iterative shrinkage thresholding algorithm (AFISTA) to minimize the objective function.

Simultaneous deblurring and iterative reconstruction of CBCT for image guided brain radiosurgery

A novel iterative reconstruction algorithm that improves spatial resolution by explicitly accounting for image unsharpness caused by different factors in the reconstruction formulation, and retains the favorable properties of the standard TV-based iterative reconstructing algorithms in improving the contrast and reducing the reconstruction artifacts.

Scaled Projected-Directions Methods with Application to Transmission Tomography

This work improves the Hessian conditioning by way of a blockcirculant scaling operator and proposes a strategy to handle nondiagonal scaling in the context of projected-directions methods for bound-constrained problems.

Scaled projected-directions methods with application to transmission tomography

This work improves the Hessian conditioning by way of a block-circulant scaling operator and proposes a strategy to handle nondiagonal scaling in the context of projected-directions methods for bound-constrained problems.

A content-adaptive unstructured grid based regularized CT reconstruction method with a SART-type preconditioned fixed-point proximity algorithm

The goal of this study is to develop a new computed tomography (CT) image reconstruction method, aiming at improving the quality of the reconstructed images of existing methods while reducing

Joint image reconstruction method with correlative multi-channel prior for x-ray spectral computed tomography

A novel method which jointly reconstructs all energy channels while imposing a strong structural correlation is proposed, which selects reference channels from which to propagate structure in an adaptive and stochastic way while preferring channels with a high data signal-to-noise ratio.

Multi-dimensional extension of the alternating minimization algorithm in x-ray computed tomography

This dissertation derives novel algorithms to reduce bias and metal artifacts in a wide variety of imaging modalities and increase performance in low-dose scenarios in X-ray computed tomography applications.



Fast X-Ray CT Image Reconstruction Using a Linearized Augmented Lagrangian Method With Ordered Subsets

This paper uses a second-order recursive system analysis to design a deterministic downward continuation approach that avoids tedious parameter tuning and provides fast convergence in a linearized variant of AL methods, leading to a simpler ordered-subsets (OS) accelerable splitting-based algorithm, OS-LALM.

Conjugate-gradient preconditioning methods for shift-variant PET image reconstruction

New preconditioners that approximate more accurately the Hessian matrices of shift-variant imaging problems are described and lead to significantly faster convergence rates for the unconstrained conjugate-gradient (CG) iteration.

Accelerating Ordered Subsets Image Reconstruction for X-ray CT Using Spatially Nonuniform Optimization Transfer

This paper uses CT scans to demonstrate that the proposed NU-OS-SQS algorithm handles the helical geometry better than the conventional OS methods and “converges” in less than half the time of ordinary OS-S QS.

Fast compressed sensing-based CBCT reconstruction using Barzilai-Borwein formulation for application to on-line IGRT.

A novel gradient projection algorithm, based on the Gradient-Projection-Barzilai-Borwein formulation (GP-BB), that handles the total variation (TV)-norm regularization-based least squares problem for the CBCT reconstruction in a highly efficient manner, with speed acceptable for routine use in the clinic.

Accelerated gradient methods for total-variation-based CT image reconstruction

Two accelerated gradient-based methods are considered for reducing the number of gradient method iterations needed to achieve a high-accuracy TV solution in CT image reconstruction, and it is found experimentally that for realistic parameters the proposed methods significantly outperform the gradient method.

Transmission maximum-likelihood reconstruction with ordered subsets for cone beam CT.

With ordered subsets, high-quality iterative reconstruction is now available in clinically practical reconstructions times, and the existing transmission maximum-likelihood algorithm (TRML) is accurate but the reconstruction time is too long.

SU-F-BRCD-09: Total Variation (TV) Based Fast Convergent Iterative CBCT Reconstruction with GPU Acceleration.

A fast convergence iterative algorithm for CBCT image reconstruction that yielded images with better spatial resolution and higher SNR than those produced by a commercial FDK tool is developed and is expected to facilitate applications including IGART and patient daily CBCT-based treatment localization.

Accelerated iterative transmission CT reconstruction using an ordered subsets convex algorithm

OSC is faster than the convex algorithm, the amount of acceleration being approximately proportional to the number of subsets in OSC, and it causes only a slight increase of noise and global errors in the reconstructions.

Compressed sensing based cone-beam computed tomography reconstruction with a first-order methoda).

It is found that high quality CBCT image can be reconstructed from undersampled and potentially noisy projection data by using the proposed method, and it is demonstrated that compressed sensing outperforms the traditional algorithm when dealing with sparse, and possibly noisy, CBCT projection views.

Image reconstruction in circular cone-beam computed tomography by constrained, total-variation minimization.

An iterative algorithm, based on recent work in compressive sensing, that minimizes the total variation of the image subject to the constraint that the estimated projection data is within a specified tolerance of the available data and that the values of the volume image are non-negative is developed.