An important requirement for various applications of binary image processing is to preserve topology. This issue has been earlier studied for two special types of image operators, namely, reductions and additions, and there have been some sufficient conditions proposed for them. In this paper, as an extension of those earlier results, we give novel sufficient criteria for general operators working on 2D pictures.

%B Combinatorial Image Analysis %S Lecture Notes in Computer Science %I Springer %C May 2014, Brno, Czech Republic %V 8466 %P 101 - 112 %8 2014 %@ 978-3-319-07147-3 %G eng %U http://dx.doi.org/10.1007/978-3-319-07148-0_10 %9 Conference paper %! Conference Paper %R 10.1007/978-3-319-07148-0_10 %0 Book Section %B Combinatorial Image Analysis %D 2012 %T Binary image reconstruction from two projections and skeletal information %A Norbert Hantos %A Péter Balázs %A Kálmán Palágyi %E Reneta P Barneva %E Valentin E Brimkov %E Jake K Aggarwal %X

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 Digital Geometry Algorithms %D 2012 %T Topology Preserving Parallel 3D Thinning Algorithms %A Kálmán Palágyi %A Gábor Németh %A Péter Kardos %E Valentin E Brimkov %E Reneta P Barneva %XA widely used technique to obtain skeletons of binary objects is thinning, which is an iterative layer-by-layer erosion in a topology preserving way. Thinning in 3D is capable of extracting various skeleton-like shape descriptors (i.e., centerlines, medial surfaces, and topological kernels). This chapter describes a family of new parallel 3D thinning algorithms for (26, 6) binary pictures. The reported algorithms are derived from some sufficient conditions for topology preserving parallel reduction operations, hence their topological correctness is guaranteed. ` `

Thinning 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 %0 Book Section %B Computational Modeling of Objects Represented in Images %D 2010 %T Direction-dependency of a binary tomographic reconstruction algorithm %A László Gábor Varga %A Péter Balázs %A Antal Nagy %E Reneta P Barneva %E Valentin E Brimkov %E Herbert A Hauptman %E Renato M Natal Jorge %E João Manuel R S Tavares %XWe 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.

%B Computational Modeling of Objects Represented in Images %S Lecture Notes in Computer Science %I Springer Verlag %C Buffalo, NY, USA %P 242 - 253 %8 May 2010 %@ 978-3-642-12711-3 %G eng %9 Conference paper %! LNCS %R 10.1007/978-3-642-12712-0_22 %0 Book Section %B Progress in Combinatorial Image Analysis %D 2010 %T Parallel Thinning Algorithms Based on Ronse's Sufficient Conditions for Topology Preservation %A Gábor Németh %A Kálmán Palágyi %E Petra Wiederhold %E Reneta P Barneva %B Progress in Combinatorial Image Analysis %I Scientific Research Publishing Inc. %C Singapore %P 183 - 194 %8 May 2010 %G eng %U http://rpsonline.com.sg/rpsweb/iwcia09.html %9 Book chapter %0 Book Section %B Proceedings of the Computational Modeling of Objects Represented in Images (CMORI) %D 2010 %T Topology Preserving Parallel Smoothing for 3D Binary Images %A Gábor Németh %A Péter Kardos %A Kálmán Palágyi %E Reneta P Barneva %E Valentin E Brimkov %E Herbert A Hauptman %E Renato M Natal Jorge %E João Manuel R S Tavares %X

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.

%B Proceedings of the Computational Modeling of Objects Represented in Images (CMORI) %I Springer Verlag %C Buffalo, USA %V 6026 %P 287 - 298 %8 May 2010 %G eng %9 Conference paper %R 10.1007/978-3-642-12712-0_26 %0 Book Section %B Proceedings of the International Workshop on Combinatorial Image Analysis (IWCIA) %D 2009 %T An order-independent sequential thinning algorithm %A Péter Kardos %A Gábor Németh %A Kálmán Palágyi %E Petra Wiederhold %E Reneta P Barneva %XThinning is a widely used approach for skeletonization. Sequential thinning algorithms use contour tracking: they scan border points and remove the actual one if it is not designated a skeletal point. They may produce various skeletons for different visiting orders. In this paper, we present a new 2-dimensional sequential thinning algorithm, which produces the same result for arbitrary visiting orders and it is capable of extracting maximally thinned skeletons. © Springer-Verlag Berlin Heidelberg 2009.

%B Proceedings of the International Workshop on Combinatorial Image Analysis (IWCIA) %I Springer Verlag %C Playa del Carmen, Mexico %P 162 - 175 %8 Nov 2009 %@ 978-3-642-10208-0 %G eng %U http://link.springer.com/chapter/10.1007/978-3-642-10210-3_13 %9 Conference paper %R 10.1007/978-3-642-10210-3_13 %0 Book Section %B Combinatorial Image Analysis %D 2009 %T Reconstruction of canonical hv-convex discrete sets from horizontal and vertical projections %A Péter Balázs %E Petra Wiederhold %E Reneta P Barneva %XThe problem of reconstructing some special hv-convex discretesets from their two orthogonal projections is considered. In general, the problem is known to be NP-hard, but it is solvable in polynomial time if the discrete set to be reconstructed is also 8-connected. In this paper, we define an intermediate class - the class of hv-convex canonical discrete sets - and give a constructive proof that the above problem remains computationally tractable for this class, too. We also discuss some further theoretical consequences and present experimental results as well. © Springer-Verlag Berlin Heidelberg 2009.

%B Combinatorial Image Analysis %I Springer Verlag %C Berlin; Heidelberg; New York; London; Paris; Tokyo %P 280 - 288 %8 Nov 2009 %@ 978-3-642-10208-0 %G eng %9 Conference paper %R 10.1007/978-3-642-10210-3_22 %0 Book Section %B Combinatorial Image Analysis %D 2008 %T On the number of hv-convex discrete sets %A Péter Balázs %E Valentin E Brimkov %E Reneta P Barneva %E Herbert A Hauptman %XOne 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.

%B Combinatorial Image Analysis %S Lecture Notes in Computer Science %I Springer Verlag %C Buffalo, NY, USA %P 112 - 123 %8 Apr 2008 %@ 978-3-540-78274-2 %G eng %9 Conference paper %! LNCS %R 10.1007/978-3-540-78275-9_10