The Euclidean plane can be partitioned into three kinds of

regular polygons, which results in triangular, square and hexagonal grids.

While the topology of the square grid is well-established, less emphasis

is put on the remaining two regular sampling schemes. In this paper we

summarize the results of our research that aimed to give some general

characterizations of simple pixels and sufficient conditions for topology-

preserving operators in the mentioned grids.

Thinning is a frequently applied technique for extracting centerlines from 2D binary objects. Parallel thinning algorithms can remove a set of object points simultaneously, while sequential algorithms traverse the boundary of objects, and consider the actually visited single point for possible removal. Two thinning algorithms are called equivalent if they produce the same result for each input picture. This paper presents the very first pair of equivalent 2D sequential and parallel subiteration-based thinning algorithms. These algorithms can be implemented directly on a conventional sequential computer or on a parallel computing device. Both of them preserve topology for (8, 4) pictures sampled on the square grid.

JF - Image and Signal Processing and Analysis (ISPA), 2015 9th International Symposium on PB - IEEE CY - Zagreb, Croatia SN - 978-1-4673-8032-4 ER - TY - CONF T1 - Vékonyítás a végpont-megőrzés felülvizsgálatáva T2 - Képfeldolgozók és Alakfelismerők Társaságának 10. országos konferenciája Y1 - 2015 A1 - Gábor Németh A1 - Péter Kardos A1 - Kálmán Palágyi AB -A vékonyítás mint iteratív objektum redukció gyakran alkalmazott

vázkijelölo módszer. A legtöbb létezo vékonyító algoritmus végpontok - vagyis releváns geometriai információt hordozó objektumpontok - megorzésével biztosítja azt, hogy ne törlodjenek az objektumok alakját reprezentáló fontos részletek. Ennek a megközelítésnek hátránya, hogy számos nemkívánatos vázágat eredményezhet. Ebben a cikkben egy olyan módszert mutatunk be, amellyel jelentosen csökkentheto a hamis vázágak száma. Ráadásul az itt bemutatott megközelítés tetszoleges végpont-megorzo 2D vékonyító algoritmusban alkalmazható.

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 - Parallel Thinning on the Triangular Grid T2 - International Conference on Cognitive Infocommunications (CogInfoCom) Y1 - 2013 A1 - Péter Kardos A1 - Kálmán Palágyi ED - Péter Baranyi AB -

One of the fundamental issues of human and computational cognitive psychology is pattern or shape recognition. Various applications in image processing and computer vision rely on skeleton-like shape features A possible technique for extracting these feautures is thinning. Although the majority of 2D thinning algorithms work on digital pictures sampled onthe conventional square grid, the role of some non-conventional grids, like the hexagonal and triangular grid, are of increasing importance as well. In this paper we propose numerous topolgy preserving parallel thinning algorithms that work on the triangular grid.

JF - International Conference on Cognitive Infocommunications (CogInfoCom) PB - IEEE CY - Budapest SN - 978-1-4799-1543-9 ER - TY - CHAP T1 - Sufficient Conditions for Topology Preserving Additions and General Operators T2 - Proceedings of the IASTED International Conference on Computer Graphics and Imaging (CGIM) Y1 - 2013 A1 - Péter Kardos A1 - Kálmán Palágyi ED - L Linsen AB -Topology preservation is a crucial issue of digital topology. Various applications of binary image processing rest on topology preserving operators. Earlier studies in this topic mainly concerned with reductions (i.e., operators that only delete some object points from binary images), as they form the basis for thinning algorithms. However, additions (i.e., operators that never change object points) also play important role for the purpose of generating discrete Voronoi diagrams or skeletons by influence zones (SKIZ). Furthermore, the use of general operators that may both add and delete some points to and from objects in pictures are suitable for contour smoothing. Therefore, in this paper we present some new sufficient conditions for topology preserving reductions, additions, and general operators. Two additions for 2D and 3D contour smoothing are also reported.

JF - Proceedings of the IASTED International Conference on Computer Graphics and Imaging (CGIM) PB - IASTED - Acta Press CY - Calgary ER - TY - CHAP T1 - On Topology Preservation in Triangular, Square, and Hexagonal Grids T2 - Proceedings of International Symposium on Image and Signal Processing and Analysis (ISPA) Y1 - 2013 A1 - Péter Kardos A1 - Kálmán Palágyi ED - Giovanni Ramponi ED - Sven Lončarić ED - Alberto Carini ED - Karen Egiazarian AB -

There are three possible partitionings of the continuous plane into regular polygons that leads to triangular, square, and hexagonal grids. The topology of the square grid is fairly well-understood, but it cannot be said of the remaining two regular sampling schemes. This paper presents a general characterization of simple pixels and some simplified sufficient conditions for topology-preserving operators in all the three types of regular grids.

JF - Proceedings of International Symposium on Image and Signal Processing and Analysis (ISPA) PB - IEEE CY - Trieste ER - TY - CONF T1 - Topology preserving parallel thinning on hexagonal grids T2 - A Képfeldolgozók és Alakfelismerők Társaságának konferenciája - KÉPAF 2013 Y1 - 2013 A1 - Péter Kardos A1 - Kálmán Palágyi ED - László Czúni JF - A Képfeldolgozók és Alakfelismerők Társaságának konferenciája - KÉPAF 2013 PB - NJSZT-KÉPAF CY - Veszprém ER - TY - JOUR T1 - Topology-preserving hexagonal thinning JF - INTERNATIONAL JOURNAL OF COMPUTER MATHEMATICS Y1 - 2013 A1 - Péter Kardos A1 - Kálmán Palágyi AB -Thinning is a well-known technique for producing skeleton-like shape features from digital binary objects in a topology-preserving way. Most of the existing thinning algorithms work on input images that are sampled on orthogonal grids; however, it is also possible to perform thinning on hexagonal grids (or triangular lattices). In this paper, we point out to the main similarities and differences between the topological properties of these two types of sampling schemes. We give various characterizations of simple points and present some new sufficient conditions for topology-preserving reductions working on hexagonal grids.

PB - Taylor & Francis VL - 90 SN - 0020-7160 UR - http://www.tandfonline.com/doi/abs/10.1080/00207160.2012.724198#preview IS - 8 N1 - doi: 10.1080/00207160.2012.724198 JO - INT J COMPUT MATH ER - TY - CHAP T1 - Hexagonal parallel thinning algorithms based on sufficient conditions for topology preservation T2 - Computational Modelling of Objects Represented in Images: Fundamentals, Methods and Applications III Y1 - 2012 A1 - Péter Kardos A1 - Kálmán Palágyi ED - Paolo Di Giamberardino ED - Daniela Iacoviello ED - Renato M Natal Jorge ED - Joao Manuel R S Taveres AB -Thinning is a well-known technique for producing skeleton-like shape features from digital

binary objects in a topology preserving way. Most of the existing thinning algorithms presuppose that the input

images are sampled on orthogonal grids.This paper presents new sufficient conditions for topology preserving

reductions working on hexagonal grids (or triangular lattices) and eight new 2D hexagonal parallel thinning

algorithms that are based on our conditions.The proposed algorithms are capable of producing both medial lines

and topological kernels as well.

Thinning as a layer-by-layer reduction is a frequently used technique for skeletonization. Sequential thinning algorithms usually suffer from the drawback of being order-dependent, i.e., their results depend on the visiting order of object points. Earlier order-independent sequential methods are based on the conventional thinning schemes that preserve endpoints to provide relevant geometric information of objects. These algorithms can generate centerlines in 2D and medial surfaces in 3D. This paper presents an alternative strategy for order-independent thinning which follows an approach, proposed by Bertrand and Couprie, which accumulates so-called isthmus points. The main advantage of this order-independent strategy over the earlier ones is that it makes also possible to produce centerlines of 3D objects.

JF - IASTED International Conference on Signal Processing, Pattern Recognition and Applications (SSPRA) PB - IASTED ACTA Press CY - Crete, Greek UR - http://www.actapress.com/Content_of_Proceeding.aspx?proceedingID=736 N1 - doi: 10.2316/P.2012.778-025 ER - TY - CONF T1 - On Order–Independent Sequential Thinning T2 - IEEE International Conference on Cognitive Infocommunications (CogInfoCom) Y1 - 2012 A1 - Péter Kardos A1 - Kálmán Palágyi ED - IEEE AB -The visual world composed by the human and computational cognitive systems strongly relies on shapes of objects. Skeleton is a widely applied shape feature that plays an important role in many fields of image processing, pattern recognition, and computer vision. Thinning is a frequently used, iterative object reduction strategy for skeletonization. Sequential thinning algorithms, which are based on contour tracking, delete just one border point at a time. Most of them have the disadvantage of order-dependence, i.e., for dissimilar visiting orders of object points, they may generate different skeletons. In this work, we give a survey of our results on order-independent thinning: we introduce some sequential algorithms that produce identical skeletons for any visiting orders, and we also present some sufficient conditions for the order-independence of templatebased sequential algorithms.

JF - IEEE International Conference on Cognitive Infocommunications (CogInfoCom) PB - IEEE CY - Kosice, Slovakia SN - 978-1-4673-5187-4 UR - http://ieeexplore.ieee.org/xpl/mostRecentIssue.jsp?punumber=6413305 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. ` `

Thinning and shrinking algorithms, respectively, are capable of extracting medial lines and topological kernels from digital binary objects in a topology preserving way. These topological algorithms are composed of reduction operations: object points that satisfy some topological and geometrical constraints are removed until stability is reached. In this work we present some new sufficient conditions for topology preserving parallel reductions and fiftyfour new 2D parallel thinning and shrinking algorithms that are based on our conditions. The proposed thinning algorithms use five characterizations of endpoints.

PB - University of Szeged, Institute of Informatics CY - Szeged VL - 20 SN - 0324-721X IS - 1 N1 - ScopusID: 79960666919 JO - ACTA CYBERN-SZEGED 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 - CONF T1 - Iterációnkénti simítással kombinált vékonyítás T2 - A Képfeldolgozók és Alakfelismerők Társaságának konferenciája - KÉPAF 2011 Y1 - 2011 A1 - Péter Kardos A1 - Gábor Németh A1 - Kálmán Palágyi ED - Zoltan Kato ED - Kálmán Palágyi JF - A Képfeldolgozók és Alakfelismerők Társaságának konferenciája - KÉPAF 2011 PB - NJSZT CY - Szeged UR - http://www.inf.u-szeged.hu/kepaf2011/pdfs/S05_01.pdf ER - TY - CONF T1 - Order-independent sequential thinning in arbitrary dimensions T2 - Signal and Image Processing and Applications (SIPA) Y1 - 2011 A1 - Péter Kardos A1 - Kálmán Palágyi ED - Ioannis Andreadis ED - M Zervakis AB -Skeletons are region based shape descriptors that play important role in shape representation. This paper introduces a novel sequential thinning approach for n-dimensional binary objects (*n* =1,2,3, ...). Its main strength lies in its order--independency, i.e., it can produce the same skeletons for any visiting orders of border points. Furthermore, this is the first scheme in this field that is also applicable for higher dimensions.

The main issue of this paper is to introduce some conditions for template-based sequential thinning that are capable of producing the same skeleton for a given binary image, independent of the visiting order of object points. As an example, we introduce two order-independent thinning algorithms for 2D binary images that satisfy these conditions. ` `

In this work we present a new thinning scheme for reducing the noise sensitivity of 3D thinning algorithms. It uses iteration-by-iteration smoothing that removes some border points that are considered as extremities. The proposed smoothing algorithm is composed of two parallel topology preserving reduction operators. An efficient implementation of our algorithm is sketched and its topological correctness for (26, 6) pictures is proved. © 2011 Elsevier Inc. All rights reserved.

VL - 73 SN - 1524-0703 IS - 6 N1 - ScopusID: 79952613010doi: 10.1016/j.gmod.2011.02.001 JO - GRAPH MODELS ER - TY - CONF T1 - A topológia-megőrzés elegendő feltételein alapuló 3D párhuzamos vékonyító algoritmusok T2 - A Képfeldolgozók és Alakfelismerők Társaságának konferenciája - KÉPAF 2011 Y1 - 2011 A1 - Gábor Németh A1 - Péter Kardos A1 - Kálmán Palágyi ED - Zoltan Kato ED - Kálmán Palágyi JF - A Képfeldolgozók és Alakfelismerők Társaságának konferenciája - KÉPAF 2011 PB - NJSZT CY - Szeged UR - http://www.inf.u-szeged.hu/kepaf2011/pdfs/S05_02.pdf 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 - JOUR T1 - Bejárásfüggetlen szekvenciális vékonyítás JF - ALKALMAZOTT MATEMATIKAI LAPOK Y1 - 2010 A1 - Péter Kardos A1 - Gábor Németh A1 - Kálmán Palágyi VL - 27 SN - 0133-3399 IS - 1 JO - ALKALMAZOTT MATEMATIKAI LAPOK ER - TY - CONF T1 - Topology preserving 2-subfield 3D thinning algorithms T2 - Proceedings of the International Conference on Signal Processing, Pattern Recognition and Applications (SPPRA) Y1 - 2010 A1 - Gábor Németh A1 - Péter Kardos A1 - Kálmán Palágyi ED - B Zagar ED - A Kuijper ED - H Sahbi AB -This paper presents a new family of 3D thinning algorithms for extracting skeleton-like shape features (i.e, centerline, medial surface, and topological kernel) from volumetric images. A 2-subfield strategy is applied: all points in a 3D picture are partitioned into two subsets which are alternatively activated. At each iteration, a parallel operator is applied for deleting some border points in the active subfield. The proposed algorithms are derived from Ma's sufficient conditions for topology preservation, and they use various endpoint characterizations.

JF - Proceedings of the International Conference on Signal Processing, Pattern Recognition and Applications (SPPRA) PB - IASTED ACTA Press CY - Innsbruck, Austria N1 - ScopusID: 77954590365 ER - TY - CHAP T1 - Topology Preserving 3D Thinning Algorithms using Four and Eight Subfields T2 - Proceedings of the International Conference on Image Analysis and Recognition (ICIAR) Y1 - 2010 A1 - Gábor Németh A1 - Péter Kardos A1 - Kálmán Palágyi ED - Aurélio Campilho ED - Mohamed Kamel AB -Thinning is a frequently applied technique for extracting skeleton-like shape features (i.e., centerline, medial surface, and topological kernel) from volumetric binary images. Subfield-based thinning algorithms partition the image into some subsets which are alternatively activated, and some points in the active subfield are deleted. This paper presents a set of new 3D parallel subfield-based thinning algorithms that use four and eight subfields. The three major contributions of this paper are: 1) The deletion rules of the presented algorithms are derived from some sufficient conditions for topology preservation. 2) A novel thinning scheme is proposed that uses iteration-level endpoint checking. 3) Various characterizations of endpoints yield different algorithms. © 2010 Springer-Verlag.

JF - Proceedings of the International Conference on Image Analysis and Recognition (ICIAR) T3 - Lecture Notes in Computer Science PB - Springer Verlag CY - Póvoa de Varzim, Portugal VL - 6111 N1 - ScopusID: 77955432947doi: 10.1007/978-3-642-13772-3_32 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 - CONF T1 - Kritikus párokat vizsgáló bejárásfüggetlen szekvenciális vékonyító algoritmus T2 - A Képfeldolgozók és Alakfelismerők Társaságának konferenciája - KÉPAF 2009 Y1 - 2009 A1 - Péter Kardos A1 - Gábor Németh A1 - Kálmán Palágyi ED - Dmitrij Chetverikov ED - Tamas Sziranyi JF - A Képfeldolgozók és Alakfelismerők Társaságának konferenciája - KÉPAF 2009 PB - Akaprint CY - Budapest 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 -