<?xml version="1.0" encoding="UTF-8"?><xml><records><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>5</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Kálmán Palágyi</style></author><author><style face="normal" font="default" size="100%">Gábor Németh</style></author><author><style face="normal" font="default" size="100%">Péter Kardos</style></author></authors><secondary-authors><author><style face="normal" font="default" size="100%">Reneta P Barneva</style></author><author><style face="normal" font="default" size="100%">Bhattacharya, B. B.</style></author><author><style face="normal" font="default" size="100%">Valentin E Brimkov</style></author></secondary-authors></contributors><titles><title><style face="normal" font="default" size="100%">Equivalent Sequential and Parallel Subiteration-Based Surface-Thinning Algorithms</style></title><secondary-title><style face="normal" font="default" size="100%">Proceedings of Combinatorial Image Analysis: 17th International Workshop, IWCIA 2015</style></secondary-title><tertiary-title><style face="normal" font="default" size="100%">Lecture Notes in Computer Science</style></tertiary-title><short-title><style face="normal" font="default" size="100%">LNCS</style></short-title></titles><dates><year><style  face="normal" font="default" size="100%">2015</style></year><pub-dates><date><style  face="normal" font="default" size="100%">Nov 2015</style></date></pub-dates></dates><publisher><style face="normal" font="default" size="100%">Springer</style></publisher><pub-location><style face="normal" font="default" size="100%">Calcutta, India</style></pub-location><volume><style face="normal" font="default" size="100%">9448</style></volume><pages><style face="normal" font="default" size="100%">31-45</style></pages><isbn><style face="normal" font="default" size="100%">978-3-319-26144-7</style></isbn><language><style face="normal" font="default" size="100%">eng</style></language><work-type><style face="normal" font="default" size="100%">Conference paper</style></work-type></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>47</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Kálmán Palágyi</style></author><author><style face="normal" font="default" size="100%">Gábor Németh</style></author><author><style face="normal" font="default" size="100%">Péter Kardos</style></author></authors><secondary-authors><author><style face="normal" font="default" size="100%">S Loncaric</style></author><author><style face="normal" font="default" size="100%">D Lerski</style></author><author><style face="normal" font="default" size="100%">H Eskola</style></author><author><style face="normal" font="default" size="100%">R Bregovic</style></author></secondary-authors></contributors><titles><title><style face="normal" font="default" size="100%">Topology-Preserving Equivalent Parallel and Sequential 4-Subiteration 2D Thinning Algorithms</style></title><secondary-title><style face="normal" font="default" size="100%">Image and Signal Processing and Analysis (ISPA), 2015 9th International Symposium on</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2015</style></year><pub-dates><date><style  face="normal" font="default" size="100%">2015 Sep</style></date></pub-dates></dates><publisher><style face="normal" font="default" size="100%">IEEE</style></publisher><pub-location><style face="normal" font="default" size="100%">Zagreb, Croatia</style></pub-location><pages><style face="normal" font="default" size="100%">304-309</style></pages><isbn><style face="normal" font="default" size="100%">978-1-4673-8032-4</style></isbn><language><style face="normal" font="default" size="100%">english</style></language><abstract><style face="normal" font="default" size="100%">&lt;p&gt;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.&lt;/p&gt;</style></abstract><work-type><style face="normal" font="default" size="100%">Conference paper</style></work-type></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>47</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Gábor Németh</style></author><author><style face="normal" font="default" size="100%">Péter Kardos</style></author><author><style face="normal" font="default" size="100%">Kálmán Palágyi</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">Vékonyítás a végpont-megőrzés felülvizsgálatáva</style></title><secondary-title><style face="normal" font="default" size="100%"> Képfeldolgozók és Alakfelismerők Társaságának 10. országos konferenciája</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2015</style></year><pub-dates><date><style  face="normal" font="default" size="100%">Jan 2015</style></date></pub-dates></dates><pub-location><style face="normal" font="default" size="100%">Kecskemét, Magyarország</style></pub-location><pages><style face="normal" font="default" size="100%">578-587</style></pages><language><style face="normal" font="default" size="100%">hun</style></language><abstract><style face="normal" font="default" size="100%">&lt;p&gt;A vékonyítás mint iteratív objektum redukció gyakran alkalmazott&lt;br&gt;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ó.&lt;/p&gt;</style></abstract><work-type><style face="normal" font="default" size="100%">Conference paper</style></work-type></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>5</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Péter Balázs</style></author><author><style face="normal" font="default" size="100%">Endre Katona</style></author><author><style face="normal" font="default" size="100%">Zoltan Kato</style></author><author><style face="normal" font="default" size="100%">Antal Nagy</style></author><author><style face="normal" font="default" size="100%">Gábor Németh</style></author><author><style face="normal" font="default" size="100%">László Gábor Nyúl</style></author><author><style face="normal" font="default" size="100%">Kálmán Palágyi</style></author><author><style face="normal" font="default" size="100%">Attila Tanacs</style></author><author><style face="normal" font="default" size="100%">László Gábor Varga</style></author></authors><secondary-authors><author><style face="normal" font="default" size="100%">Roland Kunkli</style></author><author><style face="normal" font="default" size="100%">Ildikó Papp</style></author><author><style face="normal" font="default" size="100%">Edéné Rutkovszky</style></author></secondary-authors></contributors><titles><title><style face="normal" font="default" size="100%">Képfeldolgozás a szegedi informatikus-képzésben</style></title><secondary-title><style face="normal" font="default" size="100%">Informatika a felsőoktatásban 2014</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2014</style></year><pub-dates><date><style  face="normal" font="default" size="100%">2014</style></date></pub-dates></dates><publisher><style face="normal" font="default" size="100%">University of Debrecen</style></publisher><pub-location><style face="normal" font="default" size="100%">Debrecen, Hungary</style></pub-location><pages><style face="normal" font="default" size="100%">667-675</style></pages><language><style face="normal" font="default" size="100%">hun</style></language><work-type><style face="normal" font="default" size="100%">Conference paper</style></work-type></record></records></xml>