Proceedings Article10.1109/NSSMIC.2010.5874316
Block-based iterative coordinate descent
Thomas Matthew Benson,Bruno De Man,Lin Fu,Jean-Baptiste Thibault +3 more
- 01 Oct 2010
- pp 2856-2859
26
TL;DR: In this article, a block-based version of ICD (B-ICD) is proposed, which computes an update for a block of n voxels simultaneously while accounting for the correlation among the Voxels.
read more
Abstract: In the context of x-ray computed tomography (CT), the iterative coordinate descent (ICD) algorithm is a reconstruction algorithm that computes image updates on a voxel-by-voxel basis [1]. This algorithm in turn can form the basis of powerful model-based iterative reconstruction frameworks for CT reconstruction [2]. In this paper, we will explore a blockbased version of ICD (B-ICD) that computes an update for a block of N voxels simultaneously while accounting for the correlation among the N voxels. Previous studies investigating grouped updates in a coordinate descent (GCD) framework include updating a group of potentially correlated or coupled voxels using an under-relaxation factor that preserves convergence [3], [4]. For the B-ICD method, however, we form and solve a linear system corresponding to a block of voxels in which we directly account for the correlation. Using this framework, we can update highly correlated voxels whereas with GCD algorithms it is preferable in terms of the resultant relaxation factors to update voxels with little to no correlation.
read more
Chat with Paper
AI Agents for this Paper
Find similar papers on Google Scholar, PubMed and Arxiv
Write a critical review of this paper
Analyze citations of this paper to find unaddressed research gaps
Citations
Iterative reconstruction methods in X-ray CT
TL;DR: This review strives to provide information on IR methods and aims at interested physicists and physicians already active in the field of CT and gives an overview on the terminology used and an introduction to the most important algorithmic concepts.
810
Regularization strategies in statistical image reconstruction of low‐dose x‐ray CT: A review
TL;DR: The conceptual and mathematical bases of these regularization strategies are reviewed and their efficacies in SIR of low-dose CT are illustrated.
58
Massively parallel 3D image reconstruction
Xiao Wang,Amit Sabne,Putt Sakdhnagool,Sherman J. Kisner,Charles A. Bouman,Samuel P. Midkiff +5 more
- 12 Nov 2017
TL;DR: A new algorithm for MBIR is presented, the Non-Uniform Parallel Super-Voxel (NU-PSV) algorithm, that regularizes the data access pattern, enables massive parallelism, and ensures fast convergence.
41
A comparison of linear interpolation models for iterative CT reconstruction.
TL;DR: Three forward projection models that rely on linear interpolation are investigated: the distance-driven method, Joseph's method, and the bilinear method, all of which offer the possibility to reduce bias but with an increase in computational cost.
23
An ordered-subsets proximal preconditioned gradient algorithm for edge-preserving PET image reconstruction.
TL;DR: The proposed PPG-OS algorithm shows an improved convergence rate with the ability of incorporating additional boundary information in regularized PET image reconstruction and develops a framework to incorporate boundary side information into edge-preserving total variation (TV) and Huber regularizations.
11
References
A three-dimensional statistical approach to improved image quality for multislice helical CT.
TL;DR: Enhanced image resolution and lower noise have been achieved, concurrently with the reduction of helical cone-beam artifacts, as demonstrated by phantom studies and clinical results illustrate the capabilities of the algorithm on real patient data.
A local update strategy for iterative reconstruction from projections
TL;DR: It is shown that Bayesian segmentation using Gauss-Seidel iteration produces useful estimates at much lower signal-to-noise ratios than required for continuously valued reconstruction.
Grouped-coordinate ascent algorithms for penalized-likelihood transmission image reconstruction
TL;DR: The new grouped-coordinate ascent (GCA) algorithms in the class overcome several limitations associated with previous algorithms, and it is shown that the GCA algorithms converge faster than the SCA algorithm, even on conventional workstations.
CatSim: a new computer assisted tomography simulation environment
Bruno De Man,Samit Kumar Basu,Naveen Chandra,Bruce Dunham,Peter Michael Edic,Maria Iatrou,Scott M. Mcolash,Paavana Sainath,Charlie Shaughnessy,Brendon D. Tower,Eugene Clifford Williams +10 more
- 08 Mar 2007
TL;DR: CatSim as discussed by the authors is a simulation environment for X-ray computed tomography, which allows simulating complex analytic phantoms, such as the FORBILD PHANTOM, including boxes, ellipsoids, elliptical cylinders, cones, and cut planes.
168
Parallel computation of sequential pixel updates in statistical tomographic reconstruction
Ken D. Sauer,Sean Borman,Charles A. Bouman +2 more
- 23 Oct 1995
TL;DR: It is shown that for degrees of parallelism of typical practical interest, the Gauss-Seidel iterations updates may be computed in parallel with little loss in convergence speed.