TY - CHAP T1 - Equivalent Sequential and Parallel Subiteration-Based Surface-Thinning Algorithms T2 - Proceedings of Combinatorial Image Analysis: 17th International Workshop, IWCIA 2015 Y1 - 2015 A1 - Kálmán Palágyi A1 - Gábor Németh A1 - Péter Kardos ED - Reneta P Barneva ED - Bhattacharya, B. B. ED - Valentin E Brimkov JF - Proceedings of Combinatorial Image Analysis: 17th International Workshop, IWCIA 2015 T3 - Lecture Notes in Computer Science PB - Springer CY - Calcutta, India VL - 9448 SN - 978-3-319-26144-7 JO - LNCS ER - TY - CHAP T1 - Equivalent 2D sequential and parallel thinning T2 - Combinatorial Image Analysis Y1 - 2014 A1 - Kálmán Palágyi ED - Reneta P Barneva ED - Valentin E Brimkov ED - Josef Šlapal JF - Combinatorial Image Analysis PB - Springer CY - Brno, Czech Republic ER - TY - CHAP T1 - Smoothing Filters in the DART Algorithm T2 - Combinatorial Image Analysis Y1 - 2014 A1 - Antal Nagy ED - Reneta P Barneva ED - Valentin E Brimkov ED - Josef Šlapal JF - Combinatorial Image Analysis PB - Springer CY - May 2014, Brno, Czech Republic UR - http://link.springer.com/chapter/10.1007%2F978-3-319-07148-0_20 ER - TY - CHAP T1 - Sufficient conditions for general 2D operators to preserve topology T2 - Combinatorial Image Analysis Y1 - 2014 A1 - Péter Kardos A1 - Kálmán Palágyi ED - Reneta P Barneva ED - Valentin E Brimkov ED - Josef Šlapal AB -

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.

 

JF - Combinatorial Image Analysis T3 - Lecture Notes in Computer Science PB - Springer CY - May 2014, Brno, Czech Republic VL - 8466 SN - 978-3-319-07147-3 UR - http://dx.doi.org/10.1007/978-3-319-07148-0_10 JO - Conference Paper ER - TY - CHAP T1 - Binary image reconstruction from two projections and skeletal information T2 - Combinatorial Image Analysis Y1 - 2012 A1 - Norbert Hantos A1 - Péter Balázs A1 - Kálmán Palágyi ED - Reneta P Barneva ED - Valentin E Brimkov ED - Jake K Aggarwal AB -

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 - On topology preservation for triangular thinning algorithms T2 - Combinatorial Image Analysis (IWCIA) Y1 - 2012 A1 - Péter Kardos A1 - Kálmán Palágyi ED - Reneta P Barneva ED - Valentin E Brimkov ED - Jake K Aggarwal AB -

Thinning 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.

JF - Combinatorial Image Analysis (IWCIA) T3 - Lecture Notes in Computer Science PB - Springer Verlag CY - Austin, TX, USA SN - 978-3-642-34731-3 N1 - doi: 10.1007/978-3-642-34732-0_10Lecture Notes in Computer Science, Volume 7655 JO - LNCS ER - TY - CHAP T1 - Topology Preserving Parallel 3D Thinning Algorithms T2 - Digital Geometry Algorithms Y1 - 2012 A1 - Kálmán Palágyi A1 - Gábor Németh A1 - Péter Kardos ED - Valentin E Brimkov ED - Reneta P Barneva AB -

A 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.

JF - Digital Geometry Algorithms T3 - Lecture Notes in Computational Vision and Biomechanics PB - Springer-Verlag SN - 978-94-007-4173-7 N1 - doi: 10.1007/978-94-007-4174-4_6 ER - TY - CHAP T1 - A family of topology-preserving 3d parallel 6-subiteration thinning algorithms T2 - Combinatorial Image Analysis (IWCIA) Y1 - 2011 A1 - Gábor Németh A1 - Péter Kardos A1 - Kálmán Palágyi ED - Jake K Aggarwal ED - Reneta P Barneva ED - Valentin E Brimkov ED - Kostadin N Koroutchev ED - Elka R Korutcheva AB -

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.

JF - Combinatorial Image Analysis (IWCIA) T3 - Lecture Notes in Computer Science PB - Springer Verlag CY - Madrid, Spain SN - 978-3-642-21072-3 N1 - ScopusID: 79957651399doi: 10.1007/978-3-642-21073-0_5 JO - LNCS ER - TY - CHAP T1 - On topology preservation for hexagonal parallel thinning algorithms T2 - Combinatorial Image Analysis (IWCIA) Y1 - 2011 A1 - Péter Kardos A1 - Kálmán Palágyi ED - Jake K Aggarwal ED - Reneta P Barneva ED - Valentin E Brimkov ED - Kostadin N Koroutchev ED - Elka R Korutcheva AB -

Topology 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.

JF - Combinatorial Image Analysis (IWCIA) T3 - Lecture Notes in Computer Science PB - Springer Verlag CY - Madrid, Spain SN - 978-3-642-21072-3 N1 - ScopusID: 79957628214doi: 10.1007/978-3-642-21073-0_6 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 - Parallel Thinning Algorithms Based on Ronse's Sufficient Conditions for Topology Preservation T2 - Progress in Combinatorial Image Analysis Y1 - 2010 A1 - Gábor Németh A1 - Kálmán Palágyi ED - Petra Wiederhold ED - Reneta P Barneva JF - Progress in Combinatorial Image Analysis PB - Scientific Research Publishing Inc. CY - Singapore UR - http://rpsonline.com.sg/rpsweb/iwcia09.html 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 - An order-independent sequential thinning algorithm T2 - Proceedings of the International Workshop on Combinatorial Image Analysis (IWCIA) Y1 - 2009 A1 - Péter Kardos A1 - Gábor Németh A1 - Kálmán Palágyi ED - Petra Wiederhold ED - Reneta P Barneva AB -

Thinning 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.

JF - Proceedings of the International Workshop on Combinatorial Image Analysis (IWCIA) PB - Springer Verlag CY - Playa del Carmen, Mexico SN - 978-3-642-10208-0 UR - http://link.springer.com/chapter/10.1007/978-3-642-10210-3_13 N1 - ScopusID: 78650496028doi: 10.1007/978-3-642-10210-3_13 ER - TY - CHAP T1 - Reconstruction of canonical hv-convex discrete sets from horizontal and vertical projections T2 - Combinatorial Image Analysis Y1 - 2009 A1 - Péter Balázs ED - Petra Wiederhold ED - Reneta P Barneva AB -

The 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.

JF - Combinatorial Image Analysis PB - Springer Verlag CY - Berlin; Heidelberg; New York; London; Paris; Tokyo SN - 978-3-642-10208-0 N1 - UT: 000279344100022ScopusID: 78650444641doi: 10.1007/978-3-642-10210-3_22 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 -