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 - Topology Preserving Parallel Smoothing for 3D Binary Images T2 - Proceedings of the Computational Modeling of Objects Represented in Images (CMORI) Y1 - 2010 A1 - Gábor Németh A1 - Péter Kardos A1 - Kálmán Palágyi 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 -

This paper presents a new algorithm for smoothing 3D binary images in a topology preserving way. Our algorithm is a reduction operator: some border points that are considered as extremities are removed. The proposed method is composed of two parallel reduction operators. We are to apply our smoothing algorithm as an iteration-by-iteration pruning for reducing the noise sensitivity of 3D parallel surface-thinning algorithms. An efficient implementation of our algorithm is sketched and its topological correctness for (26,6) pictures is proved. © 2010 Springer-Verlag.

JF - Proceedings of the Computational Modeling of Objects Represented in Images (CMORI) PB - Springer Verlag CY - Buffalo, USA VL - 6026 N1 - ScopusID: 77952401887doi: 10.1007/978-3-642-12712-0_26 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 -