Evidence map›Paper›PMID 27036582›Full record

ArticleMedical physics2016

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

Qiaofeng Xu, Deshan Yang, Jun Tan, Alex Sawatzky, Mark A Anastasio

Abstract read
In one paragraph

Article in Medical physics, 2016. The graph could read no effect estimate from its abstract, so it casts no vote on the map. Cited by 8 papers.

0numbers the graph read from it
0cells of the map it votes in
8citing papers in PubMed
–field-weighted citation impact
1 · What the graph read from it

What it found

Each row is one number read from the abstract, on the scale the paper reported it, with its interval. Left of the dashed line favours the treatment, right favours the comparator. Under each row is the sentence it came from. New to these charts? A ten-minute tutorial.

The abstract states no effect estimate the extractor could read, or names no intervention and outcome on the map, so this paper lights no cell and moves no belief. It is still indexed, cited and linked below.

2 · The registry

The trial behind it

Trials whose registry record cites this paper, or whose number appears in the abstract. A trial that started after this paper was published is citing it as background, not reporting it.

Neither the registry nor the abstract names a trial number. If this is a trial report, that itself is worth knowing.

3 · Its place in the literature

Who cites it

8 citing papers in PubMed.

  1. Deep learning-based artefact reduction in low-dose dental cone beam computed tomography with high-attenuation materials.Philosophical transactions. Series A, Mathematical, physical, and engineering sciences · 2025
    Review
  2. Article
  3. Article
  4. Article
  5. Article
  6. Review
  7. Fast 4D cone-beam CT from 60 s acquisitions.Physics and imaging in radiation oncology · 2018
    Article
  8. Article
4 · The record

Corrections and comments

PubMed lists nothing against this paper. Absence here is not a guarantee, only a check that was made.

5 · Who and what money

Authors and funding

5 authors.

Qiaofeng XuDepartment of Biomedical Engineering, Washington University in St. Louis, St. Louis, Missouri 63130.
Deshan YangDepartment of Radiation Oncology, School of Medicine, Washington University in St. Louis, St. Louis, Missouri 63110.
Jun TanDepartment of Radiation Oncology, The University of Texas Southwestern Medical Center, Dallas, Texas 75390.
Alex SawatzkyDepartment of Biomedical Engineering, Washington University in St. Louis, St. Louis, Missouri 63130.
Mark A AnastasioDepartment of Biomedical Engineering, Washington University in St. Louis, St. Louis, Missouri 63130.

Funding

Design Studies and Optimization of Phase-Contrast MammographyR01EB009715 · NIBIB · WASHINGTON UNIVERSITY · PI ANASTASIO, MARK A · 2010 to 2013
$1.6M
Development of Thermoacoustic Tomography Brain ImagingR01EB010049 · NIBIB · WASHINGTON UNIVERSITY · PI ANASTASIO, MARK A · 2010 to 2013
$1.6M
NIBIB NIH HHS EB009715NIBIB NIH HHS EB010049NIBIB NIH HHS R01 EB009715NIBIB NIH HHS R01 EB010049
6 · The paper itself

Abstract

purposeThe 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.

methodsAlgorithm 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.

resultsThe 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.

conclusionsThe 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.

Indexed as

AlgorithmsCone-Beam Computed TomographyHead and Neck NeoplasmsHumansImage Processing, Computer-AssistedPhantoms, ImagingTime FactorsWavelet Analysis

Identifiers

PMID27036582
PMCPMC4808068

What OpenQuestion holds

Textmetadata
Read underepoch 390

Registered trials

None linked

Read under generation 80e0d062 · epoch 390. Bibliography from PubMed, PubMed Central and OpenAlex; grants from NIH RePORTER; trial links from ClinicalTrials.gov; estimates, votes and beliefs from the OpenQuestion graph.