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.

%B Combinatorial Image Analysis %S Lecture Notes in Computer Science %I Springer Verlag %C Berlin; Heidelberg; New York; London; Paris; Tokyo %P 263 - 273 %8 Nov 2012 %G eng %9 Conference paper %! LNCS %R 10.1007/978-3-642-34732-0_20 %0 Book Section %B Combinatorial Image Analysis (IWCIA) %D 2012 %T On topology preservation for triangular thinning algorithms %A Péter Kardos %A Kálmán Palágyi %E Reneta P Barneva %E Valentin E Brimkov %E Jake K Aggarwal %XThinning is a frequently used strategy to produce skeleton-like shape features of binary objects. One of the main problems of parallel thinning is to ensure topology preservation. Solutions to this problem have been already given for the case of orthogonal and hexagonal grids. This work introduces some characterizations of simple pixels and some sufficient conditions for parallel thinning algorithms working on triangular grids (or hexagonal lattices) to preserve topology.

%B Combinatorial Image Analysis (IWCIA) %S Lecture Notes in Computer Science %I Springer Verlag %C Austin, TX, USA %P 128 - 142 %8 Nov 2012 %@ 978-3-642-34731-3 %G eng %9 Conference paper %! LNCS %R 10.1007/978-3-642-34732-0_10 %0 Book Section %B Combinatorial Image Analysis (IWCIA) %D 2011 %T A family of topology-preserving 3d parallel 6-subiteration thinning algorithms %A Gábor Németh %A Péter Kardos %A Kálmán Palágyi %E Jake K Aggarwal %E Reneta P Barneva %E Valentin E Brimkov %E Kostadin N Koroutchev %E Elka R Korutcheva %XThinning is an iterative layer-by-layer erosion until only the skeleton-like shape features of the objects are left. This paper presents a family of new 3D parallel thinning algorithms that are based on our new sufficient conditions for 3D parallel reduction operators to preserve topology. The strategy which is used is called subiteration-based: each iteration step is composed of six parallel reduction operators according to the six main directions in 3D. The major contributions of this paper are: 1) Some new sufficient conditions for topology preserving parallel reductions are introduced. 2) A new 6-subiteration thinning scheme is proposed. Its topological correctness is guaranteed, since its deletion rules are derived from our sufficient conditions for topology preservation. 3) The proposed thinning scheme with different characterizations of endpoints yields various new algorithms for extracting centerlines and medial surfaces from 3D binary pictures. © 2011 Springer-Verlag Berlin Heidelberg.

%B Combinatorial Image Analysis (IWCIA) %S Lecture Notes in Computer Science %I Springer Verlag %C Madrid, Spain %P 17 - 30 %8 May 2011 %@ 978-3-642-21072-3 %G eng %9 Conference paper %! LNCS %R 10.1007/978-3-642-21073-0_5 %0 Book Section %B Combinatorial Image Analysis (IWCIA) %D 2011 %T On topology preservation for hexagonal parallel thinning algorithms %A Péter Kardos %A Kálmán Palágyi %E Jake K Aggarwal %E Reneta P Barneva %E Valentin E Brimkov %E Kostadin N Koroutchev %E Elka R Korutcheva %XTopology preservation is the key concept in parallel thinning algorithms on any sampling schemes. This paper establishes some sufficient conditions for parallel thinning algorithms working on hexagonal grids (or triangular lattices) to preserve topology. By these results, various thinning (and shrinking to a residue) algorithms can be verified. To illustrate the usefulness of our sufficient conditions, we propose a new parallel thinning algorithm and prove its topological correctness. © 2011 Springer-Verlag Berlin Heidelberg.

%B Combinatorial Image Analysis (IWCIA) %S Lecture Notes in Computer Science %I Springer Verlag %C Madrid, Spain %P 31 - 42 %8 May 2011 %@ 978-3-642-21072-3 %G eng %9 Conference paper %! LNCS %R 10.1007/978-3-642-21073-0_6