scispace - formally typeset
Journal ArticleDOI

Super-sparsely view-sampled cone-beam CT by incorporating prior data

Sajid Abbas, +2 more
- 01 Jan 2013 - 
- Vol. 21, Iss: 1, pp 71-83
Reads0
Chats0
TLDR
It is shown that one can further reduce the number of projections, resulting in a super-sparse scan, for a good quality image reconstruction with the aid of a prior data, and both numerical and experimental results are provided.
Abstract
Computed tomography (CT) is widely used in medicine for diagnostics or for image-guided therapies, and is also popular in industrial applications for nondestructive testing. CT conventionally requires a large number of projections to pro- duce volumetric images of a scanned object, because the conventional image reconstruction algorithm is based on filtered- backprojection. This requirement may result in relatively high radiation dose to the patients in medical CT unless the radiation dose at each view angle is reduced, and can cause expensive scanning time and efforts in industrial CT applications. Sparse- view CT may provide a viable option to address both issues including high radiation dose and expensive scanning efforts. However, image reconstruction from sparsely sampled data in CT is in general very challenging, and much efforts have been made to develop algorithms for such an image reconstruction problem. Image total-variation minimization algorithm inspired by compressive sensing theory has recently been developed, which exploits the sparseness of the image derivative magnitude and can reconstruct images from sparse-view data to a similar quality of the images conventionally reconstructed from many views. In successive CT scans, prior CT image of an object and its projection data may be readily available, and the current CT image may have not much difference from the prior image. Considering the sparseness of such a difference image between the successive scans, image reconstruction of the difference image may be achieved from very sparsely sampled data. In this work, we showed that one can further reduce the number of projections, resulting in a super-sparse scan, for a good quality image reconstruction with the aid of a prior data. Both numerical and experimental results are provided.

read more

Citations
More filters
Journal ArticleDOI

Effects of sparse sampling schemes on image quality in low-dose CT

TL;DR: In CS-based image reconstructions both sampling density and data incoherence affect the image quality, and the authors suggest that a sampling scheme should be devised and optimized by use of these indicators.
Journal ArticleDOI

Moving Beam-Blocker-Based Low-Dose Cone-Beam CT

TL;DR: In this paper, a moving beam-blocker-based low-dose cone-beam CT (CBCT) system was proposed and the beam-blocking configurations were exploited to reach an optimal one that leads to the highest contrast-to-noise ratio (CNR).
Journal ArticleDOI

Directional sinogram interpolation for sparse angular acquisition in cone-beam computed tomography

TL;DR: Streak artifacts of sparsely acquired CBCT were decreased by the proposed method and image blur induced by interpolation was constrained to below other interpolation methods.
Journal ArticleDOI

Prospective regularization design in prior-image-based reconstruction.

TL;DR: This work proposes a novel method that prospectively estimates the optimal amount of prior image information for accurate admission of specific anatomical changes in PIBR without performing full image reconstructions and introduces a predictive performance metric leveraging this analytical form and knowledge of a particular presumed anatomical change whose accurate reconstruction is sought.
Journal ArticleDOI

Iterative CT reconstruction via minimizing adaptively reweighted total variation.

TL;DR: By adaptively reweighting TV in iterative CT reconstruction, this work successfully further reduce the projection number for the same or better image quality by adapting the weight on TV to approximate the solution via a series of TV minimizations.
References
More filters
Journal ArticleDOI

Near-Optimal Signal Recovery From Random Projections: Universal Encoding Strategies?

TL;DR: If the objects of interest are sparse in a fixed basis or compressible, then it is possible to reconstruct f to within very high accuracy from a small number of random measurements by solving a simple linear program.
Posted Content

Near Optimal Signal Recovery From Random Projections: Universal Encoding Strategies?

TL;DR: In this article, it was shown that if the objects of interest are sparse or compressible in the sense that the reordered entries of a signal $f \in {\cal F}$ decay like a power-law, then it is possible to reconstruct $f$ to within very high accuracy from a small number of random measurements.
Journal Article

Practical cone-beam algorithm

TL;DR: In this article, a convolution-backprojection formula is deduced for direct reconstruction of a three-dimensional density function from a set of two-dimensional projections, which has useful properties, including errors that are relatively small in many practical instances and a form that leads to convenient computation.
Journal ArticleDOI

Practical cone-beam algorithm

TL;DR: In this article, a convolution-backprojection formula is deduced for direct reconstruction of a three-dimensional density function from a set of two-dimensional projections, which has useful properties, including errors that are relatively small in many practical instances and a form that leads to convenient computation.
Journal ArticleDOI

A universal image quality index

TL;DR: Although the new index is mathematically defined and no human visual system model is explicitly employed, experiments on various image distortion types indicate that it performs significantly better than the widely used distortion metric mean squared error.
Related Papers (5)