In binary tomography, the goal is to reconstruct binary images from a small set of their projections. However, especially when only two projections are used, the task can be extremely underdetermined. In this paper, we show how to reduce ambiguity by using the morphological skeleton of the image as a priori. Three different variants of our method based on Simulated Annealing are tested using artificial binary images, and compared by reconstruction time and error. © 2012 Springer-Verlag.

JF - Combinatorial Image Analysis T3 - Lecture Notes in Computer Science PB - Springer Verlag CY - Berlin; Heidelberg; New York; London; Paris; Tokyo N1 - ScopusID: 84869986820doi: 10.1007/978-3-642-34732-0_20 JO - LNCS ER - TY - CHAP T1 - Direction-dependency of a binary tomographic reconstruction algorithm T2 - Computational Modeling of Objects Represented in Images Y1 - 2010 A1 - László Gábor Varga A1 - Péter Balázs A1 - Antal Nagy ED - Reneta P Barneva ED - Valentin E Brimkov ED - Herbert A Hauptman ED - Renato M Natal Jorge ED - João Manuel R S Tavares AB -We study how the quality of an image reconstructed by a binary tomographic algorithm depends on the direction of the observed object in the scanner, if only a few projections are available. To do so we conduct experiments on a set of software phantoms by reconstructing them form different projection sets using an algorithm based on D.C. programming (a method for minimizing the difference of convex functions), and compare the accuracy of the corresponding reconstructions by two suitable approaches. Based on the experiments, we discuss consequences on applications arising from the field of non-destructive testing, as well.

JF - Computational Modeling of Objects Represented in Images T3 - Lecture Notes in Computer Science PB - Springer Verlag CY - Buffalo, NY, USA SN - 978-3-642-12711-3 N1 - UT: 000279020400022ScopusID: 77952365308doi: 10.1007/978-3-642-12712-0_22 JO - LNCS ER - TY - CHAP T1 - On the number of hv-convex discrete sets T2 - Combinatorial Image Analysis Y1 - 2008 A1 - Péter Balázs ED - Valentin E Brimkov ED - Reneta P Barneva ED - Herbert A Hauptman AB -

One of the basic problems in discrete tomography is thereconstruction of discrete sets from few projections. Assuming that the set to be reconstructed fulfills some geometrical properties is a commonly used technique to reduce the number of possibly many different solutions of the same reconstruction problem. The class of hv-convex discrete sets and its subclasses have a well-developed theory. Several reconstruction algorithms as well as some complexity results are known for those classes. The key to achieve polynomial-time reconstruction of an hv- convex discrete set is to have the additional assumption that the set is connected as well. This paper collects several statistics on hv-convex discrete sets, which are of great importance in the analysis of algorithms for reconstructing such kind of discrete sets. © 2008 Springer-Verlag Berlin Heidelberg.

JF - Combinatorial Image Analysis T3 - Lecture Notes in Computer Science PB - Springer Verlag CY - Buffalo, NY, USA SN - 978-3-540-78274-2 N1 - UT: 000254600100010ScopusID: 70249110264doi: 10.1007/978-3-540-78275-9_10 JO - LNCS ER -