PulseExploreJournal ClubDebatesTrendingResearchersJournals
Instagram
HomeExploreJournal ClubTrending
Synapse
⌘+K
Synapse
July 22, 2010IEEE Transactions on Image Processing295 citations

Fast Model-Based X-Ray CT Reconstruction Using Spatially Nonhomogeneous ICD Optimization

View Full Paper
YZYu ZhouJTJean‐Baptiste ThibaultCBCharles A. Bouman

Key Points

Key points are not available for this paper at this time.

Abstract

Recent applications of model-based iterative reconstruction (MBIR) algorithms to multislice helical CT reconstructions have shown that MBIR can greatly improve image quality by increasing resolution as well as reducing noise and some artifacts. However, high computational cost and long reconstruction times remain as a barrier to the use of MBIR in practical applications. Among the various iterative methods that have been studied for MBIR, iterative coordinate descent (ICD) has been found to have relatively low overall computational requirements due to its fast convergence. This paper presents a fast model-based iterative reconstruction algorithm using spatially nonhomogeneous ICD (NH-ICD) optimization. The NH-ICD algorithm speeds up convergence by focusing computation where it is most needed. The NH-ICD algorithm has a mechanism that adaptively selects voxels for update. First, a voxel selection criterion VSC determines the voxels in greatest need of update. Then a voxel selection algorithm VSA selects the order of successive voxel updates based upon the need for repeated updates of some locations, while retaining characteristics for global convergence. In order to speed up each voxel update, we also propose a fast 1-D optimization algorithm that uses a quadratic substitute function to upper bound the local 1-D objective function, so that a closed form solution can be obtained rather than using a computationally expensive line search algorithm. We examine the performance of the proposed algorithm using several clinical data sets of various anatomy. The experimental results show that the proposed method accelerates the reconstructions by roughly a factor of three on average for typical 3-D multislice geometries.

Ask AI
Helpful
Bookmark
Share
View Full Paper

Cite This Study

Zhou et al. (2010) studied this question.

synapsesocial.com/papers/6a12b18b92637892a9a713f4https://doi.org/10.1109/tip.2010.2058811
Ask AI
Helpful
Bookmark
Share
View Full Paper

Also Consider

Synapse has enriched 5 closely related papers on similar clinical questions. Consider them for comparative context:

  1. 1Non-homogeneous updates for the iterative coordinate descent algorithm2007 · 9 citations
  2. 2Accelerated coordinate descent methods for Bayesian reconstruction using ordered subsets of projection data2000 · 8 citations
  3. 3Total variation regulated EM algorithm [SPECT reconstruction]1999 · 175 citations
  4. 4On the convergence of the coordinate descent method for convex differentiable minimization1992 · 519 citations
  5. 5Constrained restoration and the recovery of discontinuities1992 · 1,089 citations