|
Title
|
|
|
|
DART : a practical reconstruction algorithm for discrete tomography
| |
|
Author
|
|
|
|
| |
|
Abstract
|
|
|
|
| In this paper, we present an iterative reconstruction algorithm for discrete tomography, called DART (Discrete Algebraic Reconstruction Technique). DART can be applied if the scanned object is known to consist of only a few different compositions, each corresponding to a constant grey value in the reconstruction. Prior knowledge of the grey values for each of the compositions is exploited to steer the current reconstruction towards a reconstruction that contains only these grey values. Based on experiments with both simulated CT data and experimental CT data, it is shown that DART is capable of computing more accurate reconstructions from a small number of projection images, or from a small angular range, than alternative methods. It is also shown that DART can deal effectively with noisy projection data and that the algorithm is robust with respect to errors in the estimation of the grey values. |
| |
|
Language
|
|
|
|
English
| |
|
Source (journal)
|
|
|
|
IEEE transactions on image processing. - New York, N.Y., 1992, currens
| |
|
Publication
|
|
|
|
New York, N.Y.
:
2011
| |
|
ISSN
|
|
|
|
1057-7149
[print]
1941-0042
[online]
| |
|
DOI
|
|
|
|
10.1109/TIP.2011.2131661
| |
|
Volume/pages
|
|
|
|
20
:9
(2011)
, p. 2542-2553
| |
|
ISI
|
|
|
|
000294132800012
| |
|
Full text (Publisher's DOI)
|
|
|
|
| |
|