<?xml version="1.0" encoding="UTF-8"?><xml><records><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>17</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Norbert Hantos</style></author><author><style face="normal" font="default" size="100%">Szabolcs Iván</style></author><author><style face="normal" font="default" size="100%">Péter Balázs</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%">Binary image reconstruction from a small number of projections and the morphological skeleton</style></title><secondary-title><style face="normal" font="default" size="100%">ANNALS OF MATHEMATICS AND ARTIFICIAL INTELLIGENCE</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</style></date></pub-dates></dates><publisher><style face="normal" font="default" size="100%">Springer</style></publisher><volume><style face="normal" font="default" size="100%">75</style></volume><pages><style face="normal" font="default" size="100%">195-216</style></pages><language><style face="normal" font="default" size="100%">eng</style></language><issue><style face="normal" font="default" size="100%">1</style></issue><work-type><style face="normal" font="default" size="100%">Journal article</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%">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%">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%">Topology Preserving Reductions and Additions on the Triangular, Square, and Hexagonal Grids</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%">588-600</style></pages><language><style face="normal" font="default" size="100%">eng</style></language><abstract><style face="normal" font="default" size="100%">&lt;p&gt;The Euclidean plane can be partitioned into three kinds of&lt;br&gt;regular polygons, which results in triangular, square and hexagonal grids.&lt;br&gt;While the topology of the square grid is well-established, less emphasis&lt;br&gt;is put on the remaining two regular sampling schemes. In this paper we&lt;br&gt;summarize the results of our research that aimed to give some general&lt;br&gt;characterizations of simple pixels and sufficient conditions for topology-&lt;br&gt;preserving operators in the mentioned grids.&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%">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%">Kálmán Palágyi</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%">Valentin E Brimkov</style></author><author><style face="normal" font="default" size="100%">Josef Šlapal</style></author></secondary-authors></contributors><titles><title><style face="normal" font="default" size="100%">Equivalent 2D sequential and parallel thinning</style></title><secondary-title><style face="normal" font="default" size="100%">Combinatorial Image Analysis</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%">May 2014</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%">Brno, Czech Republic</style></pub-location><pages><style face="normal" font="default" size="100%">91 - 100</style></pages><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>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><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 Kardos</style></author><author><style face="normal" font="default" size="100%">Kálmán Palágyi</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%">Valentin E Brimkov</style></author><author><style face="normal" font="default" size="100%">Josef Šlapal</style></author></secondary-authors></contributors><titles><title><style face="normal" font="default" size="100%">Sufficient conditions for general 2D operators to preserve topology</style></title><secondary-title><style face="normal" font="default" size="100%">Combinatorial Image Analysis</style></secondary-title><tertiary-title><style face="normal" font="default" size="100%">Lecture Notes in Computer Science</style></tertiary-title><alt-title><style face="normal" font="default" size="100%">LNCS</style></alt-title><short-title><style face="normal" font="default" size="100%">Conference Paper</style></short-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><urls><web-urls><url><style face="normal" font="default" size="100%">http://dx.doi.org/10.1007/978-3-319-07148-0_10</style></url></web-urls></urls><publisher><style face="normal" font="default" size="100%">Springer</style></publisher><pub-location><style face="normal" font="default" size="100%">May 2014, Brno, Czech Republic</style></pub-location><volume><style face="normal" font="default" size="100%">8466</style></volume><pages><style face="normal" font="default" size="100%">101 - 112</style></pages><isbn><style face="normal" font="default" size="100%">978-3-319-07147-3</style></isbn><language><style face="normal" font="default" size="100%">eng</style></language><abstract><style face="normal" font="default" size="100%">&lt;div class=&quot;abstract-content formatted&quot; itemprop=&quot;description&quot;&gt;&lt;p class=&quot;a-plus-plus&quot;&gt;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.&lt;/p&gt;&lt;/div&gt;&lt;p&gt;&amp;nbsp;&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%">Norbert Hantos</style></author><author><style face="normal" font="default" size="100%">Péter Balázs</style></author><author><style face="normal" font="default" size="100%">Kálmán Palágyi</style></author></authors><secondary-authors><author><style face="normal" font="default" size="100%">László Czúni</style></author></secondary-authors></contributors><titles><title><style face="normal" font="default" size="100%">Bináris képek rekonstrukciója két vetületből és morfológiai vázból</style></title><secondary-title><style face="normal" font="default" size="100%">A Képfeldolgozók és Alakfelismerők Társaságának konferenciája - KÉPAF 2013</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2013</style></year><pub-dates><date><style  face="normal" font="default" size="100%">Jan 2013</style></date></pub-dates></dates><publisher><style face="normal" font="default" size="100%">NJSZT-KÉPAF</style></publisher><pub-location><style face="normal" font="default" size="100%">Veszprém</style></pub-location><pages><style face="normal" font="default" size="100%">182 - 193</style></pages><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>17</ref-type><contributors><authors><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%">Conference of PhD Students in Computer Science</style></title><secondary-title><style face="normal" font="default" size="100%">ACTA CYBERNETICA-SZEGED</style></secondary-title><short-title><style face="normal" font="default" size="100%">ACTA CYBERN-SZEGED</style></short-title></titles><dates><year><style  face="normal" font="default" size="100%">2013</style></year><pub-dates><date><style  face="normal" font="default" size="100%">2013</style></date></pub-dates></dates><volume><style face="normal" font="default" size="100%">21</style></volume><pages><style face="normal" font="default" size="100%">1 - 3</style></pages><isbn><style face="normal" font="default" size="100%">0324-721X</style></isbn><language><style face="normal" font="default" size="100%">eng</style></language><issue><style face="normal" font="default" size="100%">1</style></issue><work-type><style face="normal" font="default" size="100%">Journal article</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%">Kálmán Palágyi</style></author></authors><secondary-authors><author><style face="normal" font="default" size="100%">Jose Ruiz-Shulcloper</style></author><author><style face="normal" font="default" size="100%">Gabriella Sanniti di Baja</style></author></secondary-authors></contributors><titles><title><style face="normal" font="default" size="100%">Deletion Rules for Equivalent Sequential and Parallel Reductions</style></title><secondary-title><style face="normal" font="default" size="100%">Progress in Pattern Recognition, Image Analysis, Computer Vision, and Applications</style></secondary-title><tertiary-title><style face="normal" font="default" size="100%">Lecture Notes in Computer Science</style></tertiary-title><alt-title><style face="normal" font="default" size="100%">LNCS</style></alt-title><short-title><style face="normal" font="default" size="100%">Conference Paper</style></short-title></titles><dates><year><style  face="normal" font="default" size="100%">2013</style></year><pub-dates><date><style  face="normal" font="default" size="100%">Nov 2013</style></date></pub-dates></dates><urls><web-urls><url><style face="normal" font="default" size="100%">http://link.springer.com/chapter/10.1007%2F978-3-642-41822-8_3</style></url></web-urls></urls><publisher><style face="normal" font="default" size="100%">Springer</style></publisher><pub-location><style face="normal" font="default" size="100%">Berlin; Heidelberg</style></pub-location><pages><style face="normal" font="default" size="100%">17 - 24</style></pages><isbn><style face="normal" font="default" size="100%">978-3-642-41821-1</style></isbn><language><style face="normal" font="default" size="100%">eng</style></language><abstract><style face="normal" font="default" size="100%">&lt;p&gt;A reduction operator transforms a binary picture only by changing some black points to white ones, which is referred to as deletion. Sequential reductions may delete just one point at a time, while parallel reductions can alter a set of points simultaneously. Two reductions are called equivalent if they produce the same result for each input picture. This work lays a bridge between the parallel and the sequential strategies. A class of deletion rules are proposed that provide 2D parallel reductions being equivalent to sequential reductions. Some new sufficient conditions for topology-preserving parallel reductions are also reported.&lt;/p&gt;</style></abstract><work-type><style face="normal" font="default" size="100%">Conference paper</style></work-type><notes><style face="normal" font="default" size="100%">Lecture Notes in Computer Science, Vol. 8258</style></notes></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%">Kálmán Palágyi</style></author></authors><secondary-authors><author><style face="normal" font="default" size="100%">George Bebis</style></author></secondary-authors></contributors><titles><title><style face="normal" font="default" size="100%">Parallel 3D 12-Subiteration Thinning Algorithms Based on Isthmuses</style></title><secondary-title><style face="normal" font="default" size="100%">Advances in Visual Computing</style></secondary-title><tertiary-title><style face="normal" font="default" size="100%">Lecture Notes in Computer Science</style></tertiary-title><alt-title><style face="normal" font="default" size="100%">LNCS</style></alt-title></titles><dates><year><style  face="normal" font="default" size="100%">2013</style></year><pub-dates><date><style  face="normal" font="default" size="100%">Jul 2013</style></date></pub-dates></dates><number><style face="normal" font="default" size="100%">8033</style></number><publisher><style face="normal" font="default" size="100%">Springer Verlag</style></publisher><pub-location><style face="normal" font="default" size="100%">Heidelberg; New York</style></pub-location><pages><style face="normal" font="default" size="100%">87 - 98</style></pages><language><style face="normal" font="default" size="100%">eng</style></language><abstract><style face="normal" font="default" size="100%">&lt;div class=&quot;abstract-content formatted&quot; itemprop=&quot;description&quot;&gt;&lt;p class=&quot;a-plus-plus&quot;&gt;Thinning is an iterative object reduction to obtain skeleton-like shape features of volumetric binary objects. Conventional thinning algorithms preserve endpoints to provide important geometric information relative to the object to be represented. An alternative strategy is also proposed that accumulates isthmuses (i.e., generalization of curve and surface interior points as skeletal elements). This paper presents two parallel isthmus-based 3D thinning algorithms that are capable of producing centerlines and medial surfaces. The strategy which is used is called subiteration-based or directional: each iteration step is composed of 12 subiterations each of which are executed in parallel. The proposed algorithms make efficient implementation possible and their topological correctness is guaranteed.&lt;/p&gt;&lt;/div&gt;&lt;p&gt;&amp;nbsp;&lt;/p&gt;</style></abstract><work-type><style face="normal" font="default" size="100%">Conference paper</style></work-type><notes><style face="normal" font="default" size="100%">Lecture Notes in Computer Science, Vol. 8033</style></notes></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%">Kálmán Palágyi</style></author></authors><secondary-authors><author><style face="normal" font="default" size="100%">László Czúni</style></author></secondary-authors></contributors><titles><title><style face="normal" font="default" size="100%">Parallel Thinning Based on Isthmuses</style></title><secondary-title><style face="normal" font="default" size="100%">A Képfeldolgozók és Alakfelismerők Társaságának konferenciája - KÉPAF 2013</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2013</style></year><pub-dates><date><style  face="normal" font="default" size="100%">Jan 2013</style></date></pub-dates></dates><publisher><style face="normal" font="default" size="100%">NJSZT-KÉPAF</style></publisher><pub-location><style face="normal" font="default" size="100%">Veszprém</style></pub-location><pages><style face="normal" font="default" size="100%">512 - 525</style></pages><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>5</ref-type><contributors><authors><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><secondary-authors><author><style face="normal" font="default" size="100%">Péter Baranyi</style></author></secondary-authors></contributors><titles><title><style face="normal" font="default" size="100%">Parallel Thinning on the Triangular Grid</style></title><secondary-title><style face="normal" font="default" size="100%">International Conference on Cognitive Infocommunications (CogInfoCom)</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2013</style></year><pub-dates><date><style  face="normal" font="default" size="100%">Dec 2013</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%">Budapest</style></pub-location><pages><style face="normal" font="default" size="100%">277 - 282</style></pages><isbn><style face="normal" font="default" size="100%">978-1-4799-1543-9 </style></isbn><language><style face="normal" font="default" size="100%">eng</style></language><abstract><style face="normal" font="default" size="100%">&lt;p&gt;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.&lt;/p&gt;</style></abstract><work-type><style face="normal" font="default" size="100%">Conference paper</style></work-type><accession-num><style face="normal" font="default" size="100%">14046653 </style></accession-num></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 Kardos</style></author><author><style face="normal" font="default" size="100%">Kálmán Palágyi</style></author></authors><secondary-authors><author><style face="normal" font="default" size="100%">L Linsen</style></author></secondary-authors></contributors><titles><title><style face="normal" font="default" size="100%">Sufficient Conditions for Topology Preserving Additions and General Operators</style></title><secondary-title><style face="normal" font="default" size="100%">Proceedings of the IASTED International Conference on Computer Graphics and Imaging (CGIM)</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2013</style></year><pub-dates><date><style  face="normal" font="default" size="100%">Feb 2013</style></date></pub-dates></dates><publisher><style face="normal" font="default" size="100%">IASTED - Acta Press</style></publisher><pub-location><style face="normal" font="default" size="100%">Calgary</style></pub-location><pages><style face="normal" font="default" size="100%">107 - 114</style></pages><language><style face="normal" font="default" size="100%">eng</style></language><abstract><style face="normal" font="default" size="100%">&lt;div class=&quot;abstract-content formatted&quot; itemprop=&quot;description&quot;&gt;&lt;p class=&quot;first_paragraph&quot;&gt;&lt;span id=&quot;lblAbstract&quot;&gt;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.&lt;/span&gt;&lt;/p&gt;&lt;/div&gt;&lt;p&gt;&amp;nbsp;&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 Kardos</style></author><author><style face="normal" font="default" size="100%">Kálmán Palágyi</style></author></authors><secondary-authors><author><style face="normal" font="default" size="100%">Giovanni Ramponi</style></author><author><style face="normal" font="default" size="100%">Sven Lončarić</style></author><author><style face="normal" font="default" size="100%">Alberto Carini</style></author><author><style face="normal" font="default" size="100%">Karen Egiazarian</style></author></secondary-authors></contributors><titles><title><style face="normal" font="default" size="100%">On Topology Preservation in Triangular, Square, and Hexagonal Grids</style></title><secondary-title><style face="normal" font="default" size="100%">Proceedings of International Symposium on Image and Signal Processing and Analysis (ISPA)</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2013</style></year><pub-dates><date><style  face="normal" font="default" size="100%">Sep 2013</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%">Trieste</style></pub-location><pages><style face="normal" font="default" size="100%">782 - 787</style></pages><language><style face="normal" font="default" size="100%">eng</style></language><abstract><style face="normal" font="default" size="100%">&lt;p&gt;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.&lt;/p&gt;</style></abstract><work-type><style face="normal" font="default" size="100%">Conference paper</style></work-type><accession-num><style face="normal" font="default" size="100%">14027933 </style></accession-num></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%">Péter Kardos</style></author><author><style face="normal" font="default" size="100%">Kálmán Palágyi</style></author></authors><secondary-authors><author><style face="normal" font="default" size="100%">László Czúni</style></author></secondary-authors></contributors><titles><title><style face="normal" font="default" size="100%">Topology preserving parallel thinning on hexagonal grids</style></title><secondary-title><style face="normal" font="default" size="100%">A Képfeldolgozók és Alakfelismerők Társaságának konferenciája - KÉPAF 2013</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2013</style></year><pub-dates><date><style  face="normal" font="default" size="100%">Jan 2013</style></date></pub-dates></dates><publisher><style face="normal" font="default" size="100%">NJSZT-KÉPAF</style></publisher><pub-location><style face="normal" font="default" size="100%">Veszprém</style></pub-location><pages><style face="normal" font="default" size="100%">250 - 264</style></pages><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>17</ref-type><contributors><authors><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%">Topology-preserving hexagonal thinning</style></title><secondary-title><style face="normal" font="default" size="100%">INTERNATIONAL JOURNAL OF COMPUTER MATHEMATICS</style></secondary-title><short-title><style face="normal" font="default" size="100%">INT J COMPUT MATH</style></short-title></titles><dates><year><style  face="normal" font="default" size="100%">2013</style></year><pub-dates><date><style  face="normal" font="default" size="100%">2013</style></date></pub-dates></dates><urls><web-urls><url><style face="normal" font="default" size="100%">http://www.tandfonline.com/doi/abs/10.1080/00207160.2012.724198#preview</style></url></web-urls></urls><publisher><style face="normal" font="default" size="100%">Taylor &amp; Francis</style></publisher><volume><style face="normal" font="default" size="100%">90</style></volume><pages><style face="normal" font="default" size="100%">1607 - 1617</style></pages><isbn><style face="normal" font="default" size="100%">0020-7160</style></isbn><language><style face="normal" font="default" size="100%">eng</style></language><abstract><style face="normal" font="default" size="100%">&lt;p&gt;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.&lt;/p&gt;</style></abstract><issue><style face="normal" font="default" size="100%">8</style></issue><work-type><style face="normal" font="default" size="100%">Journal article</style></work-type><notes><style face="normal" font="default" size="100%">doi: 10.1080/00207160.2012.724198</style></notes></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%">Gábor Németh</style></author><author><style face="normal" font="default" size="100%">Kálmán Palágyi</style></author></authors><secondary-authors><author><style face="normal" font="default" size="100%">Jacques Blanc-Talon</style></author><author><style face="normal" font="default" size="100%">Wilfried Philips</style></author><author><style face="normal" font="default" size="100%">Dan Popescu</style></author><author><style face="normal" font="default" size="100%">Paul Scheunders</style></author><author><style face="normal" font="default" size="100%">Pavel Zemčík</style></author></secondary-authors></contributors><titles><title><style face="normal" font="default" size="100%">3D Parallel Thinning Algorithms Based on Isthmuses</style></title><secondary-title><style face="normal" font="default" size="100%">Advanced Concepts for Intelligent Vision Systems (ACIVS)</style></secondary-title><tertiary-title><style face="normal" font="default" size="100%">Lecture Notes in Computer Science</style></tertiary-title><alt-title><style face="normal" font="default" size="100%">LNCS</style></alt-title><short-title><style face="normal" font="default" size="100%">Conference Paper</style></short-title></titles><dates><year><style  face="normal" font="default" size="100%">2012</style></year><pub-dates><date><style  face="normal" font="default" size="100%">Sep 2012</style></date></pub-dates></dates><urls><web-urls><url><style face="normal" font="default" size="100%">http://dx.doi.org/10.1007/978-3-642-33140-4_29</style></url></web-urls></urls><publisher><style face="normal" font="default" size="100%">Springer Verlag</style></publisher><pub-location><style face="normal" font="default" size="100%">Brno, Czech Republic</style></pub-location><volume><style face="normal" font="default" size="100%">7517</style></volume><pages><style face="normal" font="default" size="100%">325 - 335</style></pages><language><style face="normal" font="default" size="100%">eng</style></language><abstract><style face="normal" font="default" size="100%">&lt;p&gt;Thinning is a widely used technique to obtain skeleton-like shape features (i.e., centerlines and medial surfaces) from digital binary objects. Conventional thinning algorithms preserve endpoints to provide important geometric information relative to the object to be represented. An alternative strategy is also proposed that preserves isthmuses (i.e., generalization of curve/surface interior points). In this paper we present ten 3D parallel isthmus-based thinning algorithm variants that are derived from some sufficient conditions for topology preserving reductions. &lt;tt&gt; &lt;/tt&gt;&lt;/p&gt;</style></abstract><work-type><style face="normal" font="default" size="100%">Conference Paper</style></work-type><notes><style face="normal" font="default" size="100%">N1 10.1007/978-3-642-33140-4_29</style></notes></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%">Norbert Hantos</style></author><author><style face="normal" font="default" size="100%">Péter Balázs</style></author><author><style face="normal" font="default" size="100%">Kálmán Palágyi</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%">Valentin E Brimkov</style></author><author><style face="normal" font="default" size="100%">Jake K Aggarwal</style></author></secondary-authors></contributors><titles><title><style face="normal" font="default" size="100%">Binary image reconstruction from two projections and skeletal information</style></title><secondary-title><style face="normal" font="default" size="100%">Combinatorial Image Analysis</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%">2012</style></year><pub-dates><date><style  face="normal" font="default" size="100%">Nov 2012</style></date></pub-dates></dates><number><style face="normal" font="default" size="100%">7655</style></number><publisher><style face="normal" font="default" size="100%">Springer Verlag</style></publisher><pub-location><style face="normal" font="default" size="100%">Berlin; Heidelberg; New York; London; Paris; Tokyo</style></pub-location><pages><style face="normal" font="default" size="100%">263 - 273</style></pages><language><style face="normal" font="default" size="100%">eng</style></language><abstract><style face="normal" font="default" size="100%">&lt;p&gt;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.&lt;/p&gt;</style></abstract><work-type><style face="normal" font="default" size="100%">Conference paper</style></work-type><notes><style face="normal" font="default" size="100%">ScopusID: 84869986820doi: 10.1007/978-3-642-34732-0_20</style></notes></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%">Norbert Hantos</style></author><author><style face="normal" font="default" size="100%">Péter Balázs</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%">Binary tomography using two projections and morphological skeleton</style></title><secondary-title><style face="normal" font="default" size="100%">Conference of PhD Students in Computer Science</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2012</style></year><pub-dates><date><style  face="normal" font="default" size="100%">June 2012</style></date></pub-dates></dates><publisher><style face="normal" font="default" size="100%">Univ Szeged Institute of Informatics</style></publisher><pub-location><style face="normal" font="default" size="100%">Szeged</style></pub-location><volume><style face="normal" font="default" size="100%">Volume of Extended Abstracts</style></volume><pages><style face="normal" font="default" size="100%">20</style></pages><language><style face="normal" font="default" size="100%">eng</style></language></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 Kardos</style></author><author><style face="normal" font="default" size="100%">Kálmán Palágyi</style></author></authors><secondary-authors><author><style face="normal" font="default" size="100%">Paolo Di Giamberardino</style></author><author><style face="normal" font="default" size="100%">Daniela Iacoviello</style></author><author><style face="normal" font="default" size="100%">Renato M Natal Jorge</style></author><author><style face="normal" font="default" size="100%">Joao Manuel R S Taveres</style></author></secondary-authors></contributors><titles><title><style face="normal" font="default" size="100%">Hexagonal parallel thinning algorithms based on sufficient conditions for topology preservation</style></title><secondary-title><style face="normal" font="default" size="100%">Computational Modelling of Objects Represented in Images: Fundamentals, Methods and Applications III</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2012</style></year><pub-dates><date><style  face="normal" font="default" size="100%">2012</style></date></pub-dates></dates><publisher><style face="normal" font="default" size="100%">CRC Press - Taylor and Frances Group</style></publisher><pub-location><style face="normal" font="default" size="100%">London</style></pub-location><pages><style face="normal" font="default" size="100%">63 - 68</style></pages><isbn><style face="normal" font="default" size="100%">978-0-415-62134-2</style></isbn><language><style face="normal" font="default" size="100%">eng</style></language><abstract><style face="normal" font="default" size="100%">&lt;p&gt;Thinning is a well-known technique for producing skeleton-like shape features from digital&lt;br&gt;binary objects in a topology preserving way. Most of the existing thinning algorithms presuppose that the input&lt;br&gt;images are sampled on orthogonal grids.This paper presents new sufficient conditions for topology preserving&lt;br&gt;reductions working on hexagonal grids (or triangular lattices) and eight new 2D hexagonal parallel thinning&lt;br&gt;algorithms that are based on our conditions.The proposed algorithms are capable of producing both medial lines&lt;br&gt;and topological kernels as well.&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%">Péter Kardos</style></author><author><style face="normal" font="default" size="100%">Kálmán Palágyi</style></author></authors><secondary-authors><author><style face="normal" font="default" size="100%">M Petrou</style></author><author><style face="normal" font="default" size="100%">A D Sappa</style></author><author><style face="normal" font="default" size="100%">A G Triantafyllidis</style></author></secondary-authors></contributors><titles><title><style face="normal" font="default" size="100%">Isthmus-based Order-Independent Sequential Thinning</style></title><secondary-title><style face="normal" font="default" size="100%">IASTED International Conference on Signal Processing, Pattern Recognition and Applications (SSPRA)</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2012</style></year><pub-dates><date><style  face="normal" font="default" size="100%">June 2012</style></date></pub-dates></dates><urls><web-urls><url><style face="normal" font="default" size="100%">http://www.actapress.com/Content_of_Proceeding.aspx?proceedingID=736</style></url></web-urls></urls><publisher><style face="normal" font="default" size="100%">IASTED ACTA Press</style></publisher><pub-location><style face="normal" font="default" size="100%">Crete, Greek</style></pub-location><pages><style face="normal" font="default" size="100%">28 - 34</style></pages><language><style face="normal" font="default" size="100%">eng</style></language><abstract><style face="normal" font="default" size="100%">&lt;p&gt;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.&lt;/p&gt;</style></abstract><work-type><style face="normal" font="default" size="100%">Conference paper</style></work-type><notes><style face="normal" font="default" size="100%">doi: 10.2316/P.2012.778-025</style></notes></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%">Péter Kardos</style></author><author><style face="normal" font="default" size="100%">Kálmán Palágyi</style></author></authors><secondary-authors><author><style face="normal" font="default" size="100%">IEEE</style></author></secondary-authors></contributors><titles><title><style face="normal" font="default" size="100%">On Order–Independent Sequential Thinning</style></title><secondary-title><style face="normal" font="default" size="100%">IEEE International Conference on Cognitive Infocommunications (CogInfoCom)</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2012</style></year><pub-dates><date><style  face="normal" font="default" size="100%">2012</style></date></pub-dates></dates><urls><web-urls><url><style face="normal" font="default" size="100%">http://ieeexplore.ieee.org/xpl/mostRecentIssue.jsp?punumber=6413305</style></url></web-urls></urls><publisher><style face="normal" font="default" size="100%">IEEE</style></publisher><pub-location><style face="normal" font="default" size="100%">Kosice, Slovakia </style></pub-location><pages><style face="normal" font="default" size="100%">149 - 154</style></pages><isbn><style face="normal" font="default" size="100%">978-1-4673-5187-4 </style></isbn><language><style face="normal" font="default" size="100%">eng</style></language><abstract><style face="normal" font="default" size="100%">&lt;p&gt;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.&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%">Norbert Hantos</style></author><author><style face="normal" font="default" size="100%">Péter Balázs</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%">Solving binary tomography from morphological skeleton via optimization</style></title><secondary-title><style face="normal" font="default" size="100%">Veszprém Optimization Conference: Advanced Algorithms (VOCAL)</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2012</style></year><pub-dates><date><style  face="normal" font="default" size="100%">Dec 2012</style></date></pub-dates></dates><publisher><style face="normal" font="default" size="100%">University of Pannonia</style></publisher><pub-location><style face="normal" font="default" size="100%">Veszprém</style></pub-location><pages><style face="normal" font="default" size="100%">42</style></pages><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>5</ref-type><contributors><authors><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><secondary-authors><author><style face="normal" font="default" size="100%">Reneta P Barneva</style></author><author><style face="normal" font="default" size="100%">Valentin E Brimkov</style></author><author><style face="normal" font="default" size="100%">Jake K Aggarwal</style></author></secondary-authors></contributors><titles><title><style face="normal" font="default" size="100%">On topology preservation for triangular thinning algorithms</style></title><secondary-title><style face="normal" font="default" size="100%">Combinatorial Image Analysis (IWCIA)</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%">2012</style></year><pub-dates><date><style  face="normal" font="default" size="100%">Nov 2012</style></date></pub-dates></dates><number><style face="normal" font="default" size="100%">7655</style></number><publisher><style face="normal" font="default" size="100%">Springer Verlag</style></publisher><pub-location><style face="normal" font="default" size="100%">Austin, TX, USA</style></pub-location><pages><style face="normal" font="default" size="100%">128 - 142</style></pages><isbn><style face="normal" font="default" size="100%">978-3-642-34731-3</style></isbn><language><style face="normal" font="default" size="100%">eng</style></language><abstract><style face="normal" font="default" size="100%">&lt;p&gt;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.&lt;/p&gt;</style></abstract><work-type><style face="normal" font="default" size="100%">Conference paper</style></work-type><notes><style face="normal" font="default" size="100%">doi: 10.1007/978-3-642-34732-0_10Lecture Notes in Computer Science, Volume 7655</style></notes></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%">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%">Valentin E Brimkov</style></author><author><style face="normal" font="default" size="100%">Reneta P Barneva</style></author></secondary-authors></contributors><titles><title><style face="normal" font="default" size="100%">Topology Preserving Parallel 3D Thinning Algorithms</style></title><secondary-title><style face="normal" font="default" size="100%">Digital Geometry Algorithms</style></secondary-title><tertiary-title><style face="normal" font="default" size="100%">Lecture Notes in Computational Vision and Biomechanics</style></tertiary-title></titles><dates><year><style  face="normal" font="default" size="100%">2012</style></year><pub-dates><date><style  face="normal" font="default" size="100%">2012</style></date></pub-dates></dates><number><style face="normal" font="default" size="100%">2</style></number><publisher><style face="normal" font="default" size="100%">Springer-Verlag</style></publisher><pages><style face="normal" font="default" size="100%">165 - 188</style></pages><isbn><style face="normal" font="default" size="100%">978-94-007-4173-7</style></isbn><language><style face="normal" font="default" size="100%">eng</style></language><abstract><style face="normal" font="default" size="100%">&lt;p&gt;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. &lt;tt&gt; &lt;/tt&gt;&lt;/p&gt;</style></abstract><work-type><style face="normal" font="default" size="100%">Book chapter</style></work-type><notes><style face="normal" font="default" size="100%">doi: 10.1007/978-94-007-4174-4_6</style></notes><section><style face="normal" font="default" size="100%">6</style></section></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%">Kálmán Palágyi</style></author></authors><secondary-authors><author><style face="normal" font="default" size="100%">Sven Lončarić</style></author><author><style face="normal" font="default" size="100%">Giovanni Ramponi</style></author><author><style face="normal" font="default" size="100%">D. Sersic</style></author></secondary-authors></contributors><titles><title><style face="normal" font="default" size="100%">2D Parallel Thinning Algorithms Based on Isthmus-Preservation</style></title><secondary-title><style face="normal" font="default" size="100%">Proceedings of the International Symposium on Image and Signal Processing and Analysis (ISPA)</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2011</style></year><pub-dates><date><style  face="normal" font="default" size="100%">Sep 2011 </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%">Dubrovnik, Croatia</style></pub-location><pages><style face="normal" font="default" size="100%">585 - 590</style></pages><isbn><style face="normal" font="default" size="100%">978-1-4577-0841-1 </style></isbn><language><style face="normal" font="default" size="100%">eng</style></language><abstract><style face="normal" font="default" size="100%">&lt;p&gt;Skeletons are widely used shape descriptors which summarize the general form of binary objects. A technique to obtain skeletons is the thinning, that is an iterative layer-by-layer erosion in a topology-preserving way. Conventional thinning algorithms preserve line endpoints to provide important geometric information relative to the object to be represented. Bertrand and Couprie proposed an alternative strategy by accumulating isthmus points that are line interior points. In this paper we present six new 2D parallel thinning algorithms that are derived from some sufficient conditions for topology preserving reductions and based on isthmus-preservation.&lt;/p&gt;</style></abstract><work-type><style face="normal" font="default" size="100%">Conference paper</style></work-type><accession-num><style face="normal" font="default" size="100%">12307467 </style></accession-num><notes><style face="normal" font="default" size="100%">ScopusID: 83455172782</style></notes></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>17</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%">2D parallel thinning and shrinking based on sufficient conditions for topology preservation</style></title><secondary-title><style face="normal" font="default" size="100%">ACTA CYBERNETICA-SZEGED</style></secondary-title><short-title><style face="normal" font="default" size="100%">ACTA CYBERN-SZEGED</style></short-title></titles><dates><year><style  face="normal" font="default" size="100%">2011</style></year><pub-dates><date><style  face="normal" font="default" size="100%">2011</style></date></pub-dates></dates><publisher><style face="normal" font="default" size="100%">University of Szeged, Institute of Informatics</style></publisher><pub-location><style face="normal" font="default" size="100%">Szeged</style></pub-location><volume><style face="normal" font="default" size="100%">20</style></volume><pages><style face="normal" font="default" size="100%">125 - 144</style></pages><isbn><style face="normal" font="default" size="100%">0324-721X</style></isbn><language><style face="normal" font="default" size="100%">eng</style></language><abstract><style face="normal" font="default" size="100%">&lt;p&gt;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.&lt;/p&gt;</style></abstract><issue><style face="normal" font="default" size="100%">1</style></issue><work-type><style face="normal" font="default" size="100%">Journal article</style></work-type><notes><style face="normal" font="default" size="100%">ScopusID: 79960666919</style></notes></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%">Attila Tanacs</style></author><author><style face="normal" font="default" size="100%">Joakim Lindblad</style></author><author><style face="normal" font="default" size="100%">Nataša Sladoje</style></author><author><style face="normal" font="default" size="100%">Zoltan Kato</style></author></authors><secondary-authors><author><style face="normal" font="default" size="100%">Zoltan Kato</style></author><author><style face="normal" font="default" size="100%">Kálmán Palágyi</style></author></secondary-authors></contributors><titles><title><style face="normal" font="default" size="100%">3D objektumok lineáris deformációinak becslése</style></title><secondary-title><style face="normal" font="default" size="100%">A Képfeldolgozók és Alakfelismerők Társaságának konferenciája - KÉPAF 2011</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2011</style></year><pub-dates><date><style  face="normal" font="default" size="100%">Jan 2011</style></date></pub-dates></dates><publisher><style face="normal" font="default" size="100%">NJSZT</style></publisher><pub-location><style face="normal" font="default" size="100%">Szeged</style></pub-location><pages><style face="normal" font="default" size="100%">471 - 480</style></pages><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%">Csaba Domokos</style></author><author><style face="normal" font="default" size="100%">Zoltan Kato</style></author></authors><secondary-authors><author><style face="normal" font="default" size="100%">Zoltan Kato</style></author><author><style face="normal" font="default" size="100%">Kálmán Palágyi</style></author></secondary-authors></contributors><titles><title><style face="normal" font="default" size="100%">Affin Puzzle: Deformált objektumdarabok helyreállítása megfeleltetések nélkül</style></title><secondary-title><style face="normal" font="default" size="100%">A Képfeldolgozók és Alakfelismerők Társaságának konferenciája - KÉPAF 2011</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2011</style></year><pub-dates><date><style  face="normal" font="default" size="100%">Jan 2011</style></date></pub-dates></dates><urls><web-urls><url><style face="normal" font="default" size="100%">http://www.inf.u-szeged.hu/kepaf2011/pdfs/S05_03.pdf</style></url></web-urls></urls><publisher><style face="normal" font="default" size="100%">NJSZT</style></publisher><pub-location><style face="normal" font="default" size="100%">Szeged</style></pub-location><pages><style face="normal" font="default" size="100%">206 - 220</style></pages><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><notes><style face="normal" font="default" size="100%">Kuba Attila Díjas cikk.</style></notes></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%">Mihály Gara</style></author><author><style face="normal" font="default" size="100%">Péter Balázs</style></author></authors><secondary-authors><author><style face="normal" font="default" size="100%">Zoltan Kato</style></author><author><style face="normal" font="default" size="100%">Kálmán Palágyi</style></author></secondary-authors></contributors><titles><title><style face="normal" font="default" size="100%">Bináris tomográfiai rekonstrukció objektum alapú evolúciós algoritmussal</style></title><secondary-title><style face="normal" font="default" size="100%">A Képfeldolgozók és Alakfelismerők Társaságának konferenciája - KÉPAF 2011</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2011</style></year><pub-dates><date><style  face="normal" font="default" size="100%">Jan 2011</style></date></pub-dates></dates><publisher><style face="normal" font="default" size="100%">NJSZT</style></publisher><pub-location><style face="normal" font="default" size="100%">Szeged</style></pub-location><pages><style face="normal" font="default" size="100%">117 - 127</style></pages><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>17</ref-type><contributors><authors><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%">Conference of PhD Students in Computer Science</style></title><secondary-title><style face="normal" font="default" size="100%">ACTA CYBERNETICA-SZEGED</style></secondary-title><short-title><style face="normal" font="default" size="100%">ACTA CYBERN-SZEGED</style></short-title></titles><dates><year><style  face="normal" font="default" size="100%">2011</style></year><pub-dates><date><style  face="normal" font="default" size="100%">2011</style></date></pub-dates></dates><volume><style face="normal" font="default" size="100%">20</style></volume><pages><style face="normal" font="default" size="100%">3</style></pages><isbn><style face="normal" font="default" size="100%">0324-721X</style></isbn><language><style face="normal" font="default" size="100%">eng</style></language><issue><style face="normal" font="default" size="100%">1</style></issue><work-type><style face="normal" font="default" size="100%">Journal article</style></work-type><notes><style face="normal" font="default" size="100%">ScopusID: 79960683318</style></notes></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%">Milan Lesko</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%">Imre Gombos</style></author><author><style face="normal" font="default" size="100%">Zsolt Török</style></author><author><style face="normal" font="default" size="100%">László Vígh</style></author><author><style face="normal" font="default" size="100%">László Vígh</style></author></authors><secondary-authors><author><style face="normal" font="default" size="100%">Zoltan Kato</style></author><author><style face="normal" font="default" size="100%">Kálmán Palágyi</style></author></secondary-authors></contributors><titles><title><style face="normal" font="default" size="100%">Élősejt szegmentálása gráfvágás segítségével fluoreszcenciás mikroszkóp képeken</style></title><secondary-title><style face="normal" font="default" size="100%">A Képfeldolgozók és Alakfelismerők Társaságának konferenciája - KÉPAF 2011</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2011</style></year><pub-dates><date><style  face="normal" font="default" size="100%">Jan 2011</style></date></pub-dates></dates><urls><web-urls><url><style face="normal" font="default" size="100%">http://www.inf.u-szeged.hu/kepaf2011/pdfs/S08_02.pdf</style></url></web-urls></urls><publisher><style face="normal" font="default" size="100%">NJSZT</style></publisher><pub-location><style face="normal" font="default" size="100%">Szeged</style></pub-location><pages><style face="normal" font="default" size="100%">319 - 328</style></pages><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>5</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><secondary-authors><author><style face="normal" font="default" size="100%">Jake K Aggarwal</style></author><author><style face="normal" font="default" size="100%">Reneta P Barneva</style></author><author><style face="normal" font="default" size="100%">Valentin E Brimkov</style></author><author><style face="normal" font="default" size="100%">Kostadin N Koroutchev</style></author><author><style face="normal" font="default" size="100%">Elka R Korutcheva</style></author></secondary-authors></contributors><titles><title><style face="normal" font="default" size="100%">A family of topology-preserving 3d parallel 6-subiteration thinning algorithms</style></title><secondary-title><style face="normal" font="default" size="100%">Combinatorial Image Analysis (IWCIA)</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%">2011</style></year><pub-dates><date><style  face="normal" font="default" size="100%">May 2011</style></date></pub-dates></dates><number><style face="normal" font="default" size="100%">6636</style></number><publisher><style face="normal" font="default" size="100%">Springer Verlag</style></publisher><pub-location><style face="normal" font="default" size="100%">Madrid, Spain</style></pub-location><pages><style face="normal" font="default" size="100%">17 - 30</style></pages><isbn><style face="normal" font="default" size="100%">978-3-642-21072-3</style></isbn><language><style face="normal" font="default" size="100%">eng</style></language><abstract><style face="normal" font="default" size="100%">&lt;p&gt;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.&lt;/p&gt;</style></abstract><work-type><style face="normal" font="default" size="100%">Conference paper</style></work-type><notes><style face="normal" font="default" size="100%">ScopusID: 79957651399doi: 10.1007/978-3-642-21073-0_5</style></notes></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%">Péter Kardos</style></author><author><style face="normal" font="default" size="100%">Gábor Németh</style></author><author><style face="normal" font="default" size="100%">Kálmán Palágyi</style></author></authors><secondary-authors><author><style face="normal" font="default" size="100%">Zoltan Kato</style></author><author><style face="normal" font="default" size="100%">Kálmán Palágyi</style></author></secondary-authors></contributors><titles><title><style face="normal" font="default" size="100%">Iterációnkénti simítással kombinált vékonyítás</style></title><secondary-title><style face="normal" font="default" size="100%">A Képfeldolgozók és Alakfelismerők Társaságának konferenciája - KÉPAF 2011</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2011</style></year><pub-dates><date><style  face="normal" font="default" size="100%">Jan 2011</style></date></pub-dates></dates><urls><web-urls><url><style face="normal" font="default" size="100%">http://www.inf.u-szeged.hu/kepaf2011/pdfs/S05_01.pdf</style></url></web-urls></urls><publisher><style face="normal" font="default" size="100%">NJSZT</style></publisher><pub-location><style face="normal" font="default" size="100%">Szeged</style></pub-location><pages><style face="normal" font="default" size="100%">174 - 189</style></pages><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>6</ref-type><contributors><authors><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%">Képfeldolgozás haladóknak</style></title></titles><dates><year><style  face="normal" font="default" size="100%">2011</style></year><pub-dates><date><style  face="normal" font="default" size="100%">2011</style></date></pub-dates></dates><publisher><style face="normal" font="default" size="100%">Typotex</style></publisher><pub-location><style face="normal" font="default" size="100%">Budapest</style></pub-location><language><style face="normal" font="default" size="100%">eng</style></language><work-type><style face="normal" font="default" size="100%">Book</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%">Norbert Hantos</style></author><author><style face="normal" font="default" size="100%">Péter Balázs</style></author></authors><secondary-authors><author><style face="normal" font="default" size="100%">Zoltan Kato</style></author><author><style face="normal" font="default" size="100%">Kálmán Palágyi</style></author></secondary-authors></contributors><titles><title><style face="normal" font="default" size="100%">Mediánszűrés alkalmazása algebrai rekonstrukciós módszerekben</style></title><secondary-title><style face="normal" font="default" size="100%">A Képfeldolgozók és Alakfelismerők Társaságának konferenciája - KÉPAF 2011</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2011</style></year><pub-dates><date><style  face="normal" font="default" size="100%">Jan 2011</style></date></pub-dates></dates><publisher><style face="normal" font="default" size="100%">NJSZT</style></publisher><pub-location><style face="normal" font="default" size="100%">Szeged</style></pub-location><pages><style face="normal" font="default" size="100%">106 - 116</style></pages><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%">Péter Kardos</style></author><author><style face="normal" font="default" size="100%">Kálmán Palágyi</style></author></authors><secondary-authors><author><style face="normal" font="default" size="100%">Ioannis Andreadis</style></author><author><style face="normal" font="default" size="100%">M Zervakis</style></author></secondary-authors></contributors><titles><title><style face="normal" font="default" size="100%">Order-independent sequential thinning in arbitrary dimensions</style></title><secondary-title><style face="normal" font="default" size="100%">Signal and Image Processing and Applications (SIPA)</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2011</style></year><pub-dates><date><style  face="normal" font="default" size="100%">June 2011</style></date></pub-dates></dates><publisher><style face="normal" font="default" size="100%">IASTED - Acta Press</style></publisher><pub-location><style face="normal" font="default" size="100%">Crete, Greek</style></pub-location><pages><style face="normal" font="default" size="100%">129 - 134</style></pages><language><style face="normal" font="default" size="100%">eng</style></language><abstract><style face="normal" font="default" size="100%">&lt;p class=&quot;first_paragraph&quot;&gt;&lt;span id=&quot;lblAbstract&quot;&gt;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 (&lt;em&gt;n&lt;/em&gt; =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.&lt;/span&gt;&lt;/p&gt;</style></abstract><work-type><style face="normal" font="default" size="100%">Conference paper</style></work-type><notes><style face="normal" font="default" size="100%">doi: 10.2316/P.2011.738-021</style></notes></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>17</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%">Thinning combined with iteration-by-iteration smoothing for 3D binary images</style></title><secondary-title><style face="normal" font="default" size="100%">GRAPHICAL MODELS</style></secondary-title><short-title><style face="normal" font="default" size="100%">GRAPH MODELS</style></short-title></titles><dates><year><style  face="normal" font="default" size="100%">2011</style></year><pub-dates><date><style  face="normal" font="default" size="100%">Nov 2011</style></date></pub-dates></dates><volume><style face="normal" font="default" size="100%">73</style></volume><pages><style face="normal" font="default" size="100%">335 - 345</style></pages><isbn><style face="normal" font="default" size="100%">1524-0703</style></isbn><language><style face="normal" font="default" size="100%">eng</style></language><abstract><style face="normal" font="default" size="100%">&lt;p&gt;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.&lt;/p&gt;</style></abstract><issue><style face="normal" font="default" size="100%">6</style></issue><work-type><style face="normal" font="default" size="100%">Journal article</style></work-type><notes><style face="normal" font="default" size="100%">ScopusID: 79952613010doi: 10.1016/j.gmod.2011.02.001</style></notes></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><secondary-authors><author><style face="normal" font="default" size="100%">Zoltan Kato</style></author><author><style face="normal" font="default" size="100%">Kálmán Palágyi</style></author></secondary-authors></contributors><titles><title><style face="normal" font="default" size="100%">A topológia-megőrzés elegendő feltételein alapuló 3D párhuzamos vékonyító algoritmusok</style></title><secondary-title><style face="normal" font="default" size="100%">A Képfeldolgozók és Alakfelismerők Társaságának konferenciája - KÉPAF 2011</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2011</style></year><pub-dates><date><style  face="normal" font="default" size="100%">Jan 2011</style></date></pub-dates></dates><urls><web-urls><url><style face="normal" font="default" size="100%">http://www.inf.u-szeged.hu/kepaf2011/pdfs/S05_02.pdf</style></url></web-urls></urls><publisher><style face="normal" font="default" size="100%">NJSZT</style></publisher><pub-location><style face="normal" font="default" size="100%">Szeged</style></pub-location><pages><style face="normal" font="default" size="100%">190 - 205</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><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 Kardos</style></author><author><style face="normal" font="default" size="100%">Kálmán Palágyi</style></author></authors><secondary-authors><author><style face="normal" font="default" size="100%">Jake K Aggarwal</style></author><author><style face="normal" font="default" size="100%">Reneta P Barneva</style></author><author><style face="normal" font="default" size="100%">Valentin E Brimkov</style></author><author><style face="normal" font="default" size="100%">Kostadin N Koroutchev</style></author><author><style face="normal" font="default" size="100%">Elka R Korutcheva</style></author></secondary-authors></contributors><titles><title><style face="normal" font="default" size="100%">On topology preservation for hexagonal parallel thinning algorithms</style></title><secondary-title><style face="normal" font="default" size="100%">Combinatorial Image Analysis (IWCIA)</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%">2011</style></year><pub-dates><date><style  face="normal" font="default" size="100%">May 2011</style></date></pub-dates></dates><number><style face="normal" font="default" size="100%">6636</style></number><publisher><style face="normal" font="default" size="100%">Springer Verlag</style></publisher><pub-location><style face="normal" font="default" size="100%">Madrid, Spain</style></pub-location><pages><style face="normal" font="default" size="100%">31 - 42</style></pages><isbn><style face="normal" font="default" size="100%">978-3-642-21072-3</style></isbn><language><style face="normal" font="default" size="100%">eng</style></language><abstract><style face="normal" font="default" size="100%">&lt;p&gt;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.&lt;/p&gt;</style></abstract><work-type><style face="normal" font="default" size="100%">Conference paper</style></work-type><notes><style face="normal" font="default" size="100%">ScopusID: 79957628214doi: 10.1007/978-3-642-21073-0_6</style></notes></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>17</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%">Kálmán Palágyi</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">Topology Preserving Parallel Thinning Algorithms</style></title><secondary-title><style face="normal" font="default" size="100%">INTERNATIONAL JOURNAL OF IMAGING SYSTEMS AND TECHNOLOGY</style></secondary-title><short-title><style face="normal" font="default" size="100%">INT J IMAG SYST TECH</style></short-title></titles><dates><year><style  face="normal" font="default" size="100%">2011</style></year><pub-dates><date><style  face="normal" font="default" size="100%">Feb 2011</style></date></pub-dates></dates><publisher><style face="normal" font="default" size="100%">Wiley Periodicals, Inc.</style></publisher><volume><style face="normal" font="default" size="100%">21</style></volume><pages><style face="normal" font="default" size="100%">37 - 44</style></pages><isbn><style face="normal" font="default" size="100%">0899-9457</style></isbn><language><style face="normal" font="default" size="100%">eng</style></language><abstract><style face="normal" font="default" size="100%">&lt;p&gt;Thinning is an iterative object reduction technique for extracting medial curves from binary objects. During a thinning process, some border points that satisfy certain topological and geometric constraints are deleted in iteration steps. Parallel thinning algorithms are composed of parallel reduction operators that delete a set of object points simultaneously. This article presents 21 parallel thinning algorithms for (8,4) binary pictures that are derived from the sufficient conditions for topology preservation accommodated to the three parallel thinning approaches. © 2011 Wiley Periodicals, Inc.&lt;/p&gt;</style></abstract><issue><style face="normal" font="default" size="100%">1</style></issue><work-type><style face="normal" font="default" size="100%">Journal article</style></work-type><notes><style face="normal" font="default" size="100%">UT: 000287789100005ScopusID: 79951782238doi: 10.1002/ima.20272</style></notes></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%">László Gábor Varga</style></author><author><style face="normal" font="default" size="100%">Péter Balázs</style></author><author><style face="normal" font="default" size="100%">Antal Nagy</style></author></authors><secondary-authors><author><style face="normal" font="default" size="100%">Zoltan Kato</style></author><author><style face="normal" font="default" size="100%">Kálmán Palágyi</style></author></secondary-authors></contributors><titles><title><style face="normal" font="default" size="100%">Vetületi irányfüggőség a bináris tomográfiában</style></title><secondary-title><style face="normal" font="default" size="100%">A Képfeldolgozók és Alakfelismerők Társaságának konferenciája - KÉPAF 2011</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2011</style></year><pub-dates><date><style  face="normal" font="default" size="100%">Jan 2011</style></date></pub-dates></dates><publisher><style face="normal" font="default" size="100%">NJSZT</style></publisher><pub-location><style face="normal" font="default" size="100%">Szeged</style></pub-location><pages><style face="normal" font="default" size="100%">92 - 105</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><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>17</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Péter Kardos</style></author><author><style face="normal" font="default" size="100%">Gábor Németh</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%">Bejárásfüggetlen szekvenciális vékonyítás</style></title><secondary-title><style face="normal" font="default" size="100%">ALKALMAZOTT MATEMATIKAI LAPOK</style></secondary-title><short-title><style face="normal" font="default" size="100%">ALKALMAZOTT MATEMATIKAI LAPOK</style></short-title></titles><dates><year><style  face="normal" font="default" size="100%">2010</style></year><pub-dates><date><style  face="normal" font="default" size="100%">2010</style></date></pub-dates></dates><volume><style face="normal" font="default" size="100%">27</style></volume><pages><style face="normal" font="default" size="100%">17 - 40</style></pages><isbn><style face="normal" font="default" size="100%">0133-3399</style></isbn><language><style face="normal" font="default" size="100%">eng</style></language><issue><style face="normal" font="default" size="100%">1</style></issue><work-type><style face="normal" font="default" size="100%">Journal article</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%">Gábor Németh</style></author><author><style face="normal" font="default" size="100%">Kálmán Palágyi</style></author></authors><secondary-authors><author><style face="normal" font="default" size="100%">Petra Wiederhold</style></author><author><style face="normal" font="default" size="100%">Reneta P Barneva</style></author></secondary-authors></contributors><titles><title><style face="normal" font="default" size="100%">Parallel Thinning Algorithms Based on Ronse's Sufficient Conditions for Topology Preservation</style></title><secondary-title><style face="normal" font="default" size="100%">Progress in Combinatorial Image Analysis</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2010</style></year><pub-dates><date><style  face="normal" font="default" size="100%">May 2010</style></date></pub-dates></dates><urls><web-urls><url><style face="normal" font="default" size="100%">http://rpsonline.com.sg/rpsweb/iwcia09.html</style></url></web-urls></urls><publisher><style face="normal" font="default" size="100%">Scientific Research Publishing Inc.</style></publisher><pub-location><style face="normal" font="default" size="100%">Singapore</style></pub-location><pages><style face="normal" font="default" size="100%">183 - 194</style></pages><language><style face="normal" font="default" size="100%">eng</style></language><work-type><style face="normal" font="default" size="100%">Book chapter</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><secondary-authors><author><style face="normal" font="default" size="100%">B Zagar</style></author><author><style face="normal" font="default" size="100%">A Kuijper</style></author><author><style face="normal" font="default" size="100%">H Sahbi</style></author></secondary-authors></contributors><titles><title><style face="normal" font="default" size="100%">Topology preserving 2-subfield 3D thinning algorithms</style></title><secondary-title><style face="normal" font="default" size="100%">Proceedings of the International Conference on Signal Processing, Pattern Recognition and Applications (SPPRA)</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2010</style></year><pub-dates><date><style  face="normal" font="default" size="100%">Feb 2010</style></date></pub-dates></dates><publisher><style face="normal" font="default" size="100%">IASTED ACTA Press</style></publisher><pub-location><style face="normal" font="default" size="100%">Innsbruck, Austria</style></pub-location><pages><style face="normal" font="default" size="100%">310 - 316</style></pages><language><style face="normal" font="default" size="100%">eng</style></language><abstract><style face="normal" font="default" size="100%">&lt;p&gt;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.&lt;/p&gt;</style></abstract><work-type><style face="normal" font="default" size="100%">Conference paper</style></work-type><notes><style face="normal" font="default" size="100%">ScopusID: 77954590365</style></notes></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%">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><secondary-authors><author><style face="normal" font="default" size="100%">Aurélio Campilho</style></author><author><style face="normal" font="default" size="100%">Mohamed Kamel</style></author></secondary-authors></contributors><titles><title><style face="normal" font="default" size="100%">Topology Preserving 3D Thinning Algorithms using Four and Eight Subfields</style></title><secondary-title><style face="normal" font="default" size="100%">Proceedings of the International Conference on Image Analysis and Recognition (ICIAR)</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%">2010</style></year><pub-dates><date><style  face="normal" font="default" size="100%">June 2010</style></date></pub-dates></dates><publisher><style face="normal" font="default" size="100%">Springer Verlag</style></publisher><pub-location><style face="normal" font="default" size="100%">Póvoa de Varzim, Portugal</style></pub-location><volume><style face="normal" font="default" size="100%">6111</style></volume><pages><style face="normal" font="default" size="100%">316 - 325</style></pages><language><style face="normal" font="default" size="100%">eng</style></language><abstract><style face="normal" font="default" size="100%">&lt;p&gt;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.&lt;/p&gt;</style></abstract><work-type><style face="normal" font="default" size="100%">Conference paper</style></work-type><notes><style face="normal" font="default" size="100%">ScopusID: 77955432947doi: 10.1007/978-3-642-13772-3_32</style></notes></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%">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><secondary-authors><author><style face="normal" font="default" size="100%">Reneta P Barneva</style></author><author><style face="normal" font="default" size="100%">Valentin E Brimkov</style></author><author><style face="normal" font="default" size="100%">Herbert A Hauptman</style></author><author><style face="normal" font="default" size="100%">Renato M Natal Jorge</style></author><author><style face="normal" font="default" size="100%">João Manuel R S Tavares</style></author></secondary-authors></contributors><titles><title><style face="normal" font="default" size="100%">Topology Preserving Parallel Smoothing for 3D Binary Images</style></title><secondary-title><style face="normal" font="default" size="100%">Proceedings of the Computational Modeling of Objects Represented in Images (CMORI)</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2010</style></year><pub-dates><date><style  face="normal" font="default" size="100%">May 2010</style></date></pub-dates></dates><publisher><style face="normal" font="default" size="100%">Springer Verlag</style></publisher><pub-location><style face="normal" font="default" size="100%">Buffalo, USA</style></pub-location><volume><style face="normal" font="default" size="100%">6026</style></volume><pages><style face="normal" font="default" size="100%">287 - 298</style></pages><language><style face="normal" font="default" size="100%">eng</style></language><abstract><style face="normal" font="default" size="100%">&lt;p&gt;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.&lt;/p&gt;</style></abstract><work-type><style face="normal" font="default" size="100%">Conference paper</style></work-type><notes><style face="normal" font="default" size="100%">ScopusID: 77952401887doi: 10.1007/978-3-642-12712-0_26</style></notes></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>17</ref-type><contributors><authors><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%">Conference of PhD Students in Computer Science</style></title><secondary-title><style face="normal" font="default" size="100%">ACTA CYBERNETICA-SZEGED</style></secondary-title><short-title><style face="normal" font="default" size="100%">ACTA CYBERN-SZEGED</style></short-title></titles><dates><year><style  face="normal" font="default" size="100%">2009</style></year><pub-dates><date><style  face="normal" font="default" size="100%">2009///</style></date></pub-dates></dates><volume><style face="normal" font="default" size="100%">19</style></volume><pages><style face="normal" font="default" size="100%">3</style></pages><isbn><style face="normal" font="default" size="100%">0324-721X</style></isbn><language><style face="normal" font="default" size="100%">eng</style></language><issue><style face="normal" font="default" size="100%">1</style></issue></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%">Kálmán Palágyi</style></author><author><style face="normal" font="default" size="100%">Gábor Németh</style></author></authors><secondary-authors><author><style face="normal" font="default" size="100%">Srecko Brlek</style></author><author><style face="normal" font="default" size="100%">Christophe Reutenauer</style></author><author><style face="normal" font="default" size="100%">Xavier Provençal</style></author></secondary-authors></contributors><titles><title><style face="normal" font="default" size="100%">Fully Parallel 3D Thinning Algorithms based on Sufficient Conditions for Topology Preservation</style></title><secondary-title><style face="normal" font="default" size="100%">Proceedings of Discrete Geometry for Computer Imagery (DGCI)</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2009</style></year><pub-dates><date><style  face="normal" font="default" size="100%">Sep 2009</style></date></pub-dates></dates><number><style face="normal" font="default" size="100%">5810</style></number><publisher><style face="normal" font="default" size="100%">Springer Verlag</style></publisher><pub-location><style face="normal" font="default" size="100%">Montreal, Quebec, Canada</style></pub-location><pages><style face="normal" font="default" size="100%">481 - 492</style></pages><isbn><style face="normal" font="default" size="100%">978-3-642-04396-3</style></isbn><language><style face="normal" font="default" size="100%">eng</style></language><abstract><style face="normal" font="default" size="100%">&lt;p&gt;This paper presents a family of parallel thinning algorithms for extracting medial surfaces from 3D binary pictures. The proposed algorithms are based on sufficient conditions for 3D parallel reduction operators to preserve topology for (26,6) pictures. Hence it is self-evident that our algorithms are topology preserving. Their efficient implementation on conventional sequential computers is also presented. © 2009 Springer Berlin Heidelberg.&lt;/p&gt;</style></abstract><work-type><style face="normal" font="default" size="100%">Conference paper</style></work-type><notes><style face="normal" font="default" size="100%">ScopusID: 77952414581doi: 10.1007/978-3-642-04397-0_41</style></notes></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%">Péter Kardos</style></author><author><style face="normal" font="default" size="100%">Gábor Németh</style></author><author><style face="normal" font="default" size="100%">Kálmán Palágyi</style></author></authors><secondary-authors><author><style face="normal" font="default" size="100%">Dmitrij Chetverikov</style></author><author><style face="normal" font="default" size="100%">Tamas Sziranyi</style></author></secondary-authors></contributors><titles><title><style face="normal" font="default" size="100%">Kritikus párokat vizsgáló bejárásfüggetlen szekvenciális vékonyító algoritmus</style></title><secondary-title><style face="normal" font="default" size="100%">A Képfeldolgozók és Alakfelismerők Társaságának konferenciája - KÉPAF 2009</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2009</style></year><pub-dates><date><style  face="normal" font="default" size="100%">Jan 2009</style></date></pub-dates></dates><publisher><style face="normal" font="default" size="100%">Akaprint</style></publisher><pub-location><style face="normal" font="default" size="100%">Budapest</style></pub-location><pages><style face="normal" font="default" size="100%">1 - 8</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><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%">György Kovács</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 Fazekas</style></author></authors><secondary-authors><author><style face="normal" font="default" size="100%">Dmitrij Chetverikov</style></author><author><style face="normal" font="default" size="100%">Tamas Sziranyi</style></author></secondary-authors></contributors><titles><title><style face="normal" font="default" size="100%">A morfológiai váz általánosítása szomszédsági szekvenciákkal</style></title><secondary-title><style face="normal" font="default" size="100%">A Képfeldolgozók és Alakfelismerők Társaságának konferenciája - KÉPAF 2009</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2009</style></year><pub-dates><date><style  face="normal" font="default" size="100%">Jan 2009</style></date></pub-dates></dates><publisher><style face="normal" font="default" size="100%">Akaprint</style></publisher><pub-location><style face="normal" font="default" size="100%">Budapest</style></pub-location><pages><style face="normal" font="default" size="100%">1 - 10</style></pages><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>5</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Péter Kardos</style></author><author><style face="normal" font="default" size="100%">Gábor Németh</style></author><author><style face="normal" font="default" size="100%">Kálmán Palágyi</style></author></authors><secondary-authors><author><style face="normal" font="default" size="100%">Petra Wiederhold</style></author><author><style face="normal" font="default" size="100%">Reneta P Barneva</style></author></secondary-authors></contributors><titles><title><style face="normal" font="default" size="100%">An order-independent sequential thinning algorithm</style></title><secondary-title><style face="normal" font="default" size="100%">Proceedings of the International Workshop on Combinatorial Image Analysis (IWCIA)</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2009</style></year><pub-dates><date><style  face="normal" font="default" size="100%">Nov 2009</style></date></pub-dates></dates><urls><web-urls><url><style face="normal" font="default" size="100%">http://link.springer.com/chapter/10.1007/978-3-642-10210-3_13</style></url></web-urls></urls><number><style face="normal" font="default" size="100%">5852</style></number><publisher><style face="normal" font="default" size="100%">Springer Verlag</style></publisher><pub-location><style face="normal" font="default" size="100%">Playa del Carmen, Mexico</style></pub-location><pages><style face="normal" font="default" size="100%">162 - 175</style></pages><isbn><style face="normal" font="default" size="100%">978-3-642-10208-0</style></isbn><language><style face="normal" font="default" size="100%">eng</style></language><abstract><style face="normal" font="default" size="100%">&lt;p&gt;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.&lt;/p&gt;</style></abstract><work-type><style face="normal" font="default" size="100%">Conference paper</style></work-type><notes><style face="normal" font="default" size="100%">ScopusID: 78650496028doi: 10.1007/978-3-642-10210-3_13</style></notes></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>17</ref-type><contributors><authors><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></authors></contributors><titles><title><style face="normal" font="default" size="100%">Preface to the Special Issue</style></title><secondary-title><style face="normal" font="default" size="100%">DISCRETE APPLIED MATHEMATICS</style></secondary-title><short-title><style face="normal" font="default" size="100%">DISCRETE APPL MATH</style></short-title></titles><dates><year><style  face="normal" font="default" size="100%">2009</style></year><pub-dates><date><style  face="normal" font="default" size="100%">2009///</style></date></pub-dates></dates><volume><style face="normal" font="default" size="100%">157</style></volume><pages><style face="normal" font="default" size="100%">437</style></pages><isbn><style face="normal" font="default" size="100%">0166-218X</style></isbn><language><style face="normal" font="default" size="100%">eng</style></language><issue><style face="normal" font="default" size="100%">3</style></issue><notes><style face="normal" font="default" size="100%">UT: 000262243800001ScopusID: 56649097446doi: 10.1016/j.dam.2008.08.005</style></notes></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>17</ref-type><contributors><authors><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%">A 3D fully parallel surface-thinning algorithm</style></title><secondary-title><style face="normal" font="default" size="100%">THEORETICAL COMPUTER SCIENCE</style></secondary-title><short-title><style face="normal" font="default" size="100%">THEOR COMPUT SCI</style></short-title></titles><dates><year><style  face="normal" font="default" size="100%">2008</style></year><pub-dates><date><style  face="normal" font="default" size="100%">Oct 2008</style></date></pub-dates></dates><publisher><style face="normal" font="default" size="100%">Elsevier</style></publisher><pub-location><style face="normal" font="default" size="100%">AHUJA N, 1997, IEEE T PATTERN ANAL, V19, P169ARCELLI C, 2006, LECT NOTES COMPUT SC, V4245, P555BERTRAND G, 1994, P SPIE C VISION GEOM, V2356, P113BERTRAND G, 1995, CR ACAD SCI I-MATH, V321, P1077BERTRAND G, 1995, P 5 INT C DISCR GEOM, P233BERTRAND G, </style></pub-location><volume><style face="normal" font="default" size="100%">406</style></volume><pages><style face="normal" font="default" size="100%">119 - 135</style></pages><isbn><style face="normal" font="default" size="100%">0304-3975</style></isbn><language><style face="normal" font="default" size="100%">eng</style></language><abstract><style face="normal" font="default" size="100%">&lt;p&gt;The thinning is an iterative layer by layer erosion until only the &quot;skeletons&quot; of the objects are left. This paper presents a thinning algorithm for extracting medial surfaces from 3D binary pictures. The strategy which is used is called fully parallel, which means that the same parallel operator is applied at each iteration. An efficient implementation of the proposed algorithm on conventional sequential computers is given and the topological correctness for (26, 6) binary pictures is proved. © 2008 Elsevier B.V. All rights reserved.&lt;/p&gt;</style></abstract><issue><style face="normal" font="default" size="100%">1-2</style></issue><work-type><style face="normal" font="default" size="100%">Journal article</style></work-type><notes><style face="normal" font="default" size="100%">UT: 000260289400014ScopusID: 51749087902doi: 10.1016/j.tcs.2008.06.041</style></notes></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%">Mihály Gara</style></author><author><style face="normal" font="default" size="100%">Péter Balázs</style></author></authors><secondary-authors><author><style face="normal" font="default" size="100%">Kálmán Palágyi</style></author><author><style face="normal" font="default" size="100%">Balázs Bánhelyi</style></author><author><style face="normal" font="default" size="100%">Tamás Gergely</style></author><author><style face="normal" font="default" size="100%">István Matievics</style></author></secondary-authors></contributors><titles><title><style face="normal" font="default" size="100%">Determination of geometric features of binary images from their projections by using decision trees</style></title><secondary-title><style face="normal" font="default" size="100%">Conference of PhD Students in Computer Science. Volume of Extended Abstracts</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2008</style></year><pub-dates><date><style  face="normal" font="default" size="100%">July 2008</style></date></pub-dates></dates><publisher><style face="normal" font="default" size="100%">University of Szeged</style></publisher><pub-location><style face="normal" font="default" size="100%">Szeged, Hungary</style></pub-location><pages><style face="normal" font="default" size="100%">26</style></pages><language><style face="normal" font="default" size="100%">eng</style></language><work-type><style face="normal" font="default" size="100%">Abstract</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%">Balázs Erdőhelyi</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%">Eörs Máté</style></author><author><style face="normal" font="default" size="100%">Antal Nagy</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></authors><secondary-authors><author><style face="normal" font="default" size="100%">Attila Pethő</style></author><author><style face="normal" font="default" size="100%">Miklós Herdon</style></author></secondary-authors></contributors><titles><title><style face="normal" font="default" size="100%">A képfeldolgozás kutatása a Szegedi Tudományegyetemen</style></title><secondary-title><style face="normal" font="default" size="100%">Informatika a felsőoktatásban 2008</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2008</style></year><pub-dates><date><style  face="normal" font="default" size="100%">2008///</style></date></pub-dates></dates><urls><web-urls><url><style face="normal" font="default" size="100%">http://www.agr.unideb.hu/if2008/kiadvany/papers/E62.pdf</style></url></web-urls></urls><publisher><style face="normal" font="default" size="100%">Debreceni Egyetem Informatikai Kar</style></publisher><pub-location><style face="normal" font="default" size="100%">Debrecen</style></pub-location><language><style face="normal" font="default" size="100%">eng</style></language><abstract><style face="normal" font="default" size="100%">A digitális képfeldolgozás kutatásának a Szegedi TudományegyetemTermészettudományi és Informatikai Karán, az Informatikai 
Tanszékcsoport Képfeldolgozás és Számítógépes Grafika Tanszékén 
közel négy évtizedes hagyománya van.
A Tanszék valamennyi munkatársa nemzetközileg elismert 
kutatómunkát folytat, melyet már több száz rangos publikáció 
fémjelez. Számos, a képfeldolgozás kutatásában vezető egyetemmel 
és kutatóintézettel építettünk ki szoros kapcsolatot és 
folytattunk eredményes kutatómunkát, aktív résztvevői vagyunk a 
hazai és a nemzetközi tudományos közéletnek.
A legfontosabb, jelenleg is folyó kutatásaink: orvosi képek 
feldolgozása, diszkrét tomográfia, képszegmentálás, 
térinformatika, távérzékelés, képregisztráció, vázkijelölés, 
műtéti tervezés.
</style></abstract><notes><style face="normal" font="default" size="100%">Art. No.: E62</style></notes></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%">Attila Fazekas</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%">György Kovács</style></author><author><style face="normal" font="default" size="100%">Gábor Németh</style></author></authors><secondary-authors><author><style face="normal" font="default" size="100%">Antonios Gasteratos</style></author><author><style face="normal" font="default" size="100%">Markus Vincze</style></author><author><style face="normal" font="default" size="100%">John K Tsotsos</style></author></secondary-authors></contributors><titles><title><style face="normal" font="default" size="100%">Skeletonization based on metrical neighborhood sequences</style></title><secondary-title><style face="normal" font="default" size="100%">Computer Vision Systems</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2008</style></year><pub-dates><date><style  face="normal" font="default" size="100%">May 2008</style></date></pub-dates></dates><number><style face="normal" font="default" size="100%">5008</style></number><publisher><style face="normal" font="default" size="100%">Springer Verlag</style></publisher><pub-location><style face="normal" font="default" size="100%">Santorini, Greece</style></pub-location><pages><style face="normal" font="default" size="100%">333 - 342</style></pages><isbn><style face="normal" font="default" size="100%">978-3-540-79546-9</style></isbn><language><style face="normal" font="default" size="100%">eng</style></language><abstract><style face="normal" font="default" size="100%">&lt;p&gt;Skeleton is a shape descriptor which summarizes the general formof objects. It can be expressed in terms of the fundamental morphological operations. The limitation of that characterization is that its construction based on digital disks such that cannot provide good approximation to the Euclidean disks. In this paper we define a new type of skeleton based on neighborhood sequences that is much closer to the Euclidean skeleton. A novel method for quantitative comparison of skeletonization algorithms is also proposed. © 2008 Springer- Verlag Berlin Heidelberg.&lt;/p&gt;</style></abstract><work-type><style face="normal" font="default" size="100%">Conference paper</style></work-type><notes><style face="normal" font="default" size="100%">ScopusID: 44649159529doi: 10.1007/978-3-540-79547-6</style></notes></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%">Erich Sorantin</style></author><author><style face="normal" font="default" size="100%">Emese Balogh</style></author><author><style face="normal" font="default" size="100%">Anna Vilanova Bartroli</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%">László Gábor Nyúl</style></author><author><style face="normal" font="default" size="100%">Franz Lindbichler</style></author><author><style face="normal" font="default" size="100%">Andrea Ruppert</style></author></authors><secondary-authors><author><style face="normal" font="default" size="100%">Emanuele Neri</style></author><author><style face="normal" font="default" size="100%">Davide Caramella</style></author><author><style face="normal" font="default" size="100%">Carlo Bartolozzi</style></author></secondary-authors></contributors><titles><title><style face="normal" font="default" size="100%">Techniques of Virtual Dissection of the Colon Based on Spiral CT Data</style></title><secondary-title><style face="normal" font="default" size="100%">Image Processing in Radiology</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2008</style></year><pub-dates><date><style  face="normal" font="default" size="100%">2008</style></date></pub-dates></dates><publisher><style face="normal" font="default" size="100%">Springer-Verlag</style></publisher><pub-location><style face="normal" font="default" size="100%">Berlin</style></pub-location><pages><style face="normal" font="default" size="100%">257 - 268</style></pages><language><style face="normal" font="default" size="100%">eng</style></language><abstract><style face="normal" font="default" size="100%">&lt;p&gt;Colorectal cancer represents the third most commonly diagnosedcancer and is the second leading cause of cancer deaths in the United States (Gazelle et al. 2000). In addition, colorectal cancer is responsible for about 11% of all new cancer cases per year (Gazelle et al. 2000). Five-year prognosis is about 90% for patients with localized disease compared to 60% if there is a regional spread and a drop to 10% in patients with distant metastasis (Gazelle et al. 2000). In the field of medicine there is a widely accepted opinion that most colorectal cancers arise from pre-existent adenomatous polyps (Johnson 2000). Therefore, different societies, such as the American Cancer Society, have proposed screening for colorectal cancer (Byers et al. 1997; Winawer et al. 1997). Today, different options exist for detection of colorectal cancer, including digital rectal examination, fecal occult blood testing, flexible and rigid sigmoidoscopy, barium enema and its variants, colonoscopy and recently computed tomography or magnetic resonance-based virtual colonography (Gazelle et al. 2000).&lt;/p&gt;</style></abstract><work-type><style face="normal" font="default" size="100%">Book chapter</style></work-type><notes><style face="normal" font="default" size="100%">doi: 10.1007/978-3-540-49830-8_18</style></notes></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%">Kálmán Palágyi</style></author></authors><secondary-authors><author><style face="normal" font="default" size="100%">Walter G Kropatsch</style></author><author><style face="normal" font="default" size="100%">Martin Kampel</style></author><author><style face="normal" font="default" size="100%">Allan Hanbury</style></author></secondary-authors></contributors><titles><title><style face="normal" font="default" size="100%">A 3-subiteration surface-thinning algorithm</style></title><secondary-title><style face="normal" font="default" size="100%">Computer Analysis of Images and Patterns</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%">2007</style></year><pub-dates><date><style  face="normal" font="default" size="100%">Aug 2007</style></date></pub-dates></dates><number><style face="normal" font="default" size="100%">4673</style></number><publisher><style face="normal" font="default" size="100%">Springer Verlag</style></publisher><pub-location><style face="normal" font="default" size="100%">Vienna, Austria</style></pub-location><pages><style face="normal" font="default" size="100%">628 - 635</style></pages><isbn><style face="normal" font="default" size="100%">978-3-540-74271-5</style></isbn><language><style face="normal" font="default" size="100%">eng</style></language><abstract><style face="normal" font="default" size="100%">&lt;p&gt;Thinning is an iterative layer by layer erosion for extractingskeleton. This paper presents an efficient parallel 3D thinning algorithm which produces medial surfaces. A three-subiteration strategy is proposed: the thinning operation is changed from iteration to iteration with a period of three according to the three deletion directions. © Springer-Verlag Berlin Heidelberg 2007.&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%">Kálmán Palágyi</style></author><author><style face="normal" font="default" size="100%">Csaba Pintér</style></author><author><style face="normal" font="default" size="100%">Eörs Máté</style></author></authors><secondary-authors><author><style face="normal" font="default" size="100%">Attila Fazekas</style></author><author><style face="normal" font="default" size="100%">András Hajdú</style></author></secondary-authors></contributors><titles><title><style face="normal" font="default" size="100%">Alakreprezentáció szférikus harmonikus sorfejtéssel</style></title><secondary-title><style face="normal" font="default" size="100%">A Képfeldolgozók és Alakfelismerők Társaságának konferenciája - KÉPAF 2007</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2007</style></year><pub-dates><date><style  face="normal" font="default" size="100%">Jan 2007</style></date></pub-dates></dates><publisher><style face="normal" font="default" size="100%">Képfeldolgozók és Alakfelismerők Társasága</style></publisher><pub-location><style face="normal" font="default" size="100%">Debrecen</style></pub-location><pages><style face="normal" font="default" size="100%">275 - 282</style></pages><language><style face="normal" font="default" size="100%">eng</style></language></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></authors><secondary-authors><author><style face="normal" font="default" size="100%">Attila Fazekas</style></author><author><style face="normal" font="default" size="100%">András Hajdú</style></author></secondary-authors></contributors><titles><title><style face="normal" font="default" size="100%">Efficient Implementation of 3D Thinning Algorithms</style></title><secondary-title><style face="normal" font="default" size="100%">A Képfeldolgozók és Alakfelismerők Társaságának konferenciája - KÉPAF 2007</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2007</style></year><pub-dates><date><style  face="normal" font="default" size="100%">Jan 2007</style></date></pub-dates></dates><publisher><style face="normal" font="default" size="100%">Képfeldolgozók és Alakfelismerők Társasága</style></publisher><pub-location><style face="normal" font="default" size="100%">Debrecen</style></pub-location><pages><style face="normal" font="default" size="100%">266 - 274</style></pages><language><style face="normal" font="default" size="100%">eng</style></language></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%">Kálmán Palágyi</style></author></authors><secondary-authors><author><style face="normal" font="default" size="100%">Fred A Hamprecht</style></author><author><style face="normal" font="default" size="100%">Christoph Schnorr</style></author><author><style face="normal" font="default" size="100%">Bernd Jähne</style></author></secondary-authors></contributors><titles><title><style face="normal" font="default" size="100%">A subiteration-based surface-thinning algorithm with a period of three</style></title><secondary-title><style face="normal" font="default" size="100%">Pattern Recognition</style></secondary-title><tertiary-title><style face="normal" font="default" size="100%">Lecture Notes on 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%">2007</style></year><pub-dates><date><style  face="normal" font="default" size="100%">Sep 2007</style></date></pub-dates></dates><number><style face="normal" font="default" size="100%">4713</style></number><publisher><style face="normal" font="default" size="100%">Springer Verlag</style></publisher><pub-location><style face="normal" font="default" size="100%">Heidelberg, Germany</style></pub-location><pages><style face="normal" font="default" size="100%">294 - 303</style></pages><isbn><style face="normal" font="default" size="100%">978-3-540-74933-2</style></isbn><language><style face="normal" font="default" size="100%">eng</style></language><abstract><style face="normal" font="default" size="100%">&lt;p&gt;Thinning on binary images is an iterative layer by layer erosionuntil only the &quot;skeletons&quot; of the objects are left. This paper presents an efficient parallel 3D surface-thinning algorithm. A three-subiteration strategy is proposed: the thinning operation is changed from iteration to iteration with a period of three according to the three deletion directions. © Springer-Verlag Berlin Heidelberg 2007.&lt;/p&gt;</style></abstract><work-type><style face="normal" font="default" size="100%">Conference paper</style></work-type><notes><style face="normal" font="default" size="100%">ScopusID: 38149004908</style></notes></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%">Stefan Weber</style></author><author><style face="normal" font="default" size="100%">Antal Nagy</style></author><author><style face="normal" font="default" size="100%">Thomas Schulle</style></author><author><style face="normal" font="default" size="100%">Christoph Schnorr</style></author><author><style face="normal" font="default" size="100%">Attila Kuba</style></author></authors><secondary-authors><author><style face="normal" font="default" size="100%">Attila Kuba</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></secondary-authors></contributors><titles><title><style face="normal" font="default" size="100%">A benchmark evaluation of large-scale optimization approaches to binary tomography</style></title><secondary-title><style face="normal" font="default" size="100%">Discrete Geometry for Computer Imagery</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2006</style></year><pub-dates><date><style  face="normal" font="default" size="100%">2006</style></date></pub-dates></dates><publisher><style face="normal" font="default" size="100%">Springer-Verlag</style></publisher><pub-location><style face="normal" font="default" size="100%">Berlin; Heidelberg</style></pub-location><pages><style face="normal" font="default" size="100%">146 - 156</style></pages><language><style face="normal" font="default" size="100%">eng</style></language><notes><style face="normal" font="default" size="100%">UT: 000241649600013doi: 10.1007/11907350_13</style></notes></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>10</ref-type><contributors><secondary-authors><author><style face="normal" font="default" size="100%">Attila Kuba</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></secondary-authors></contributors><titles><title><style face="normal" font="default" size="100%">Discrete Geometry for Computer Imagery</style></title><secondary-title><style face="normal" font="default" size="100%">Discrete Geometry for Computer Imagery</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%">2006</style></year><pub-dates><date><style  face="normal" font="default" size="100%">2006</style></date></pub-dates></dates><urls><web-urls><url><style face="normal" font="default" size="100%">http://www.springerlink.com/content/t38633812l42/</style></url></web-urls></urls><publisher><style face="normal" font="default" size="100%">Springer-Verlag</style></publisher><volume><style face="normal" font="default" size="100%">4245</style></volume><pages><style face="normal" font="default" size="100%">688</style></pages><language><style face="normal" font="default" size="100%">eng</style></language><abstract><style face="normal" font="default" size="100%">&lt;p&gt;This book constitutes the refereed proceedings of the 13th International Conference on Discrete Geometry for Computer Imagery, DGCI 2006, held in Szeged, Hungary in October 2006. The 28 revised full papers and 27 revised poster papers presented together with 2 invited papers were carefully reviewed and selected from 99 submissions. The papers are organized in topical sections on discrete geometry, discrete tomography, discrete topology, distance, image analysis, shape representation, segmentation, skeletonization, as well as surfaces and volumes. &lt;tt&gt; &lt;/tt&gt;&lt;/p&gt;</style></abstract><notes><style face="normal" font="default" size="100%">UT: 000241649600007ScopusID: 33845210215doi: 10.1007/11907350</style></notes></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%">Erich Sorantin</style></author><author><style face="normal" font="default" size="100%">Darius Mohadjer</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%">Franz Lindbichler</style></author><author><style face="normal" font="default" size="100%">Bernhard Geiger</style></author></authors><secondary-authors><author><style face="normal" font="default" size="100%">Walter Hruby</style></author></secondary-authors></contributors><titles><title><style face="normal" font="default" size="100%">New advances for imaging laryngo / trachealstenosis by post processing of spiral-CT data</style></title><secondary-title><style face="normal" font="default" size="100%">Digital (r)evolution in radiology</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2006</style></year><pub-dates><date><style  face="normal" font="default" size="100%">2006///</style></date></pub-dates></dates><publisher><style face="normal" font="default" size="100%">Springer-Verlag</style></publisher><pub-location><style face="normal" font="default" size="100%">Wien; New York</style></pub-location><pages><style face="normal" font="default" size="100%">297 - 308</style></pages><language><style face="normal" font="default" size="100%">eng</style></language></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></authors><secondary-authors><author><style face="normal" font="default" size="100%">Attila Kuba</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></secondary-authors></contributors><titles><title><style face="normal" font="default" size="100%">The number of line-convex directed polyominoes having the same orthogonal projections</style></title><secondary-title><style face="normal" font="default" size="100%">Discrete Geometry for Computer Imagery</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2006</style></year><pub-dates><date><style  face="normal" font="default" size="100%">2006///</style></date></pub-dates></dates><publisher><style face="normal" font="default" size="100%">Springer-Verlag</style></publisher><pub-location><style face="normal" font="default" size="100%">Berlin, Heidelberg</style></pub-location><pages><style face="normal" font="default" size="100%">77 - 85</style></pages><language><style face="normal" font="default" size="100%">eng</style></language><abstract><style face="normal" font="default" size="100%">&lt;p&gt;The number of line-convex directed polyominoes with givenhorizontal and vertical projections is studied. It is proven that diagonally convex directed polyominoes are uniquely determined by their orthogonal projections. The proof of this result is algorithmical. As a counterpart, we show that ambiguity can be exponential if antidiagonal convexity is assumed about the polyomino. Then, the results are generalised to polyominoes having convexity property along arbitrary lines. © Springer-Verlag Berlin Heidelberg 2006.&lt;/p&gt;</style></abstract><notes><style face="normal" font="default" size="100%">UT: 000241649600007ScopusID: 33845210215</style></notes></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>17</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%">Juerg Tschirren</style></author><author><style face="normal" font="default" size="100%">Eric A Hoffman</style></author><author><style face="normal" font="default" size="100%">Milan Sonka</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">Quantitative analysis of pulmonary airway tree structures</style></title><secondary-title><style face="normal" font="default" size="100%">COMPUTERS IN BIOLOGY AND MEDICINE</style></secondary-title><short-title><style face="normal" font="default" size="100%">COMPUT BIOL MED</style></short-title></titles><dates><year><style  face="normal" font="default" size="100%">2006</style></year><pub-dates><date><style  face="normal" font="default" size="100%">2006///</style></date></pub-dates></dates><pub-location><style face="normal" font="default" size="100%">ANTIGA L, 2003, IEEE T MED IMAGING, V22, P674, DOI10.1109/TMI.2003.812261
AYLWARD SR, 2002, IEEE T MED IMAGING, V21, P61
BLAND JM, 1986, LANCET, V1, P307
BORGEFORS G, 1984, COMPUT VISION GRAPH, V27, P321
BOUIX S, 2003, IEEE C COMP VIS PATT, P449
CHEN ZK, </style></pub-location><volume><style face="normal" font="default" size="100%">36</style></volume><pages><style face="normal" font="default" size="100%">974 - 996</style></pages><isbn><style face="normal" font="default" size="100%">0010-4825</style></isbn><language><style face="normal" font="default" size="100%">eng</style></language><abstract><style face="normal" font="default" size="100%">A method for computationally efficient skeletonization of three-dimensional tubular structures is reported. The method is specifically targeting skeletonization of vascular and airway tree structures in medical images but it is general and applicable to many other skeletonization tasks. The developed approach builds on the following novel concepts and properties: fast curve-thinning algorithm to increase computational speed, endpoint re-checking to avoid generation of spurious side branches, depth-and-length sensitive pruning, and exact tree-branch partitioning allowing branch volume and surface measurements. The method was validated in computer and physical phantoms and in vivo CT scans of human lungs. The validation studies demonstrated sub-voxel accuracy of branch point positioning, insensitivity to changes of object orientation, and high reproducibility of derived quantitative indices of the tubular structures offering a significant improvement over previously reported methods (p ≪ 0.001). © 2005 Elsevier Ltd. All rights reserved.</style></abstract><issue><style face="normal" font="default" size="100%">9</style></issue><notes><style face="normal" font="default" size="100%">UT: 000239889900004ScopusID: 33746349840doi: 10.1016/j.compbiomed.2005.05.004</style></notes></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%">Kálmán Palágyi</style></author></authors><secondary-authors><author><style face="normal" font="default" size="100%">Dmitrij Chetverikov</style></author><author><style face="normal" font="default" size="100%">László Czúni</style></author><author><style face="normal" font="default" size="100%">Markus Vincze</style></author></secondary-authors></contributors><titles><title><style face="normal" font="default" size="100%">A 2-Subfield 3D Thinning Algorithm for Extracting Medial Curves</style></title><secondary-title><style face="normal" font="default" size="100%">Joint Hungarian-Austrian conference on image processing and pattern recognition. 5th conference of the Hungarian Association for Image Processing and Pattern Recognition (KÉPAF), 29th workshop of the Austrian Association for Pattern Reco</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2005</style></year><pub-dates><date><style  face="normal" font="default" size="100%">2005///</style></date></pub-dates></dates><publisher><style face="normal" font="default" size="100%">OCG</style></publisher><pub-location><style face="normal" font="default" size="100%">Vienna</style></pub-location><pages><style face="normal" font="default" size="100%">135 - 142</style></pages><language><style face="normal" font="default" size="100%">eng</style></language></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>17</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Juerg Tschirren</style></author><author><style face="normal" font="default" size="100%">Geoffrey McLennan</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%">Eric A Hoffman</style></author><author><style face="normal" font="default" size="100%">Milan Sonka</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">Matching and anatomical labeling of human airway tree</style></title><secondary-title><style face="normal" font="default" size="100%">IEEE TRANSACTIONS ON MEDICAL IMAGING</style></secondary-title><short-title><style face="normal" font="default" size="100%">IEEE T MED IMAGING</style></short-title></titles><dates><year><style  face="normal" font="default" size="100%">2005</style></year><pub-dates><date><style  face="normal" font="default" size="100%">2005///</style></date></pub-dates></dates><pub-location><style face="normal" font="default" size="100%">BALLARD DH, 1982, COMPUTER VISIONBOYDEN EA, 1955, SEGMENTAL ANATOMY LU
CARRAGHAN R, 1990, OPER RES LETT, V9, P375
GAREY MR, 1979, COMPUTERS INTRACTABI
KITAOKA H, 2002, P MICCAI 2002 TOKYO, P1
MORI K, 2000, IEEE T MED IMAGING, V19, P103
PALAGYI K, 2003, LE</style></pub-location><volume><style face="normal" font="default" size="100%">24</style></volume><pages><style face="normal" font="default" size="100%">1540 - 1547</style></pages><isbn><style face="normal" font="default" size="100%">0278-0062</style></isbn><language><style face="normal" font="default" size="100%">eng</style></language><abstract><style face="normal" font="default" size="100%">Matching of corresponding branchpoints between two human airway trees, as well as assigning anatomical names to the segments and branchpoints of the human airway tree, are of significant interest for clinical applications and physiological studies. In the past, these tasks were often performed manually due to the lack of automated algorithms that can tolerate false branches and anatomical variability typical for in vivo trees. In this paper, we present algorithms that perform both matching of branchpoints and anatomical labeling of in vivo trees without any human intervention and within a short computing time. No hand-pruning of false branches is required. The results from the automated methods show a high degree of accuracy when validated against reference data provided by human experts. 92.9% of the verifiable branchpoint matches found by the computer agree with experts' results. For anatomical labeling, 97.1 % of the automatically assigned segment labels were found to be correct. © 2005 IEEE.</style></abstract><issue><style face="normal" font="default" size="100%">12</style></issue><notes><style face="normal" font="default" size="100%">UT: 000233779000002ScopusID: 29144483584doi: 10.1109/TMI.2005.857653</style></notes></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%">Erich Sorantin</style></author><author><style face="normal" font="default" size="100%">Darius Mohadjer</style></author><author><style face="normal" font="default" size="100%">Franz Lindbichler</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%">Bernhard Geiger</style></author></authors><secondary-authors><author><style face="normal" font="default" size="100%">Cornelius T Leondes</style></author></secondary-authors></contributors><titles><title><style face="normal" font="default" size="100%">Techniques in 3D Assessment of Tracheal-Stenosis by the Mean of Spiral Computed Tomography (S-CT) and Their Applications</style></title><secondary-title><style face="normal" font="default" size="100%">Medical Imaging Systems Technology</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2005</style></year><pub-dates><date><style  face="normal" font="default" size="100%">2005///</style></date></pub-dates></dates><publisher><style face="normal" font="default" size="100%">World Scientific</style></publisher><pub-location><style face="normal" font="default" size="100%">Singapore</style></pub-location><pages><style face="normal" font="default" size="100%">61 - 80</style></pages><language><style face="normal" font="default" size="100%">eng</style></language><abstract><style face="normal" font="default" size="100%">Endotracheal intubation is the most common cause of Laryngo-Tracheal Stenoses (LTS), followed by trauma and prior airway 
surgery.1–3 In rare cases LTS may have resulted also from 
inhalation injuries, gastro-esophageal reflux disease, neoplasia 
and autoimmune diseases like Wegeners granulomatosis or 
relapsing polychondritis.1,4 In pediatric patients vascular 
compression of the trachea is a common cause of tracheal 
indentations.5 Clinical management of these conditions requires 
information on localization, grade, length and dynamics of the 
stenosis. Exact LTS information is necessary, since stenoses 
with a length less than 1.0 cm can be treated by an endoscopic 
surgery.6,7 Besides Fiberoptic Endoscopy (FE), which represents 
the gold standard for airway evaluation, imaging modalities like 
conventional radiography, fluoroscopy, tracheal tomograms, 
Magnetic Resonance Imaging (MRI) and above all Spiral Computed 
Tomography (S-CT) are an essential part of the clinical work.1,8 
S-CT and the recent introduction of multislice imaging allows 
volumetric data acquisition of the Laryngo–Tracheal Tract (LTT) 
during a short time span. Decreased motion artifacts and 
increased spatial resolution form the basis for high quality 
post processing.9,10 The improved performance of today's 
workstations permits the use of sophisticated post processing 
algorithms even on standard hardware like personal computers. 
Thus real time 3D display and virtual endoscopic views (virtual 
endoscopy) are just one mouse click away. Other algorithms 
compute the medial axis of tubular structures like airways or 
vessels in 3D, which can be used for the calculation of 3D cross 
sectional profiles for better demonstration of caliber 
changes.11 Thus display of S-CT axial source images is moving 
rapidly to 3D display. Moreover, established network connections 
within and between institutions allows telemedical cooperation. 
Web technologies offer an easy to use way for information 
exchange. The objective of this paper is to present an overview 
on 3D display and quantification of LTS as well as to provide 
information how these results can be presented and shared with 
the referring physicians on the hospitals computer network. This 
article is structured in seven parts; namely: S-CT data 
acquisition for LTS imaging; selected 3D image post processing 
algorithms; 3D display; Virtual endoscopy; Objective LTS degree 
and length estimation using LTT 3D — cross-sectional profiles; 
Intranet applications; and a conclusion is drawn in the final 
section.
</style></abstract><notes><style face="normal" font="default" size="100%">doi: 10.1142/9789812701077_0003</style></notes></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>17</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%">Juerg Tschirren</style></author><author><style face="normal" font="default" size="100%">Eric A Hoffman</style></author><author><style face="normal" font="default" size="100%">Milan Sonka</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">Assessment of intrathoracic airway trees: Methods and in vivo validation</style></title><secondary-title><style face="normal" font="default" size="100%">LECTURE NOTES IN COMPUTER SCIENCE</style></secondary-title><short-title><style face="normal" font="default" size="100%">LECT NOTES COMPUT SCI</style></short-title></titles><dates><year><style  face="normal" font="default" size="100%">2004</style></year><pub-dates><date><style  face="normal" font="default" size="100%">2004///</style></date></pub-dates></dates><pub-location><style face="normal" font="default" size="100%">BLAND JM, 1986, LANCET, V1, P307CHEN ZK, 2003, COMPUT MED IMAG GRAP, V27, P469, DOI
10.1016/S0895-6111(03)00039-9
GERIG G, 1993, LECT NOTES COMPUTER, V687, P94
KITAOKA H, 1999, J APPL PHYSIOL, V87, P2207
KONG TY, 1989, COMPUT VISION GRAPH, V48, P357
MADDA</style></pub-location><volume><style face="normal" font="default" size="100%">3117</style></volume><pages><style face="normal" font="default" size="100%">341 - 352</style></pages><isbn><style face="normal" font="default" size="100%">0302-9743</style></isbn><language><style face="normal" font="default" size="100%">eng</style></language><notes><style face="normal" font="default" size="100%">UT: 000224372600029doi: 10.1007/978-3-540-27816-0_29Milan Sonka, Ioannis A. Kakadiaris, Jan Kybic (eds.)Computer Vision and Mathematical Methods in Medical and Biomedical Image Analysis 
ECCV 2004 Workshops CVAMIA and MMBIA, Prague, Czech Republic, May 15, 2004 
Revised Selected Papers 
Berlin; Heidelberg; New York : Springer,2004 
DOI: 10.1007/b98995
</style></notes></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></authors><secondary-authors><author><style face="normal" font="default" size="100%">Zoltán Gácsi</style></author><author><style face="normal" font="default" size="100%">Péter Barkóczy</style></author><author><style face="normal" font="default" size="100%">Gábor Sárközi</style></author></secondary-authors></contributors><titles><title><style face="normal" font="default" size="100%">Légutak vizsgálata 3D CT-képeken</style></title><secondary-title><style face="normal" font="default" size="100%">A Képfeldolgozók és Alakfelismerők Társaságának konferenciája - KÉPAF 2004</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2004</style></year><pub-dates><date><style  face="normal" font="default" size="100%">Jan 2004</style></date></pub-dates></dates><publisher><style face="normal" font="default" size="100%">Neumann János Számítógép-tudományi Társaság</style></publisher><pub-location><style face="normal" font="default" size="100%">Miskolc</style></pub-location><pages><style face="normal" font="default" size="100%">232 - 236</style></pages><language><style face="normal" font="default" size="100%">eng</style></language></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%">Reinhardt Beichel</style></author><author><style face="normal" font="default" size="100%">Thomas Pock</style></author><author><style face="normal" font="default" size="100%">Christian Janko</style></author><author><style face="normal" font="default" size="100%">Roman B Zotter</style></author><author><style face="normal" font="default" size="100%">Bernhard Reitinger</style></author><author><style face="normal" font="default" size="100%">Alexander Bornik</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%">Erich Sorantin</style></author><author><style face="normal" font="default" size="100%">Georg Werkgartner</style></author><author><style face="normal" font="default" size="100%">Horst Bischof</style></author><author><style face="normal" font="default" size="100%">Milan Sonka</style></author></authors><secondary-authors><author><style face="normal" font="default" size="100%">J Michael Fitzpatrick</style></author><author><style face="normal" font="default" size="100%">Milan Sonka</style></author></secondary-authors></contributors><titles><title><style face="normal" font="default" size="100%">Liver segment approximation in CT data for surgical resection planning</style></title><secondary-title><style face="normal" font="default" size="100%">Medical Imaging 2004: Image Processing</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2004</style></year><pub-dates><date><style  face="normal" font="default" size="100%">2004///</style></date></pub-dates></dates><publisher><style face="normal" font="default" size="100%">SPIE</style></publisher><pub-location><style face="normal" font="default" size="100%">Bellingham; WashingtonScheele, J., Anatomical and atypical liver resection (2001) Chirurg, 72 (2), pp. 113-124;Couinaud, C., (1957) Le Foie - Etudes Anatomiques et Chirurgicales, , Masson, Paris; 
Strunk, H., Stuckmann, G., Textor, J., Willinek, W., Limit</style></pub-location><pages><style face="normal" font="default" size="100%">1435 - 1446</style></pages><language><style face="normal" font="default" size="100%">eng</style></language><abstract><style face="normal" font="default" size="100%">Surgical planning of liver tumor resections requires detailed three-dimensional (3D) understanding of the complex arrangement of vasculature, liver segments and tumors. Knowledge about location and sizes of liver segments is important for choosing an optimal surgical resection approach and predicting postoperative residual liver capacity. The aim of this work is to facilitate such surgical planning process by developing a robust method for portal vein tree segmentation. The work also investigates the impact of vessel segmentation on the approximation of liver segment volumes. For segment approximation, smaller portal vein branches are of importance. Small branches, however, are difficult to segment due to noise and partial volume effects. Our vessel segmentation is based on the original gray-values and on the result of a vessel enhancement filter. Validation of the developed portal vein segmentation method in computer generated phantoms shows that, compared to a conventional approach, more vessel branches can be segmented. Experiments with in vivo acquired liver CT data sets confirmed this result. The outcome of a Nearest Neighbor liver segment approximation method applied to phantom data demonstrates, that the proposed vessel segmentation approach translates into a more accurate segment partitioning.</style></abstract><notes><style face="normal" font="default" size="100%">ScopusID: 5644267870doi: 10.1117/12.535514</style></notes></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%">Antal Nagy</style></author><author><style face="normal" font="default" size="100%">Emese Balogh</style></author><author><style face="normal" font="default" size="100%">Mariann Dudásné Nagy</style></author><author><style face="normal" font="default" size="100%">Attila Kuba</style></author><author><style face="normal" font="default" size="100%">Eörs Máté</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%">Endre Katona</style></author><author><style face="normal" font="default" size="100%">Zoltan Kato</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%">Attila Tanacs</style></author></authors><secondary-authors><author><style face="normal" font="default" size="100%">Zoltán Gácsi</style></author><author><style face="normal" font="default" size="100%">Péter Barkóczy</style></author><author><style face="normal" font="default" size="100%">Gábor Sárközi</style></author></secondary-authors></contributors><titles><title><style face="normal" font="default" size="100%">Számítógépes képfeldolgozás oktatása a Szegedi Tudományegyetemen</style></title><secondary-title><style face="normal" font="default" size="100%">A Képfeldolgozók és Alakfelismerők Társaságának konferenciája - KÉPAF 2004</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2004</style></year><pub-dates><date><style  face="normal" font="default" size="100%">Jan 2004</style></date></pub-dates></dates><publisher><style face="normal" font="default" size="100%">Neumann János Számítógép-tudományi Társaság</style></publisher><pub-location><style face="normal" font="default" size="100%">Miskolc</style></pub-location><pages><style face="normal" font="default" size="100%">191 - 196</style></pages><language><style face="normal" font="default" size="100%">eng</style></language><abstract><style face="normal" font="default" size="100%">&lt;p&gt;Az SZTE Informatikai Tanszékcsoportja által gondozott szakoktanterveiben 1993 óta szerepel a képfeldolgozás és alkalmazásainak oktatása. A kreditrendszer bevezetésével a Képfeldolgozás I. tárgy kötelező az ötéves képzésben részt vevő informatikus hallgatóknak. Ezen felül a választható szakirányok között szintén szerepel a Képfeldolgozás szakirány. A szakirányon belül különböző képpfeldolgozási területeket tárgyaló kurzusok épülnek egymásra. Az elméleti megalapozás mellett a képfeldolgozás alkalmazásaira is nagy hangsúlyt fektetünk. A kutatások illetve az orvosi alkalmazások fejlesztése során szerzett eredményeket a kötelező jellegű tárgyak mellett speciálkollégiumok keretében építjül be az otkatási anyagba. Számos hallgatónk választ a képfeldolgzás területéről témát a diplomamunkájához, dolgozataikkal rendszeresen és sikerrel szerepelnek az OTDK-n. Hallgatóink évente több hónapot tölthetnek külföldi partneregyetemeinken, ahol a kutató- és fejlesztőmunka mellett nálunk is elfogadott kurzusokat teljesíthetnek. A képfeldolgozás témakörön belül &quot;ipari&quot; projekt munkákban is egyre több hallgató vesz részt. A doktori programon belül is meghirdetünk képfeldolgozáshoz kapcsolódó kutatási irányokat. Az évente megrendezésre kerülő, 11-éves múltra visszatekintő Képfeldolgozó Nyári Iskolának (SSIP) eddig hatszor adott otthont Szeged. A rendszvénysorozat kiemelkedő fontosságú nemzetközi fórum hallgatóink és oktatóink számára is.&lt;/p&gt;</style></abstract></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>17</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Erich Sorantin</style></author><author><style face="normal" font="default" size="100%">Csongor Halmai</style></author><author><style face="normal" font="default" size="100%">Balázs Erdőhelyi</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%">László Gábor Nyúl</style></author><author><style face="normal" font="default" size="100%">Krisztián Ollé</style></author><author><style face="normal" font="default" size="100%">Franz Lindbichler</style></author><author><style face="normal" font="default" size="100%">Gerhard Friedrich</style></author><author><style face="normal" font="default" size="100%">Karl Kiesler</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">3D cross section of the laryngotracheal tract. A new method for visualization and quantification of tracheal stenoses</style></title><secondary-title><style face="normal" font="default" size="100%">RADIOLOGE</style></secondary-title><short-title><style face="normal" font="default" size="100%">RADIOLOGE</style></short-title></titles><dates><year><style  face="normal" font="default" size="100%">2003</style></year><pub-dates><date><style  face="normal" font="default" size="100%">2003///</style></date></pub-dates></dates><volume><style face="normal" font="default" size="100%">43</style></volume><pages><style face="normal" font="default" size="100%">1056 - 1068</style></pages><isbn><style face="normal" font="default" size="100%">0033-832X</style></isbn><language><style face="normal" font="default" size="100%">eng</style></language><abstract><style face="normal" font="default" size="100%">PURPOSE: Demonstration of a technique for 3D assessment oftracheal stenoses, regarding site, length and degree, based on 
spiral computed tomography (S-CT). PATIENTS AND METHODS: S-CT 
scanning and automated segmentation of the laryngo-tracheal 
tract (LTT) was followed by the extraction of the LTT medial 
axis using a skeletonisation algorithm. Orthogonal to the medial 
axis the LTT 3D cross sectional profile was computed and 
presented as line charts, where degree and length were obtained. 
Values for both parameters were compared between 36 patients and 
18 normal controls separately. Accuracy and precision was 
derived from 17 phantom studies. RESULTS: Average degree and 
length of tracheal stenoses were found to be 60.5% and 4.32 cm 
in patients compared to minor caliber changes of 8.8% and 2.31 
cm in normal controls (p &lt;0.005). For the phantoms an excellent 
correlation between the true and computed 3D cross sectional 
profile was found (p &lt;0.005) and an accuracy for length and 
degree measurements of 2.14 mm and 2.53% respectively could be 
determined. The corresponding figures for the precision were 
found to be 0.92 mm and 2.56%. CONCLUSION: LTT 3D cross 
sectional profiles permit objective, accurate and precise 
assessment of LTT caliber changes. Minor LTT caliber changes can 
be observed even in normals and, in case of an otherwise normal 
S-CT study, can be regarded as artefacts.
</style></abstract><issue><style face="normal" font="default" size="100%">12</style></issue><notes><style face="normal" font="default" size="100%">UT: 000188058500005ScopusID: 9144241258doi: 10.1007/s00117-003-0990-8</style></notes></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>17</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Erich Sorantin</style></author><author><style face="normal" font="default" size="100%">Csongor Halmai</style></author><author><style face="normal" font="default" size="100%">Balázs Erdőhelyi</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%">László Gábor Nyúl</style></author><author><style face="normal" font="default" size="100%">Krisztián Ollé</style></author><author><style face="normal" font="default" size="100%">Franz Lindbichler</style></author><author><style face="normal" font="default" size="100%">Gerhard Friedrich</style></author><author><style face="normal" font="default" size="100%">Karl Kiesler</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">3D cross section of the laryngotracheal tract. A new method for visualization and quantification of tracheal stenoses</style></title><secondary-title><style face="normal" font="default" size="100%">RADIOLOGE</style></secondary-title><short-title><style face="normal" font="default" size="100%">RADIOLOGE</style></short-title></titles><dates><year><style  face="normal" font="default" size="100%">2003</style></year><pub-dates><date><style  face="normal" font="default" size="100%">2003///</style></date></pub-dates></dates><volume><style face="normal" font="default" size="100%">43</style></volume><pages><style face="normal" font="default" size="100%">1056 - 1068</style></pages><isbn><style face="normal" font="default" size="100%">0033-832X</style></isbn><language><style face="normal" font="default" size="100%">eng</style></language><abstract><style face="normal" font="default" size="100%">PURPOSE: Demonstration of a technique for 3D assessment oftracheal stenoses, regarding site, length and degree, based on 
spiral computed tomography (S-CT). PATIENTS AND METHODS: S-CT 
scanning and automated segmentation of the laryngo-tracheal 
tract (LTT) was followed by the extraction of the LTT medial 
axis using a skeletonisation algorithm. Orthogonal to the medial 
axis the LTT 3D cross sectional profile was computed and 
presented as line charts, where degree and length were obtained. 
Values for both parameters were compared between 36 patients and 
18 normal controls separately. Accuracy and precision was 
derived from 17 phantom studies. RESULTS: Average degree and 
length of tracheal stenoses were found to be 60.5% and 4.32 cm 
in patients compared to minor caliber changes of 8.8% and 2.31 
cm in normal controls (p &lt;0.005). For the phantoms an excellent 
correlation between the true and computed 3D cross sectional 
profile was found (p &lt;0.005) and an accuracy for length and 
degree measurements of 2.14 mm and 2.53% respectively could be 
determined. The corresponding figures for the precision were 
found to be 0.92 mm and 2.56%. CONCLUSION: LTT 3D cross 
sectional profiles permit objective, accurate and precise 
assessment of LTT caliber changes. Minor LTT caliber changes can 
be observed even in normals and, in case of an otherwise normal 
S-CT study, can be regarded as artefacts.
</style></abstract><issue><style face="normal" font="default" size="100%">12</style></issue><notes><style face="normal" font="default" size="100%">UT: 000188058500005ScopusID: 9144241258doi: 10.1007/s00117-003-0990-8</style></notes></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>17</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Sorantin, Erich.</style></author><author><style face="normal" font="default" size="100%">Halmai, Csongor.</style></author><author><style face="normal" font="default" size="100%">Balázs Erdőhelyi</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%">László Gábor Nyúl</style></author><author><style face="normal" font="default" size="100%">Ollé, Krisztián.</style></author><author><style face="normal" font="default" size="100%">Geiger, B.</style></author><author><style face="normal" font="default" size="100%">Lindbichler, F.</style></author><author><style face="normal" font="default" size="100%">Friedrich, G.</style></author><author><style face="normal" font="default" size="100%">Kiesler, K.</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">3D-Querschnittsprofil des Laryngotrachealtrakts—Eine neue Methode zur Visualisierung und Quantifizierung von Trachealstenosen</style></title><secondary-title><style face="normal" font="default" size="100%">Der Radiologe</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2003</style></year><pub-dates><date><style  face="normal" font="default" size="100%">2003</style></date></pub-dates></dates><urls><web-urls><url><style face="normal" font="default" size="100%">http://dx.doi.org/10.1007/s00117-003-0990-8</style></url></web-urls></urls><publisher><style face="normal" font="default" size="100%">Springer-Verlag</style></publisher><volume><style face="normal" font="default" size="100%">43</style></volume><pages><style face="normal" font="default" size="100%">1056-1068</style></pages><language><style face="normal" font="default" size="100%">eng</style></language><abstract><style face="normal" font="default" size="100%">&lt;div class=&quot;abstract-content formatted&quot; itemprop=&quot;description&quot;&gt;&lt;h3 class=&quot;a-plus-plus&quot;&gt;Purpose&lt;/h3&gt;&lt;p class=&quot;a-plus-plus&quot;&gt;Demonstration of a technique for 3D assessment of tracheal stenoses, regarding site, length and degree, based on spiral computed tomography (S-CT).&lt;/p&gt;&lt;h3 class=&quot;a-plus-plus&quot;&gt;Patients and Methods&lt;/h3&gt;&lt;p class=&quot;a-plus-plus&quot;&gt;S-CT scanning and automated segmentation of the laryngo-tracheal tract (LTT) was followed by the extraction of the LTT medial axis using a skeletonisation algorithm. Orthogonal to the medial axis the LTT 3D cross sectional profile was computed and presented as line charts, where degree and length were obtained. Values for both parameters were compared between 36&amp;nbsp;patients and 18 normal controls separately. Accuracy and precision was derived from 17 phantom studies.&lt;/p&gt;&lt;h3 class=&quot;a-plus-plus&quot;&gt;Results&lt;/h3&gt;&lt;p class=&quot;a-plus-plus&quot;&gt;Average degree and length of tracheal stenoses were found to be 60.5% and 4.32&amp;nbsp;cm in patients compared to minor caliber changes of 8.8% and 2.31&amp;nbsp;cm in normal controls (p &amp;lt;0.005). For the phantoms an excellent correlation between the true and computed 3D cross sectional profile was found (p &amp;lt;0.005) and an accuray for length and degree measurements of 2.14&amp;nbsp;mm and 2.53% respectively could be determined. The corresponding figures for the precision were found to be 0.92&amp;nbsp;mm and 2.56%.&lt;/p&gt;&lt;h3 class=&quot;a-plus-plus&quot;&gt;Conclusion&lt;/h3&gt;&lt;p class=&quot;a-plus-plus&quot;&gt;LTT 3D cross sectional profiles permit objective, accurate and precise assessment of LTT caliber changes. Minor LTT caliber changes can be observed even in normals and, in case of an otherwise normal S-CT study, can be regarded as artefacts.&lt;/p&gt;&lt;/div&gt;&lt;p&gt;&amp;nbsp;&lt;/p&gt;</style></abstract><work-type><style face="normal" font="default" size="100%">Journal Article</style></work-type></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>17</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Eric A Hoffman</style></author><author><style face="normal" font="default" size="100%">Joseph M Reinhardt</style></author><author><style face="normal" font="default" size="100%">Milan Sonka</style></author><author><style face="normal" font="default" size="100%">Brett A Simon</style></author><author><style face="normal" font="default" size="100%">Junfeng Guo</style></author><author><style face="normal" font="default" size="100%">Osama Saba</style></author><author><style face="normal" font="default" size="100%">Deokiee Chon</style></author><author><style face="normal" font="default" size="100%">Shaher Samrah</style></author><author><style face="normal" font="default" size="100%">Hidenori Shikata</style></author><author><style face="normal" font="default" size="100%">Juerg Tschirren</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%">Kenneth C Beck</style></author><author><style face="normal" font="default" size="100%">Geoffrey McLennan</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">Characterization of the interstitial lung diseases via density-based and texture-based analysis of computed tomography images of lung structure and function</style></title><secondary-title><style face="normal" font="default" size="100%">ACADEMIC RADIOLOGY</style></secondary-title><short-title><style face="normal" font="default" size="100%">ACAD RADIOL</style></short-title></titles><dates><year><style  face="normal" font="default" size="100%">2003</style></year><pub-dates><date><style  face="normal" font="default" size="100%">2003///</style></date></pub-dates></dates><pub-location><style face="normal" font="default" size="100%">BAE KT, 1997, RADIOLOGY, V203, P705BENTLEY MD, 1994, CIRC RES, V74, P945
CHULHO W, 2003, J APPL PHYSIOL, V94, P2483
CLARKE LP, 2001, ACAD RADIOL, V8, P447
COXSON H, 2003, AM J RESP CRIT CARE, V167, A81
COXSON H, 2003, AM J RESP CRIT CARE, V167, A81
COXSON</style></pub-location><volume><style face="normal" font="default" size="100%">10</style></volume><pages><style face="normal" font="default" size="100%">1104 - 1118</style></pages><isbn><style face="normal" font="default" size="100%">1076-6332</style></isbn><language><style face="normal" font="default" size="100%">eng</style></language><issue><style face="normal" font="default" size="100%">10</style></issue><notes><style face="normal" font="default" size="100%">UT: 000185944700005doi: 10.1016/S1076-6332(03)00330-1Workshop on Pulmonary Functional ImagingJUN, 2002
PHILADELPHIA, PENNSYLVANIA
</style></notes></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%">Kálmán Palágyi</style></author><author><style face="normal" font="default" size="100%">Juerg Tschirren</style></author><author><style face="normal" font="default" size="100%">Milan Sonka</style></author></authors><secondary-authors><author><style face="normal" font="default" size="100%">C Taylor</style></author><author><style face="normal" font="default" size="100%">J A Noble</style></author></secondary-authors></contributors><titles><title><style face="normal" font="default" size="100%">Quantitative analysis of intrathoracic airway trees: Methods and validation</style></title><secondary-title><style face="normal" font="default" size="100%">INFORMATION PROCESSING IN MEDICAL IMAGING, PROCEEDINGS</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2003</style></year><pub-dates><date><style  face="normal" font="default" size="100%">2003///</style></date></pub-dates></dates><publisher><style face="normal" font="default" size="100%">Springer Verlag</style></publisher><pub-location><style face="normal" font="default" size="100%">Berlin; HeidelbergBLAND JM, 1986, LANCET, V1, P307BORGEFORS G, 1984, COMPUT VISION GRAPH, V27, P321
CORMEN TH, 1990, INTRO ALGORITHMS
GONZALES RC, 1992, DIGITAL IMAGE PROCES
KITAOKA H, 1999, J APPL PHYSIOL, V87, P2207
KONG TY, 1989, COMPUT VISION GRAPH, V</style></pub-location><pages><style face="normal" font="default" size="100%">222 - 233</style></pages><language><style face="normal" font="default" size="100%">eng</style></language><notes><style face="normal" font="default" size="100%">UT: 000185604900019ScopusID: 29144477913doi: 10.1007/978-3-540-45087-0_19</style></notes></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%">Kálmán Palágyi</style></author><author><style face="normal" font="default" size="100%">Juerg Tschirren</style></author><author><style face="normal" font="default" size="100%">Milan Sonka</style></author></authors><secondary-authors><author><style face="normal" font="default" size="100%">Milan Sonka</style></author><author><style face="normal" font="default" size="100%">J Michael Fitzpatrick</style></author></secondary-authors></contributors><titles><title><style face="normal" font="default" size="100%">Quantitative analysis of three-dimensional tubular tree structures</style></title><secondary-title><style face="normal" font="default" size="100%">Medical Imaging 2003</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2003</style></year><pub-dates><date><style  face="normal" font="default" size="100%">2003///</style></date></pub-dates></dates><urls><web-urls><url><style face="normal" font="default" size="100%">http://spie.org/x648.html?product_id=459268</style></url></web-urls></urls><publisher><style face="normal" font="default" size="100%">SPIE - The International Society for Optical Engineering</style></publisher><pub-location><style face="normal" font="default" size="100%">Bellingham; Washington</style></pub-location><pages><style face="normal" font="default" size="100%">277 - 287</style></pages><language><style face="normal" font="default" size="100%">eng</style></language><notes><style face="normal" font="default" size="100%">doi: 10.1117/12.481127</style></notes></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>17</ref-type><contributors><authors><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%">A 3-subiteration 3D thinning algorithm for extracting medial surfaces</style></title><secondary-title><style face="normal" font="default" size="100%">PATTERN RECOGNITION LETTERS</style></secondary-title><short-title><style face="normal" font="default" size="100%">PATTERN RECOGN LETT</style></short-title></titles><dates><year><style  face="normal" font="default" size="100%">2002</style></year><pub-dates><date><style  face="normal" font="default" size="100%">2002///</style></date></pub-dates></dates><pub-location><style face="normal" font="default" size="100%">BERTRAND G, 1994, P SPIE C VISION GEOM, V2356, P113BERTRAND G, 1995, PATTERN RECOGN LETT, V16, P979
BLUM H, 1967, MODELS PERCEPTION SP, P362
BORGEFORS G, 1984, COMPUT VISION GRAPH, V27, P321
BORGEFORS G, 1999, PATTERN RECOGN, V32, P1225
GERIG G, 1993, LEC</style></pub-location><volume><style face="normal" font="default" size="100%">23</style></volume><pages><style face="normal" font="default" size="100%">663 - 675</style></pages><isbn><style face="normal" font="default" size="100%">0167-8655</style></isbn><language><style face="normal" font="default" size="100%">eng</style></language><issue><style face="normal" font="default" size="100%">6</style></issue><notes><style face="normal" font="default" size="100%">UT: 000174470900005</style></notes></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%">László Almási</style></author><author><style face="normal" font="default" size="100%">Antal Nagy</style></author><author><style face="normal" font="default" size="100%">Zoltán Alexin</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%">Attila Kuba</style></author><author><style face="normal" font="default" size="100%">László Csernay</style></author></authors><secondary-authors><author><style face="normal" font="default" size="100%">Attila Kuba</style></author><author><style face="normal" font="default" size="100%">Eörs Máté</style></author><author><style face="normal" font="default" size="100%">Kálmán Palágyi</style></author></secondary-authors></contributors><titles><title><style face="normal" font="default" size="100%">Digitális képtároló és képtovábbító rendszer (PACS) a Szegedi Tudományegyetemen</style></title><secondary-title><style face="normal" font="default" size="100%">Képfeldolgozók és Alakfelismerők III. Konfereciája</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2002</style></year><pub-dates><date><style  face="normal" font="default" size="100%">2002</style></date></pub-dates></dates><publisher><style face="normal" font="default" size="100%">NJSZT-KÉPAF</style></publisher><pub-location><style face="normal" font="default" size="100%">Szeged</style></pub-location><pages><style face="normal" font="default" size="100%">132 - 139</style></pages><language><style face="normal" font="default" size="100%">eng</style></language></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%">László Almási</style></author><author><style face="normal" font="default" size="100%">Antal Nagy</style></author><author><style face="normal" font="default" size="100%">Zoltán Alexin</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%">Attila Kuba</style></author><author><style face="normal" font="default" size="100%">László Csernay</style></author></authors><secondary-authors><author><style face="normal" font="default" size="100%">Attila Kuba</style></author><author><style face="normal" font="default" size="100%">Eörs Máté</style></author><author><style face="normal" font="default" size="100%">Kálmán Palágyi</style></author></secondary-authors></contributors><titles><title><style face="normal" font="default" size="100%">Digitális képtároló és képtovábbító rendszer (PACS) a Szegedi Tudományegyetemen</style></title><secondary-title><style face="normal" font="default" size="100%">Képfeldolgozók és Alakfelismerők III. Konfereciája</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2002</style></year><pub-dates><date><style  face="normal" font="default" size="100%">2002///</style></date></pub-dates></dates><publisher><style face="normal" font="default" size="100%">NJSZT-KÉPAF</style></publisher><pub-location><style face="normal" font="default" size="100%">Szeged</style></pub-location><pages><style face="normal" font="default" size="100%">132 - 139</style></pages><language><style face="normal" font="default" size="100%">eng</style></language></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>6</ref-type><contributors><secondary-authors><author><style face="normal" font="default" size="100%">Attila Kuba</style></author><author><style face="normal" font="default" size="100%">Eörs Máté</style></author><author><style face="normal" font="default" size="100%">Kálmán Palágyi</style></author></secondary-authors></contributors><titles><title><style face="normal" font="default" size="100%">Képfeldolgozók és Alakfelismerők III. Konfereciája</style></title></titles><dates><year><style  face="normal" font="default" size="100%">2002</style></year><pub-dates><date><style  face="normal" font="default" size="100%">2002///</style></date></pub-dates></dates><publisher><style face="normal" font="default" size="100%">NJSZT-KÉPAF</style></publisher><pub-location><style face="normal" font="default" size="100%">Szeged</style></pub-location><language><style face="normal" font="default" size="100%">eng</style></language></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>17</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">R J Bale</style></author><author><style face="normal" font="default" size="100%">W Birkfellner</style></author><author><style face="normal" font="default" size="100%">Erich Sorantin</style></author><author><style face="normal" font="default" size="100%">H Staedele</style></author><author><style face="normal" font="default" size="100%">J Kettenbach</style></author><author><style face="normal" font="default" size="100%">W Recheis</style></author><author><style face="normal" font="default" size="100%">M Voegele</style></author><author><style face="normal" font="default" size="100%">R Sweeney</style></author><author><style face="normal" font="default" size="100%">P Kovács</style></author><author><style face="normal" font="default" size="100%">R Wegenkittl</style></author><author><style face="normal" font="default" size="100%">G Bodner</style></author><author><style face="normal" font="default" size="100%">W Jaschke</style></author><author><style face="normal" font="default" size="100%">D zur Nedden</style></author><author><style face="normal" font="default" size="100%">E Eisner</style></author><author><style face="normal" font="default" size="100%">G Kronreig</style></author><author><style face="normal" font="default" size="100%">M Furst</style></author><author><style face="normal" font="default" size="100%">R Hanel</style></author><author><style face="normal" font="default" size="100%">M Figl</style></author><author><style face="normal" font="default" size="100%">H Bergmann</style></author><author><style face="normal" font="default" size="100%">D Hanson</style></author><author><style face="normal" font="default" size="100%">László Ruskó</style></author><author><style face="normal" font="default" size="100%">Lajos Rodek</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%">Anna Vilanova Bartroli</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%">A L Jacob</style></author><author><style face="normal" font="default" size="100%">B Baumann</style></author><author><style face="normal" font="default" size="100%">Emese Balogh</style></author><author><style face="normal" font="default" size="100%">P Messmer</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">Medical Image Processing, Surgical Planning, Image-Guided Therapy and Robotic Applications: Recent Developments for Radiology</style></title><secondary-title><style face="normal" font="default" size="100%">EUROPEAN RADIOLOGY</style></secondary-title><short-title><style face="normal" font="default" size="100%">EUR RADIOL</style></short-title></titles><dates><year><style  face="normal" font="default" size="100%">2002</style></year><pub-dates><date><style  face="normal" font="default" size="100%">2002///</style></date></pub-dates></dates><volume><style face="normal" font="default" size="100%">12</style></volume><pages><style face="normal" font="default" size="100%">504</style></pages><isbn><style face="normal" font="default" size="100%">0938-7994</style></isbn><language><style face="normal" font="default" size="100%">eng</style></language><issue><style face="normal" font="default" size="100%">1 Suppl</style></issue><notes><style face="normal" font="default" size="100%">doi: 10.1007/s00330-002-0004-7</style></notes></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>17</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Juerg Tschirren</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%">Joseph M Reinhardt</style></author><author><style face="normal" font="default" size="100%">Eric A Hoffman</style></author><author><style face="normal" font="default" size="100%">Milan Sonka</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">Segmentation, skeletonization, and branchpoint matching - A fully automated quantitative evaluation of human intrathoratic airway trees</style></title><secondary-title><style face="normal" font="default" size="100%">LECTURE NOTES IN COMPUTER SCIENCE</style></secondary-title><short-title><style face="normal" font="default" size="100%">LECT NOTES COMPUT SCI</style></short-title></titles><dates><year><style  face="normal" font="default" size="100%">2002</style></year><pub-dates><date><style  face="normal" font="default" size="100%">2002///</style></date></pub-dates></dates><volume><style face="normal" font="default" size="100%">2489</style></volume><pages><style face="normal" font="default" size="100%">12 - 19</style></pages><isbn><style face="normal" font="default" size="100%">0302-9743</style></isbn><language><style face="normal" font="default" size="100%">eng</style></language></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%">Kálmán Palágyi</style></author></authors><secondary-authors><author><style face="normal" font="default" size="100%">Attila Kuba</style></author><author><style face="normal" font="default" size="100%">Eörs Máté</style></author><author><style face="normal" font="default" size="100%">Kálmán Palágyi</style></author></secondary-authors></contributors><titles><title><style face="normal" font="default" size="100%">A sequential 3D curve-thinning algorithm</style></title><secondary-title><style face="normal" font="default" size="100%">Képfeldolgozók és Alakfelismerők III. Konfereciája</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2002</style></year><pub-dates><date><style  face="normal" font="default" size="100%">2002///</style></date></pub-dates></dates><publisher><style face="normal" font="default" size="100%">NJSZT-KÉPAF</style></publisher><pub-location><style face="normal" font="default" size="100%">Szeged</style></pub-location><pages><style face="normal" font="default" size="100%">42 - 51</style></pages><language><style face="normal" font="default" size="100%">eng</style></language></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>17</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Erich Sorantin</style></author><author><style face="normal" font="default" size="100%">Csongor Halmai</style></author><author><style face="normal" font="default" size="100%">Balázs Erdőhelyi</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%">László Gábor Nyúl</style></author><author><style face="normal" font="default" size="100%">Krisztián Ollé</style></author><author><style face="normal" font="default" size="100%">Bernhard Geiger</style></author><author><style face="normal" font="default" size="100%">Franz Lindbichler</style></author><author><style face="normal" font="default" size="100%">Gerhard Friedrich</style></author><author><style face="normal" font="default" size="100%">Karl Kiesler</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">Spiral-CT-based assessment of tracheal stenoses using 3-D-skeletonization</style></title><secondary-title><style face="normal" font="default" size="100%">IEEE TRANSACTIONS ON MEDICAL IMAGING</style></secondary-title><short-title><style face="normal" font="default" size="100%">IEEE T MED IMAGING</style></short-title></titles><dates><year><style  face="normal" font="default" size="100%">2002</style></year><pub-dates><date><style  face="normal" font="default" size="100%">2002///</style></date></pub-dates></dates><volume><style face="normal" font="default" size="100%">21</style></volume><pages><style face="normal" font="default" size="100%">263 - 273</style></pages><isbn><style face="normal" font="default" size="100%">0278-0062</style></isbn><language><style face="normal" font="default" size="100%">eng</style></language><abstract><style face="normal" font="default" size="100%">PURPOSE: Demonstration of a technique for three-dimensional (3-D) assessment of tracheal-stenoses, regarding site, length and 
degree, based on spiral computed tomography (S-CT). PATIENTS AND 
METHODS: S-CT scanning and automated segmentation of the 
laryngo-tracheal tract (LTT) was followed by the extraction of 
the LTT medial axis using a skeletonization algorithm. 
Orthogonal to the medial axis the LTT 3-D cross-sectional 
profile was computed and presented as line charts, where degree 
and length was obtained. Values for both parameters were 
compared between 36 patients and 18 normal controls separately. 
Accuracy and precision was derived from 17 phantom studies. 
RESULTS: Average degree and length of tracheal stenoses was 
found to be 60.5% and 4.32 cm in patients compared with minor 
caliber changes of 8.8% and 2.31 cm in normal controls (p &lt;&lt; 
0.0001). For the phantoms an excellent correlation between the 
true and computed 3-D cross-sectional profile was found (p &lt;&lt; 
0.005) and an accuracy for length and degree measurements of 
2.14 mm and 2.53% respectively could be determined. The 
corresponding figures for the precision were found to be 0.92 mm 
and 2.56%. CONCLUSION: LTT 3-D cross-sectional profiles permit 
objective, accurate and precise assessment of LTT caliber 
changes. Minor LTT caliber changes can be observed even in 
normals and, in case of an otherwise normal S-CT study, can be 
regarded as artifacts.
</style></abstract><issue><style face="normal" font="default" size="100%">3</style></issue><notes><style face="normal" font="default" size="100%">UT: 000175063900007ScopusID: 0036489382doi: 10.1109/42.996344</style></notes></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%">Antal Nagy</style></author><author><style face="normal" font="default" size="100%">Emese Balogh</style></author><author><style face="normal" font="default" size="100%">Mariann Dudásné Nagy</style></author><author><style face="normal" font="default" size="100%">Attila Kuba</style></author><author><style face="normal" font="default" size="100%">Eörs Máté</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></authors><secondary-authors><author><style face="normal" font="default" size="100%">Péter Arató</style></author><author><style face="normal" font="default" size="100%">Miklós Herdon</style></author></secondary-authors></contributors><titles><title><style face="normal" font="default" size="100%">Számítógépes képfeldolgozás oktatása a Szegedi Tudományegyetemen</style></title><secondary-title><style face="normal" font="default" size="100%">Informatika a felsőoktatásban</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2002</style></year><pub-dates><date><style  face="normal" font="default" size="100%">2002///</style></date></pub-dates></dates><publisher><style face="normal" font="default" size="100%">Debreceni Egyetem</style></publisher><pub-location><style face="normal" font="default" size="100%">Debrecen</style></pub-location><pages><style face="normal" font="default" size="100%">750 - 757</style></pages><language><style face="normal" font="default" size="100%">eng</style></language><abstract><style face="normal" font="default" size="100%">A Szegedi Tudományegyetem tanterveiben 1993 óta szerepel aképfeldolgozás és alkalmazásainak oktatása. A tantárgy ez idő 
alatt sok változáson ment át. Jelenleg a Képfeldolgozás 
szakirányt választó hallgatók részesülnek ilyen képzésben. Az 
adott szakirányon belül különböző képfeldolgozási területek 
oktatása épül egymásra. Az oktatás során nem csak elméleti és 
gyakorlati ismereteket szerezhetnek a hallgatók, hanem néhány 
(főleg orvosi) alkalmazás is bemutatásra kerül. A kötelező 
jellegű tárgyak mellett speciálkollégiumok engednek bepillantást 
más kiegészítő területekre. A hallgatók a képfeldolgozás témával 
rendszeresen vesznek rész helyi és országos Tudományos DIákköri 
Konferenciákon. Az utóbbi időben sikerült a képfeldolgozásban 
érdekelt cégekkel felvenni a kapcsolatot, így évente több 
hallgató vehet részt ipari alkalmazások fejlesztésében. A 
doktori programon belül is meghirdetünk képfeldolgozáshoz 
kapcsolódó kutatási irányokat. Ezenkívül rendszeresen 
megrendezzük a nemzetközi Képfeldolgozó Nyári Iskolákat, ahol 
nemcsak Magyarországról, hanem a környező országokból is 
fogadunk hallgatókat és oktatókat.
</style></abstract><notes><style face="normal" font="default" size="100%">A nyomtatott kötetben az absztrakt a 150. oldalon található.A teljes cikk a CD mellékleten, a D41.pdf fájlban, a megadott oldalszámokkal szerepel.
</style></notes></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%">László Gábor Nyúl</style></author><author><style face="normal" font="default" size="100%">Jayaram K Udupa</style></author></authors><secondary-authors><author><style face="normal" font="default" size="100%">Attila Kuba</style></author><author><style face="normal" font="default" size="100%">Eörs Máté</style></author><author><style face="normal" font="default" size="100%">Kálmán Palágyi</style></author></secondary-authors></contributors><titles><title><style face="normal" font="default" size="100%">Többdimenziós MRI képek feldolgozása</style></title><secondary-title><style face="normal" font="default" size="100%">Képfeldolgozók és Alakfelismerők III. Konfereciája</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2002</style></year><pub-dates><date><style  face="normal" font="default" size="100%">2002///</style></date></pub-dates></dates><publisher><style face="normal" font="default" size="100%">NJSZT-KÉPAF</style></publisher><pub-location><style face="normal" font="default" size="100%">Szeged</style></pub-location><pages><style face="normal" font="default" size="100%">96 - 97</style></pages><language><style face="normal" font="default" size="100%">eng</style></language></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>17</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Erich Sorantin</style></author><author><style face="normal" font="default" size="100%">Georg Werkgartner</style></author><author><style face="normal" font="default" size="100%">Emese Balogh</style></author><author><style face="normal" font="default" size="100%">Anna Vilanova Bartroli</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%">László Gábor Nyúl</style></author><author><style face="normal" font="default" size="100%">László Ruskó</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">Virtual dissection and automated polyp detection of the colon based on spiral CT - Techniques and preliminary experience on a cadaveric phantom</style></title><secondary-title><style face="normal" font="default" size="100%">EUROPEAN SURGERY - ACTA CHIRURGICA AUSTRIACA</style></secondary-title><short-title><style face="normal" font="default" size="100%">EUR SURG-ACA</style></short-title></titles><dates><year><style  face="normal" font="default" size="100%">2002</style></year><pub-dates><date><style  face="normal" font="default" size="100%">2002///</style></date></pub-dates></dates><volume><style face="normal" font="default" size="100%">34</style></volume><pages><style face="normal" font="default" size="100%">143 - 149</style></pages><isbn><style face="normal" font="default" size="100%">1682-8631</style></isbn><language><style face="normal" font="default" size="100%">eng</style></language><abstract><style face="normal" font="default" size="100%">Background: CT colonography was found to be sensitive andspecific for detection of colonic polyps and colorectal cancer 
(CRC). Depending on the software used, CT colonography requires 
a certain amount of operator interaction, which limits it's 
widespread usage. The goal of this papers is to present two 
novel automated techniques for displaying CT colonography: 
virtual dissection and automated colonic polyp detection. 
Methods: Virtual dissection refers to a technique where the 
entire colon is virtually stretched and flattened thus 
simulating the view on the pathologist's table. Colonic folds 
show a 'global outward bulging of the contour', whereas colonic 
polyps exhibit the inverse ('local inward bulging'). This 
feature is used to map areas of 'local inward bulging' with 
colours on 3D reconstructions. A cadaveric phantom with 13 
artificially inserted polyps was used for validation of both 
techniques. Results: On virtual dissection all 13 inserted 
polyps could be identified. They appeared either as bumps or as 
local broadening of colonic folds. In addition, the automated 
colonic polyp detection algorithm was able to tag all polyps. 
Only 10 min of operator interaction were necessary for both 
techniques. Conclusions: Virtual dissection overcomes the 
shortcomings of CT colonography, and automated colonic polyp 
detection establishes a roadmap of the polyps.
</style></abstract><issue><style face="normal" font="default" size="100%">2</style></issue><notes><style face="normal" font="default" size="100%">ScopusID: 0037000327doi: 10.1046/j.1563-2563.2002.02018.x</style></notes></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%">Emese Balogh</style></author><author><style face="normal" font="default" size="100%">Erich Sorantin</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 Kuba</style></author></authors><secondary-authors><author><style face="normal" font="default" size="100%">Attila Kuba</style></author><author><style face="normal" font="default" size="100%">Eörs Máté</style></author><author><style face="normal" font="default" size="100%">Kálmán Palágyi</style></author></secondary-authors></contributors><titles><title><style face="normal" font="default" size="100%">Virtual Dissection of the Colon</style></title><secondary-title><style face="normal" font="default" size="100%">Képfeldolgozók és Alakfelismerők III. Konfereciája</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2002</style></year><pub-dates><date><style  face="normal" font="default" size="100%">2002///</style></date></pub-dates></dates><publisher><style face="normal" font="default" size="100%">NJSZT-KÉPAF</style></publisher><pub-location><style face="normal" font="default" size="100%">Szeged</style></pub-location><pages><style face="normal" font="default" size="100%">109 - 117</style></pages><language><style face="normal" font="default" size="100%">eng</style></language></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%">Erich Sorantin</style></author><author><style face="normal" font="default" size="100%">Emese Balogh</style></author><author><style face="normal" font="default" size="100%">Anna Vilanova Bartroli</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%">László Gábor Nyúl</style></author><author><style face="normal" font="default" size="100%">Sven Lončarić</style></author><author><style face="normal" font="default" size="100%">Marco Subasic</style></author><author><style face="normal" font="default" size="100%">Domagoj Kovacevic</style></author></authors><secondary-authors><author><style face="normal" font="default" size="100%">Davide Caramella</style></author><author><style face="normal" font="default" size="100%">Carlo Bartolozzi</style></author></secondary-authors></contributors><titles><title><style face="normal" font="default" size="100%">Virtual Dissection of the Colon</style></title><secondary-title><style face="normal" font="default" size="100%">3D Image Processing</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2002</style></year><pub-dates><date><style  face="normal" font="default" size="100%">2002///</style></date></pub-dates></dates><publisher><style face="normal" font="default" size="100%">Springer-Verlag</style></publisher><pub-location><style face="normal" font="default" size="100%">New York</style></pub-location><pages><style face="normal" font="default" size="100%">197 - 209</style></pages><language><style face="normal" font="default" size="100%">eng</style></language><notes><style face="normal" font="default" size="100%">doi: 10.1007/978-3-642-59438-0_18</style></notes></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%">Emese Balogh</style></author><author><style face="normal" font="default" size="100%">Erich Sorantin</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 Kuba</style></author><author><style face="normal" font="default" size="100%">Georg Werkgartner</style></author><author><style face="normal" font="default" size="100%">Ekke Spuller</style></author></authors><secondary-authors><author><style face="normal" font="default" size="100%">Seong Ki Mun</style></author></secondary-authors></contributors><titles><title><style face="normal" font="default" size="100%">Virtual dissection of the colon: technique and first experiments with artificial and cadaveric phantoms</style></title><secondary-title><style face="normal" font="default" size="100%">Medical Imaging 2002: Visualization, Image-Guided Procedures, and Display</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2002</style></year><pub-dates><date><style  face="normal" font="default" size="100%">2002///</style></date></pub-dates></dates><publisher><style face="normal" font="default" size="100%">SPIE</style></publisher><pub-location><style face="normal" font="default" size="100%">Bellingham; Washington</style></pub-location><pages><style face="normal" font="default" size="100%">713 - 721</style></pages><language><style face="normal" font="default" size="100%">eng</style></language><abstract><style face="normal" font="default" size="100%">Virtual dissection refers to a display technique for polypdetection, where the colon is digitally straightened and then 
flattened using multirow detector Computed Tomograph (CT) 
images. As compared to virtual colonoscopy where polyps may be 
hidden from view behind the folds, the unravelled colon is more 
suitable for polyp detection, because the entire inner surface 
of the colon is displayed in a single view. The method was 
tested both on artificial and cadaveric phantoms. All polyps 
could be recognized on both phantoms. This technique for virtual 
dissection requires only a minimum of operator interaction.
</style></abstract><notes><style face="normal" font="default" size="100%">ScopusID: 0036061143doi: 10.1117/12.466982</style></notes></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>17</ref-type><contributors><authors><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%">A 3D parallel shrinking algorithm</style></title><secondary-title><style face="normal" font="default" size="100%">Acta Cybernetica</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2001</style></year></dates><publisher><style face="normal" font="default" size="100%">University of Szeged</style></publisher><pub-location><style face="normal" font="default" size="100%">Szeged</style></pub-location><volume><style face="normal" font="default" size="100%">15</style></volume><pages><style face="normal" font="default" size="100%">201-211</style></pages><language><style face="normal" font="default" size="100%">eng</style></language><abstract><style face="normal" font="default" size="100%">&lt;p&gt;Shrinking is a frequently used preprocessing step in image processing. This paper presents an efficient 3D parallel shrinking algorithm for transforming a binary object into its topological kernel. The applied strategy is called directional: each iteration step is composed of six subiterations each of which can be executed in parallel. The algorithm makes easy implementation possible, since deletable points are given by 3x3x3 matching templates. The topological correctness of the algorithm is proved for (26,6) binary pictures. &lt;tt&gt; &lt;/tt&gt;&lt;/p&gt;</style></abstract><work-type><style face="normal" font="default" size="100%">Journal Article</style></work-type></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>17</ref-type><contributors><authors><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%">A 3D parallel shrinking algorithm</style></title><secondary-title><style face="normal" font="default" size="100%">ACTA CYBERNETICA-SZEGED</style></secondary-title><short-title><style face="normal" font="default" size="100%">ACTA CYBERN-SZEGED</style></short-title></titles><dates><year><style  face="normal" font="default" size="100%">2001</style></year><pub-dates><date><style  face="normal" font="default" size="100%">2001</style></date></pub-dates></dates><volume><style face="normal" font="default" size="100%">15</style></volume><pages><style face="normal" font="default" size="100%">201 - 211</style></pages><isbn><style face="normal" font="default" size="100%">0324-721X</style></isbn><language><style face="normal" font="default" size="100%">eng</style></language><issue><style face="normal" font="default" size="100%">2</style></issue></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>17</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Attila Tanacs</style></author><author><style face="normal" font="default" size="100%">Gábor Czédli</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 Kuba</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">Affine matching of two sets of points in arbitrary dimensions.</style></title><secondary-title><style face="normal" font="default" size="100%">ACTA CYBERNETICA-SZEGED</style></secondary-title><short-title><style face="normal" font="default" size="100%">ACTA CYBERN-SZEGED</style></short-title></titles><dates><year><style  face="normal" font="default" size="100%">2001</style></year><pub-dates><date><style  face="normal" font="default" size="100%">2001</style></date></pub-dates></dates><volume><style face="normal" font="default" size="100%">15</style></volume><pages><style face="normal" font="default" size="100%">101 - 106</style></pages><isbn><style face="normal" font="default" size="100%">0324-721X</style></isbn><language><style face="normal" font="default" size="100%">eng</style></language><issue><style face="normal" font="default" size="100%">1</style></issue><notes><style face="normal" font="default" size="100%">ScopusID: 0034882398</style></notes></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>17</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%">Erich Sorantin</style></author><author><style face="normal" font="default" size="100%">Emese Balogh</style></author><author><style face="normal" font="default" size="100%">Attila Kuba</style></author><author><style face="normal" font="default" size="100%">Csongor Halmai</style></author><author><style face="normal" font="default" size="100%">Balázs Erdőhelyi</style></author><author><style face="normal" font="default" size="100%">Klaus Hausegger</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">A sequential 3D thinning algorithm and its medical applications</style></title><secondary-title><style face="normal" font="default" size="100%">LECTURE NOTES IN COMPUTER SCIENCE</style></secondary-title><short-title><style face="normal" font="default" size="100%">LECT NOTES COMPUT SCI</style></short-title></titles><dates><year><style  face="normal" font="default" size="100%">2001</style></year><pub-dates><date><style  face="normal" font="default" size="100%">2001///</style></date></pub-dates></dates><urls><web-urls><url><style face="normal" font="default" size="100%">http://www.springerlink.com/content/py49qu0e434n0n16</style></url></web-urls></urls><volume><style face="normal" font="default" size="100%">2082</style></volume><pages><style face="normal" font="default" size="100%">409 - 415</style></pages><isbn><style face="normal" font="default" size="100%">0302-9743</style></isbn><language><style face="normal" font="default" size="100%">eng</style></language><notes><style face="normal" font="default" size="100%">doi: 10.1007/3-540-45729-1_42</style></notes></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%">Erich Sorantin</style></author><author><style face="normal" font="default" size="100%">Emese Balogh</style></author><author><style face="normal" font="default" size="100%">Anna Vilanova Bartroli</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%">László Gábor Nyúl</style></author></authors><secondary-authors><author><style face="normal" font="default" size="100%">Sven Lončarić</style></author><author><style face="normal" font="default" size="100%">Hrvoje Babic</style></author></secondary-authors></contributors><titles><title><style face="normal" font="default" size="100%">Virtual Dissection of the Colon Based on Helical CT Data - Can It Be Done?</style></title><secondary-title><style face="normal" font="default" size="100%">Proceedings of the 2nd International Symposium on Image and Signal Processing and Analysis, ISPA 2001, Pula, Croatia</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2001</style></year><pub-dates><date><style  face="normal" font="default" size="100%">2001///</style></date></pub-dates></dates><publisher><style face="normal" font="default" size="100%">University of Zagreb</style></publisher><pub-location><style face="normal" font="default" size="100%">Zagreb</style></pub-location><pages><style face="normal" font="default" size="100%">224 - 229</style></pages><language><style face="normal" font="default" size="100%">eng</style></language><abstract><style face="normal" font="default" size="100%">Colorectal cancer is the third most commonly diagnosed cancer;and colonic polyps are known precursors of that particular 
cancer. Virtual dissection refers to a display technique for 
polyp detection based on helical CT data, where the colon is 
dissected and flattened as on the pathologist's table. The 
approach and image processing as well as the early experience 
are described in this paper.
</style></abstract><notes><style face="normal" font="default" size="100%">doi: 10.1109/ISPA.2001.938632</style></notes></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>17</ref-type><contributors><authors><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%">A 3D 3-subiteration thinning algorithm for medial surfaces</style></title><secondary-title><style face="normal" font="default" size="100%">LECTURE NOTES IN COMPUTER SCIENCE</style></secondary-title><short-title><style face="normal" font="default" size="100%">LECT NOTES COMPUT SCI</style></short-title></titles><dates><year><style  face="normal" font="default" size="100%">2000</style></year><pub-dates><date><style  face="normal" font="default" size="100%">2000///</style></date></pub-dates></dates><pub-location><style face="normal" font="default" size="100%">BERTRAND G, 1994, P SPIE C VISION GEOM, V2356, P113BERTRAND G, 1995, PATTERN RECOGN LETT, V16, P979
BLU H, 1967, MODELS PERCEPTION SP, P362
GONG WX, 1990, P 10 INT C PATT REC, P188
KONG TY, 1989, COMPUT VISION GRAPH, V48, P357
KONG TY, 1995, INT J PATTERN</style></pub-location><volume><style face="normal" font="default" size="100%">1953</style></volume><pages><style face="normal" font="default" size="100%">406 - 418</style></pages><isbn><style face="normal" font="default" size="100%">0302-9743</style></isbn><language><style face="normal" font="default" size="100%">eng</style></language><notes><style face="normal" font="default" size="100%">UT: 000171232100033doi: 10.1007/3-540-44438-6_33Discrete Geometry for Computer Imagery9th InternationalConference, DGCI 2000 
Uppsala, Sweden, December 13-15, 2000 
Proceedings 
Gunilla Borgefors, Ingela Nyström, Gabriella Sanniti di Baja (Eds.) 
ISBN: 3-540-41396-0 
DOI: 10.1007/3-540-44438-6
</style></notes></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%">Erich Sorantin</style></author><author><style face="normal" font="default" size="100%">Csongor Halmai</style></author><author><style face="normal" font="default" size="100%">Balázs Erdőhelyi</style></author><author><style face="normal" font="default" size="100%">László Martonossy</style></author><author><style face="normal" font="default" size="100%">Attila Kuba</style></author></authors><secondary-authors><author><style face="normal" font="default" size="100%">Tamas Sziranyi</style></author></secondary-authors></contributors><titles><title><style face="normal" font="default" size="100%">3D vékonyítás és alkalmazása vérerek és légutak átmérőjének meghatározására</style></title><secondary-title><style face="normal" font="default" size="100%">A Képfeldolgozók és Alakfelismerők Társaságának konferenciája - KÉPAF 2000</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2000</style></year><pub-dates><date><style  face="normal" font="default" size="100%">Jan 2000</style></date></pub-dates></dates><publisher><style face="normal" font="default" size="100%">NJSZT</style></publisher><pub-location><style face="normal" font="default" size="100%">Noszvaj</style></pub-location><pages><style face="normal" font="default" size="100%">95 - 100</style></pages><language><style face="normal" font="default" size="100%">eng</style></language></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%">Erich Sorantin</style></author><author><style face="normal" font="default" size="100%">Csongor Halmai</style></author><author><style face="normal" font="default" size="100%">Balázs Erdőhelyi</style></author><author><style face="normal" font="default" size="100%">László Martonossy</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%">Bernhard Geiger</style></author></authors><secondary-authors><author><style face="normal" font="default" size="100%">Walter Hruby</style></author></secondary-authors></contributors><titles><title><style face="normal" font="default" size="100%">New advances for imaging of laryngotracheal stenosis by post processing of spiral-CT data</style></title><secondary-title><style face="normal" font="default" size="100%">Digital (R)Evolution in Radiology</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2000</style></year><pub-dates><date><style  face="normal" font="default" size="100%">2000///</style></date></pub-dates></dates><publisher><style face="normal" font="default" size="100%">Springer-Verlag</style></publisher><pub-location><style face="normal" font="default" size="100%">Berlin; Heidelberg; New York; London; Paris; Tokyo</style></pub-location><pages><style face="normal" font="default" size="100%">275 - 285</style></pages><language><style face="normal" font="default" size="100%">eng</style></language></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>17</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Attila Tanacs</style></author><author><style face="normal" font="default" size="100%">Gábor Czédli</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 Kuba</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">Point-based registration assuming affine motion</style></title><secondary-title><style face="normal" font="default" size="100%">LECTURE NOTES IN COMPUTER SCIENCE</style></secondary-title><short-title><style face="normal" font="default" size="100%">LECT NOTES COMPUT SCI</style></short-title></titles><dates><year><style  face="normal" font="default" size="100%">2000</style></year><pub-dates><date><style  face="normal" font="default" size="100%">2000</style></date></pub-dates></dates><urls><web-urls><url><style face="normal" font="default" size="100%">http://www.inf.u-szeged.hu/ipcg/publications/papers/Tanacs_2000_AFPAC.pdf</style></url></web-urls></urls><volume><style face="normal" font="default" size="100%">1888</style></volume><pages><style face="normal" font="default" size="100%">329 - 338</style></pages><isbn><style face="normal" font="default" size="100%">0302-9743</style></isbn><language><style face="normal" font="default" size="100%">eng</style></language><notes><style face="normal" font="default" size="100%">UT: 000174539200027doi: 10.1007/10722492_26Gerald Sommer, Yehoshua Y. Zeevi (Eds.)Algebraic Frames for the Perception-Action Cycle Second International Workshop, AFPAC 2000
Kiel, Germany, September 10-11, 2000
Proceedings
Berlin; Heidelberg; New York : Springer,2000
ISBN 3-540-41013-9
DOI: 10.1007/10722492
</style></notes></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>17</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%">Erich Sorantin</style></author><author><style face="normal" font="default" size="100%">Csongor Halmai</style></author><author><style face="normal" font="default" size="100%">Attila Kuba</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">3D thinning and its applications to medical image processing</style></title><secondary-title><style face="normal" font="default" size="100%">TASK QUARTERLY</style></secondary-title><short-title><style face="normal" font="default" size="100%">TASK Q</style></short-title></titles><dates><year><style  face="normal" font="default" size="100%">1999</style></year><pub-dates><date><style  face="normal" font="default" size="100%">1999///</style></date></pub-dates></dates><volume><style face="normal" font="default" size="100%">3</style></volume><pages><style face="normal" font="default" size="100%">397 - 408</style></pages><isbn><style face="normal" font="default" size="100%">1428-6394</style></isbn><language><style face="normal" font="default" size="100%">eng</style></language><issue><style face="normal" font="default" size="100%">4</style></issue></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>17</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%">Attila Kuba</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">Directional 3D thinning using 8 subiterations</style></title><secondary-title><style face="normal" font="default" size="100%">LECTURE NOTES IN COMPUTER SCIENCE</style></secondary-title><short-title><style face="normal" font="default" size="100%">LECT NOTES COMPUT SCI</style></short-title></titles><dates><year><style  face="normal" font="default" size="100%">1999</style></year><pub-dates><date><style  face="normal" font="default" size="100%">1999///</style></date></pub-dates></dates><pub-location><style face="normal" font="default" size="100%">BERTRAND G, 1994, P SPIE C VISION GEOM, V2356, P113BERTRAND G, 1995, PATTERN RECOGN LETT, V16, P979
GONG WX, 1990, P 10 INT C PATT REC, P188
KONG TY, 1989, COMPUT VISION GRAPH, V48, P357
KONG TY, 1995, INT J PATTERN RECOGN, V9, P813
LEE TC, 1994, CVGIP-GR</style></pub-location><volume><style face="normal" font="default" size="100%">1568</style></volume><pages><style face="normal" font="default" size="100%">325 - 336</style></pages><isbn><style face="normal" font="default" size="100%">0302-9743</style></isbn><language><style face="normal" font="default" size="100%">eng</style></language><notes><style face="normal" font="default" size="100%">UT: 000082776500025doi: 10.1007/3-540-49126-0Bertrand G; Couprie M; Perroton L (eds.)DISCRETE GEOMETRY FOR COMPUTER IMAGERY. 
Berlin ; Heidelberg: Springer Verlag, 1999. 
ISBN:3-540-65685-5
</style></notes></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>17</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%">Attila Kuba</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">A parallel 3D 12-subiteration thinning algorithm</style></title><secondary-title><style face="normal" font="default" size="100%">GRAPHICAL MODELS AND IMAGE PROCESSING</style></secondary-title><short-title><style face="normal" font="default" size="100%">GRAPH MODEL IM PROC</style></short-title></titles><dates><year><style  face="normal" font="default" size="100%">1999</style></year><pub-dates><date><style  face="normal" font="default" size="100%">1999///</style></date></pub-dates></dates><urls><web-urls><url><style face="normal" font="default" size="100%">http://www.inf.u-szeged.hu/ipcg/publications/papers/PalagyiKuba_GMIP1999.pdf</style></url></web-urls></urls><pub-location><style face="normal" font="default" size="100%">BERTRAND G, 1994, P SPIE C VISION GEOM, V2356, P113BERTRAND G, 1995, PATTERN RECOGN LETT, V16, P979
BLUM H, 1967, MODELS PERCEPTION SP, P362
BORGEFORS G, 1984, COMPUT VISION GRAPH, V27, P321
CALABI L, 1965, 60429 PARK MATH LAB
GERIG G, 1993, LECT NOTES CO</style></pub-location><volume><style face="normal" font="default" size="100%">61</style></volume><pages><style face="normal" font="default" size="100%">199 - 221</style></pages><isbn><style face="normal" font="default" size="100%">1077-3169</style></isbn><language><style face="normal" font="default" size="100%">eng</style></language><issue><style face="normal" font="default" size="100%">4</style></issue><notes><style face="normal" font="default" size="100%">UT: 000082784900002</style></notes></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%">Attila Tanacs</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 Kuba</style></author></authors><secondary-authors><author><style face="normal" font="default" size="100%">F Pernus</style></author><author><style face="normal" font="default" size="100%">S Kovacic</style></author><author><style face="normal" font="default" size="100%">H S Stiehl</style></author><author><style face="normal" font="default" size="100%">Max A Viergever</style></author></secondary-authors></contributors><titles><title><style face="normal" font="default" size="100%">Target registration error of point-based methods assuming rigid-body and linear motions</style></title><secondary-title><style face="normal" font="default" size="100%">International Workshop on Biomedical Image Registration (WBIR)</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">1999</style></year><pub-dates><date><style  face="normal" font="default" size="100%">Aug 1999</style></date></pub-dates></dates><publisher><style face="normal" font="default" size="100%">Slovenian Society of Informatics</style></publisher><pub-location><style face="normal" font="default" size="100%">Ljubljana</style></pub-location><pages><style face="normal" font="default" size="100%">223 - 233</style></pages><language><style face="normal" font="default" size="100%">eng</style></language></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>17</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%">Attila Kuba</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">A 3D 6-subiteration thinning algorithm for extracting medial lines</style></title><secondary-title><style face="normal" font="default" size="100%">PATTERN RECOGNITION LETTERS</style></secondary-title><short-title><style face="normal" font="default" size="100%">PATTERN RECOGN LETT</style></short-title></titles><dates><year><style  face="normal" font="default" size="100%">1998</style></year><pub-dates><date><style  face="normal" font="default" size="100%">1998///</style></date></pub-dates></dates><pub-location><style face="normal" font="default" size="100%">BERTRAND G, 1994, P SPIE C VISION GEOM, V2356, P113BERTRAND G, 1995, PATTERN RECOGN LETT, V16, P979
BLUM H, 1967, MODELS PERCEPTION SP, P362
GONG WX, 1990, P 10 INT C PATT REC, P188
KONG TY, 1989, COMPUT VISION GRAPH, V48, P357
LEE TC, 1994, CVGIP-GRAPH M</style></pub-location><volume><style face="normal" font="default" size="100%">19</style></volume><pages><style face="normal" font="default" size="100%">613 - 627</style></pages><isbn><style face="normal" font="default" size="100%">0167-8655</style></isbn><language><style face="normal" font="default" size="100%">eng</style></language><issue><style face="normal" font="default" size="100%">7</style></issue><notes><style face="normal" font="default" size="100%">UT: 000075051900009doi: 10.1016/S0167-8655(98)00031-2</style></notes></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>17</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%">Attila Kuba</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">A hybrid thinning algorithm for 3D medical images</style></title><secondary-title><style face="normal" font="default" size="100%">CIT JOURNAL OF COMPUTING AND INFORMATION TECHNOLOGY</style></secondary-title><short-title><style face="normal" font="default" size="100%">J COMPUT INF TECHNOL (CIT)</style></short-title></titles><dates><year><style  face="normal" font="default" size="100%">1998</style></year><pub-dates><date><style  face="normal" font="default" size="100%">1998///</style></date></pub-dates></dates><volume><style face="normal" font="default" size="100%">6</style></volume><pages><style face="normal" font="default" size="100%">149 - 164</style></pages><isbn><style face="normal" font="default" size="100%">1330-1136</style></isbn><language><style face="normal" font="default" size="100%">eng</style></language><issue><style face="normal" font="default" size="100%">2</style></issue></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>17</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Attila Tanacs</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 Kuba</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">Medical image registration based on interactively identified anatomical landmark points</style></title><secondary-title><style face="normal" font="default" size="100%">MACHINE GRAPHICS AND VISION</style></secondary-title><short-title><style face="normal" font="default" size="100%">MACH GRAPH VIS</style></short-title></titles><dates><year><style  face="normal" font="default" size="100%">1998</style></year><pub-dates><date><style  face="normal" font="default" size="100%">1998///</style></date></pub-dates></dates><volume><style face="normal" font="default" size="100%">7</style></volume><pages><style face="normal" font="default" size="100%">151 - 158</style></pages><isbn><style face="normal" font="default" size="100%">1230-0535</style></isbn><language><style face="normal" font="default" size="100%">eng</style></language><issue><style face="normal" font="default" size="100%">1/2</style></issue></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>17</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Attila Tanacs</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 Kuba</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">Medical image registration based on interactively identified anatomical landmark points</style></title><secondary-title><style face="normal" font="default" size="100%">MACHINE GRAPHICS AND VISION</style></secondary-title><short-title><style face="normal" font="default" size="100%">MACH GRAPH VIS</style></short-title></titles><dates><year><style  face="normal" font="default" size="100%">1998</style></year><pub-dates><date><style  face="normal" font="default" size="100%">1998</style></date></pub-dates></dates><volume><style face="normal" font="default" size="100%">7</style></volume><pages><style face="normal" font="default" size="100%">151 - 158</style></pages><isbn><style face="normal" font="default" size="100%">1230-0535</style></isbn><language><style face="normal" font="default" size="100%">eng</style></language><issue><style face="normal" font="default" size="100%">1/2</style></issue></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%">Attila Tanacs</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 Kuba</style></author></authors><secondary-authors><author><style face="normal" font="default" size="100%">György Kozmann</style></author><author><style face="normal" font="default" size="100%">K Szakolczai</style></author></secondary-authors></contributors><titles><title><style face="normal" font="default" size="100%">Pont alapú regisztráció, képfúzió</style></title><secondary-title><style face="normal" font="default" size="100%">XXI. Neumann Kollokvium kiadványa</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">1998</style></year><pub-dates><date><style  face="normal" font="default" size="100%">Nov 1998</style></date></pub-dates></dates><publisher><style face="normal" font="default" size="100%">Neumann János Számítógép-tudományi Társaság</style></publisher><pub-location><style face="normal" font="default" size="100%">Budapest</style></pub-location><pages><style face="normal" font="default" size="100%">67 - 70</style></pages><language><style face="normal" font="default" size="100%">eng</style></language></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%">Attila Tanacs</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 Kuba</style></author></authors><secondary-authors><author><style face="normal" font="default" size="100%">György Kozmann</style></author><author><style face="normal" font="default" size="100%">K Szakolczai</style></author></secondary-authors></contributors><titles><title><style face="normal" font="default" size="100%">Pont alapú regisztráció, képfúzió</style></title><secondary-title><style face="normal" font="default" size="100%">XXI. Neumann Kollokvium kiadványa</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">1998</style></year><pub-dates><date><style  face="normal" font="default" size="100%">Nov 1998</style></date></pub-dates></dates><publisher><style face="normal" font="default" size="100%">Neumann János Számítógép-tudományi Társaság</style></publisher><pub-location><style face="normal" font="default" size="100%">Budapest</style></pub-location><pages><style face="normal" font="default" size="100%">67 - 70</style></pages><language><style face="normal" font="default" size="100%">eng</style></language></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%">Attila Kuba</style></author></authors><secondary-authors><author><style face="normal" font="default" size="100%">György Kozmann</style></author><author><style face="normal" font="default" size="100%">K Szakolczai</style></author></secondary-authors></contributors><titles><title><style face="normal" font="default" size="100%">Vékonyító algoritmusok 3D orvosi képekre</style></title><secondary-title><style face="normal" font="default" size="100%">XXI. Neumann Kollokvium kiadványa</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">1998</style></year><pub-dates><date><style  face="normal" font="default" size="100%">Nov 1998</style></date></pub-dates></dates><publisher><style face="normal" font="default" size="100%">Neumann János Számítógép-tudományi Társaság</style></publisher><pub-location><style face="normal" font="default" size="100%">Budapest</style></pub-location><pages><style face="normal" font="default" size="100%">63 - 66</style></pages><language><style face="normal" font="default" size="100%">eng</style></language></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%">Attila Kuba</style></author></authors><secondary-authors><author><style face="normal" font="default" size="100%">Tamas Sziranyi</style></author><author><style face="normal" font="default" size="100%">József Berke</style></author></secondary-authors></contributors><titles><title><style face="normal" font="default" size="100%">An algorithm for thinning 3D medical images</style></title><secondary-title><style face="normal" font="default" size="100%">A Képfeldolgozók és Alakfelismerők Társaságának konferenciája - KÉPAF 1997</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">1997</style></year><pub-dates><date><style  face="normal" font="default" size="100%">Oct 1997</style></date></pub-dates></dates><publisher><style face="normal" font="default" size="100%">Pannon Agrártudományi Egyetem Georgikon Mezőgazdaságtudományi Kar</style></publisher><pub-location><style face="normal" font="default" size="100%">Keszthely</style></pub-location><pages><style face="normal" font="default" size="100%">64 - 71</style></pages><language><style face="normal" font="default" size="100%">eng</style></language></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%">Attila Tanacs</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 Kuba</style></author></authors><secondary-authors><author><style face="normal" font="default" size="100%">Tamas Sziranyi</style></author><author><style face="normal" font="default" size="100%">József Berke</style></author></secondary-authors></contributors><titles><title><style face="normal" font="default" size="100%">Orvosi képek regisztrációja interaktívan kijelölt anatómiai pontok alapján</style></title><secondary-title><style face="normal" font="default" size="100%">Magyar Képfeldolgozók és Alakfelismerők Országos Konferenciája</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">1997</style></year><pub-dates><date><style  face="normal" font="default" size="100%">Oct 1997</style></date></pub-dates></dates><publisher><style face="normal" font="default" size="100%">Pannon Agrártudományi Egyetem Georgikon Mezőgazdaságtudományi Kar</style></publisher><pub-location><style face="normal" font="default" size="100%">Keszthely</style></pub-location><pages><style face="normal" font="default" size="100%">1 - 8</style></pages><language><style face="normal" font="default" size="100%">eng</style></language></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%">Attila Tanacs</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 Kuba</style></author></authors><secondary-authors><author><style face="normal" font="default" size="100%">Tamas Sziranyi</style></author><author><style face="normal" font="default" size="100%">József Berke</style></author></secondary-authors></contributors><titles><title><style face="normal" font="default" size="100%">Orvosi képek regisztrációja interaktívan kijelölt anatómiai pontok alapján</style></title><secondary-title><style face="normal" font="default" size="100%">Magyar Képfeldolgozók és Alakfelismerők Országos Konferenciája</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">1997</style></year><pub-dates><date><style  face="normal" font="default" size="100%">Oct 1997</style></date></pub-dates></dates><publisher><style face="normal" font="default" size="100%">Pannon Agrártudományi Egyetem Georgikon Mezőgazdaságtudományi Kar</style></publisher><pub-location><style face="normal" font="default" size="100%">Keszthely</style></pub-location><pages><style face="normal" font="default" size="100%">1 - 8</style></pages><language><style face="normal" font="default" size="100%">eng</style></language></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%">Kálmán Palágyi</style></author><author><style face="normal" font="default" size="100%">Attila Kuba</style></author></authors><secondary-authors><author><style face="normal" font="default" size="100%">Gerald Sommer</style></author><author><style face="normal" font="default" size="100%">Kostas Daniilidis</style></author><author><style face="normal" font="default" size="100%">Josef Pauli</style></author></secondary-authors></contributors><titles><title><style face="normal" font="default" size="100%">A parallel 12-subiteration 3D thinning algorithm to extract medial lines</style></title><secondary-title><style face="normal" font="default" size="100%">Computer analysis of images and patterns</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">1997</style></year><pub-dates><date><style  face="normal" font="default" size="100%">1997///</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%">Berlin</style></pub-location><pages><style face="normal" font="default" size="100%">400 - 407</style></pages><language><style face="normal" font="default" size="100%">eng</style></language></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%">Kálmán Palágyi</style></author><author><style face="normal" font="default" size="100%">Attila Kuba</style></author></authors><secondary-authors><author><style face="normal" font="default" size="100%">James Duncan</style></author><author><style face="normal" font="default" size="100%">Gene Gindi</style></author></secondary-authors></contributors><titles><title><style face="normal" font="default" size="100%">A thinning algorithm to extract medial lines from 3D medical images</style></title><secondary-title><style face="normal" font="default" size="100%">INFORMATION PROCESSING IN MEDICAL IMAGING</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">1997</style></year><pub-dates><date><style  face="normal" font="default" size="100%">1997///</style></date></pub-dates></dates><publisher><style face="normal" font="default" size="100%">Springer Verlag</style></publisher><pub-location><style face="normal" font="default" size="100%">Berlin; HeidelbergGERIG G, 1993, LECT NOTES COMPUTER, V687, P94GONG WX, 1990, P 10 INT C PATT REC, P188
KONG TY, 1989, COMPUT VISION GRAPH, V48, P357
LEE TC, 1994, CVGIP-GRAPH MODEL IM, V6, P462
MA CM, 1994, CVGIP-IMAG UNDERSTAN, V59, P328
PALAGYI K, 1996</style></pub-location><pages><style face="normal" font="default" size="100%">411 - 416</style></pages><language><style face="normal" font="default" size="100%">eng</style></language><notes><style face="normal" font="default" size="100%">UT: 000073946600035doi: 10.1007/3-540-63046-5_35</style></notes></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%">Attila Kuba</style></author><author><style face="normal" font="default" size="100%">Zoltán Alexin</style></author><author><style face="normal" font="default" size="100%">Antal Nagy</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%">Mariann Nagy</style></author><author><style face="normal" font="default" size="100%">László Almási</style></author><author><style face="normal" font="default" size="100%">László Csernay</style></author></authors><secondary-authors><author><style face="normal" font="default" size="100%">S Orphanoudakis</style></author></secondary-authors></contributors><titles><title><style face="normal" font="default" size="100%">DICOM Based PACS and Its Application in the Education</style></title><secondary-title><style face="normal" font="default" size="100%">International EuroPACS Meeting, EuroPACS '96</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">1996</style></year><pub-dates><date><style  face="normal" font="default" size="100%">Oct 1996</style></date></pub-dates></dates><pages><style face="normal" font="default" size="100%">46 - 49</style></pages><language><style face="normal" font="default" size="100%">eng</style></language><abstract><style face="normal" font="default" size="100%">&lt;p&gt;SZOTE-PACS is a DICOM based PACS developed at the Universitiesof Szeged. It is able to collect studies from different modalities and convert them into DICOM format. The DICOM studies can be edited, modified by RIS data, then verified and transferred into the archiving server. There is a graphic application based on Oracle for searching and other database management functions of the Archive. The archived studies can be presented and/or processed on the viewing workstations. SZOTE- PACS also supports the creation and presentation of educational materials fror medical students.&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%">Attila Kuba</style></author><author><style face="normal" font="default" size="100%">Zoltán Alexin</style></author><author><style face="normal" font="default" size="100%">Antal Nagy</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%">Mariann Nagy</style></author><author><style face="normal" font="default" size="100%">László Almási</style></author><author><style face="normal" font="default" size="100%">László Csernay</style></author></authors><secondary-authors><author><style face="normal" font="default" size="100%">S Orphanoudakis</style></author></secondary-authors></contributors><titles><title><style face="normal" font="default" size="100%">DICOM Based PACS and Its Application in the Education</style></title><secondary-title><style face="normal" font="default" size="100%">International EuroPACS Meeting, EuroPACS '96</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">1996</style></year><pub-dates><date><style  face="normal" font="default" size="100%">Oct 1996</style></date></pub-dates></dates><pages><style face="normal" font="default" size="100%">46 - 49</style></pages><language><style face="normal" font="default" size="100%">eng</style></language><abstract><style face="normal" font="default" size="100%">&lt;p&gt;SZOTE-PACS is a DICOM based PACS developed at the Universitiesof Szeged. It is able to collect studies from different modalities and convert them into DICOM format. The DICOM studies can be edited, modified by RIS data, then verified and transferred into the archiving server. There is a graphic application based on Oracle for searching and other database management functions of the Archive. The archived studies can be presented and/or processed on the viewing workstations. SZOTE- PACS also supports the creation and presentation of educational materials fror medical students.&lt;/p&gt;</style></abstract></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%">Jayaram K Udupa</style></author></authors><secondary-authors><author><style face="normal" font="default" size="100%">K Tarnay</style></author><author><style face="normal" font="default" size="100%">Zoltán Fazekas</style></author></secondary-authors></contributors><titles><title><style face="normal" font="default" size="100%">Medical image registration based on fuzzy objects</style></title><secondary-title><style face="normal" font="default" size="100%">SUMMER WORKSHOP ON COMPUTATIONAL MODELLING, IMAGING AND VISUALIZATION IN BIOSCIENCES (COMBIO)</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">1996</style></year><pub-dates><date><style  face="normal" font="default" size="100%">1996.08.29</style></date></pub-dates></dates><publisher><style face="normal" font="default" size="100%">KFKI</style></publisher><pub-location><style face="normal" font="default" size="100%">Budapest</style></pub-location><pages><style face="normal" font="default" size="100%">44 - 48</style></pages><language><style face="normal" font="default" size="100%">eng</style></language></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%">Jayaram K Udupa</style></author></authors><secondary-authors><author><style face="normal" font="default" size="100%">György Kozmann</style></author></secondary-authors></contributors><titles><title><style face="normal" font="default" size="100%">Orvosi képek fuzzy objektumokon alapuló regisztrációja</style></title><secondary-title><style face="normal" font="default" size="100%">A számítástechnika orvosi és biológiai alkalmazásai: A XX. Neumann Kollokvium Kiadványa</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">1996</style></year><pub-dates><date><style  face="normal" font="default" size="100%">Nov 1996</style></date></pub-dates></dates><publisher><style face="normal" font="default" size="100%">NJSZT</style></publisher><pub-location><style face="normal" font="default" size="100%">Budapest</style></pub-location><pages><style face="normal" font="default" size="100%">107 - 110</style></pages><language><style face="normal" font="default" size="100%">eng</style></language></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%">Attila Kuba</style></author><author><style face="normal" font="default" size="100%">Zoltán Alexin</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%">Antal Nagy</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%">Mariann Dudásné Nagy</style></author><author><style face="normal" font="default" size="100%">László Csernay</style></author><author><style face="normal" font="default" size="100%">László Almási</style></author></authors><secondary-authors><author><style face="normal" font="default" size="100%">György Kozmann</style></author></secondary-authors></contributors><titles><title><style face="normal" font="default" size="100%">SZOTE-PACS: A Szent-Györgyi Albert Orvostudományi Egyetem képarchiváló és továbbító rendszerének szoftvere</style></title><secondary-title><style face="normal" font="default" size="100%">A számítástechnika orvosi és biológiai alkalmazásai: A XX. Neumann Kollokvium Kiadványa</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">1996</style></year><pub-dates><date><style  face="normal" font="default" size="100%">Nov 1996</style></date></pub-dates></dates><publisher><style face="normal" font="default" size="100%">NJSZT</style></publisher><pub-location><style face="normal" font="default" size="100%">Veszprém</style></pub-location><pages><style face="normal" font="default" size="100%">173 - 176</style></pages><language><style face="normal" font="default" size="100%">eng</style></language><abstract><style face="normal" font="default" size="100%">&lt;p&gt;A Szent-Györgyi Albert Orvostudományi Egyetem kép-archiváló és -továbbító rendszer (SZOTE-PACS) szoftverének a fejlesztését ismertetjük előadásunkban. A cél egy olyan számítógépes hálózat elkészítése, amely nemcsak a klinikai vizsgálatok képeinek tárolásával és átvitelével kapcsolatos feladatokat látja el, de támogatja az oktatási és konzultációs tevékenységéeket is. A SZOTE-PACS 3 részre bontható: képfelvevő, archiváló és megjelenítő állomásokra. A képfelvevő munkaállomásoknak kettős feladata van: egyrészt a különféle modalitásokon (CT, MR, NM, US és SPECT) vagy röntgenfilm-scanneren felvett, illetve a DICOM- szabványnak megfelelő állomásról beérkező vizsgálatok begyűjtése, másrészt az Interfile 3.3, ACR-NEMA 2.0 vagy TIFF formátumú vizsgálatok DICOM formátumra való automatikus konvertálása. A rendszer képes a Radiológiai Klinika Információs Rendszerében (RIS) levő információk átvételére és beépítésére is. Az így előkészített vizsgálatok átküldhetők a központi szerverre, ahol azok az archívumban automatiksan tárolódnak. A jelenlegi diszk kapacitás mellett 15 napig őrizzük a vizsgálatokat. A tervek szerint 15 nap után csak a képeket töröljük a szerverről, a vizsgálat egyéb (nem képi) adatai továbbra is megőrzésre kerülnek. Az archívumban Oracle adatbázis kezeéő rendszer segíti a visszakeresést, a mejelenítést és a módosítást. A feldolgozó munkaállomásokra (PC-k, UNOX-állomások vagy X-terminálok) kérheti le a felhasználó a szerveren tárolt vizsgálatokat. Itt jeleníthetők meg illetve dolgozhatók fel a vizsgálatok képei. Az orvostanhallgatók és doktoranduszok képzésére HTML-ben írt oktatási anyagok állíthatók össze a tárolt szöveges és képi adatokból. Az oktatási anyagokat a rendszer külön adatbázisban tárolja.&lt;/p&gt;</style></abstract></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%">Attila Kuba</style></author><author><style face="normal" font="default" size="100%">Zoltán Alexin</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%">Antal Nagy</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%">Mariann Dudásné Nagy</style></author><author><style face="normal" font="default" size="100%">László Csernay</style></author><author><style face="normal" font="default" size="100%">László Almási</style></author></authors><secondary-authors><author><style face="normal" font="default" size="100%">György Kozmann</style></author></secondary-authors></contributors><titles><title><style face="normal" font="default" size="100%">SZOTE-PACS: A Szent-Györgyi Albert Orvostudományi Egyetem képarchiváló és továbbító rendszerének szoftvere</style></title><secondary-title><style face="normal" font="default" size="100%">A számítástechnika orvosi és biológiai alkalmazásai: A XX. Neumann Kollokvium Kiadványa</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">1996</style></year><pub-dates><date><style  face="normal" font="default" size="100%">Nov 1996</style></date></pub-dates></dates><publisher><style face="normal" font="default" size="100%">NJSZT</style></publisher><pub-location><style face="normal" font="default" size="100%">Veszprém</style></pub-location><pages><style face="normal" font="default" size="100%">173 - 176</style></pages><language><style face="normal" font="default" size="100%">eng</style></language><abstract><style face="normal" font="default" size="100%">&lt;p&gt;A Szent-Györgyi Albert Orvostudományi Egyetem kép-archiváló és -továbbító rendszer (SZOTE-PACS) szoftverének a fejlesztését ismertetjük előadásunkban. A cél egy olyan számítógépes hálózat elkészítése, amely nemcsak a klinikai vizsgálatok képeinek tárolásával és átvitelével kapcsolatos feladatokat látja el, de támogatja az oktatási és konzultációs tevékenységéeket is. A SZOTE-PACS 3 részre bontható: képfelvevő, archiváló és megjelenítő állomásokra. A képfelvevő munkaállomásoknak kettős feladata van: egyrészt a különféle modalitásokon (CT, MR, NM, US és SPECT) vagy röntgenfilm-scanneren felvett, illetve a DICOM- szabványnak megfelelő állomásról beérkező vizsgálatok begyűjtése, másrészt az Interfile 3.3, ACR-NEMA 2.0 vagy TIFF formátumú vizsgálatok DICOM formátumra való automatikus konvertálása. A rendszer képes a Radiológiai Klinika Információs Rendszerében (RIS) levő információk átvételére és beépítésére is. Az így előkészített vizsgálatok átküldhetők a központi szerverre, ahol azok az archívumban automatiksan tárolódnak. A jelenlegi diszk kapacitás mellett 15 napig őrizzük a vizsgálatokat. A tervek szerint 15 nap után csak a képeket töröljük a szerverről, a vizsgálat egyéb (nem képi) adatai továbbra is megőrzésre kerülnek. Az archívumban Oracle adatbázis kezeéő rendszer segíti a visszakeresést, a mejelenítést és a módosítást. A feldolgozó munkaállomásokra (PC-k, UNOX-állomások vagy X-terminálok) kérheti le a felhasználó a szerveren tárolt vizsgálatokat. Itt jeleníthetők meg illetve dolgozhatók fel a vizsgálatok képei. Az orvostanhallgatók és doktoranduszok képzésére HTML-ben írt oktatási anyagok állíthatók össze a tárolt szöveges és képi adatokból. Az oktatási anyagokat a rendszer külön adatbázisban tárolja.&lt;/p&gt;</style></abstract></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%">Attila Kuba</style></author><author><style face="normal" font="default" size="100%">Attila Fazekas</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%">Antal Nagy</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%">Attila Pethő</style></author></authors><secondary-authors><author><style face="normal" font="default" size="100%">Péter Bakonyi</style></author><author><style face="normal" font="default" size="100%">Miklós Herdon</style></author></secondary-authors></contributors><titles><title><style face="normal" font="default" size="100%">A többdimenziós képfeldolgozás programjai és oktatásuk</style></title><secondary-title><style face="normal" font="default" size="100%">Informatika a felsőoktatásban '96 és Networkshop '96</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">1996</style></year><pub-dates><date><style  face="normal" font="default" size="100%">1996///</style></date></pub-dates></dates><publisher><style face="normal" font="default" size="100%">Debreceni Egyetem</style></publisher><pub-location><style face="normal" font="default" size="100%">Debrecen</style></pub-location><pages><style face="normal" font="default" size="100%">649 - 656</style></pages><language><style face="normal" font="default" size="100%">eng</style></language><abstract><style face="normal" font="default" size="100%">Nowdays, the multidimensional (i.e. higher than 2-dimensional)image processing has been a strongly developing area. One of its 
most important application areas is the medicine, where numerous 
diagnostic imaging devices (e.g., CT, MR, SPECT etc.) are able 
to produce 3- or even higher dimensional images. We have studied 
the possibility of introduction of multidimensional image 
processing into the subjects of Image Processing at József 
Attila University. First, we considered the methods of 
generation of such images, then the different standards accepted 
in the medical applications. From the processing algorithms we 
have dealt with the 3D skeletons, binary operations, 
reconstruction and registration. These topics are discussed in 
the education of graduated and PhD students as well.
</style></abstract></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%">Attila Kuba</style></author><author><style face="normal" font="default" size="100%">Attila Fazekas</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%">Antal Nagy</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%">Attila Pethő</style></author></authors><secondary-authors><author><style face="normal" font="default" size="100%">Péter Bakonyi</style></author><author><style face="normal" font="default" size="100%">Miklós Herdon</style></author></secondary-authors></contributors><titles><title><style face="normal" font="default" size="100%">A többdimenziós képfeldolgozás programjai és oktatásuk</style></title><secondary-title><style face="normal" font="default" size="100%">Informatika a felsőoktatásban '96 és Networkshop '96</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">1996</style></year><pub-dates><date><style  face="normal" font="default" size="100%">1996</style></date></pub-dates></dates><publisher><style face="normal" font="default" size="100%">Debreceni Egyetem</style></publisher><pub-location><style face="normal" font="default" size="100%">Debrecen</style></pub-location><pages><style face="normal" font="default" size="100%">649 - 656</style></pages><language><style face="normal" font="default" size="100%">eng</style></language><abstract><style face="normal" font="default" size="100%">Nowdays, the multidimensional (i.e. higher than 2-dimensional)image processing has been a strongly developing area. One of its 
most important application areas is the medicine, where numerous 
diagnostic imaging devices (e.g., CT, MR, SPECT etc.) are able 
to produce 3- or even higher dimensional images. We have studied 
the possibility of introduction of multidimensional image 
processing into the subjects of Image Processing at József 
Attila University. First, we considered the methods of 
generation of such images, then the different standards accepted 
in the medical applications. From the processing algorithms we 
have dealt with the 3D skeletons, binary operations, 
reconstruction and registration. These topics are discussed in 
the education of graduated and PhD students as well.
</style></abstract></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%">Attila Kuba</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%">László Gábor Nyúl</style></author><author><style face="normal" font="default" size="100%">Antal Nagy</style></author><author><style face="normal" font="default" size="100%">László Csernay</style></author></authors><secondary-authors><author><style face="normal" font="default" size="100%">Ivan Bajla</style></author><author><style face="normal" font="default" size="100%">K Karovic</style></author></secondary-authors></contributors><titles><title><style face="normal" font="default" size="100%">Presentation of 3D SPECT images</style></title><secondary-title><style face="normal" font="default" size="100%">4th International Workshop Measurement</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">1995</style></year><pub-dates><date><style  face="normal" font="default" size="100%">May 1995</style></date></pub-dates></dates><pub-location><style face="normal" font="default" size="100%">Smolenice, Slovakia</style></pub-location><pages><style face="normal" font="default" size="100%">82</style></pages><language><style face="normal" font="default" size="100%">eng</style></language><abstract><style face="normal" font="default" size="100%">&lt;p&gt;The problem of presentation of 3D SPECT (Single-Photon EmissionComputed Tomography) images are considered. Instead of the classical 2D image presentation methods (displaying the slices) the following methods are studied: presentation of sections with a 3D reference image, generation of 3D phase and amplitude images (for gated heart studies), surface rendering and volume rendering by 3DVIEWNIX (MIGP, Univ. Pennsylvania) software. The projections are collected by a single-head SPECT system. After preprocessing (centre-of-rotation, uniformity correction) and reconstruction of the transversal sections absorption- correction and special 3D processing can be done. There are clinical programs for the different kinds of studies (e.g. brain SPECT, heart SPECT). The processed section images are stored and converted into Interfile 3.3 format. The first two presentation methods are available on our SPECT system. In order to use the 3DVIEWNIX software the file of the reconstructed sections is converted into a generalized ACR-NEMA format and transferred into our university network. The 3DVIEWNIX system runs on UNIX machines. It is suitable to visualize, manipulate and analyse multidimensional image data like SPECT. The results of the surface and volume rendering of brain and heart studies are presented.&lt;/p&gt;</style></abstract></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%">Attila Kuba</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%">László Gábor Nyúl</style></author><author><style face="normal" font="default" size="100%">Antal Nagy</style></author><author><style face="normal" font="default" size="100%">László Csernay</style></author></authors><secondary-authors><author><style face="normal" font="default" size="100%">Ivan Bajla</style></author><author><style face="normal" font="default" size="100%">K Karovic</style></author></secondary-authors></contributors><titles><title><style face="normal" font="default" size="100%">Presentation of 3D SPECT images</style></title><secondary-title><style face="normal" font="default" size="100%">4th International Workshop Measurement</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">1995</style></year><pub-dates><date><style  face="normal" font="default" size="100%">May 1995</style></date></pub-dates></dates><pub-location><style face="normal" font="default" size="100%">Smolenice, Slovakia</style></pub-location><pages><style face="normal" font="default" size="100%">82</style></pages><language><style face="normal" font="default" size="100%">eng</style></language><abstract><style face="normal" font="default" size="100%">&lt;p&gt;The problem of presentation of 3D SPECT (Single-Photon EmissionComputed Tomography) images are considered. Instead of the classical 2D image presentation methods (displaying the slices) the following methods are studied: presentation of sections with a 3D reference image, generation of 3D phase and amplitude images (for gated heart studies), surface rendering and volume rendering by 3DVIEWNIX (MIGP, Univ. Pennsylvania) software. The projections are collected by a single-head SPECT system. After preprocessing (centre-of-rotation, uniformity correction) and reconstruction of the transversal sections absorption- correction and special 3D processing can be done. There are clinical programs for the different kinds of studies (e.g. brain SPECT, heart SPECT). The processed section images are stored and converted into Interfile 3.3 format. The first two presentation methods are available on our SPECT system. In order to use the 3DVIEWNIX software the file of the reconstructed sections is converted into a generalized ACR-NEMA format and transferred into our university network. The 3DVIEWNIX system runs on UNIX machines. It is suitable to visualize, manipulate and analyse multidimensional image data like SPECT. The results of the surface and volume rendering of brain and heart studies are presented.&lt;/p&gt;</style></abstract></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%">Endre Katona</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%">Nándor Tóth</style></author></authors><secondary-authors><author><style face="normal" font="default" size="100%">Gunilla Borgefors</style></author></secondary-authors></contributors><titles><title><style face="normal" font="default" size="100%">Signature verification using neuron nets</style></title><secondary-title><style face="normal" font="default" size="100%">Proceedings of the 9th Scandinavian Conference on Image Analysis, SCIA '95</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">1995</style></year><pub-dates><date><style  face="normal" font="default" size="100%">1995///</style></date></pub-dates></dates><publisher><style face="normal" font="default" size="100%">World Sci. Publishing, River Edge, NJ</style></publisher><pub-location><style face="normal" font="default" size="100%">River Edge</style></pub-location><pages><style face="normal" font="default" size="100%">1115 - 1122</style></pages><language><style face="normal" font="default" size="100%">eng</style></language></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%">László Gábor Nyúl</style></author><author><style face="normal" font="default" size="100%">Antal Nagy</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%">József Tolnai</style></author><author><style face="normal" font="default" size="100%">Attila Kuba</style></author></authors><secondary-authors><author><style face="normal" font="default" size="100%">Zoltán Hantos</style></author></secondary-authors></contributors><titles><title><style face="normal" font="default" size="100%">Szabványos képformák orvosi képek tárolására</style></title><secondary-title><style face="normal" font="default" size="100%">MEDICOMP '94, Számítástechnikai és kibernetikai módszerek az orvostudományban és a biológiában</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">1994</style></year><pub-dates><date><style  face="normal" font="default" size="100%">1994///</style></date></pub-dates></dates><publisher><style face="normal" font="default" size="100%">SZOTE</style></publisher><pub-location><style face="normal" font="default" size="100%">Szeged</style></pub-location><pages><style face="normal" font="default" size="100%">112 - 116</style></pages><language><style face="normal" font="default" size="100%">eng</style></language><abstract><style face="normal" font="default" size="100%">Az orvosi képalkotó berendezések fejlődésével elengedhetetlennévált a szabványos orvosi képformátumok kialakítása. A különféle 
eszközökön készült felvételek feldolgozását, összehasonlítását 
és hálózatban való továbbítását megnehezítette, hogy a gyártók a 
képeket csak egyéni, többé-kevésbé publikált formátumban 
tárolták. Ezen a helyzeten kívánnak változtatni különféle 
szervezetek olyan szabványok bevezetésével, amelyek speciálisan 
orvosi képek esetében lehetnek hasznosak. A szabványosítási 
törekvések eredményeként mára három nagy irányzat alakult ki: 
ACR-NEMA, DICOM és Interfile. Előadásunkban vázoljuk az orvosi 
képek tárolási formátumainál érvényesülő specifikus 
szempontokat, röviden ismertetjük az említett szabványokat és 
bemutatjuk az általunk eddig készített, a különféle formátumok 
közötti konverziót biztosító programokat.
</style></abstract></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%">László Gábor Nyúl</style></author><author><style face="normal" font="default" size="100%">Antal Nagy</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%">József Tolnai</style></author><author><style face="normal" font="default" size="100%">Attila Kuba</style></author></authors><secondary-authors><author><style face="normal" font="default" size="100%">Zoltán Hantos</style></author></secondary-authors></contributors><titles><title><style face="normal" font="default" size="100%">Szabványos képformák orvosi képek tárolására</style></title><secondary-title><style face="normal" font="default" size="100%">MEDICOMP '94, Számítástechnikai és kibernetikai módszerek az orvostudományban és a biológiában</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">1994</style></year><pub-dates><date><style  face="normal" font="default" size="100%">1994</style></date></pub-dates></dates><publisher><style face="normal" font="default" size="100%">SZOTE</style></publisher><pub-location><style face="normal" font="default" size="100%">Szeged</style></pub-location><pages><style face="normal" font="default" size="100%">112 - 116</style></pages><language><style face="normal" font="default" size="100%">eng</style></language><abstract><style face="normal" font="default" size="100%">Az orvosi képalkotó berendezések fejlődésével elengedhetetlennévált a szabványos orvosi képformátumok kialakítása. A különféle 
eszközökön készült felvételek feldolgozását, összehasonlítását 
és hálózatban való továbbítását megnehezítette, hogy a gyártók a 
képeket csak egyéni, többé-kevésbé publikált formátumban 
tárolták. Ezen a helyzeten kívánnak változtatni különféle 
szervezetek olyan szabványok bevezetésével, amelyek speciálisan 
orvosi képek esetében lehetnek hasznosak. A szabványosítási 
törekvések eredményeként mára három nagy irányzat alakult ki: 
ACR-NEMA, DICOM és Interfile. Előadásunkban vázoljuk az orvosi 
képek tárolási formátumainál érvényesülő specifikus 
szempontokat, röviden ismertetjük az említett szabványokat és 
bemutatjuk az általunk eddig készített, a különféle formátumok 
közötti konverziót biztosító programokat.
</style></abstract></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>17</ref-type><contributors><authors><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%">Lokális párhuzamos eljárás bináris képek zajszűrésére</style></title><secondary-title><style face="normal" font="default" size="100%">ALKALMAZOTT MATEMATIKAI LAPOK</style></secondary-title><short-title><style face="normal" font="default" size="100%">ALKALMAZOTT MATEMATIKAI LAPOK</style></short-title></titles><dates><year><style  face="normal" font="default" size="100%">1993</style></year><pub-dates><date><style  face="normal" font="default" size="100%">1993///</style></date></pub-dates></dates><volume><style face="normal" font="default" size="100%">17</style></volume><pages><style face="normal" font="default" size="100%">373 - 396</style></pages><isbn><style face="normal" font="default" size="100%">0133-3399</style></isbn><language><style face="normal" font="default" size="100%">eng</style></language></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 Köles</style></author><author><style face="normal" font="default" size="100%">Kálmán Palágyi</style></author></authors><secondary-authors><author><style face="normal" font="default" size="100%">A Gyorgy</style></author></secondary-authors></contributors><titles><title><style face="normal" font="default" size="100%">Image processing on cellprocessors</style></title><secondary-title><style face="normal" font="default" size="100%">Proceedings of Conference on Intelligent Systems, CIS ’91</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">1991</style></year><pub-dates><date><style  face="normal" font="default" size="100%">1991///</style></date></pub-dates></dates><publisher><style face="normal" font="default" size="100%">NJSZT</style></publisher><pub-location><style face="normal" font="default" size="100%">Budapest</style></pub-location><pages><style face="normal" font="default" size="100%">31 - 40</style></pages><language><style face="normal" font="default" size="100%">eng</style></language></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%">Nándor Tóth</style></author><author><style face="normal" font="default" size="100%">Kálmán Palágyi</style></author></authors><secondary-authors><author><style face="normal" font="default" size="100%">A Gyorgy</style></author></secondary-authors></contributors><titles><title><style face="normal" font="default" size="100%">Neural Network Implementation on Cellular Processor</style></title><secondary-title><style face="normal" font="default" size="100%">Proceedings of Conference on Intelligent Systems, CIS ’91</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">1991</style></year><pub-dates><date><style  face="normal" font="default" size="100%">1991///</style></date></pub-dates></dates><publisher><style face="normal" font="default" size="100%">NJSZT</style></publisher><pub-location><style face="normal" font="default" size="100%">Budapest</style></pub-location><pages><style face="normal" font="default" size="100%">129 - 137</style></pages><language><style face="normal" font="default" size="100%">eng</style></language></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%">T Tűzkő</style></author><author><style face="normal" font="default" size="100%">Kálmán Palágyi</style></author></authors><secondary-authors><author><style face="normal" font="default" size="100%">G Wolf</style></author><author><style face="normal" font="default" size="100%">Tamás Legendi</style></author><author><style face="normal" font="default" size="100%">U Schendel</style></author></secondary-authors></contributors><titles><title><style face="normal" font="default" size="100%">Cellular program development for the M1 processor</style></title><secondary-title><style face="normal" font="default" size="100%">Proceedings of the 5th International Workshop Parallel Processing by Cellular Automata and Arrays, Parcella '90</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">1990</style></year><pub-dates><date><style  face="normal" font="default" size="100%">1990///</style></date></pub-dates></dates><publisher><style face="normal" font="default" size="100%">Akademie Verlag</style></publisher><pub-location><style face="normal" font="default" size="100%">Berlin</style></pub-location><pages><style face="normal" font="default" size="100%">315 - 319</style></pages><language><style face="normal" font="default" size="100%">eng</style></language></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>17</ref-type><contributors><authors><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%">SOLUTION OF DENSE SYSTEMS OF LINEAR-EQUATIONS USING CELLULAR PROCESSORS</style></title><secondary-title><style face="normal" font="default" size="100%">LECTURE NOTES IN COMPUTER SCIENCE</style></secondary-title><short-title><style face="normal" font="default" size="100%">LECT NOTES COMPUT SCI</style></short-title></titles><dates><year><style  face="normal" font="default" size="100%">1989</style></year><pub-dates><date><style  face="normal" font="default" size="100%">1989///</style></date></pub-dates></dates><pub-location><style face="normal" font="default" size="100%">BOYANCZYK A, 1981, NUMERICALLY STABLE S, P21HWANG K, 1982, IEEE T COMPUT, V31, P1215
KATONA E, 1986, PARALLEL COMPUTING 8
KATONA E, 1988, 4TH P CELL M TU BRAU
KUNG HT, 1978, SYSTOLIC ARRAYS, P32
LEGENDI T, 1977, CELLPROCESSORS COMPU, V11, P147
MIKLOSKO J,</style></pub-location><volume><style face="normal" font="default" size="100%">342</style></volume><pages><style face="normal" font="default" size="100%">311 - 316</style></pages><isbn><style face="normal" font="default" size="100%">0302-9743</style></isbn><language><style face="normal" font="default" size="100%">eng</style></language><notes><style face="normal" font="default" size="100%">UT: A1989AB14600024doi: 10.1007/3-540-50647-0_123Gottfried Wolf, Tamáas Legendi and Udo Schendel (eds.):Parcella'88 Fourth International Workshop on Parallel Processing 
by Cellular Automata and Arrays Berlin, GDR, October 17-21, 
1988, Proceedings 
Berlin ; Heidelberg : Springer, 1989 
ISBN: 3-540-50647-0
</style></notes></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%">Kálmán Palágyi</style></author></authors><secondary-authors><author><style face="normal" font="default" size="100%">Tamás Legendi</style></author><author><style face="normal" font="default" size="100%">Dennis Parkinson</style></author><author><style face="normal" font="default" size="100%">R Vollmar</style></author><author><style face="normal" font="default" size="100%">G Wolf</style></author></secondary-authors></contributors><titles><title><style face="normal" font="default" size="100%">Cellular algorithms for matrix multiplication</style></title><secondary-title><style face="normal" font="default" size="100%">Proceedings of the 3rd International Workshop Parallel Processing by Cellular Automata and Arrays, Parcella'86</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">1987</style></year><pub-dates><date><style  face="normal" font="default" size="100%">1987///</style></date></pub-dates></dates><publisher><style face="normal" font="default" size="100%">North-Holland Publishing Company</style></publisher><pub-location><style face="normal" font="default" size="100%">Amsterdam</style></pub-location><pages><style face="normal" font="default" size="100%">122 - 129</style></pages><language><style face="normal" font="default" size="100%">eng</style></language></record></records></xml>