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.

1 aHantos, Norbert1 aBalázs, Péter1 aPalágyi, Kálmán1 aBarneva, Reneta, P1 aBrimkov, Valentin, E1 aAggarwal, Jake, K uhttps://www.inf.u-szeged.hu/en/publication/binary-image-reconstruction-from-two-projections-and-skeletal-information01538nas a2200217 4500008004100000020002200041245007400063210006900137260004800206300001400254520074200268100002701010700002001037700001601057700002301073700002501096700002501121700002601146700003101172856011701203 2010 eng d a978-3-642-12711-300aDirection-dependency of a binary tomographic reconstruction algorithm0 aDirectiondependency of a binary tomographic reconstruction algor aBuffalo, NY, USAbSpringer VerlagcMay 2010 a242 - 2533 aWe 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.

1 aVarga, László Gábor1 aBalázs, Péter1 aNagy, Antal1 aBarneva, Reneta, P1 aBrimkov, Valentin, E1 aHauptman, Herbert, A1 aJorge, Renato M Natal1 aTavares, João, Manuel R S uhttps://www.inf.u-szeged.hu/en/publication/direction-dependency-of-a-binary-tomographic-reconstruction-algorithm01433nas a2200169 4500008004100000020002200041245004500063210003700108260004800145300001400193520087500207100002001082700002501102700002301127700002501150856008801175 2008 eng d a978-3-540-78274-200aOn the number of hv-convex discrete sets0 anumber of hvconvex discrete sets aBuffalo, NY, USAbSpringer VerlagcApr 2008 a112 - 1233 a

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.

1 aBalázs, Péter1 aBrimkov, Valentin, E1 aBarneva, Reneta, P1 aHauptman, Herbert, A uhttps://www.inf.u-szeged.hu/en/publication/on-the-number-of-hv-convex-discrete-sets