title: DART: a practical reconstruction algorithm for discrete tomography.
abstract: In this paper, we present an iterative reconstruction algorithm for discrete tomography, called discrete algebraic reconstruction technique (DART). DART can be applied if the scanned object is known to consist of only a few different compositions, each corresponding to a constant gray value in the reconstruction. Prior knowledge of the gray values for each of the compositions is exploited to steer the current reconstruction towards a reconstruction that contains only these gray 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 gray values.
authors: Centrum Wiskunde & Informatica CWI, NL-1098XG Amsterdam, The Netherlands. joost.batenburg@cwi.nl
authors: Kees Joost
authors: KJ
authors: Batenburg
authors: Jan
authors: J
authors: Sijbers
mesh_terms: D000465:Algorithms; D003198:Computer Simulation; D016208:Databases, Factual; D006801:Humans; D007091:Image Processing, Computer-Assisted / Q000379:methods*; D008962:Models, Theoretical; D019047:Phantoms, Imaging; D055114:X-Ray Microtomography / Q000379:methods*