|
Title
|
|
|
|
Generic iterative subset algorithms for discrete tomography
|
|
|
Author
|
|
|
|
|
|
|
Abstract
|
|
|
|
| Discrete tomography deals with the reconstruction of images from their projections where the images are assumed to contain only a small number of grey values. In particular, there is a strong focus on the reconstruction of binary images (binary tomography). A variety of binary tomography problems have been considered in the literature, each using different projection models or additional constraints. In this paper, we propose a generic iterative reconstruction algorithm that can be used for many different binary reconstruction problems. In every iteration, a subproblem is solved based on at most two of the available projections. Each of the subproblems can be solved efficiently using network flow methods. We report experimental results for various reconstruction problems. Our results demonstrate that the algorithm is capable of reconstructing complex objects from a small number of projections. |
|
|
|
Language
|
|
|
|
English
|
|
|
Source (journal)
|
|
|
|
Discrete applied mathematics. - Amsterdam
|
|
|
Publication
|
|
|
|
Amsterdam
:
2009
|
|
|
ISSN
|
|
|
|
0166-218X
|
|
|
DOI
|
|
|
|
10.1016/J.DAM.2008.05.033
|
|
|
Volume/pages
|
|
|
|
157
:3
(2009)
, p. 438-451
|
|
|
ISI
|
|
|
|
000262243800002
|
|
|
Full text (Publisher's DOI)
|
|
|
|
|
|
|
Full text (open access)
|
|
|
|
|
|