@article {2344, title = {Binary image reconstruction from a small number of projections and the morphological skeleton}, journal = {ANNALS OF MATHEMATICS AND ARTIFICIAL INTELLIGENCE}, volume = {75}, year = {2015}, month = {2015}, pages = {195-216}, publisher = {Springer}, type = {Journal article}, issn = {1012-2443}, doi = {10.1007/s10472-014-9440-8}, author = {Norbert Hantos and Szabolcs Iv{\'a}n and P{\'e}ter Bal{\'a}zs and K{\'a}lm{\'a}n Pal{\'a}gyi} } @inbook {2350, title = {Equivalent Sequential and Parallel Subiteration-Based Surface-Thinning Algorithms}, booktitle = {Proceedings of Combinatorial Image Analysis: 17th International Workshop, IWCIA 2015}, series = {Lecture Notes in Computer Science}, volume = {9448}, year = {2015}, month = {Nov 2015}, pages = {31-45}, publisher = {Springer}, organization = {Springer}, type = {Conference paper}, address = {Calcutta, India}, isbn = {978-3-319-26144-7}, author = {K{\'a}lm{\'a}n Pal{\'a}gyi and G{\'a}bor N{\'e}meth and P{\'e}ter Kardos}, editor = {Reneta P Barneva and Bhattacharya, B. B. and Valentin E Brimkov} } @conference {2106, title = {Topology Preserving Reductions and Additions on the Triangular, Square, and Hexagonal Grids}, booktitle = {K{\'e}pfeldolgoz{\'o}k {\'e}s Alakfelismer{\H o}k T{\'a}rsas{\'a}g{\'a}nak 10. orsz{\'a}gos konferenci{\'a}ja}, year = {2015}, month = {Jan 2015}, pages = {588-600}, type = {Conference paper}, address = {Kecskem{\'e}t, Magyarorsz{\'a}g}, abstract = {

The Euclidean plane can be partitioned into three kinds of
regular polygons, which results in triangular, square and hexagonal grids.
While the topology of the square grid is well-established, less emphasis
is put on the remaining two regular sampling schemes. In this paper we
summarize the results of our research that aimed to give some general
characterizations of simple pixels and sufficient conditions for topology-
preserving operators in the mentioned grids.

}, author = {P{\'e}ter Kardos and K{\'a}lm{\'a}n Pal{\'a}gyi} } @conference {2345, title = {Topology-Preserving Equivalent Parallel and Sequential 4-Subiteration 2D Thinning Algorithms}, booktitle = {Image and Signal Processing and Analysis (ISPA), 2015 9th International Symposium on}, year = {2015}, month = {2015 Sep}, pages = {304-309}, publisher = {IEEE}, organization = {IEEE}, type = {Conference paper}, address = {Zagreb, Croatia}, abstract = {

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.

}, isbn = {978-1-4673-8032-4}, doi = {10.1109/ISPA.2015.7306077}, author = {K{\'a}lm{\'a}n Pal{\'a}gyi and G{\'a}bor N{\'e}meth and P{\'e}ter Kardos}, editor = {S Loncaric and D Lerski and H Eskola and R Bregovic} } @conference {2097, title = {V{\'e}kony{\'\i}t{\'a}s a v{\'e}gpont-meg{\H o}rz{\'e}s fel{\"u}lvizsg{\'a}lat{\'a}va}, booktitle = { K{\'e}pfeldolgoz{\'o}k {\'e}s Alakfelismer{\H o}k T{\'a}rsas{\'a}g{\'a}nak 10. orsz{\'a}gos konferenci{\'a}ja}, year = {2015}, month = {Jan 2015}, pages = {578-587}, type = {Conference paper}, address = {Kecskem{\'e}t, Magyarorsz{\'a}g}, abstract = {

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

}, author = {G{\'a}bor N{\'e}meth and P{\'e}ter Kardos and K{\'a}lm{\'a}n Pal{\'a}gyi} } @inbook {986, title = {Equivalent 2D sequential and parallel thinning}, booktitle = {Combinatorial Image Analysis}, year = {2014}, month = {May 2014}, pages = {91 - 100}, publisher = {Springer }, organization = {Springer }, type = {Conference paper}, address = {Brno, Czech Republic}, author = {K{\'a}lm{\'a}n Pal{\'a}gyi}, editor = {Reneta P Barneva and Valentin E Brimkov and Josef {\v S}lapal} } @inbook {1990, title = {K{\'e}pfeldolgoz{\'a}s a szegedi informatikus-k{\'e}pz{\'e}sben}, booktitle = {Informatika a fels{\H o}oktat{\'a}sban 2014}, year = {2014}, month = {2014}, pages = {667-675}, publisher = {University of Debrecen}, organization = {University of Debrecen}, type = {Conference paper}, address = {Debrecen, Hungary}, issn = {978-963-473-712-4}, author = {P{\'e}ter Bal{\'a}zs and Endre Katona and Zoltan Kato and Antal Nagy and G{\'a}bor N{\'e}meth and L{\'a}szl{\'o} G{\'a}bor Ny{\'u}l and K{\'a}lm{\'a}n Pal{\'a}gyi and Attila Tanacs and L{\'a}szl{\'o} G{\'a}bor Varga}, editor = {Roland Kunkli and Ildik{\'o} Papp and Ed{\'e}n{\'e} Rutkovszky} } @inbook {988, title = {Sufficient conditions for general 2D operators to preserve topology}, booktitle = {Combinatorial Image Analysis}, series = {Lecture Notes in Computer Science}, volume = {8466}, year = {2014}, month = {2014}, pages = {101 - 112}, publisher = {Springer}, organization = {Springer}, type = {Conference paper}, address = {May 2014, Brno, Czech Republic}, abstract = {

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.

}, isbn = {978-3-319-07147-3}, issn = {978-3-319-07147-3}, doi = {10.1007/978-3-319-07148-0_10}, url = {http://dx.doi.org/10.1007/978-3-319-07148-0_10}, author = {P{\'e}ter Kardos and K{\'a}lm{\'a}n Pal{\'a}gyi}, editor = {Reneta P Barneva and Valentin E Brimkov and Josef {\v S}lapal} } @conference {940, title = {Bin{\'a}ris k{\'e}pek rekonstrukci{\'o}ja k{\'e}t vet{\"u}letb{\H o}l {\'e}s morfol{\'o}giai v{\'a}zb{\'o}l}, booktitle = {A K{\'e}pfeldolgoz{\'o}k {\'e}s Alakfelismer{\H o}k T{\'a}rsas{\'a}g{\'a}nak konferenci{\'a}ja - K{\'E}PAF 2013}, year = {2013}, month = {Jan 2013}, pages = {182 - 193}, publisher = {NJSZT-K{\'E}PAF}, organization = {NJSZT-K{\'E}PAF}, type = {Conference paper}, address = {Veszpr{\'e}m}, author = {Norbert Hantos and P{\'e}ter Bal{\'a}zs and K{\'a}lm{\'a}n Pal{\'a}gyi}, editor = {L{\'a}szl{\'o} Cz{\'u}ni} } @article {978, title = {Conference of PhD Students in Computer Science}, journal = {ACTA CYBERNETICA-SZEGED}, volume = {21}, year = {2013}, month = {2013}, pages = {1 - 3}, type = {Journal article}, isbn = {0324-721X}, author = {K{\'a}lm{\'a}n Pal{\'a}gyi} } @inbook {982, title = {Deletion Rules for Equivalent Sequential and Parallel Reductions}, booktitle = {Progress in Pattern Recognition, Image Analysis, Computer Vision, and Applications}, series = {Lecture Notes in Computer Science}, year = {2013}, note = {Lecture Notes in Computer Science, Vol. 8258}, month = {Nov 2013}, pages = {17 - 24}, publisher = {Springer}, organization = {Springer}, type = {Conference paper}, address = {Berlin; Heidelberg}, abstract = {

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.

}, isbn = {978-3-642-41821-1}, doi = {10.1007/978-3-642-41822-8_3}, url = {http://link.springer.com/chapter/10.1007\%2F978-3-642-41822-8_3}, author = {K{\'a}lm{\'a}n Pal{\'a}gyi}, editor = {Jose Ruiz-Shulcloper and Gabriella Sanniti di Baja} } @inbook {981, title = {Parallel 3D 12-Subiteration Thinning Algorithms Based on Isthmuses}, booktitle = {Advances in Visual Computing}, series = {Lecture Notes in Computer Science}, number = {8033}, year = {2013}, note = {Lecture Notes in Computer Science, Vol. 8033}, month = {Jul 2013}, pages = {87 - 98}, publisher = {Springer Verlag}, organization = {Springer Verlag}, type = {Conference paper}, address = {Heidelberg; New York}, abstract = {

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.

}, doi = { 10.1007/978-3-642-41914-0_10}, author = {K{\'a}lm{\'a}n Pal{\'a}gyi}, editor = {George Bebis} } @conference {879, title = {Parallel Thinning Based on Isthmuses}, booktitle = {A K{\'e}pfeldolgoz{\'o}k {\'e}s Alakfelismer{\H o}k T{\'a}rsas{\'a}g{\'a}nak konferenci{\'a}ja - K{\'E}PAF 2013}, year = {2013}, month = {Jan 2013}, pages = {512 - 525}, publisher = {NJSZT-K{\'E}PAF}, organization = {NJSZT-K{\'E}PAF}, type = {Conference paper}, address = {Veszpr{\'e}m}, author = {G{\'a}bor N{\'e}meth and K{\'a}lm{\'a}n Pal{\'a}gyi}, editor = {L{\'a}szl{\'o} Cz{\'u}ni} } @inbook {983, title = {Parallel Thinning on the Triangular Grid}, booktitle = {International Conference on Cognitive Infocommunications (CogInfoCom)}, year = {2013}, month = {Dec 2013}, pages = {277 - 282}, publisher = {IEEE}, organization = {IEEE}, type = {Conference paper}, address = {Budapest}, abstract = {

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.

}, isbn = {978-1-4799-1543-9 }, doi = {10.1109/CogInfoCom.2013.6719256}, author = {P{\'e}ter Kardos and K{\'a}lm{\'a}n Pal{\'a}gyi}, editor = {P{\'e}ter Baranyi} } @inbook {976, title = {Sufficient Conditions for Topology Preserving Additions and General Operators}, booktitle = {Proceedings of the IASTED International Conference on Computer Graphics and Imaging (CGIM)}, year = {2013}, month = {Feb 2013}, pages = {107 - 114}, publisher = {IASTED - Acta Press}, organization = {IASTED - Acta Press}, type = {Conference paper}, address = {Calgary}, abstract = {

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.

}, doi = {10.2316/P.2013.797-040}, author = {P{\'e}ter Kardos and K{\'a}lm{\'a}n Pal{\'a}gyi}, editor = {L Linsen} } @inbook {980, title = {On Topology Preservation in Triangular, Square, and Hexagonal Grids}, booktitle = {Proceedings of International Symposium on Image and Signal Processing and Analysis (ISPA)}, year = {2013}, month = {Sep 2013}, pages = {782 - 787}, publisher = {IEEE}, organization = {IEEE}, type = {Conference paper}, address = {Trieste}, abstract = {

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.

}, doi = {10.1109/ISPA.2013.6703844}, author = {P{\'e}ter Kardos and K{\'a}lm{\'a}n Pal{\'a}gyi}, editor = {Giovanni Ramponi and Sven Lon{\v c}ari{\'c} and Alberto Carini and Karen Egiazarian} } @conference {974, title = {Topology preserving parallel thinning on hexagonal grids}, booktitle = {A K{\'e}pfeldolgoz{\'o}k {\'e}s Alakfelismer{\H o}k T{\'a}rsas{\'a}g{\'a}nak konferenci{\'a}ja - K{\'E}PAF 2013}, year = {2013}, month = {Jan 2013}, pages = {250 - 264}, publisher = {NJSZT-K{\'E}PAF}, organization = {NJSZT-K{\'E}PAF}, type = {Conference paper}, address = {Veszpr{\'e}m}, author = {P{\'e}ter Kardos and K{\'a}lm{\'a}n Pal{\'a}gyi}, editor = {L{\'a}szl{\'o} Cz{\'u}ni} } @article {975, title = {Topology-preserving hexagonal thinning}, journal = {INTERNATIONAL JOURNAL OF COMPUTER MATHEMATICS}, volume = {90}, year = {2013}, note = {doi: 10.1080/00207160.2012.724198}, month = {2013}, pages = {1607 - 1617}, publisher = {Taylor \& Francis}, type = {Journal article}, abstract = {

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.

}, isbn = {0020-7160}, doi = {10.1080/00207160.2012.724198}, url = {http://www.tandfonline.com/doi/abs/10.1080/00207160.2012.724198$\#$preview}, author = {P{\'e}ter Kardos and K{\'a}lm{\'a}n Pal{\'a}gyi} } @inbook {878, title = {3D Parallel Thinning Algorithms Based on Isthmuses}, booktitle = {Advanced Concepts for Intelligent Vision Systems (ACIVS)}, series = {Lecture Notes in Computer Science}, volume = {7517}, year = {2012}, note = {N1 10.1007/978-3-642-33140-4_29}, month = {Sep 2012}, pages = {325 - 335}, publisher = {Springer Verlag}, organization = {Springer Verlag}, type = {Conference Paper}, address = {Brno, Czech Republic}, abstract = {

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.

}, doi = {10.1007/978-3-642-33140-4_29}, url = {http://dx.doi.org/10.1007/978-3-642-33140-4_29}, author = {G{\'a}bor N{\'e}meth and K{\'a}lm{\'a}n Pal{\'a}gyi}, editor = {Jacques Blanc-Talon and Wilfried Philips and Dan Popescu and Paul Scheunders and Pavel Zem{\v c}{\'\i}k} } @inbook {1153, title = {Binary image reconstruction from two projections and skeletal information}, booktitle = {Combinatorial Image Analysis}, series = {Lecture Notes in Computer Science}, number = {7655}, year = {2012}, note = {ScopusID: 84869986820doi: 10.1007/978-3-642-34732-0_20}, month = {Nov 2012}, pages = {263 - 273}, publisher = {Springer Verlag}, organization = {Springer Verlag}, type = {Conference paper}, address = {Berlin; Heidelberg; New York; London; Paris; Tokyo}, abstract = {

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. {\textcopyright} 2012 Springer-Verlag.

}, doi = {10.1007/978-3-642-34732-0_20}, author = {Norbert Hantos and P{\'e}ter Bal{\'a}zs and K{\'a}lm{\'a}n Pal{\'a}gyi}, editor = {Reneta P Barneva and Valentin E Brimkov and Jake K Aggarwal} } @conference {1145, title = {Binary tomography using two projections and morphological skeleton}, booktitle = {Conference of PhD Students in Computer Science}, volume = {Volume of Extended Abstracts}, year = {2012}, month = {June 2012}, pages = {20}, publisher = {Univ Szeged Institute of Informatics}, organization = {Univ Szeged Institute of Informatics}, address = {Szeged}, author = {Norbert Hantos and P{\'e}ter Bal{\'a}zs and K{\'a}lm{\'a}n Pal{\'a}gyi} } @inbook {942, title = {Hexagonal parallel thinning algorithms based on sufficient conditions for topology preservation}, booktitle = {Computational Modelling of Objects Represented in Images: Fundamentals, Methods and Applications III}, year = {2012}, month = {2012}, pages = {63 - 68}, publisher = {CRC Press - Taylor and Frances Group}, organization = {CRC Press - Taylor and Frances Group}, type = {Conference paper}, address = {London}, abstract = {

Thinning is a well-known technique for producing skeleton-like shape features from digital
binary objects in a topology preserving way. Most of the existing thinning algorithms presuppose that the input
images are sampled on orthogonal grids.This paper presents new sufficient conditions for topology preserving
reductions working on hexagonal grids (or triangular lattices) and eight new 2D hexagonal parallel thinning
algorithms that are based on our conditions.The proposed algorithms are capable of producing both medial lines
and topological kernels as well.

}, isbn = {978-0-415-62134-2}, doi = {10.1201/b12753-12}, author = {P{\'e}ter Kardos and K{\'a}lm{\'a}n Pal{\'a}gyi}, editor = {Paolo Di Giamberardino and Daniela Iacoviello and Renato M Natal Jorge and Joao Manuel R S Taveres} } @conference {941, title = {Isthmus-based Order-Independent Sequential Thinning}, booktitle = {IASTED International Conference on Signal Processing, Pattern Recognition and Applications (SSPRA)}, year = {2012}, note = {doi: 10.2316/P.2012.778-025}, month = {June 2012}, pages = {28 - 34}, publisher = {IASTED ACTA Press}, organization = {IASTED ACTA Press}, type = {Conference paper}, address = {Crete, Greek}, abstract = {

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.

}, doi = {10.2316/P.2012.778-025}, url = {http://www.actapress.com/Content_of_Proceeding.aspx?proceedingID=736}, author = {P{\'e}ter Kardos and K{\'a}lm{\'a}n Pal{\'a}gyi}, editor = {M Petrou and A D Sappa and A G Triantafyllidis} } @conference {944, title = {On Order{\textendash}Independent Sequential Thinning}, booktitle = {IEEE International Conference on Cognitive Infocommunications (CogInfoCom)}, year = {2012}, month = {2012}, pages = {149 - 154}, publisher = {IEEE}, organization = {IEEE}, type = {Conference paper}, address = {Kosice, Slovakia }, abstract = {

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.

}, isbn = {978-1-4673-5187-4 }, doi = {10.1109/CogInfoCom.2012.6421971}, url = {http://ieeexplore.ieee.org/xpl/mostRecentIssue.jsp?punumber=6413305}, author = {P{\'e}ter Kardos and K{\'a}lm{\'a}n Pal{\'a}gyi}, editor = {IEEE} } @conference {1154, title = {Solving binary tomography from morphological skeleton via optimization}, booktitle = {Veszpr{\'e}m Optimization Conference: Advanced Algorithms (VOCAL)}, year = {2012}, month = {Dec 2012}, pages = {42}, publisher = {University of Pannonia}, organization = {University of Pannonia}, type = {Conference paper}, address = {Veszpr{\'e}m}, author = {Norbert Hantos and P{\'e}ter Bal{\'a}zs and K{\'a}lm{\'a}n Pal{\'a}gyi} } @inbook {943, title = {On topology preservation for triangular thinning algorithms}, booktitle = {Combinatorial Image Analysis (IWCIA)}, series = {Lecture Notes in Computer Science}, number = {7655}, year = {2012}, note = {doi: 10.1007/978-3-642-34732-0_10Lecture Notes in Computer Science, Volume 7655}, month = {Nov 2012}, pages = {128 - 142}, publisher = {Springer Verlag}, organization = {Springer Verlag}, type = {Conference paper}, address = {Austin, TX, USA}, abstract = {

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.

}, isbn = {978-3-642-34731-3}, doi = {10.1007/978-3-642-34732-0_10}, author = {P{\'e}ter Kardos and K{\'a}lm{\'a}n Pal{\'a}gyi}, editor = {Reneta P Barneva and Valentin E Brimkov and Jake K Aggarwal} } @inbook {875, title = {Topology Preserving Parallel 3D Thinning Algorithms}, booktitle = {Digital Geometry Algorithms}, series = {Lecture Notes in Computational Vision and Biomechanics}, number = {2}, year = {2012}, note = {doi: 10.1007/978-94-007-4174-4_6}, month = {2012}, pages = {165 - 188}, publisher = {Springer-Verlag}, organization = {Springer-Verlag}, type = {Book chapter}, chapter = {6}, abstract = {

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.

}, isbn = {978-94-007-4173-7}, doi = {10.1007/978-94-007-4174-4_6}, author = {K{\'a}lm{\'a}n Pal{\'a}gyi and G{\'a}bor N{\'e}meth and P{\'e}ter Kardos}, editor = {Valentin E Brimkov and Reneta P Barneva} } @conference {874, title = {2D Parallel Thinning Algorithms Based on Isthmus-Preservation}, booktitle = {Proceedings of the International Symposium on Image and Signal Processing and Analysis (ISPA)}, year = {2011}, note = {ScopusID: 83455172782}, month = {Sep 2011 }, pages = {585 - 590}, publisher = {IEEE}, organization = {IEEE}, type = {Conference paper}, address = {Dubrovnik, Croatia}, abstract = {

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.

}, isbn = {978-1-4577-0841-1 }, author = {G{\'a}bor N{\'e}meth and K{\'a}lm{\'a}n Pal{\'a}gyi}, editor = {Sven Lon{\v c}ari{\'c} and Giovanni Ramponi and D. Sersic} } @article {870, title = {2D parallel thinning and shrinking based on sufficient conditions for topology preservation}, journal = {ACTA CYBERNETICA-SZEGED}, volume = {20}, year = {2011}, note = {ScopusID: 79960666919}, month = {2011}, pages = {125 - 144}, publisher = {University of Szeged, Institute of Informatics}, type = {Journal article}, address = {Szeged}, abstract = {

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.

}, isbn = {0324-721X}, author = {G{\'a}bor N{\'e}meth and P{\'e}ter Kardos and K{\'a}lm{\'a}n Pal{\'a}gyi} } @conference {1222, title = {3D objektumok line{\'a}ris deform{\'a}ci{\'o}inak becsl{\'e}se}, booktitle = {A K{\'e}pfeldolgoz{\'o}k {\'e}s Alakfelismer{\H o}k T{\'a}rsas{\'a}g{\'a}nak konferenci{\'a}ja - K{\'E}PAF 2011}, year = {2011}, month = {Jan 2011}, pages = {471 - 480}, publisher = {NJSZT}, organization = {NJSZT}, type = {Conference paper}, address = {Szeged}, author = {Attila Tanacs and Joakim Lindblad and Nata{\v s}a Sladoje and Zoltan Kato}, editor = {Zoltan Kato and K{\'a}lm{\'a}n Pal{\'a}gyi} } @conference {1220, title = {Affin Puzzle: Deform{\'a}lt objektumdarabok helyre{\'a}ll{\'\i}t{\'a}sa megfeleltet{\'e}sek n{\'e}lk{\"u}l}, booktitle = {A K{\'e}pfeldolgoz{\'o}k {\'e}s Alakfelismer{\H o}k T{\'a}rsas{\'a}g{\'a}nak konferenci{\'a}ja - K{\'E}PAF 2011}, year = {2011}, note = {Kuba Attila D{\'\i}jas cikk.}, month = {Jan 2011}, pages = {206 - 220}, publisher = {NJSZT}, organization = {NJSZT}, type = {Conference paper}, address = {Szeged}, url = {http://www.inf.u-szeged.hu/kepaf2011/pdfs/S05_03.pdf}, author = {Csaba Domokos and Zoltan Kato}, editor = {Zoltan Kato and K{\'a}lm{\'a}n Pal{\'a}gyi} } @conference {1128, title = {Bin{\'a}ris tomogr{\'a}fiai rekonstrukci{\'o} objektum alap{\'u} evol{\'u}ci{\'o}s algoritmussal}, booktitle = {A K{\'e}pfeldolgoz{\'o}k {\'e}s Alakfelismer{\H o}k T{\'a}rsas{\'a}g{\'a}nak konferenci{\'a}ja - K{\'E}PAF 2011}, year = {2011}, month = {Jan 2011}, pages = {117 - 127}, publisher = {NJSZT}, organization = {NJSZT}, type = {Conference paper}, address = {Szeged}, author = {Mih{\'a}ly Gara and P{\'e}ter Bal{\'a}zs}, editor = {Zoltan Kato and K{\'a}lm{\'a}n Pal{\'a}gyi} } @article {932, title = {Conference of PhD Students in Computer Science}, journal = {ACTA CYBERNETICA-SZEGED}, volume = {20}, year = {2011}, note = {ScopusID: 79960683318}, month = {2011}, pages = {3}, type = {Journal article}, isbn = {0324-721X}, author = {K{\'a}lm{\'a}n Pal{\'a}gyi} } @conference {1221, title = {{\'E}l{\H o}sejt szegment{\'a}l{\'a}sa gr{\'a}fv{\'a}g{\'a}s seg{\'\i}ts{\'e}g{\'e}vel fluoreszcenci{\'a}s mikroszk{\'o}p k{\'e}peken}, booktitle = {A K{\'e}pfeldolgoz{\'o}k {\'e}s Alakfelismer{\H o}k T{\'a}rsas{\'a}g{\'a}nak konferenci{\'a}ja - K{\'E}PAF 2011}, year = {2011}, month = {Jan 2011}, pages = {319 - 328}, publisher = {NJSZT}, organization = {NJSZT}, type = {Conference paper}, address = {Szeged}, url = {http://www.inf.u-szeged.hu/kepaf2011/pdfs/S08_02.pdf}, author = {Milan Lesko and Zoltan Kato and Antal Nagy and Imre Gombos and Zsolt T{\"o}r{\"o}k and L{\'a}szl{\'o} V{\'\i}gh and L{\'a}szl{\'o} V{\'\i}gh}, editor = {Zoltan Kato and K{\'a}lm{\'a}n Pal{\'a}gyi} } @inbook {864, title = {A family of topology-preserving 3d parallel 6-subiteration thinning algorithms}, booktitle = {Combinatorial Image Analysis (IWCIA)}, series = {Lecture Notes in Computer Science}, number = {6636}, year = {2011}, note = {ScopusID: 79957651399doi: 10.1007/978-3-642-21073-0_5}, month = {May 2011}, pages = {17 - 30}, publisher = {Springer Verlag}, organization = {Springer Verlag}, type = {Conference paper}, address = {Madrid, Spain}, abstract = {

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. {\textcopyright} 2011 Springer-Verlag Berlin Heidelberg.

}, isbn = {978-3-642-21072-3}, doi = {10.1007/978-3-642-21073-0_5}, author = {G{\'a}bor N{\'e}meth and P{\'e}ter Kardos and K{\'a}lm{\'a}n Pal{\'a}gyi}, editor = {Jake K Aggarwal and Reneta P Barneva and Valentin E Brimkov and Kostadin N Koroutchev and Elka R Korutcheva} } @conference {876, title = {Iter{\'a}ci{\'o}nk{\'e}nti sim{\'\i}t{\'a}ssal kombin{\'a}lt v{\'e}kony{\'\i}t{\'a}s}, booktitle = {A K{\'e}pfeldolgoz{\'o}k {\'e}s Alakfelismer{\H o}k T{\'a}rsas{\'a}g{\'a}nak konferenci{\'a}ja - K{\'E}PAF 2011}, year = {2011}, month = {Jan 2011}, pages = {174 - 189}, publisher = {NJSZT}, organization = {NJSZT}, type = {Conference paper}, address = {Szeged}, url = {http://www.inf.u-szeged.hu/kepaf2011/pdfs/S05_01.pdf}, author = {P{\'e}ter Kardos and G{\'a}bor N{\'e}meth and K{\'a}lm{\'a}n Pal{\'a}gyi}, editor = {Zoltan Kato and K{\'a}lm{\'a}n Pal{\'a}gyi} } @book {937, title = {K{\'e}pfeldolgoz{\'a}s halad{\'o}knak}, year = {2011}, month = {2011}, publisher = {Typotex}, organization = {Typotex}, type = {Book}, address = {Budapest}, author = {K{\'a}lm{\'a}n Pal{\'a}gyi} } @conference {1129, title = {Medi{\'a}nsz{\H u}r{\'e}s alkalmaz{\'a}sa algebrai rekonstrukci{\'o}s m{\'o}dszerekben}, booktitle = {A K{\'e}pfeldolgoz{\'o}k {\'e}s Alakfelismer{\H o}k T{\'a}rsas{\'a}g{\'a}nak konferenci{\'a}ja - K{\'E}PAF 2011}, year = {2011}, month = {Jan 2011}, pages = {106 - 116}, publisher = {NJSZT}, organization = {NJSZT}, type = {Conference paper}, address = {Szeged}, author = {Norbert Hantos and P{\'e}ter Bal{\'a}zs}, editor = {Zoltan Kato and K{\'a}lm{\'a}n Pal{\'a}gyi} } @conference {933, title = {Order-independent sequential thinning in arbitrary dimensions}, booktitle = {Signal and Image Processing and Applications (SIPA)}, year = {2011}, note = {doi: 10.2316/P.2011.738-021}, month = {June 2011}, pages = {129 - 134}, publisher = {IASTED - Acta Press}, organization = {IASTED - Acta Press}, type = {Conference paper}, address = {Crete, Greek}, abstract = {

Skeletons are region based shape descriptors that play important role in shape representation. This paper introduces a novel sequential thinning approach for n-dimensional binary objects (n =1,2,3, ...). Its main strength lies in its order--independency, i.e., it can produce the same skeletons for any visiting orders of border points. Furthermore, this is the first scheme in this field that is also applicable for higher dimensions.

}, doi = { 10.2316/P.2011.738-021}, author = {P{\'e}ter Kardos and K{\'a}lm{\'a}n Pal{\'a}gyi}, editor = {Ioannis Andreadis and M Zervakis} } @article {871, title = {Thinning combined with iteration-by-iteration smoothing for 3D binary images}, journal = {GRAPHICAL MODELS}, volume = {73}, year = {2011}, note = {ScopusID: 79952613010doi: 10.1016/j.gmod.2011.02.001}, month = {Nov 2011}, pages = {335 - 345}, type = {Journal article}, abstract = {

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. {\textcopyright} 2011 Elsevier Inc. All rights reserved.

}, isbn = {1524-0703}, doi = {10.1016/j.gmod.2011.02.001}, author = {G{\'a}bor N{\'e}meth and P{\'e}ter Kardos and K{\'a}lm{\'a}n Pal{\'a}gyi} } @conference {877, title = {A topol{\'o}gia-meg{\H o}rz{\'e}s elegend{\H o} felt{\'e}telein alapul{\'o} 3D p{\'a}rhuzamos v{\'e}kony{\'\i}t{\'o} algoritmusok}, booktitle = {A K{\'e}pfeldolgoz{\'o}k {\'e}s Alakfelismer{\H o}k T{\'a}rsas{\'a}g{\'a}nak konferenci{\'a}ja - K{\'E}PAF 2011}, year = {2011}, month = {Jan 2011}, pages = {190 - 205}, publisher = {NJSZT}, organization = {NJSZT}, type = {Conference paper}, address = {Szeged}, url = {http://www.inf.u-szeged.hu/kepaf2011/pdfs/S05_02.pdf}, author = {G{\'a}bor N{\'e}meth and P{\'e}ter Kardos and K{\'a}lm{\'a}n Pal{\'a}gyi}, editor = {Zoltan Kato and K{\'a}lm{\'a}n Pal{\'a}gyi} } @inbook {935, title = {On topology preservation for hexagonal parallel thinning algorithms}, booktitle = {Combinatorial Image Analysis (IWCIA)}, series = {Lecture Notes in Computer Science}, number = {6636}, year = {2011}, note = {ScopusID: 79957628214doi: 10.1007/978-3-642-21073-0_6}, month = {May 2011}, pages = {31 - 42}, publisher = {Springer Verlag}, organization = {Springer Verlag}, type = {Conference paper}, address = {Madrid, Spain}, abstract = {

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. {\textcopyright} 2011 Springer-Verlag Berlin Heidelberg.

}, isbn = {978-3-642-21072-3}, doi = {10.1007/978-3-642-21073-0_6}, author = {P{\'e}ter Kardos and K{\'a}lm{\'a}n Pal{\'a}gyi}, editor = {Jake K Aggarwal and Reneta P Barneva and Valentin E Brimkov and Kostadin N Koroutchev and Elka R Korutcheva} } @article {863, title = {Topology Preserving Parallel Thinning Algorithms}, journal = {INTERNATIONAL JOURNAL OF IMAGING SYSTEMS AND TECHNOLOGY}, volume = {21}, year = {2011}, note = {UT: 000287789100005ScopusID: 79951782238doi: 10.1002/ima.20272}, month = {Feb 2011}, pages = {37 - 44}, publisher = {Wiley Periodicals, Inc.}, type = {Journal article}, abstract = {

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. {\textcopyright} 2011 Wiley Periodicals, Inc.

}, isbn = {0899-9457}, doi = {10.1002/ima.20272}, author = {G{\'a}bor N{\'e}meth and K{\'a}lm{\'a}n Pal{\'a}gyi} } @conference {1130, title = {Vet{\"u}leti ir{\'a}nyf{\"u}gg{\H o}s{\'e}g a bin{\'a}ris tomogr{\'a}fi{\'a}ban}, booktitle = {A K{\'e}pfeldolgoz{\'o}k {\'e}s Alakfelismer{\H o}k T{\'a}rsas{\'a}g{\'a}nak konferenci{\'a}ja - K{\'E}PAF 2011}, year = {2011}, month = {Jan 2011}, pages = {92 - 105}, publisher = {NJSZT}, organization = {NJSZT}, type = {Conference paper}, address = {Szeged}, author = {L{\'a}szl{\'o} G{\'a}bor Varga and P{\'e}ter Bal{\'a}zs and Antal Nagy}, editor = {Zoltan Kato and K{\'a}lm{\'a}n Pal{\'a}gyi} } @article {862, title = {Bej{\'a}r{\'a}sf{\"u}ggetlen szekvenci{\'a}lis v{\'e}kony{\'\i}t{\'a}s}, journal = {ALKALMAZOTT MATEMATIKAI LAPOK}, volume = {27}, year = {2010}, month = {2010}, pages = {17 - 40}, type = {Journal article}, isbn = {0133-3399}, author = {P{\'e}ter Kardos and G{\'a}bor N{\'e}meth and K{\'a}lm{\'a}n Pal{\'a}gyi} } @inbook {959, title = {Parallel Thinning Algorithms Based on Ronse{\textquoteright}s Sufficient Conditions for Topology Preservation}, booktitle = {Progress in Combinatorial Image Analysis}, year = {2010}, month = {May 2010}, pages = {183 - 194}, publisher = {Scientific Research Publishing Inc.}, organization = {Scientific Research Publishing Inc.}, type = {Book chapter}, address = {Singapore}, url = {http://rpsonline.com.sg/rpsweb/iwcia09.html}, author = {G{\'a}bor N{\'e}meth and K{\'a}lm{\'a}n Pal{\'a}gyi}, editor = {Petra Wiederhold and Reneta P Barneva} } @conference {872, title = {Topology preserving 2-subfield 3D thinning algorithms}, booktitle = {Proceedings of the International Conference on Signal Processing, Pattern Recognition and Applications (SPPRA)}, year = {2010}, note = {ScopusID: 77954590365}, month = {Feb 2010}, pages = {310 - 316}, publisher = {IASTED ACTA Press}, organization = {IASTED ACTA Press}, type = {Conference paper}, address = {Innsbruck, Austria}, abstract = {

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{\textquoteright}s sufficient conditions for topology preservation, and they use various endpoint characterizations.

}, author = {G{\'a}bor N{\'e}meth and P{\'e}ter Kardos and K{\'a}lm{\'a}n Pal{\'a}gyi}, editor = {B Zagar and A Kuijper and H Sahbi} } @inbook {865, title = {Topology Preserving 3D Thinning Algorithms using Four and Eight Subfields}, booktitle = {Proceedings of the International Conference on Image Analysis and Recognition (ICIAR)}, series = {Lecture Notes in Computer Science}, volume = {6111}, year = {2010}, note = {ScopusID: 77955432947doi: 10.1007/978-3-642-13772-3_32}, month = {June 2010}, pages = {316 - 325}, publisher = {Springer Verlag}, organization = {Springer Verlag}, type = {Conference paper}, address = {P{\'o}voa de Varzim, Portugal}, abstract = {

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. {\textcopyright} 2010 Springer-Verlag.

}, doi = {10.1007/978-3-642-13772-3_32}, author = {G{\'a}bor N{\'e}meth and P{\'e}ter Kardos and K{\'a}lm{\'a}n Pal{\'a}gyi}, editor = {Aur{\'e}lio Campilho and Mohamed Kamel} } @inbook {866, title = {Topology Preserving Parallel Smoothing for 3D Binary Images}, booktitle = {Proceedings of the Computational Modeling of Objects Represented in Images (CMORI)}, volume = {6026}, year = {2010}, note = {ScopusID: 77952401887doi: 10.1007/978-3-642-12712-0_26}, month = {May 2010}, pages = {287 - 298}, publisher = {Springer Verlag}, organization = {Springer Verlag}, type = {Conference paper}, address = {Buffalo, USA}, abstract = {

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. {\textcopyright} 2010 Springer-Verlag.

}, doi = {10.1007/978-3-642-12712-0_26}, author = {G{\'a}bor N{\'e}meth and P{\'e}ter Kardos and K{\'a}lm{\'a}n Pal{\'a}gyi}, editor = {Reneta P Barneva and Valentin E Brimkov and Herbert A Hauptman and Renato M Natal Jorge and Jo{\~a}o Manuel R S Tavares} } @article {979, title = {Conference of PhD Students in Computer Science}, journal = {ACTA CYBERNETICA-SZEGED}, volume = {19}, year = {2009}, month = {2009///}, pages = {3}, isbn = {0324-721X}, author = {K{\'a}lm{\'a}n Pal{\'a}gyi} } @inbook {867, title = {Fully Parallel 3D Thinning Algorithms based on Sufficient Conditions for Topology Preservation}, booktitle = {Proceedings of Discrete Geometry for Computer Imagery (DGCI)}, number = {5810}, year = {2009}, note = {ScopusID: 77952414581doi: 10.1007/978-3-642-04397-0_41}, month = {Sep 2009}, pages = {481 - 492}, publisher = {Springer Verlag}, organization = {Springer Verlag}, type = {Conference paper}, address = {Montreal, Quebec, Canada}, abstract = {

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. {\textcopyright} 2009 Springer Berlin Heidelberg.

}, isbn = {978-3-642-04396-3}, doi = {10.1007/978-3-642-04397-0_41}, author = {K{\'a}lm{\'a}n Pal{\'a}gyi and G{\'a}bor N{\'e}meth}, editor = {Srecko Brlek and Christophe Reutenauer and Xavier Proven{\c c}al} } @conference {973, title = {Kritikus p{\'a}rokat vizsg{\'a}l{\'o} bej{\'a}r{\'a}sf{\"u}ggetlen szekvenci{\'a}lis v{\'e}kony{\'\i}t{\'o} algoritmus}, booktitle = {A K{\'e}pfeldolgoz{\'o}k {\'e}s Alakfelismer{\H o}k T{\'a}rsas{\'a}g{\'a}nak konferenci{\'a}ja - K{\'E}PAF 2009}, year = {2009}, month = {Jan 2009}, pages = {1 - 8}, publisher = {Akaprint}, organization = {Akaprint}, type = {Conference paper}, address = {Budapest}, author = {P{\'e}ter Kardos and G{\'a}bor N{\'e}meth and K{\'a}lm{\'a}n Pal{\'a}gyi}, editor = {Dmitrij Chetverikov and Tamas Sziranyi} } @conference {972, title = {A morfol{\'o}giai v{\'a}z {\'a}ltal{\'a}nos{\'\i}t{\'a}sa szomsz{\'e}ds{\'a}gi szekvenci{\'a}kkal}, booktitle = {A K{\'e}pfeldolgoz{\'o}k {\'e}s Alakfelismer{\H o}k T{\'a}rsas{\'a}g{\'a}nak konferenci{\'a}ja - K{\'E}PAF 2009}, year = {2009}, month = {Jan 2009}, pages = {1 - 10}, publisher = {Akaprint}, organization = {Akaprint}, type = {Conference paper}, address = {Budapest}, author = {G{\'a}bor N{\'e}meth and Gy{\"o}rgy Kov{\'a}cs and K{\'a}lm{\'a}n Pal{\'a}gyi and Attila Fazekas}, editor = {Dmitrij Chetverikov and Tamas Sziranyi} } @inbook {868, title = {An order-independent sequential thinning algorithm}, booktitle = {Proceedings of the International Workshop on Combinatorial Image Analysis (IWCIA)}, number = {5852}, year = {2009}, note = {ScopusID: 78650496028doi: 10.1007/978-3-642-10210-3_13}, month = {Nov 2009}, pages = {162 - 175}, publisher = {Springer Verlag}, organization = {Springer Verlag}, type = {Conference paper}, address = {Playa del Carmen, Mexico}, abstract = {

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. {\textcopyright} Springer-Verlag Berlin Heidelberg 2009.

}, isbn = {978-3-642-10208-0}, doi = {10.1007/978-3-642-10210-3_13}, url = {http://link.springer.com/chapter/10.1007/978-3-642-10210-3_13}, author = {P{\'e}ter Kardos and G{\'a}bor N{\'e}meth and K{\'a}lm{\'a}n Pal{\'a}gyi}, editor = {Petra Wiederhold and Reneta P Barneva} } @article {912, title = {Preface to the Special Issue}, journal = {DISCRETE APPLIED MATHEMATICS}, volume = {157}, year = {2009}, note = {UT: 000262243800001ScopusID: 56649097446doi: 10.1016/j.dam.2008.08.005}, month = {2009///}, pages = {437}, isbn = {0166-218X}, author = {L{\'a}szl{\'o} G{\'a}bor Ny{\'u}l and K{\'a}lm{\'a}n Pal{\'a}gyi} } @article {916, title = {A 3D fully parallel surface-thinning algorithm}, journal = {THEORETICAL COMPUTER SCIENCE}, volume = {406}, year = {2008}, note = {UT: 000260289400014ScopusID: 51749087902doi: 10.1016/j.tcs.2008.06.041}, month = {Oct 2008}, pages = {119 - 135}, publisher = {Elsevier}, type = {Journal article}, address = {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, }, abstract = {

The thinning is an iterative layer by layer erosion until only the "skeletons" 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. {\textcopyright} 2008 Elsevier B.V. All rights reserved.

}, isbn = {0304-3975}, doi = {10.1016/j.tcs.2008.06.041}, author = {K{\'a}lm{\'a}n Pal{\'a}gyi} } @conference {1115, title = {Determination of geometric features of binary images from their projections by using decision trees}, booktitle = {Conference of PhD Students in Computer Science. Volume of Extended Abstracts}, year = {2008}, month = {July 2008}, pages = {26}, publisher = {University of Szeged}, organization = {University of Szeged}, type = {Abstract}, address = {Szeged, Hungary}, author = {Mih{\'a}ly Gara and P{\'e}ter Bal{\'a}zs}, editor = {K{\'a}lm{\'a}n Pal{\'a}gyi and Bal{\'a}zs B{\'a}nhelyi and Tam{\'a}s Gergely and Istv{\'a}n Matievics} } @inbook {1172, title = {A k{\'e}pfeldolgoz{\'a}s kutat{\'a}sa a Szegedi Tudom{\'a}nyegyetemen}, booktitle = {Informatika a fels{\H o}oktat{\'a}sban 2008}, year = {2008}, note = {Art. No.: E62}, month = {2008///}, publisher = {Debreceni Egyetem Informatikai Kar}, organization = {Debreceni Egyetem Informatikai Kar}, address = {Debrecen}, abstract = {A digit{\'a}lis k{\'e}pfeldolgoz{\'a}s kutat{\'a}s{\'a}nak a Szegedi Tudom{\'a}nyegyetemTerm{\'e}szettudom{\'a}nyi {\'e}s Informatikai Kar{\'a}n, az Informatikai Tansz{\'e}kcsoport K{\'e}pfeldolgoz{\'a}s {\'e}s Sz{\'a}m{\'\i}t{\'o}g{\'e}pes Grafika Tansz{\'e}k{\'e}n k{\"o}zel n{\'e}gy {\'e}vtizedes hagyom{\'a}nya van. A Tansz{\'e}k valamennyi munkat{\'a}rsa nemzetk{\"o}zileg elismert kutat{\'o}munk{\'a}t folytat, melyet m{\'a}r t{\"o}bb sz{\'a}z rangos publik{\'a}ci{\'o} f{\'e}mjelez. Sz{\'a}mos, a k{\'e}pfeldolgoz{\'a}s kutat{\'a}s{\'a}ban vezet{\H o} egyetemmel {\'e}s kutat{\'o}int{\'e}zettel {\'e}p{\'\i}tett{\"u}nk ki szoros kapcsolatot {\'e}s folytattunk eredm{\'e}nyes kutat{\'o}munk{\'a}t, akt{\'\i}v r{\'e}sztvev{\H o}i vagyunk a hazai {\'e}s a nemzetk{\"o}zi tudom{\'a}nyos k{\"o}z{\'e}letnek. A legfontosabb, jelenleg is foly{\'o} kutat{\'a}saink: orvosi k{\'e}pek feldolgoz{\'a}sa, diszkr{\'e}t tomogr{\'a}fia, k{\'e}pszegment{\'a}l{\'a}s, t{\'e}rinformatika, t{\'a}v{\'e}rz{\'e}kel{\'e}s, k{\'e}pregisztr{\'a}ci{\'o}, v{\'a}zkijel{\"o}l{\'e}s, m{\H u}t{\'e}ti tervez{\'e}s. }, url = {http://www.agr.unideb.hu/if2008/kiadvany/papers/E62.pdf}, author = {P{\'e}ter Bal{\'a}zs and Bal{\'a}zs Erd{\H o}helyi and Endre Katona and Zoltan Kato and E{\"o}rs M{\'a}t{\'e} and Antal Nagy and L{\'a}szl{\'o} G{\'a}bor Ny{\'u}l and K{\'a}lm{\'a}n Pal{\'a}gyi and Attila Tanacs}, editor = {Attila Peth{\H o} and Mikl{\'o}s Herdon} } @inbook {869, title = {Skeletonization based on metrical neighborhood sequences}, booktitle = {Computer Vision Systems}, number = {5008}, year = {2008}, note = {ScopusID: 44649159529doi: 10.1007/978-3-540-79547-6}, month = {May 2008}, pages = {333 - 342}, publisher = {Springer Verlag}, organization = {Springer Verlag}, type = {Conference paper}, address = {Santorini, Greece}, abstract = {

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. {\textcopyright} 2008 Springer- Verlag Berlin Heidelberg.

}, isbn = {978-3-540-79546-9}, issn = {0302-9743}, doi = {10.1007/978-3-540-79547-6_32}, author = {Attila Fazekas and K{\'a}lm{\'a}n Pal{\'a}gyi and Gy{\"o}rgy Kov{\'a}cs and G{\'a}bor N{\'e}meth}, editor = {Antonios Gasteratos and Markus Vincze and John K Tsotsos} } @inbook {914, title = {Techniques of Virtual Dissection of the Colon Based on Spiral CT Data}, booktitle = {Image Processing in Radiology}, year = {2008}, note = {doi: 10.1007/978-3-540-49830-8_18}, month = {2008}, pages = {257 - 268}, publisher = {Springer-Verlag}, organization = {Springer-Verlag}, type = {Book chapter}, address = {Berlin}, abstract = {

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

}, doi = {10.1007/978-3-540-49830-8_18}, author = {Erich Sorantin and Emese Balogh and Anna Vilanova Bartroli and K{\'a}lm{\'a}n Pal{\'a}gyi and L{\'a}szl{\'o} G{\'a}bor Ny{\'u}l and Franz Lindbichler and Andrea Ruppert}, editor = {Emanuele Neri and Davide Caramella and Carlo Bartolozzi} } @inbook {928, title = {A 3-subiteration surface-thinning algorithm}, booktitle = {Computer Analysis of Images and Patterns}, series = {Lecture Notes in Computer Science}, number = {4673}, year = {2007}, month = {Aug 2007}, pages = {628 - 635}, publisher = {Springer Verlag}, organization = {Springer Verlag}, type = {Conference paper}, address = {Vienna, Austria}, abstract = {

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. {\textcopyright} Springer-Verlag Berlin Heidelberg 2007.

}, isbn = {978-3-540-74271-5}, issn = {0302-9743}, doi = {10.1007/978-3-540-74272-2_78}, author = {K{\'a}lm{\'a}n Pal{\'a}gyi}, editor = {Walter G Kropatsch and Martin Kampel and Allan Hanbury} } @conference {971, title = {Alakreprezent{\'a}ci{\'o} szf{\'e}rikus harmonikus sorfejt{\'e}ssel}, booktitle = {A K{\'e}pfeldolgoz{\'o}k {\'e}s Alakfelismer{\H o}k T{\'a}rsas{\'a}g{\'a}nak konferenci{\'a}ja - K{\'E}PAF 2007}, year = {2007}, month = {Jan 2007}, pages = {275 - 282}, publisher = {K{\'e}pfeldolgoz{\'o}k {\'e}s Alakfelismer{\H o}k T{\'a}rsas{\'a}ga}, organization = {K{\'e}pfeldolgoz{\'o}k {\'e}s Alakfelismer{\H o}k T{\'a}rsas{\'a}ga}, address = {Debrecen}, author = {K{\'a}lm{\'a}n Pal{\'a}gyi and Csaba Pint{\'e}r and E{\"o}rs M{\'a}t{\'e}}, editor = {Attila Fazekas and Andr{\'a}s Hajd{\'u}} } @conference {970, title = {Efficient Implementation of 3D Thinning Algorithms}, booktitle = {A K{\'e}pfeldolgoz{\'o}k {\'e}s Alakfelismer{\H o}k T{\'a}rsas{\'a}g{\'a}nak konferenci{\'a}ja - K{\'E}PAF 2007}, year = {2007}, month = {Jan 2007}, pages = {266 - 274}, publisher = {K{\'e}pfeldolgoz{\'o}k {\'e}s Alakfelismer{\H o}k T{\'a}rsas{\'a}ga}, organization = {K{\'e}pfeldolgoz{\'o}k {\'e}s Alakfelismer{\H o}k T{\'a}rsas{\'a}ga}, address = {Debrecen}, author = {K{\'a}lm{\'a}n Pal{\'a}gyi}, editor = {Attila Fazekas and Andr{\'a}s Hajd{\'u}} } @inbook {929, title = {A subiteration-based surface-thinning algorithm with a period of three}, booktitle = {Pattern Recognition}, series = {Lecture Notes on Computer Science}, number = {4713}, year = {2007}, note = {ScopusID: 38149004908}, month = {Sep 2007}, pages = {294 - 303}, publisher = {Springer Verlag}, organization = {Springer Verlag}, type = {Conference paper}, address = {Heidelberg, Germany}, abstract = {

Thinning on binary images is an iterative layer by layer erosionuntil only the "skeletons" 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. {\textcopyright} Springer-Verlag Berlin Heidelberg 2007.

}, isbn = {978-3-540-74933-2}, issn = {0302-9743}, doi = {10.1007/978-3-540-74936-3_30}, author = {K{\'a}lm{\'a}n Pal{\'a}gyi}, editor = {Fred A Hamprecht and Christoph Schnorr and Bernd J{\"a}hne} } @inbook {1338, title = {A benchmark evaluation of large-scale optimization approaches to binary tomography}, booktitle = {Discrete Geometry for Computer Imagery}, year = {2006}, note = {UT: 000241649600013doi: 10.1007/11907350_13}, month = {2006}, pages = {146 - 156}, publisher = {Springer-Verlag}, organization = {Springer-Verlag}, address = {Berlin; Heidelberg}, author = {Stefan Weber and Antal Nagy and Thomas Schulle and Christoph Schnorr and Attila Kuba}, editor = {Attila Kuba and L{\'a}szl{\'o} G{\'a}bor Ny{\'u}l and K{\'a}lm{\'a}n Pal{\'a}gyi} } @proceedings {913, title = {Discrete Geometry for Computer Imagery}, volume = {4245}, year = {2006}, note = {UT: 000241649600007ScopusID: 33845210215doi: 10.1007/11907350}, month = {2006}, pages = {688}, publisher = {Springer-Verlag}, abstract = {

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.

}, doi = {10.1007/11907350}, url = {http://www.springerlink.com/content/t38633812l42/}, editor = {Attila Kuba and L{\'a}szl{\'o} G{\'a}bor Ny{\'u}l and K{\'a}lm{\'a}n Pal{\'a}gyi} } @inbook {909, title = {New advances for imaging laryngo / trachealstenosis by post processing of spiral-CT data}, booktitle = {Digital (r)evolution in radiology}, year = {2006}, month = {2006///}, pages = {297 - 308}, publisher = {Springer-Verlag}, organization = {Springer-Verlag}, address = {Wien; New York}, author = {Erich Sorantin and Darius Mohadjer and L{\'a}szl{\'o} G{\'a}bor Ny{\'u}l and K{\'a}lm{\'a}n Pal{\'a}gyi and Franz Lindbichler and Bernhard Geiger}, editor = {Walter Hruby} } @inbook {1140, title = {The number of line-convex directed polyominoes having the same orthogonal projections}, booktitle = {Discrete Geometry for Computer Imagery}, year = {2006}, note = {UT: 000241649600007ScopusID: 33845210215}, month = {2006///}, pages = {77 - 85}, publisher = {Springer-Verlag}, organization = {Springer-Verlag}, address = {Berlin, Heidelberg}, abstract = {

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. {\textcopyright} Springer-Verlag Berlin Heidelberg 2006.

}, author = {P{\'e}ter Bal{\'a}zs}, editor = {Attila Kuba and L{\'a}szl{\'o} G{\'a}bor Ny{\'u}l and K{\'a}lm{\'a}n Pal{\'a}gyi} } @article {917, title = {Quantitative analysis of pulmonary airway tree structures}, journal = {COMPUTERS IN BIOLOGY AND MEDICINE}, volume = {36}, year = {2006}, note = {UT: 000239889900004ScopusID: 33746349840doi: 10.1016/j.compbiomed.2005.05.004}, month = {2006///}, pages = {974 - 996}, address = {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, }, abstract = {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). {\textcopyright} 2005 Elsevier Ltd. All rights reserved.}, isbn = {0010-4825}, author = {K{\'a}lm{\'a}n Pal{\'a}gyi and Juerg Tschirren and Eric A Hoffman and Milan Sonka} } @inbook {952, title = {A 2-Subfield 3D Thinning Algorithm for Extracting Medial Curves}, booktitle = {Joint Hungarian-Austrian conference on image processing and pattern recognition. 5th conference of the Hungarian Association for Image Processing and Pattern Recognition (K{\'E}PAF), 29th workshop of the Austrian Association for Pattern Reco}, year = {2005}, month = {2005///}, pages = {135 - 142}, publisher = {OCG}, organization = {OCG}, address = {Vienna}, author = {K{\'a}lm{\'a}n Pal{\'a}gyi}, editor = {Dmitrij Chetverikov and L{\'a}szl{\'o} Cz{\'u}ni and Markus Vincze} } @article {918, title = {Matching and anatomical labeling of human airway tree}, journal = {IEEE TRANSACTIONS ON MEDICAL IMAGING}, volume = {24}, year = {2005}, note = {UT: 000233779000002ScopusID: 29144483584doi: 10.1109/TMI.2005.857653}, month = {2005///}, pages = {1540 - 1547}, address = {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}, abstract = {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{\textquoteright} results. For anatomical labeling, 97.1 \% of the automatically assigned segment labels were found to be correct. {\textcopyright} 2005 IEEE.}, isbn = {0278-0062}, author = {Juerg Tschirren and Geoffrey McLennan and K{\'a}lm{\'a}n Pal{\'a}gyi and Eric A Hoffman and Milan Sonka} } @inbook {908, title = {Techniques in 3D Assessment of Tracheal-Stenosis by the Mean of Spiral Computed Tomography (S-CT) and Their Applications}, booktitle = {Medical Imaging Systems Technology}, year = {2005}, note = {doi: 10.1142/9789812701077_0003}, month = {2005///}, pages = {61 - 80}, publisher = {World Scientific}, organization = {World Scientific}, address = {Singapore}, abstract = {Endotracheal intubation is the most common cause of Laryngo-Tracheal Stenoses (LTS), followed by trauma and prior airway surgery.1{\textendash}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{\textendash}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{\textquoteright}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 {\textemdash} cross-sectional profiles; Intranet applications; and a conclusion is drawn in the final section. }, author = {Erich Sorantin and Darius Mohadjer and Franz Lindbichler and L{\'a}szl{\'o} G{\'a}bor Ny{\'u}l and K{\'a}lm{\'a}n Pal{\'a}gyi and Bernhard Geiger}, editor = {Cornelius T Leondes} } @article {919, title = {Assessment of intrathoracic airway trees: Methods and in vivo validation}, journal = {LECTURE NOTES IN COMPUTER SCIENCE}, volume = {3117}, year = {2004}, note = {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 }, month = {2004///}, pages = {341 - 352}, address = {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}, isbn = {0302-9743}, author = {K{\'a}lm{\'a}n Pal{\'a}gyi and Juerg Tschirren and Eric A Hoffman and Milan Sonka} } @conference {969, title = {L{\'e}gutak vizsg{\'a}lata 3D CT-k{\'e}peken}, booktitle = {A K{\'e}pfeldolgoz{\'o}k {\'e}s Alakfelismer{\H o}k T{\'a}rsas{\'a}g{\'a}nak konferenci{\'a}ja - K{\'E}PAF 2004}, year = {2004}, month = {Jan 2004}, pages = {232 - 236}, publisher = {Neumann J{\'a}nos Sz{\'a}m{\'\i}t{\'o}g{\'e}p-tudom{\'a}nyi T{\'a}rsas{\'a}g}, organization = {Neumann J{\'a}nos Sz{\'a}m{\'\i}t{\'o}g{\'e}p-tudom{\'a}nyi T{\'a}rsas{\'a}g}, address = {Miskolc}, author = {K{\'a}lm{\'a}n Pal{\'a}gyi}, editor = {Zolt{\'a}n G{\'a}csi and P{\'e}ter Bark{\'o}czy and G{\'a}bor S{\'a}rk{\"o}zi} } @inbook {930, title = {Liver segment approximation in CT data for surgical resection planning}, booktitle = {Medical Imaging 2004: Image Processing}, year = {2004}, note = {ScopusID: 5644267870doi: 10.1117/12.535514}, month = {2004///}, pages = {1435 - 1446}, publisher = {SPIE}, organization = {SPIE}, address = {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}, abstract = {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.}, author = {Reinhardt Beichel and Thomas Pock and Christian Janko and Roman B Zotter and Bernhard Reitinger and Alexander Bornik and K{\'a}lm{\'a}n Pal{\'a}gyi and Erich Sorantin and Georg Werkgartner and Horst Bischof and Milan Sonka}, editor = {J Michael Fitzpatrick and Milan Sonka} } @conference {977, title = {Sz{\'a}m{\'\i}t{\'o}g{\'e}pes k{\'e}pfeldolgoz{\'a}s oktat{\'a}sa a Szegedi Tudom{\'a}nyegyetemen}, booktitle = {A K{\'e}pfeldolgoz{\'o}k {\'e}s Alakfelismer{\H o}k T{\'a}rsas{\'a}g{\'a}nak konferenci{\'a}ja - K{\'E}PAF 2004}, year = {2004}, month = {Jan 2004}, pages = {191 - 196}, publisher = {Neumann J{\'a}nos Sz{\'a}m{\'\i}t{\'o}g{\'e}p-tudom{\'a}nyi T{\'a}rsas{\'a}g}, organization = {Neumann J{\'a}nos Sz{\'a}m{\'\i}t{\'o}g{\'e}p-tudom{\'a}nyi T{\'a}rsas{\'a}g}, address = {Miskolc}, abstract = {

Az SZTE Informatikai Tansz{\'e}kcsoportja {\'a}ltal gondozott szakoktanterveiben 1993 {\'o}ta szerepel a k{\'e}pfeldolgoz{\'a}s {\'e}s alkalmaz{\'a}sainak oktat{\'a}sa. A kreditrendszer bevezet{\'e}s{\'e}vel a K{\'e}pfeldolgoz{\'a}s I. t{\'a}rgy k{\"o}telez{\H o} az {\"o}t{\'e}ves k{\'e}pz{\'e}sben r{\'e}szt vev{\H o} informatikus hallgat{\'o}knak. Ezen fel{\"u}l a v{\'a}laszthat{\'o} szakir{\'a}nyok k{\"o}z{\"o}tt szint{\'e}n szerepel a K{\'e}pfeldolgoz{\'a}s szakir{\'a}ny. A szakir{\'a}nyon bel{\"u}l k{\"u}l{\"o}nb{\"o}z{\H o} k{\'e}ppfeldolgoz{\'a}si ter{\"u}leteket t{\'a}rgyal{\'o} kurzusok {\'e}p{\"u}lnek egym{\'a}sra. Az elm{\'e}leti megalapoz{\'a}s mellett a k{\'e}pfeldolgoz{\'a}s alkalmaz{\'a}saira is nagy hangs{\'u}lyt fektet{\"u}nk. A kutat{\'a}sok illetve az orvosi alkalmaz{\'a}sok fejleszt{\'e}se sor{\'a}n szerzett eredm{\'e}nyeket a k{\"o}telez{\H o} jelleg{\H u} t{\'a}rgyak mellett speci{\'a}lkoll{\'e}giumok keret{\'e}ben {\'e}p{\'\i}tj{\"u}l be az otkat{\'a}si anyagba. Sz{\'a}mos hallgat{\'o}nk v{\'a}laszt a k{\'e}pfeldolgz{\'a}s ter{\"u}let{\'e}r{\H o}l t{\'e}m{\'a}t a diplomamunk{\'a}j{\'a}hoz, dolgozataikkal rendszeresen {\'e}s sikerrel szerepelnek az OTDK-n. Hallgat{\'o}ink {\'e}vente t{\"o}bb h{\'o}napot t{\"o}lthetnek k{\"u}lf{\"o}ldi partneregyetemeinken, ahol a kutat{\'o}- {\'e}s fejleszt{\H o}munka mellett n{\'a}lunk is elfogadott kurzusokat teljes{\'\i}thetnek. A k{\'e}pfeldolgoz{\'a}s t{\'e}mak{\"o}r{\"o}n bel{\"u}l "ipari" projekt munk{\'a}kban is egyre t{\"o}bb hallgat{\'o} vesz r{\'e}szt. A doktori programon bel{\"u}l is meghirdet{\"u}nk k{\'e}pfeldolgoz{\'a}shoz kapcsol{\'o}d{\'o} kutat{\'a}si ir{\'a}nyokat. Az {\'e}vente megrendez{\'e}sre ker{\"u}l{\H o}, 11-{\'e}ves m{\'u}ltra visszatekint{\H o} K{\'e}pfeldolgoz{\'o} Ny{\'a}ri Iskol{\'a}nak (SSIP) eddig hatszor adott otthont Szeged. A rendszv{\'e}nysorozat kiemelked{\H o} fontoss{\'a}g{\'u} nemzetk{\"o}zi f{\'o}rum hallgat{\'o}ink {\'e}s oktat{\'o}ink sz{\'a}m{\'a}ra is.

}, author = {Antal Nagy and Emese Balogh and Mariann Dud{\'a}sn{\'e} Nagy and Attila Kuba and E{\"o}rs M{\'a}t{\'e} and K{\'a}lm{\'a}n Pal{\'a}gyi and Endre Katona and Zoltan Kato and L{\'a}szl{\'o} G{\'a}bor Ny{\'u}l and Attila Tanacs}, editor = {Zolt{\'a}n G{\'a}csi and P{\'e}ter Bark{\'o}czy and G{\'a}bor S{\'a}rk{\"o}zi} } @article {895, title = {3D cross section of the laryngotracheal tract. A new method for visualization and quantification of tracheal stenoses}, journal = {RADIOLOGE}, volume = {43}, year = {2003}, note = {UT: 000188058500005ScopusID: 9144241258doi: 10.1007/s00117-003-0990-8}, month = {2003///}, pages = {1056 - 1068}, abstract = {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 <0.005). For the phantoms an excellent correlation between the true and computed 3D cross sectional profile was found (p <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. }, isbn = {0033-832X}, author = {Erich Sorantin and Csongor Halmai and Bal{\'a}zs Erd{\H o}helyi and K{\'a}lm{\'a}n Pal{\'a}gyi and L{\'a}szl{\'o} G{\'a}bor Ny{\'u}l and Kriszti{\'a}n Oll{\'e} and Franz Lindbichler and Gerhard Friedrich and Karl Kiesler} } @article {998, title = {3D cross section of the laryngotracheal tract. A new method for visualization and quantification of tracheal stenoses}, journal = {RADIOLOGE}, volume = {43}, year = {2003}, note = {UT: 000188058500005ScopusID: 9144241258doi: 10.1007/s00117-003-0990-8}, month = {2003///}, pages = {1056 - 1068}, abstract = {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 <0.005). For the phantoms an excellent correlation between the true and computed 3D cross sectional profile was found (p <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. }, isbn = {0033-832X}, author = {Erich Sorantin and Csongor Halmai and Bal{\'a}zs Erd{\H o}helyi and K{\'a}lm{\'a}n Pal{\'a}gyi and L{\'a}szl{\'o} G{\'a}bor Ny{\'u}l and Kriszti{\'a}n Oll{\'e} and Franz Lindbichler and Gerhard Friedrich and Karl Kiesler} } @article {1857, title = {3D-Querschnittsprofil des Laryngotrachealtrakts{\textemdash}Eine neue Methode zur Visualisierung und Quantifizierung von Trachealstenosen}, journal = {Der Radiologe}, volume = {43}, year = {2003}, month = {2003}, pages = {1056-1068}, publisher = {Springer-Verlag}, type = {Journal Article}, abstract = {

Purpose

Demonstration of a technique for 3D 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 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 \<0.005). For the phantoms an excellent correlation between the true and computed 3D cross sectional profile was found (p \<0.005) and an accuray 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.

}, issn = {0033-832X}, doi = {10.1007/s00117-003-0990-8}, url = {http://dx.doi.org/10.1007/s00117-003-0990-8}, author = {Sorantin, Erich. and Halmai, Csongor. and Bal{\'a}zs Erd{\H o}helyi and K{\'a}lm{\'a}n Pal{\'a}gyi and L{\'a}szl{\'o} G{\'a}bor Ny{\'u}l and Oll{\'e}, Kriszti{\'a}n. and Geiger, B. and Lindbichler, F. and Friedrich, G. and Kiesler, K.} } @article {934, title = {Characterization of the interstitial lung diseases via density-based and texture-based analysis of computed tomography images of lung structure and function}, journal = {ACADEMIC RADIOLOGY}, volume = {10}, year = {2003}, note = {UT: 000185944700005doi: 10.1016/S1076-6332(03)00330-1Workshop on Pulmonary Functional ImagingJUN, 2002 PHILADELPHIA, PENNSYLVANIA }, month = {2003///}, pages = {1104 - 1118}, address = {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}, isbn = {1076-6332}, author = {Eric A Hoffman and Joseph M Reinhardt and Milan Sonka and Brett A Simon and Junfeng Guo and Osama Saba and Deokiee Chon and Shaher Samrah and Hidenori Shikata and Juerg Tschirren and K{\'a}lm{\'a}n Pal{\'a}gyi and Kenneth C Beck and Geoffrey McLennan} } @inbook {920, title = {Quantitative analysis of intrathoracic airway trees: Methods and validation}, booktitle = {INFORMATION PROCESSING IN MEDICAL IMAGING, PROCEEDINGS}, year = {2003}, note = {UT: 000185604900019ScopusID: 29144477913doi: 10.1007/978-3-540-45087-0_19}, month = {2003///}, pages = {222 - 233}, publisher = {Springer Verlag}, organization = {Springer Verlag}, address = {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}, author = {K{\'a}lm{\'a}n Pal{\'a}gyi and Juerg Tschirren and Milan Sonka}, editor = {C Taylor and J A Noble} } @inbook {931, title = {Quantitative analysis of three-dimensional tubular tree structures}, booktitle = {Medical Imaging 2003}, year = {2003}, note = {doi: 10.1117/12.481127}, month = {2003///}, pages = {277 - 287}, publisher = {SPIE - The International Society for Optical Engineering}, organization = {SPIE - The International Society for Optical Engineering}, address = {Bellingham; Washington}, url = {http://spie.org/x648.html?product_id=459268}, author = {K{\'a}lm{\'a}n Pal{\'a}gyi and Juerg Tschirren and Milan Sonka}, editor = {Milan Sonka and J Michael Fitzpatrick} } @article {921, title = {A 3-subiteration 3D thinning algorithm for extracting medial surfaces}, journal = {PATTERN RECOGNITION LETTERS}, volume = {23}, year = {2002}, note = {UT: 000174470900005}, month = {2002///}, pages = {663 - 675}, address = {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}, isbn = {0167-8655}, author = {K{\'a}lm{\'a}n Pal{\'a}gyi} } @inbook {1308, title = {Digit{\'a}lis k{\'e}pt{\'a}rol{\'o} {\'e}s k{\'e}ptov{\'a}bb{\'\i}t{\'o} rendszer (PACS) a Szegedi Tudom{\'a}nyegyetemen}, booktitle = {K{\'e}pfeldolgoz{\'o}k {\'e}s Alakfelismer{\H o}k III. Konfereci{\'a}ja}, year = {2002}, month = {2002}, pages = {132 - 139}, publisher = {NJSZT-K{\'E}PAF}, organization = {NJSZT-K{\'E}PAF}, address = {Szeged}, author = {L{\'a}szl{\'o} Alm{\'a}si and Antal Nagy and Zolt{\'a}n Alexin and L{\'a}szl{\'o} G{\'a}bor Ny{\'u}l and Attila Kuba and L{\'a}szl{\'o} Csernay}, editor = {Attila Kuba and E{\"o}rs M{\'a}t{\'e} and K{\'a}lm{\'a}n Pal{\'a}gyi} } @inbook {1024, title = {Digit{\'a}lis k{\'e}pt{\'a}rol{\'o} {\'e}s k{\'e}ptov{\'a}bb{\'\i}t{\'o} rendszer (PACS) a Szegedi Tudom{\'a}nyegyetemen}, booktitle = {K{\'e}pfeldolgoz{\'o}k {\'e}s Alakfelismer{\H o}k III. Konfereci{\'a}ja}, year = {2002}, month = {2002///}, pages = {132 - 139}, publisher = {NJSZT-K{\'E}PAF}, organization = {NJSZT-K{\'E}PAF}, address = {Szeged}, author = {L{\'a}szl{\'o} Alm{\'a}si and Antal Nagy and Zolt{\'a}n Alexin and L{\'a}szl{\'o} G{\'a}bor Ny{\'u}l and Attila Kuba and L{\'a}szl{\'o} Csernay}, editor = {Attila Kuba and E{\"o}rs M{\'a}t{\'e} and K{\'a}lm{\'a}n Pal{\'a}gyi} } @book {902, title = {K{\'e}pfeldolgoz{\'o}k {\'e}s Alakfelismer{\H o}k III. Konfereci{\'a}ja}, year = {2002}, month = {2002///}, publisher = {NJSZT-K{\'E}PAF}, organization = {NJSZT-K{\'E}PAF}, address = {Szeged}, editor = {Attila Kuba and E{\"o}rs M{\'a}t{\'e} and K{\'a}lm{\'a}n Pal{\'a}gyi} } @article {938, title = {Medical Image Processing, Surgical Planning, Image-Guided Therapy and Robotic Applications: Recent Developments for Radiology}, journal = {EUROPEAN RADIOLOGY}, volume = {12}, year = {2002}, note = {doi: 10.1007/s00330-002-0004-7}, month = {2002///}, pages = {504}, isbn = {0938-7994}, author = {R J Bale and W Birkfellner and Erich Sorantin and H Staedele and J Kettenbach and W Recheis and M Voegele and R Sweeney and P Kov{\'a}cs and R Wegenkittl and G Bodner and W Jaschke and D zur Nedden and E Eisner and G Kronreig and M Furst and R Hanel and M Figl and H Bergmann and D Hanson and L{\'a}szl{\'o} Rusk{\'o} and Lajos Rodek and K{\'a}lm{\'a}n Pal{\'a}gyi and Anna Vilanova Bartroli and L{\'a}szl{\'o} G{\'a}bor Ny{\'u}l and A L Jacob and B Baumann and Emese Balogh and P Messmer} } @article {960, title = {Segmentation, skeletonization, and branchpoint matching - A fully automated quantitative evaluation of human intrathoratic airway trees}, journal = {LECTURE NOTES IN COMPUTER SCIENCE}, volume = {2489}, year = {2002}, month = {2002///}, pages = {12 - 19}, isbn = {0302-9743}, author = {Juerg Tschirren and K{\'a}lm{\'a}n Pal{\'a}gyi and Joseph M Reinhardt and Eric A Hoffman and Milan Sonka} } @inbook {968, title = {A sequential 3D curve-thinning algorithm}, booktitle = {K{\'e}pfeldolgoz{\'o}k {\'e}s Alakfelismer{\H o}k III. Konfereci{\'a}ja}, year = {2002}, month = {2002///}, pages = {42 - 51}, publisher = {NJSZT-K{\'E}PAF}, organization = {NJSZT-K{\'E}PAF}, address = {Szeged}, author = {K{\'a}lm{\'a}n Pal{\'a}gyi}, editor = {Attila Kuba and E{\"o}rs M{\'a}t{\'e} and K{\'a}lm{\'a}n Pal{\'a}gyi} } @article {896, title = {Spiral-CT-based assessment of tracheal stenoses using 3-D-skeletonization}, journal = {IEEE TRANSACTIONS ON MEDICAL IMAGING}, volume = {21}, year = {2002}, note = {UT: 000175063900007ScopusID: 0036489382doi: 10.1109/42.996344}, month = {2002///}, pages = {263 - 273}, abstract = {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 << 0.0001). For the phantoms an excellent correlation between the true and computed 3-D cross-sectional profile was found (p << 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. }, isbn = {0278-0062}, author = {Erich Sorantin and Csongor Halmai and Bal{\'a}zs Erd{\H o}helyi and K{\'a}lm{\'a}n Pal{\'a}gyi and L{\'a}szl{\'o} G{\'a}bor Ny{\'u}l and Kriszti{\'a}n Oll{\'e} and Bernhard Geiger and Franz Lindbichler and Gerhard Friedrich and Karl Kiesler} } @inbook {1091, title = {Sz{\'a}m{\'\i}t{\'o}g{\'e}pes k{\'e}pfeldolgoz{\'a}s oktat{\'a}sa a Szegedi Tudom{\'a}nyegyetemen}, booktitle = {Informatika a fels{\H o}oktat{\'a}sban}, year = {2002}, note = {A nyomtatott k{\"o}tetben az absztrakt a 150. oldalon tal{\'a}lhat{\'o}.A teljes cikk a CD mell{\'e}kleten, a D41.pdf f{\'a}jlban, a megadott oldalsz{\'a}mokkal szerepel. }, month = {2002///}, pages = {750 - 757}, publisher = {Debreceni Egyetem}, organization = {Debreceni Egyetem}, address = {Debrecen}, abstract = {A Szegedi Tudom{\'a}nyegyetem tanterveiben 1993 {\'o}ta szerepel ak{\'e}pfeldolgoz{\'a}s {\'e}s alkalmaz{\'a}sainak oktat{\'a}sa. A tant{\'a}rgy ez id{\H o} alatt sok v{\'a}ltoz{\'a}son ment {\'a}t. Jelenleg a K{\'e}pfeldolgoz{\'a}s szakir{\'a}nyt v{\'a}laszt{\'o} hallgat{\'o}k r{\'e}szes{\"u}lnek ilyen k{\'e}pz{\'e}sben. Az adott szakir{\'a}nyon bel{\"u}l k{\"u}l{\"o}nb{\"o}z{\H o} k{\'e}pfeldolgoz{\'a}si ter{\"u}letek oktat{\'a}sa {\'e}p{\"u}l egym{\'a}sra. Az oktat{\'a}s sor{\'a}n nem csak elm{\'e}leti {\'e}s gyakorlati ismereteket szerezhetnek a hallgat{\'o}k, hanem n{\'e}h{\'a}ny (f{\H o}leg orvosi) alkalmaz{\'a}s is bemutat{\'a}sra ker{\"u}l. A k{\"o}telez{\H o} jelleg{\H u} t{\'a}rgyak mellett speci{\'a}lkoll{\'e}giumok engednek bepillant{\'a}st m{\'a}s kieg{\'e}sz{\'\i}t{\H o} ter{\"u}letekre. A hallgat{\'o}k a k{\'e}pfeldolgoz{\'a}s t{\'e}m{\'a}val rendszeresen vesznek r{\'e}sz helyi {\'e}s orsz{\'a}gos Tudom{\'a}nyos DI{\'a}kk{\"o}ri Konferenci{\'a}kon. Az ut{\'o}bbi id{\H o}ben siker{\"u}lt a k{\'e}pfeldolgoz{\'a}sban {\'e}rdekelt c{\'e}gekkel felvenni a kapcsolatot, {\'\i}gy {\'e}vente t{\"o}bb hallgat{\'o} vehet r{\'e}szt ipari alkalmaz{\'a}sok fejleszt{\'e}s{\'e}ben. A doktori programon bel{\"u}l is meghirdet{\"u}nk k{\'e}pfeldolgoz{\'a}shoz kapcsol{\'o}d{\'o} kutat{\'a}si ir{\'a}nyokat. Ezenk{\'\i}v{\"u}l rendszeresen megrendezz{\"u}k a nemzetk{\"o}zi K{\'e}pfeldolgoz{\'o} Ny{\'a}ri Iskol{\'a}kat, ahol nemcsak Magyarorsz{\'a}gr{\'o}l, hanem a k{\"o}rnyez{\H o} orsz{\'a}gokb{\'o}l is fogadunk hallgat{\'o}kat {\'e}s oktat{\'o}kat. }, author = {Antal Nagy and Emese Balogh and Mariann Dud{\'a}sn{\'e} Nagy and Attila Kuba and E{\"o}rs M{\'a}t{\'e} and L{\'a}szl{\'o} G{\'a}bor Ny{\'u}l and K{\'a}lm{\'a}n Pal{\'a}gyi and Attila Tanacs}, editor = {P{\'e}ter Arat{\'o} and Mikl{\'o}s Herdon} } @inbook {1023, title = {T{\"o}bbdimenzi{\'o}s MRI k{\'e}pek feldolgoz{\'a}sa}, booktitle = {K{\'e}pfeldolgoz{\'o}k {\'e}s Alakfelismer{\H o}k III. Konfereci{\'a}ja}, year = {2002}, month = {2002///}, pages = {96 - 97}, publisher = {NJSZT-K{\'E}PAF}, organization = {NJSZT-K{\'E}PAF}, address = {Szeged}, author = {L{\'a}szl{\'o} G{\'a}bor Ny{\'u}l and Jayaram K Udupa}, editor = {Attila Kuba and E{\"o}rs M{\'a}t{\'e} and K{\'a}lm{\'a}n Pal{\'a}gyi} } @article {900, title = {Virtual dissection and automated polyp detection of the colon based on spiral CT - Techniques and preliminary experience on a cadaveric phantom}, journal = {EUROPEAN SURGERY - ACTA CHIRURGICA AUSTRIACA}, volume = {34}, year = {2002}, note = {ScopusID: 0037000327doi: 10.1046/j.1563-2563.2002.02018.x}, month = {2002///}, pages = {143 - 149}, abstract = {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{\textquoteright}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{\textquoteright}s table. Colonic folds show a {\textquoteright}global outward bulging of the contour{\textquoteright}, whereas colonic polyps exhibit the inverse ({\textquoteright}local inward bulging{\textquoteright}). This feature is used to map areas of {\textquoteright}local inward bulging{\textquoteright} 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. }, isbn = {1682-8631}, author = {Erich Sorantin and Georg Werkgartner and Emese Balogh and Anna Vilanova Bartroli and K{\'a}lm{\'a}n Pal{\'a}gyi and L{\'a}szl{\'o} G{\'a}bor Ny{\'u}l and L{\'a}szl{\'o} Rusk{\'o}} } @inbook {901, title = {Virtual Dissection of the Colon}, booktitle = {K{\'e}pfeldolgoz{\'o}k {\'e}s Alakfelismer{\H o}k III. Konfereci{\'a}ja}, year = {2002}, month = {2002///}, pages = {109 - 117}, publisher = {NJSZT-K{\'E}PAF}, organization = {NJSZT-K{\'E}PAF}, address = {Szeged}, author = {Emese Balogh and Erich Sorantin and L{\'a}szl{\'o} G{\'a}bor Ny{\'u}l and K{\'a}lm{\'a}n Pal{\'a}gyi and Attila Kuba}, editor = {Attila Kuba and E{\"o}rs M{\'a}t{\'e} and K{\'a}lm{\'a}n Pal{\'a}gyi} } @inbook {899, title = {Virtual Dissection of the Colon}, booktitle = {3D Image Processing}, year = {2002}, note = {doi: 10.1007/978-3-642-59438-0_18}, month = {2002///}, pages = {197 - 209}, publisher = {Springer-Verlag}, organization = {Springer-Verlag}, address = {New York}, author = {Erich Sorantin and Emese Balogh and Anna Vilanova Bartroli and K{\'a}lm{\'a}n Pal{\'a}gyi and L{\'a}szl{\'o} G{\'a}bor Ny{\'u}l and Sven Lon{\v c}ari{\'c} and Marco Subasic and Domagoj Kovacevic}, editor = {Davide Caramella and Carlo Bartolozzi} } @inbook {897, title = {Virtual dissection of the colon: technique and first experiments with artificial and cadaveric phantoms}, booktitle = {Medical Imaging 2002: Visualization, Image-Guided Procedures, and Display}, year = {2002}, note = {ScopusID: 0036061143doi: 10.1117/12.466982}, month = {2002///}, pages = {713 - 721}, publisher = {SPIE}, organization = {SPIE}, address = {Bellingham; Washington}, abstract = {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. }, author = {Emese Balogh and Erich Sorantin and L{\'a}szl{\'o} G{\'a}bor Ny{\'u}l and K{\'a}lm{\'a}n Pal{\'a}gyi and Attila Kuba and Georg Werkgartner and Ekke Spuller}, editor = {Seong Ki Mun} } @article {1845, title = {A 3D parallel shrinking algorithm}, journal = {Acta Cybernetica}, volume = {15}, year = {2001}, pages = {201-211}, publisher = {University of Szeged}, type = {Journal Article}, address = {Szeged}, abstract = {

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.

}, author = {K{\'a}lm{\'a}n Pal{\'a}gyi} } @article {957, title = {A 3D parallel shrinking algorithm}, journal = {ACTA CYBERNETICA-SZEGED}, volume = {15}, year = {2001}, month = {2001}, pages = {201 - 211}, isbn = {0324-721X}, author = {K{\'a}lm{\'a}n Pal{\'a}gyi} } @article {1365, title = {Affine matching of two sets of points in arbitrary dimensions.}, journal = {ACTA CYBERNETICA-SZEGED}, volume = {15}, year = {2001}, note = {ScopusID: 0034882398}, month = {2001}, pages = {101 - 106}, isbn = {0324-721X}, author = {Attila Tanacs and G{\'a}bor Cz{\'e}dli and K{\'a}lm{\'a}n Pal{\'a}gyi and Attila Kuba} } @article {936, title = {A sequential 3D thinning algorithm and its medical applications}, journal = {LECTURE NOTES IN COMPUTER SCIENCE}, volume = {2082}, year = {2001}, note = {doi: 10.1007/3-540-45729-1_42}, month = {2001///}, pages = {409 - 415}, isbn = {0302-9743}, url = {http://www.springerlink.com/content/py49qu0e434n0n16}, author = {K{\'a}lm{\'a}n Pal{\'a}gyi and Erich Sorantin and Emese Balogh and Attila Kuba and Csongor Halmai and Bal{\'a}zs Erd{\H o}helyi and Klaus Hausegger} } @inbook {898, title = {Virtual Dissection of the Colon Based on Helical CT Data - Can It Be Done?}, booktitle = {Proceedings of the 2nd International Symposium on Image and Signal Processing and Analysis, ISPA 2001, Pula, Croatia}, year = {2001}, note = {doi: 10.1109/ISPA.2001.938632}, month = {2001///}, pages = {224 - 229}, publisher = {University of Zagreb}, organization = {University of Zagreb}, address = {Zagreb}, abstract = {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{\textquoteright}s table. The approach and image processing as well as the early experience are described in this paper. }, author = {Erich Sorantin and Emese Balogh and Anna Vilanova Bartroli and K{\'a}lm{\'a}n Pal{\'a}gyi and L{\'a}szl{\'o} G{\'a}bor Ny{\'u}l}, editor = {Sven Lon{\v c}ari{\'c} and Hrvoje Babic} } @article {922, title = {A 3D 3-subiteration thinning algorithm for medial surfaces}, journal = {LECTURE NOTES IN COMPUTER SCIENCE}, volume = {1953}, year = {2000}, note = {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{\"o}m, Gabriella Sanniti di Baja (Eds.) ISBN: 3-540-41396-0 DOI: 10.1007/3-540-44438-6 }, month = {2000///}, pages = {406 - 418}, address = {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}, isbn = {0302-9743}, author = {K{\'a}lm{\'a}n Pal{\'a}gyi} } @conference {967, title = {3D v{\'e}kony{\'\i}t{\'a}s {\'e}s alkalmaz{\'a}sa v{\'e}rerek {\'e}s l{\'e}gutak {\'a}tm{\'e}r{\H o}j{\'e}nek meghat{\'a}roz{\'a}s{\'a}ra}, booktitle = {A K{\'e}pfeldolgoz{\'o}k {\'e}s Alakfelismer{\H o}k T{\'a}rsas{\'a}g{\'a}nak konferenci{\'a}ja - K{\'E}PAF 2000}, year = {2000}, month = {Jan 2000}, pages = {95 - 100}, publisher = {NJSZT}, organization = {NJSZT}, address = {Noszvaj}, author = {K{\'a}lm{\'a}n Pal{\'a}gyi and Erich Sorantin and Csongor Halmai and Bal{\'a}zs Erd{\H o}helyi and L{\'a}szl{\'o} Martonossy and Attila Kuba}, editor = {Tamas Sziranyi} } @inbook {961, title = {New advances for imaging of laryngotracheal stenosis by post processing of spiral-CT data}, booktitle = {Digital (R)Evolution in Radiology}, year = {2000}, month = {2000///}, pages = {275 - 285}, publisher = {Springer-Verlag}, organization = {Springer-Verlag}, address = {Berlin; Heidelberg; New York; London; Paris; Tokyo}, author = {Erich Sorantin and Csongor Halmai and Bal{\'a}zs Erd{\H o}helyi and L{\'a}szl{\'o} Martonossy and K{\'a}lm{\'a}n Pal{\'a}gyi and Bernhard Geiger}, editor = {Walter Hruby} } @article {1364, title = {Point-based registration assuming affine motion}, journal = {LECTURE NOTES IN COMPUTER SCIENCE}, volume = {1888}, year = {2000}, note = {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 }, month = {2000}, pages = {329 - 338}, isbn = {0302-9743}, url = {http://www.inf.u-szeged.hu/ipcg/publications/papers/Tanacs_2000_AFPAC.pdf}, author = {Attila Tanacs and G{\'a}bor Cz{\'e}dli and K{\'a}lm{\'a}n Pal{\'a}gyi and Attila Kuba} } @article {958, title = {3D thinning and its applications to medical image processing}, journal = {TASK QUARTERLY}, volume = {3}, year = {1999}, month = {1999///}, pages = {397 - 408}, isbn = {1428-6394}, author = {K{\'a}lm{\'a}n Pal{\'a}gyi and Erich Sorantin and Csongor Halmai and Attila Kuba} } @article {924, title = {Directional 3D thinning using 8 subiterations}, journal = {LECTURE NOTES IN COMPUTER SCIENCE}, volume = {1568}, year = {1999}, note = {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 }, month = {1999///}, pages = {325 - 336}, address = {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}, isbn = {0302-9743}, author = {K{\'a}lm{\'a}n Pal{\'a}gyi and Attila Kuba} } @article {923, title = {A parallel 3D 12-subiteration thinning algorithm}, journal = {GRAPHICAL MODELS AND IMAGE PROCESSING}, volume = {61}, year = {1999}, note = {UT: 000082784900002}, month = {1999///}, pages = {199 - 221}, address = {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}, isbn = {1077-3169}, url = {http://www.inf.u-szeged.hu/ipcg/publications/papers/PalagyiKuba_GMIP1999.pdf}, author = {K{\'a}lm{\'a}n Pal{\'a}gyi and Attila Kuba} } @conference {1385, title = {Target registration error of point-based methods assuming rigid-body and linear motions}, booktitle = {International Workshop on Biomedical Image Registration (WBIR)}, year = {1999}, month = {Aug 1999}, pages = {223 - 233}, publisher = {Slovenian Society of Informatics}, organization = {Slovenian Society of Informatics}, address = {Ljubljana}, author = {Attila Tanacs and K{\'a}lm{\'a}n Pal{\'a}gyi and Attila Kuba}, editor = {F Pernus and S Kovacic and H S Stiehl and Max A Viergever} } @article {925, title = {A 3D 6-subiteration thinning algorithm for extracting medial lines}, journal = {PATTERN RECOGNITION LETTERS}, volume = {19}, year = {1998}, note = {UT: 000075051900009doi: 10.1016/S0167-8655(98)00031-2}, month = {1998///}, pages = {613 - 627}, address = {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}, isbn = {0167-8655}, author = {K{\'a}lm{\'a}n Pal{\'a}gyi and Attila Kuba} } @article {956, title = {A hybrid thinning algorithm for 3D medical images}, journal = {CIT JOURNAL OF COMPUTING AND INFORMATION TECHNOLOGY}, volume = {6}, year = {1998}, month = {1998///}, pages = {149 - 164}, isbn = {1330-1136}, author = {K{\'a}lm{\'a}n Pal{\'a}gyi and Attila Kuba} } @article {955, title = {Medical image registration based on interactively identified anatomical landmark points}, journal = {MACHINE GRAPHICS AND VISION}, volume = {7}, year = {1998}, month = {1998///}, pages = {151 - 158}, isbn = {1230-0535}, author = {Attila Tanacs and K{\'a}lm{\'a}n Pal{\'a}gyi and Attila Kuba} } @article {1386, title = {Medical image registration based on interactively identified anatomical landmark points}, journal = {MACHINE GRAPHICS AND VISION}, volume = {7}, year = {1998}, month = {1998}, pages = {151 - 158}, isbn = {1230-0535}, author = {Attila Tanacs and K{\'a}lm{\'a}n Pal{\'a}gyi and Attila Kuba} } @conference {1388, title = {Pont alap{\'u} regisztr{\'a}ci{\'o}, k{\'e}pf{\'u}zi{\'o}}, booktitle = {XXI. Neumann Kollokvium kiadv{\'a}nya}, year = {1998}, month = {Nov 1998}, pages = {67 - 70}, publisher = {Neumann J{\'a}nos Sz{\'a}m{\'\i}t{\'o}g{\'e}p-tudom{\'a}nyi T{\'a}rsas{\'a}g}, organization = {Neumann J{\'a}nos Sz{\'a}m{\'\i}t{\'o}g{\'e}p-tudom{\'a}nyi T{\'a}rsas{\'a}g}, address = {Budapest}, author = {Attila Tanacs and K{\'a}lm{\'a}n Pal{\'a}gyi and Attila Kuba}, editor = {Gy{\"o}rgy Kozmann and K Szakolczai} } @conference {966, title = {Pont alap{\'u} regisztr{\'a}ci{\'o}, k{\'e}pf{\'u}zi{\'o}}, booktitle = {XXI. Neumann Kollokvium kiadv{\'a}nya}, year = {1998}, month = {Nov 1998}, pages = {67 - 70}, publisher = {Neumann J{\'a}nos Sz{\'a}m{\'\i}t{\'o}g{\'e}p-tudom{\'a}nyi T{\'a}rsas{\'a}g}, organization = {Neumann J{\'a}nos Sz{\'a}m{\'\i}t{\'o}g{\'e}p-tudom{\'a}nyi T{\'a}rsas{\'a}g}, address = {Budapest}, author = {Attila Tanacs and K{\'a}lm{\'a}n Pal{\'a}gyi and Attila Kuba}, editor = {Gy{\"o}rgy Kozmann and K Szakolczai} } @conference {965, title = {V{\'e}kony{\'\i}t{\'o} algoritmusok 3D orvosi k{\'e}pekre}, booktitle = {XXI. Neumann Kollokvium kiadv{\'a}nya}, year = {1998}, month = {Nov 1998}, pages = {63 - 66}, publisher = {Neumann J{\'a}nos Sz{\'a}m{\'\i}t{\'o}g{\'e}p-tudom{\'a}nyi T{\'a}rsas{\'a}g}, organization = {Neumann J{\'a}nos Sz{\'a}m{\'\i}t{\'o}g{\'e}p-tudom{\'a}nyi T{\'a}rsas{\'a}g}, address = {Budapest}, author = {K{\'a}lm{\'a}n Pal{\'a}gyi and Attila Kuba}, editor = {Gy{\"o}rgy Kozmann and K Szakolczai} } @conference {964, title = {An algorithm for thinning 3D medical images}, booktitle = {A K{\'e}pfeldolgoz{\'o}k {\'e}s Alakfelismer{\H o}k T{\'a}rsas{\'a}g{\'a}nak konferenci{\'a}ja - K{\'E}PAF 1997}, year = {1997}, month = {Oct 1997}, pages = {64 - 71}, publisher = {Pannon Agr{\'a}rtudom{\'a}nyi Egyetem Georgikon Mez{\H o}gazdas{\'a}gtudom{\'a}nyi Kar}, organization = {Pannon Agr{\'a}rtudom{\'a}nyi Egyetem Georgikon Mez{\H o}gazdas{\'a}gtudom{\'a}nyi Kar}, address = {Keszthely}, author = {K{\'a}lm{\'a}n Pal{\'a}gyi and Attila Kuba}, editor = {Tamas Sziranyi and J{\'o}zsef Berke} } @conference {1387, title = {Orvosi k{\'e}pek regisztr{\'a}ci{\'o}ja interakt{\'\i}van kijel{\"o}lt anat{\'o}miai pontok alapj{\'a}n}, booktitle = {Magyar K{\'e}pfeldolgoz{\'o}k {\'e}s Alakfelismer{\H o}k Orsz{\'a}gos Konferenci{\'a}ja}, year = {1997}, month = {Oct 1997}, pages = {1 - 8}, publisher = {Pannon Agr{\'a}rtudom{\'a}nyi Egyetem Georgikon Mez{\H o}gazdas{\'a}gtudom{\'a}nyi Kar}, organization = {Pannon Agr{\'a}rtudom{\'a}nyi Egyetem Georgikon Mez{\H o}gazdas{\'a}gtudom{\'a}nyi Kar}, address = {Keszthely}, author = {Attila Tanacs and K{\'a}lm{\'a}n Pal{\'a}gyi and Attila Kuba}, editor = {Tamas Sziranyi and J{\'o}zsef Berke} } @conference {963, title = {Orvosi k{\'e}pek regisztr{\'a}ci{\'o}ja interakt{\'\i}van kijel{\"o}lt anat{\'o}miai pontok alapj{\'a}n}, booktitle = {Magyar K{\'e}pfeldolgoz{\'o}k {\'e}s Alakfelismer{\H o}k Orsz{\'a}gos Konferenci{\'a}ja}, year = {1997}, month = {Oct 1997}, pages = {1 - 8}, publisher = {Pannon Agr{\'a}rtudom{\'a}nyi Egyetem Georgikon Mez{\H o}gazdas{\'a}gtudom{\'a}nyi Kar}, organization = {Pannon Agr{\'a}rtudom{\'a}nyi Egyetem Georgikon Mez{\H o}gazdas{\'a}gtudom{\'a}nyi Kar}, address = {Keszthely}, author = {Attila Tanacs and K{\'a}lm{\'a}n Pal{\'a}gyi and Attila Kuba}, editor = {Tamas Sziranyi and J{\'o}zsef Berke} } @inbook {954, title = {A parallel 12-subiteration 3D thinning algorithm to extract medial lines}, booktitle = {Computer analysis of images and patterns}, year = {1997}, month = {1997///}, pages = {400 - 407}, publisher = {Springer}, organization = {Springer}, address = {Berlin}, author = {K{\'a}lm{\'a}n Pal{\'a}gyi and Attila Kuba}, editor = {Gerald Sommer and Kostas Daniilidis and Josef Pauli} } @inbook {926, title = {A thinning algorithm to extract medial lines from 3D medical images}, booktitle = {INFORMATION PROCESSING IN MEDICAL IMAGING}, year = {1997}, note = {UT: 000073946600035doi: 10.1007/3-540-63046-5_35}, month = {1997///}, pages = {411 - 416}, publisher = {Springer Verlag}, organization = {Springer Verlag}, address = {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}, author = {K{\'a}lm{\'a}n Pal{\'a}gyi and Attila Kuba}, editor = {James Duncan and Gene Gindi} } @conference {906, title = {DICOM Based PACS and Its Application in the Education}, booktitle = {International EuroPACS Meeting, EuroPACS {\textquoteright}96}, year = {1996}, month = {Oct 1996}, pages = {46 - 49}, type = {Conference paper}, abstract = {

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.

}, author = {Attila Kuba and Zolt{\'a}n Alexin and Antal Nagy and L{\'a}szl{\'o} G{\'a}bor Ny{\'u}l and K{\'a}lm{\'a}n Pal{\'a}gyi and Mariann Nagy and L{\'a}szl{\'o} Alm{\'a}si and L{\'a}szl{\'o} Csernay}, editor = {S Orphanoudakis} } @conference {1327, title = {DICOM Based PACS and Its Application in the Education}, booktitle = {International EuroPACS Meeting, EuroPACS {\textquoteright}96}, year = {1996}, month = {Oct 1996}, pages = {46 - 49}, abstract = {

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.

}, author = {Attila Kuba and Zolt{\'a}n Alexin and Antal Nagy and L{\'a}szl{\'o} G{\'a}bor Ny{\'u}l and K{\'a}lm{\'a}n Pal{\'a}gyi and Mariann Nagy and L{\'a}szl{\'o} Alm{\'a}si and L{\'a}szl{\'o} Csernay}, editor = {S Orphanoudakis} } @conference {953, title = {Medical image registration based on fuzzy objects}, booktitle = {SUMMER WORKSHOP ON COMPUTATIONAL MODELLING, IMAGING AND VISUALIZATION IN BIOSCIENCES (COMBIO)}, year = {1996}, month = {1996.08.29}, pages = {44 - 48}, publisher = {KFKI}, organization = {KFKI}, address = {Budapest}, author = {K{\'a}lm{\'a}n Pal{\'a}gyi and Jayaram K Udupa}, editor = {K Tarnay and Zolt{\'a}n Fazekas} } @conference {962, title = {Orvosi k{\'e}pek fuzzy objektumokon alapul{\'o} regisztr{\'a}ci{\'o}ja}, booktitle = {A sz{\'a}m{\'\i}t{\'a}stechnika orvosi {\'e}s biol{\'o}giai alkalmaz{\'a}sai: A XX. Neumann Kollokvium Kiadv{\'a}nya}, year = {1996}, month = {Nov 1996}, pages = {107 - 110}, publisher = {NJSZT}, organization = {NJSZT}, address = {Budapest}, author = {K{\'a}lm{\'a}n Pal{\'a}gyi and Jayaram K Udupa}, editor = {Gy{\"o}rgy Kozmann} } @conference {1328, title = {SZOTE-PACS: A Szent-Gy{\"o}rgyi Albert Orvostudom{\'a}nyi Egyetem k{\'e}parchiv{\'a}l{\'o} {\'e}s tov{\'a}bb{\'\i}t{\'o} rendszer{\'e}nek szoftvere}, booktitle = {A sz{\'a}m{\'\i}t{\'a}stechnika orvosi {\'e}s biol{\'o}giai alkalmaz{\'a}sai: A XX. Neumann Kollokvium Kiadv{\'a}nya}, year = {1996}, month = {Nov 1996}, pages = {173 - 176}, publisher = {NJSZT}, organization = {NJSZT}, address = {Veszpr{\'e}m}, abstract = {

A Szent-Gy{\"o}rgyi Albert Orvostudom{\'a}nyi Egyetem k{\'e}p-archiv{\'a}l{\'o} {\'e}s -tov{\'a}bb{\'\i}t{\'o} rendszer (SZOTE-PACS) szoftver{\'e}nek a fejleszt{\'e}s{\'e}t ismertetj{\"u}k el{\H o}ad{\'a}sunkban. A c{\'e}l egy olyan sz{\'a}m{\'\i}t{\'o}g{\'e}pes h{\'a}l{\'o}zat elk{\'e}sz{\'\i}t{\'e}se, amely nemcsak a klinikai vizsg{\'a}latok k{\'e}peinek t{\'a}rol{\'a}s{\'a}val {\'e}s {\'a}tvitel{\'e}vel kapcsolatos feladatokat l{\'a}tja el, de t{\'a}mogatja az oktat{\'a}si {\'e}s konzult{\'a}ci{\'o}s tev{\'e}kenys{\'e}g{\'e}eket is. A SZOTE-PACS 3 r{\'e}szre bonthat{\'o}: k{\'e}pfelvev{\H o}, archiv{\'a}l{\'o} {\'e}s megjelen{\'\i}t{\H o} {\'a}llom{\'a}sokra. A k{\'e}pfelvev{\H o} munka{\'a}llom{\'a}soknak kett{\H o}s feladata van: egyr{\'e}szt a k{\"u}l{\"o}nf{\'e}le modalit{\'a}sokon (CT, MR, NM, US {\'e}s SPECT) vagy r{\"o}ntgenfilm-scanneren felvett, illetve a DICOM- szabv{\'a}nynak megfelel{\H o} {\'a}llom{\'a}sr{\'o}l be{\'e}rkez{\H o} vizsg{\'a}latok begy{\H u}jt{\'e}se, m{\'a}sr{\'e}szt az Interfile 3.3, ACR-NEMA 2.0 vagy TIFF form{\'a}tum{\'u} vizsg{\'a}latok DICOM form{\'a}tumra val{\'o} automatikus konvert{\'a}l{\'a}sa. A rendszer k{\'e}pes a Radiol{\'o}giai Klinika Inform{\'a}ci{\'o}s Rendszer{\'e}ben (RIS) lev{\H o} inform{\'a}ci{\'o}k {\'a}tv{\'e}tel{\'e}re {\'e}s be{\'e}p{\'\i}t{\'e}s{\'e}re is. Az {\'\i}gy el{\H o}k{\'e}sz{\'\i}tett vizsg{\'a}latok {\'a}tk{\"u}ldhet{\H o}k a k{\"o}zponti szerverre, ahol azok az arch{\'\i}vumban automatiksan t{\'a}rol{\'o}dnak. A jelenlegi diszk kapacit{\'a}s mellett 15 napig {\H o}rizz{\"u}k a vizsg{\'a}latokat. A tervek szerint 15 nap ut{\'a}n csak a k{\'e}peket t{\"o}r{\"o}lj{\"u}k a szerverr{\H o}l, a vizsg{\'a}lat egy{\'e}b (nem k{\'e}pi) adatai tov{\'a}bbra is meg{\H o}rz{\'e}sre ker{\"u}lnek. Az arch{\'\i}vumban Oracle adatb{\'a}zis keze{\'e}{\H o} rendszer seg{\'\i}ti a visszakeres{\'e}st, a mejelen{\'\i}t{\'e}st {\'e}s a m{\'o}dos{\'\i}t{\'a}st. A feldolgoz{\'o} munka{\'a}llom{\'a}sokra (PC-k, UNOX-{\'a}llom{\'a}sok vagy X-termin{\'a}lok) k{\'e}rheti le a felhaszn{\'a}l{\'o} a szerveren t{\'a}rolt vizsg{\'a}latokat. Itt jelen{\'\i}thet{\H o}k meg illetve dolgozhat{\'o}k fel a vizsg{\'a}latok k{\'e}pei. Az orvostanhallgat{\'o}k {\'e}s doktoranduszok k{\'e}pz{\'e}s{\'e}re HTML-ben {\'\i}rt oktat{\'a}si anyagok {\'a}ll{\'\i}that{\'o}k {\"o}ssze a t{\'a}rolt sz{\"o}veges {\'e}s k{\'e}pi adatokb{\'o}l. Az oktat{\'a}si anyagokat a rendszer k{\"u}l{\"o}n adatb{\'a}zisban t{\'a}rolja.

}, author = {Attila Kuba and Zolt{\'a}n Alexin and L{\'a}szl{\'o} G{\'a}bor Ny{\'u}l and Antal Nagy and K{\'a}lm{\'a}n Pal{\'a}gyi and Mariann Dud{\'a}sn{\'e} Nagy and L{\'a}szl{\'o} Csernay and L{\'a}szl{\'o} Alm{\'a}si}, editor = {Gy{\"o}rgy Kozmann} } @conference {907, title = {SZOTE-PACS: A Szent-Gy{\"o}rgyi Albert Orvostudom{\'a}nyi Egyetem k{\'e}parchiv{\'a}l{\'o} {\'e}s tov{\'a}bb{\'\i}t{\'o} rendszer{\'e}nek szoftvere}, booktitle = {A sz{\'a}m{\'\i}t{\'a}stechnika orvosi {\'e}s biol{\'o}giai alkalmaz{\'a}sai: A XX. Neumann Kollokvium Kiadv{\'a}nya}, year = {1996}, month = {Nov 1996}, pages = {173 - 176}, publisher = {NJSZT}, organization = {NJSZT}, address = {Veszpr{\'e}m}, abstract = {

A Szent-Gy{\"o}rgyi Albert Orvostudom{\'a}nyi Egyetem k{\'e}p-archiv{\'a}l{\'o} {\'e}s -tov{\'a}bb{\'\i}t{\'o} rendszer (SZOTE-PACS) szoftver{\'e}nek a fejleszt{\'e}s{\'e}t ismertetj{\"u}k el{\H o}ad{\'a}sunkban. A c{\'e}l egy olyan sz{\'a}m{\'\i}t{\'o}g{\'e}pes h{\'a}l{\'o}zat elk{\'e}sz{\'\i}t{\'e}se, amely nemcsak a klinikai vizsg{\'a}latok k{\'e}peinek t{\'a}rol{\'a}s{\'a}val {\'e}s {\'a}tvitel{\'e}vel kapcsolatos feladatokat l{\'a}tja el, de t{\'a}mogatja az oktat{\'a}si {\'e}s konzult{\'a}ci{\'o}s tev{\'e}kenys{\'e}g{\'e}eket is. A SZOTE-PACS 3 r{\'e}szre bonthat{\'o}: k{\'e}pfelvev{\H o}, archiv{\'a}l{\'o} {\'e}s megjelen{\'\i}t{\H o} {\'a}llom{\'a}sokra. A k{\'e}pfelvev{\H o} munka{\'a}llom{\'a}soknak kett{\H o}s feladata van: egyr{\'e}szt a k{\"u}l{\"o}nf{\'e}le modalit{\'a}sokon (CT, MR, NM, US {\'e}s SPECT) vagy r{\"o}ntgenfilm-scanneren felvett, illetve a DICOM- szabv{\'a}nynak megfelel{\H o} {\'a}llom{\'a}sr{\'o}l be{\'e}rkez{\H o} vizsg{\'a}latok begy{\H u}jt{\'e}se, m{\'a}sr{\'e}szt az Interfile 3.3, ACR-NEMA 2.0 vagy TIFF form{\'a}tum{\'u} vizsg{\'a}latok DICOM form{\'a}tumra val{\'o} automatikus konvert{\'a}l{\'a}sa. A rendszer k{\'e}pes a Radiol{\'o}giai Klinika Inform{\'a}ci{\'o}s Rendszer{\'e}ben (RIS) lev{\H o} inform{\'a}ci{\'o}k {\'a}tv{\'e}tel{\'e}re {\'e}s be{\'e}p{\'\i}t{\'e}s{\'e}re is. Az {\'\i}gy el{\H o}k{\'e}sz{\'\i}tett vizsg{\'a}latok {\'a}tk{\"u}ldhet{\H o}k a k{\"o}zponti szerverre, ahol azok az arch{\'\i}vumban automatiksan t{\'a}rol{\'o}dnak. A jelenlegi diszk kapacit{\'a}s mellett 15 napig {\H o}rizz{\"u}k a vizsg{\'a}latokat. A tervek szerint 15 nap ut{\'a}n csak a k{\'e}peket t{\"o}r{\"o}lj{\"u}k a szerverr{\H o}l, a vizsg{\'a}lat egy{\'e}b (nem k{\'e}pi) adatai tov{\'a}bbra is meg{\H o}rz{\'e}sre ker{\"u}lnek. Az arch{\'\i}vumban Oracle adatb{\'a}zis keze{\'e}{\H o} rendszer seg{\'\i}ti a visszakeres{\'e}st, a mejelen{\'\i}t{\'e}st {\'e}s a m{\'o}dos{\'\i}t{\'a}st. A feldolgoz{\'o} munka{\'a}llom{\'a}sokra (PC-k, UNOX-{\'a}llom{\'a}sok vagy X-termin{\'a}lok) k{\'e}rheti le a felhaszn{\'a}l{\'o} a szerveren t{\'a}rolt vizsg{\'a}latokat. Itt jelen{\'\i}thet{\H o}k meg illetve dolgozhat{\'o}k fel a vizsg{\'a}latok k{\'e}pei. Az orvostanhallgat{\'o}k {\'e}s doktoranduszok k{\'e}pz{\'e}s{\'e}re HTML-ben {\'\i}rt oktat{\'a}si anyagok {\'a}ll{\'\i}that{\'o}k {\"o}ssze a t{\'a}rolt sz{\"o}veges {\'e}s k{\'e}pi adatokb{\'o}l. Az oktat{\'a}si anyagokat a rendszer k{\"u}l{\"o}n adatb{\'a}zisban t{\'a}rolja.

}, author = {Attila Kuba and Zolt{\'a}n Alexin and L{\'a}szl{\'o} G{\'a}bor Ny{\'u}l and Antal Nagy and K{\'a}lm{\'a}n Pal{\'a}gyi and Mariann Dud{\'a}sn{\'e} Nagy and L{\'a}szl{\'o} Csernay and L{\'a}szl{\'o} Alm{\'a}si}, editor = {Gy{\"o}rgy Kozmann} } @inbook {905, title = {A t{\"o}bbdimenzi{\'o}s k{\'e}pfeldolgoz{\'a}s programjai {\'e}s oktat{\'a}suk}, booktitle = {Informatika a fels{\H o}oktat{\'a}sban {\textquoteright}96 {\'e}s Networkshop {\textquoteright}96}, year = {1996}, month = {1996///}, pages = {649 - 656}, publisher = {Debreceni Egyetem}, organization = {Debreceni Egyetem}, address = {Debrecen}, abstract = {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{\'o}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. }, author = {Attila Kuba and Attila Fazekas and K{\'a}lm{\'a}n Pal{\'a}gyi and Antal Nagy and L{\'a}szl{\'o} G{\'a}bor Ny{\'u}l and Attila Peth{\H o}}, editor = {P{\'e}ter Bakonyi and Mikl{\'o}s Herdon} } @inbook {1326, title = {A t{\"o}bbdimenzi{\'o}s k{\'e}pfeldolgoz{\'a}s programjai {\'e}s oktat{\'a}suk}, booktitle = {Informatika a fels{\H o}oktat{\'a}sban {\textquoteright}96 {\'e}s Networkshop {\textquoteright}96}, year = {1996}, month = {1996}, pages = {649 - 656}, publisher = {Debreceni Egyetem}, organization = {Debreceni Egyetem}, address = {Debrecen}, abstract = {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{\'o}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. }, author = {Attila Kuba and Attila Fazekas and K{\'a}lm{\'a}n Pal{\'a}gyi and Antal Nagy and L{\'a}szl{\'o} G{\'a}bor Ny{\'u}l and Attila Peth{\H o}}, editor = {P{\'e}ter Bakonyi and Mikl{\'o}s Herdon} } @conference {1322, title = {Presentation of 3D SPECT images}, booktitle = {4th International Workshop Measurement}, year = {1995}, month = {May 1995}, pages = {82}, address = {Smolenice, Slovakia}, abstract = {

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.

}, author = {Attila Kuba and K{\'a}lm{\'a}n Pal{\'a}gyi and L{\'a}szl{\'o} G{\'a}bor Ny{\'u}l and Antal Nagy and L{\'a}szl{\'o} Csernay}, editor = {Ivan Bajla and K Karovic} } @conference {904, title = {Presentation of 3D SPECT images}, booktitle = {4th International Workshop Measurement}, year = {1995}, month = {May 1995}, pages = {82}, address = {Smolenice, Slovakia}, abstract = {

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.

}, author = {Attila Kuba and K{\'a}lm{\'a}n Pal{\'a}gyi and L{\'a}szl{\'o} G{\'a}bor Ny{\'u}l and Antal Nagy and L{\'a}szl{\'o} Csernay}, editor = {Ivan Bajla and K Karovic} } @inbook {951, title = {Signature verification using neuron nets}, booktitle = {Proceedings of the 9th Scandinavian Conference on Image Analysis, SCIA {\textquoteright}95}, year = {1995}, month = {1995///}, pages = {1115 - 1122}, publisher = {World Sci. Publishing, River Edge, NJ}, organization = {World Sci. Publishing, River Edge, NJ}, address = {River Edge}, author = {Endre Katona and K{\'a}lm{\'a}n Pal{\'a}gyi and N{\'a}ndor T{\'o}th}, editor = {Gunilla Borgefors} } @inbook {903, title = {Szabv{\'a}nyos k{\'e}pform{\'a}k orvosi k{\'e}pek t{\'a}rol{\'a}s{\'a}ra}, booktitle = {MEDICOMP {\textquoteright}94, Sz{\'a}m{\'\i}t{\'a}stechnikai {\'e}s kibernetikai m{\'o}dszerek az orvostudom{\'a}nyban {\'e}s a biol{\'o}gi{\'a}ban}, year = {1994}, month = {1994///}, pages = {112 - 116}, publisher = {SZOTE}, organization = {SZOTE}, address = {Szeged}, abstract = {Az orvosi k{\'e}palkot{\'o} berendez{\'e}sek fejl{\H o}d{\'e}s{\'e}vel elengedhetetlenn{\'e}v{\'a}lt a szabv{\'a}nyos orvosi k{\'e}pform{\'a}tumok kialak{\'\i}t{\'a}sa. A k{\"u}l{\"o}nf{\'e}le eszk{\"o}z{\"o}k{\"o}n k{\'e}sz{\"u}lt felv{\'e}telek feldolgoz{\'a}s{\'a}t, {\"o}sszehasonl{\'\i}t{\'a}s{\'a}t {\'e}s h{\'a}l{\'o}zatban val{\'o} tov{\'a}bb{\'\i}t{\'a}s{\'a}t megnehez{\'\i}tette, hogy a gy{\'a}rt{\'o}k a k{\'e}peket csak egy{\'e}ni, t{\"o}bb{\'e}-kev{\'e}sb{\'e} publik{\'a}lt form{\'a}tumban t{\'a}rolt{\'a}k. Ezen a helyzeten k{\'\i}v{\'a}nnak v{\'a}ltoztatni k{\"u}l{\"o}nf{\'e}le szervezetek olyan szabv{\'a}nyok bevezet{\'e}s{\'e}vel, amelyek speci{\'a}lisan orvosi k{\'e}pek eset{\'e}ben lehetnek hasznosak. A szabv{\'a}nyos{\'\i}t{\'a}si t{\"o}rekv{\'e}sek eredm{\'e}nyek{\'e}nt m{\'a}ra h{\'a}rom nagy ir{\'a}nyzat alakult ki: ACR-NEMA, DICOM {\'e}s Interfile. El{\H o}ad{\'a}sunkban v{\'a}zoljuk az orvosi k{\'e}pek t{\'a}rol{\'a}si form{\'a}tumain{\'a}l {\'e}rv{\'e}nyes{\"u}l{\H o} specifikus szempontokat, r{\"o}viden ismertetj{\"u}k az eml{\'\i}tett szabv{\'a}nyokat {\'e}s bemutatjuk az {\'a}ltalunk eddig k{\'e}sz{\'\i}tett, a k{\"u}l{\"o}nf{\'e}le form{\'a}tumok k{\"o}z{\"o}tti konverzi{\'o}t biztos{\'\i}t{\'o} programokat. }, author = {L{\'a}szl{\'o} G{\'a}bor Ny{\'u}l and Antal Nagy and K{\'a}lm{\'a}n Pal{\'a}gyi and J{\'o}zsef Tolnai and Attila Kuba}, editor = {Zolt{\'a}n Hantos} } @inbook {1321, title = {Szabv{\'a}nyos k{\'e}pform{\'a}k orvosi k{\'e}pek t{\'a}rol{\'a}s{\'a}ra}, booktitle = {MEDICOMP {\textquoteright}94, Sz{\'a}m{\'\i}t{\'a}stechnikai {\'e}s kibernetikai m{\'o}dszerek az orvostudom{\'a}nyban {\'e}s a biol{\'o}gi{\'a}ban}, year = {1994}, month = {1994}, pages = {112 - 116}, publisher = {SZOTE}, organization = {SZOTE}, address = {Szeged}, abstract = {Az orvosi k{\'e}palkot{\'o} berendez{\'e}sek fejl{\H o}d{\'e}s{\'e}vel elengedhetetlenn{\'e}v{\'a}lt a szabv{\'a}nyos orvosi k{\'e}pform{\'a}tumok kialak{\'\i}t{\'a}sa. A k{\"u}l{\"o}nf{\'e}le eszk{\"o}z{\"o}k{\"o}n k{\'e}sz{\"u}lt felv{\'e}telek feldolgoz{\'a}s{\'a}t, {\"o}sszehasonl{\'\i}t{\'a}s{\'a}t {\'e}s h{\'a}l{\'o}zatban val{\'o} tov{\'a}bb{\'\i}t{\'a}s{\'a}t megnehez{\'\i}tette, hogy a gy{\'a}rt{\'o}k a k{\'e}peket csak egy{\'e}ni, t{\"o}bb{\'e}-kev{\'e}sb{\'e} publik{\'a}lt form{\'a}tumban t{\'a}rolt{\'a}k. Ezen a helyzeten k{\'\i}v{\'a}nnak v{\'a}ltoztatni k{\"u}l{\"o}nf{\'e}le szervezetek olyan szabv{\'a}nyok bevezet{\'e}s{\'e}vel, amelyek speci{\'a}lisan orvosi k{\'e}pek eset{\'e}ben lehetnek hasznosak. A szabv{\'a}nyos{\'\i}t{\'a}si t{\"o}rekv{\'e}sek eredm{\'e}nyek{\'e}nt m{\'a}ra h{\'a}rom nagy ir{\'a}nyzat alakult ki: ACR-NEMA, DICOM {\'e}s Interfile. El{\H o}ad{\'a}sunkban v{\'a}zoljuk az orvosi k{\'e}pek t{\'a}rol{\'a}si form{\'a}tumain{\'a}l {\'e}rv{\'e}nyes{\"u}l{\H o} specifikus szempontokat, r{\"o}viden ismertetj{\"u}k az eml{\'\i}tett szabv{\'a}nyokat {\'e}s bemutatjuk az {\'a}ltalunk eddig k{\'e}sz{\'\i}tett, a k{\"u}l{\"o}nf{\'e}le form{\'a}tumok k{\"o}z{\"o}tti konverzi{\'o}t biztos{\'\i}t{\'o} programokat. }, author = {L{\'a}szl{\'o} G{\'a}bor Ny{\'u}l and Antal Nagy and K{\'a}lm{\'a}n Pal{\'a}gyi and J{\'o}zsef Tolnai and Attila Kuba}, editor = {Zolt{\'a}n Hantos} } @article {950, title = {Lok{\'a}lis p{\'a}rhuzamos elj{\'a}r{\'a}s bin{\'a}ris k{\'e}pek zajsz{\H u}r{\'e}s{\'e}re}, journal = {ALKALMAZOTT MATEMATIKAI LAPOK}, volume = {17}, year = {1993}, month = {1993///}, pages = {373 - 396}, isbn = {0133-3399}, author = {K{\'a}lm{\'a}n Pal{\'a}gyi} } @inbook {948, title = {Image processing on cellprocessors}, booktitle = {Proceedings of Conference on Intelligent Systems, CIS {\textquoteright}91}, year = {1991}, month = {1991///}, pages = {31 - 40}, publisher = {NJSZT}, organization = {NJSZT}, address = {Budapest}, author = {P{\'e}ter K{\"o}les and K{\'a}lm{\'a}n Pal{\'a}gyi}, editor = {A Gyorgy} } @inbook {947, title = {Neural Network Implementation on Cellular Processor}, booktitle = {Proceedings of Conference on Intelligent Systems, CIS {\textquoteright}91}, year = {1991}, month = {1991///}, pages = {129 - 137}, publisher = {NJSZT}, organization = {NJSZT}, address = {Budapest}, author = {N{\'a}ndor T{\'o}th and K{\'a}lm{\'a}n Pal{\'a}gyi}, editor = {A Gyorgy} } @inbook {946, title = {Cellular program development for the M1 processor}, booktitle = {Proceedings of the 5th International Workshop Parallel Processing by Cellular Automata and Arrays, Parcella {\textquoteright}90}, year = {1990}, month = {1990///}, pages = {315 - 319}, publisher = {Akademie Verlag}, organization = {Akademie Verlag}, address = {Berlin}, author = {T T{\H u}zk{\H o} and K{\'a}lm{\'a}n Pal{\'a}gyi}, editor = {G Wolf and Tam{\'a}s Legendi and U Schendel} } @article {927, title = {SOLUTION OF DENSE SYSTEMS OF LINEAR-EQUATIONS USING CELLULAR PROCESSORS}, journal = {LECTURE NOTES IN COMPUTER SCIENCE}, volume = {342}, year = {1989}, note = {UT: A1989AB14600024doi: 10.1007/3-540-50647-0_123Gottfried Wolf, Tam{\'a}as Legendi and Udo Schendel (eds.):Parcella{\textquoteright}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 }, month = {1989///}, pages = {311 - 316}, address = {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,}, isbn = {0302-9743}, author = {K{\'a}lm{\'a}n Pal{\'a}gyi} } @inbook {945, title = {Cellular algorithms for matrix multiplication}, booktitle = {Proceedings of the 3rd International Workshop Parallel Processing by Cellular Automata and Arrays, Parcella{\textquoteright}86}, year = {1987}, month = {1987///}, pages = {122 - 129}, publisher = {North-Holland Publishing Company}, organization = {North-Holland Publishing Company}, address = {Amsterdam}, author = {K{\'a}lm{\'a}n Pal{\'a}gyi}, editor = {Tam{\'a}s Legendi and Dennis Parkinson and R Vollmar and G Wolf} }