TY - CHAP T1 - Equivalent 2D sequential and parallel thinning T2 - Combinatorial Image Analysis Y1 - 2014 A1 - Kálmán Palágyi ED - Reneta P Barneva ED - Valentin E Brimkov ED - Josef Šlapal JF - Combinatorial Image Analysis PB - Springer CY - Brno, Czech Republic ER - TY - CHAP T1 - Sufficient conditions for general 2D operators to preserve topology T2 - Combinatorial Image Analysis Y1 - 2014 A1 - Péter Kardos A1 - Kálmán Palágyi ED - Reneta P Barneva ED - Valentin E Brimkov ED - Josef Šlapal AB -

An important requirement for various applications of binary image processing is to preserve topology. This issue has been earlier studied for two special types of image operators, namely, reductions and additions, and there have been some sufficient conditions proposed for them. In this paper, as an extension of those earlier results, we give novel sufficient criteria for general operators working on 2D pictures.

 

JF - Combinatorial Image Analysis T3 - Lecture Notes in Computer Science PB - Springer CY - May 2014, Brno, Czech Republic VL - 8466 SN - 978-3-319-07147-3 UR - http://dx.doi.org/10.1007/978-3-319-07148-0_10 JO - Conference Paper ER - TY - CONF T1 - Bináris képek rekonstrukciója két vetületből és morfológiai vázból T2 - A Képfeldolgozók és Alakfelismerők Társaságának konferenciája - KÉPAF 2013 Y1 - 2013 JF - A Képfeldolgozók és Alakfelismerők Társaságának konferenciája - KÉPAF 2013 PB - NJSZT-KÉPAF CY - Veszprém ER - TY - JOUR T1 - Conference of PhD Students in Computer Science JF - ACTA CYBERNETICA-SZEGED Y1 - 2013 A1 - Kálmán Palágyi VL - 21 SN - 0324-721X IS - 1 JO - ACTA CYBERN-SZEGED ER - TY - CHAP T1 - Deletion Rules for Equivalent Sequential and Parallel Reductions T2 - Progress in Pattern Recognition, Image Analysis, Computer Vision, and Applications Y1 - 2013 A1 - Kálmán Palágyi ED - Jose Ruiz-Shulcloper ED - Gabriella Sanniti di Baja AB -

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.

JF - Progress in Pattern Recognition, Image Analysis, Computer Vision, and Applications T3 - Lecture Notes in Computer Science PB - Springer CY - Berlin; Heidelberg SN - 978-3-642-41821-1 UR - http://link.springer.com/chapter/10.1007%2F978-3-642-41822-8_3 N1 - Lecture Notes in Computer Science, Vol. 8258 JO - Conference Paper ER - TY - CHAP T1 - Parallel 3D 12-Subiteration Thinning Algorithms Based on Isthmuses T2 - Advances in Visual Computing Y1 - 2013 A1 - Kálmán Palágyi ED - George Bebis AB -

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.

 

JF - Advances in Visual Computing T3 - Lecture Notes in Computer Science PB - Springer Verlag CY - Heidelberg; New York N1 - Lecture Notes in Computer Science, Vol. 8033 ER - TY - CONF T1 - Parallel Thinning Based on Isthmuses T2 - A Képfeldolgozók és Alakfelismerők Társaságának konferenciája - KÉPAF 2013 Y1 - 2013 A1 - Gábor Németh A1 - Kálmán Palágyi ED - László Czúni JF - A Képfeldolgozók és Alakfelismerők Társaságának konferenciája - KÉPAF 2013 PB - NJSZT-KÉPAF CY - Veszprém ER - TY - CHAP T1 - Parallel Thinning on the Triangular Grid T2 - International Conference on Cognitive Infocommunications (CogInfoCom) Y1 - 2013 A1 - Péter Kardos A1 - Kálmán Palágyi ED - Péter Baranyi AB -

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

JF - International Conference on Cognitive Infocommunications (CogInfoCom) PB - IEEE CY - Budapest SN - 978-1-4799-1543-9 ER - TY - CHAP T1 - Sufficient Conditions for Topology Preserving Additions and General Operators T2 - Proceedings of the IASTED International Conference on Computer Graphics and Imaging (CGIM) Y1 - 2013 A1 - Péter Kardos A1 - Kálmán Palágyi ED - L Linsen AB -

Topology preservation is a crucial issue of digital topology. Various applications of binary image processing rest on topology preserving operators. Earlier studies in this topic mainly concerned with reductions (i.e., operators that only delete some object points from binary images), as they form the basis for thinning algorithms. However, additions (i.e., operators that never change object points) also play important role for the purpose of generating discrete Voronoi diagrams or skeletons by influence zones (SKIZ). Furthermore, the use of general operators that may both add and delete some points to and from objects in pictures are suitable for contour smoothing. Therefore, in this paper we present some new sufficient conditions for topology preserving reductions, additions, and general operators. Two additions for 2D and 3D contour smoothing are also reported.

 

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

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

JF - Proceedings of International Symposium on Image and Signal Processing and Analysis (ISPA) PB - IEEE CY - Trieste ER - TY - CONF T1 - Topology preserving parallel thinning on hexagonal grids T2 - A Képfeldolgozók és Alakfelismerők Társaságának konferenciája - KÉPAF 2013 Y1 - 2013 A1 - Péter Kardos A1 - Kálmán Palágyi ED - László Czúni JF - A Képfeldolgozók és Alakfelismerők Társaságának konferenciája - KÉPAF 2013 PB - NJSZT-KÉPAF CY - Veszprém ER - TY - JOUR T1 - Topology-preserving hexagonal thinning JF - INTERNATIONAL JOURNAL OF COMPUTER MATHEMATICS Y1 - 2013 A1 - Péter Kardos A1 - Kálmán Palágyi AB -

Thinning is a well-known technique for producing skeleton-like shape features from digital binary objects in a topology-preserving way. Most of the existing thinning algorithms work on input images that are sampled on orthogonal grids; however, it is also possible to perform thinning on hexagonal grids (or triangular lattices). In this paper, we point out to the main similarities and differences between the topological properties of these two types of sampling schemes. We give various characterizations of simple points and present some new sufficient conditions for topology-preserving reductions working on hexagonal grids.

PB - Taylor & Francis VL - 90 SN - 0020-7160 UR - http://www.tandfonline.com/doi/abs/10.1080/00207160.2012.724198#preview IS - 8 N1 - doi: 10.1080/00207160.2012.724198 JO - INT J COMPUT MATH ER - TY - CHAP T1 - 3D Parallel Thinning Algorithms Based on Isthmuses T2 - Advanced Concepts for Intelligent Vision Systems (ACIVS) Y1 - 2012 A1 - Gábor Németh A1 - Kálmán Palágyi ED - Jacques Blanc-Talon ED - Wilfried Philips ED - Dan Popescu ED - Paul Scheunders ED - Pavel Zemčík AB -

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.

JF - Advanced Concepts for Intelligent Vision Systems (ACIVS) T3 - Lecture Notes in Computer Science PB - Springer Verlag CY - Brno, Czech Republic VL - 7517 UR - http://dx.doi.org/10.1007/978-3-642-33140-4_29 N1 - N1 10.1007/978-3-642-33140-4_29 JO - Conference Paper ER - TY - CHAP T1 - Binary image reconstruction from two projections and skeletal information T2 - Combinatorial Image Analysis Y1 - 2012 A1 - Norbert Hantos A1 - Péter Balázs A1 - Kálmán Palágyi ED - Reneta P Barneva ED - Valentin E Brimkov ED - Jake K Aggarwal AB -

In binary tomography, the goal is to reconstruct binary images from a small set of their projections. However, especially when only two projections are used, the task can be extremely underdetermined. In this paper, we show how to reduce ambiguity by using the morphological skeleton of the image as a priori. Three different variants of our method based on Simulated Annealing are tested using artificial binary images, and compared by reconstruction time and error. © 2012 Springer-Verlag.

JF - Combinatorial Image Analysis T3 - Lecture Notes in Computer Science PB - Springer Verlag CY - Berlin; Heidelberg; New York; London; Paris; Tokyo N1 - ScopusID: 84869986820doi: 10.1007/978-3-642-34732-0_20 JO - LNCS ER - TY - CONF T1 - Binary tomography using two projections and morphological skeleton T2 - Conference of PhD Students in Computer Science Y1 - 2012 JF - Conference of PhD Students in Computer Science PB - Univ Szeged Institute of Informatics CY - Szeged VL - Volume of Extended Abstracts ER - TY - CHAP T1 - Hexagonal parallel thinning algorithms based on sufficient conditions for topology preservation T2 - Computational Modelling of Objects Represented in Images: Fundamentals, Methods and Applications III Y1 - 2012 A1 - Péter Kardos A1 - Kálmán Palágyi ED - Paolo Di Giamberardino ED - Daniela Iacoviello ED - Renato M Natal Jorge ED - Joao Manuel R S Taveres AB -

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

JF - Computational Modelling of Objects Represented in Images: Fundamentals, Methods and Applications III PB - CRC Press - Taylor and Frances Group CY - London SN - 978-0-415-62134-2 ER - TY - CONF T1 - Isthmus-based Order-Independent Sequential Thinning T2 - IASTED International Conference on Signal Processing, Pattern Recognition and Applications (SSPRA) Y1 - 2012 A1 - Péter Kardos A1 - Kálmán Palágyi ED - M Petrou ED - A D Sappa ED - A G Triantafyllidis AB -

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

JF - IASTED International Conference on Signal Processing, Pattern Recognition and Applications (SSPRA) PB - IASTED ACTA Press CY - Crete, Greek UR - http://www.actapress.com/Content_of_Proceeding.aspx?proceedingID=736 N1 - doi: 10.2316/P.2012.778-025 ER - TY - CONF T1 - On Order–Independent Sequential Thinning T2 - IEEE International Conference on Cognitive Infocommunications (CogInfoCom) Y1 - 2012 A1 - Péter Kardos A1 - Kálmán Palágyi ED - IEEE AB -

The visual world composed by the human and computational cognitive systems strongly relies on shapes of objects. Skeleton is a widely applied shape feature that plays an important role in many fields of image processing, pattern recognition, and computer vision. Thinning is a frequently used, iterative object reduction strategy for skeletonization. Sequential thinning algorithms, which are based on contour tracking, delete just one border point at a time. Most of them have the disadvantage of order-dependence, i.e., for dissimilar visiting orders of object points, they may generate different skeletons. In this work, we give a survey of our results on order-independent thinning: we introduce some sequential algorithms that produce identical skeletons for any visiting orders, and we also present some sufficient conditions for the order-independence of templatebased sequential algorithms.

JF - IEEE International Conference on Cognitive Infocommunications (CogInfoCom) PB - IEEE CY - Kosice, Slovakia SN - 978-1-4673-5187-4 UR - http://ieeexplore.ieee.org/xpl/mostRecentIssue.jsp?punumber=6413305 ER - TY - CONF T1 - Solving binary tomography from morphological skeleton via optimization T2 - Veszprém Optimization Conference: Advanced Algorithms (VOCAL) Y1 - 2012 A1 - Norbert Hantos A1 - Péter Balázs A1 - Kálmán Palágyi JF - Veszprém Optimization Conference: Advanced Algorithms (VOCAL) PB - University of Pannonia CY - Veszprém ER - TY - CHAP T1 - On topology preservation for triangular thinning algorithms T2 - Combinatorial Image Analysis (IWCIA) Y1 - 2012 A1 - Péter Kardos A1 - Kálmán Palágyi ED - Reneta P Barneva ED - Valentin E Brimkov ED - Jake K Aggarwal AB -

Thinning is a frequently used strategy to produce skeleton-like shape features of binary objects. One of the main problems of parallel thinning is to ensure topology preservation. Solutions to this problem have been already given for the case of orthogonal and hexagonal grids. This work introduces some characterizations of simple pixels and some sufficient conditions for parallel thinning algorithms working on triangular grids (or hexagonal lattices) to preserve topology.

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

A widely used technique to obtain skeletons of binary objects is thinning, which is an iterative layer-by-layer erosion in a topology preserving way. Thinning in 3D is capable of extracting various skeleton-like shape descriptors (i.e., centerlines, medial surfaces, and topological kernels). This chapter describes a family of new parallel 3D thinning algorithms for (26, 6) binary pictures. The reported algorithms are derived from some sufficient conditions for topology preserving parallel reduction operations, hence their topological correctness is guaranteed.

JF - Digital Geometry Algorithms T3 - Lecture Notes in Computational Vision and Biomechanics PB - Springer-Verlag SN - 978-94-007-4173-7 N1 - doi: 10.1007/978-94-007-4174-4_6 ER - TY - CONF T1 - 2D Parallel Thinning Algorithms Based on Isthmus-Preservation T2 - Proceedings of the International Symposium on Image and Signal Processing and Analysis (ISPA) Y1 - 2011 A1 - Gábor Németh A1 - Kálmán Palágyi ED - Sven Lončarić ED - Giovanni Ramponi ED - D. Sersic AB -

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.

JF - Proceedings of the International Symposium on Image and Signal Processing and Analysis (ISPA) PB - IEEE CY - Dubrovnik, Croatia SN - 978-1-4577-0841-1 N1 - ScopusID: 83455172782 ER - TY - JOUR T1 - 2D parallel thinning and shrinking based on sufficient conditions for topology preservation JF - ACTA CYBERNETICA-SZEGED Y1 - 2011 A1 - Gábor Németh A1 - Péter Kardos A1 - Kálmán Palágyi AB -

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

PB - University of Szeged, Institute of Informatics CY - Szeged VL - 20 SN - 0324-721X IS - 1 N1 - ScopusID: 79960666919 JO - ACTA CYBERN-SZEGED ER - TY - CONF T1 - 3D objektumok lineáris deformációinak becslése T2 - A Képfeldolgozók és Alakfelismerők Társaságának konferenciája - KÉPAF 2011 Y1 - 2011 A1 - Attila Tanacs A1 - Joakim Lindblad A1 - Nataša Sladoje A1 - Zoltan Kato ED - Zoltan Kato ED - Kálmán Palágyi JF - A Képfeldolgozók és Alakfelismerők Társaságának konferenciája - KÉPAF 2011 PB - NJSZT CY - Szeged ER - TY - CONF T1 - Affin Puzzle: Deformált objektumdarabok helyreállítása megfeleltetések nélkül T2 - A Képfeldolgozók és Alakfelismerők Társaságának konferenciája - KÉPAF 2011 Y1 - 2011 A1 - Csaba Domokos A1 - Zoltan Kato ED - Zoltan Kato ED - Kálmán Palágyi JF - A Képfeldolgozók és Alakfelismerők Társaságának konferenciája - KÉPAF 2011 PB - NJSZT CY - Szeged UR - http://www.inf.u-szeged.hu/kepaf2011/pdfs/S05_03.pdf N1 - Kuba Attila Díjas cikk. ER - TY - CONF T1 - Bináris tomográfiai rekonstrukció objektum alapú evolúciós algoritmussal T2 - A Képfeldolgozók és Alakfelismerők Társaságának konferenciája - KÉPAF 2011 Y1 - 2011 JF - A Képfeldolgozók és Alakfelismerők Társaságának konferenciája - KÉPAF 2011 PB - NJSZT CY - Szeged ER - TY - JOUR T1 - Conference of PhD Students in Computer Science JF - ACTA CYBERNETICA-SZEGED Y1 - 2011 A1 - Kálmán Palágyi VL - 20 SN - 0324-721X IS - 1 N1 - ScopusID: 79960683318 JO - ACTA CYBERN-SZEGED ER - TY - CONF T1 - Élősejt szegmentálása gráfvágás segítségével fluoreszcenciás mikroszkóp képeken T2 - A Képfeldolgozók és Alakfelismerők Társaságának konferenciája - KÉPAF 2011 Y1 - 2011 A1 - Milan Lesko A1 - Zoltan Kato A1 - Antal Nagy A1 - Imre Gombos A1 - Zsolt Török A1 - László Vígh A1 - László Vígh ED - Zoltan Kato ED - Kálmán Palágyi JF - A Képfeldolgozók és Alakfelismerők Társaságának konferenciája - KÉPAF 2011 PB - NJSZT CY - Szeged UR - http://www.inf.u-szeged.hu/kepaf2011/pdfs/S08_02.pdf ER - TY - CHAP T1 - A family of topology-preserving 3d parallel 6-subiteration thinning algorithms T2 - Combinatorial Image Analysis (IWCIA) Y1 - 2011 A1 - Gábor Németh A1 - Péter Kardos A1 - Kálmán Palágyi ED - Jake K Aggarwal ED - Reneta P Barneva ED - Valentin E Brimkov ED - Kostadin N Koroutchev ED - Elka R Korutcheva AB -

Thinning is an iterative layer-by-layer erosion until only the skeleton-like shape features of the objects are left. This paper presents a family of new 3D parallel thinning algorithms that are based on our new sufficient conditions for 3D parallel reduction operators to preserve topology. The strategy which is used is called subiteration-based: each iteration step is composed of six parallel reduction operators according to the six main directions in 3D. The major contributions of this paper are: 1) Some new sufficient conditions for topology preserving parallel reductions are introduced. 2) A new 6-subiteration thinning scheme is proposed. Its topological correctness is guaranteed, since its deletion rules are derived from our sufficient conditions for topology preservation. 3) The proposed thinning scheme with different characterizations of endpoints yields various new algorithms for extracting centerlines and medial surfaces from 3D binary pictures. © 2011 Springer-Verlag Berlin Heidelberg.

JF - Combinatorial Image Analysis (IWCIA) T3 - Lecture Notes in Computer Science PB - Springer Verlag CY - Madrid, Spain SN - 978-3-642-21072-3 N1 - ScopusID: 79957651399doi: 10.1007/978-3-642-21073-0_5 JO - LNCS ER - TY - CONF T1 - Iterációnkénti simítással kombinált vékonyítás T2 - A Képfeldolgozók és Alakfelismerők Társaságának konferenciája - KÉPAF 2011 Y1 - 2011 A1 - Péter Kardos A1 - Gábor Németh A1 - Kálmán Palágyi ED - Zoltan Kato ED - Kálmán Palágyi JF - A Képfeldolgozók és Alakfelismerők Társaságának konferenciája - KÉPAF 2011 PB - NJSZT CY - Szeged UR - http://www.inf.u-szeged.hu/kepaf2011/pdfs/S05_01.pdf ER - TY - BOOK T1 - Képfeldolgozás haladóknak Y1 - 2011 A1 - Kálmán Palágyi PB - Typotex CY - Budapest ER - TY - CONF T1 - Mediánszűrés alkalmazása algebrai rekonstrukciós módszerekben T2 - A Képfeldolgozók és Alakfelismerők Társaságának konferenciája - KÉPAF 2011 Y1 - 2011 A1 - Norbert Hantos A1 - Péter Balázs ED - Zoltan Kato ED - Kálmán Palágyi JF - A Képfeldolgozók és Alakfelismerők Társaságának konferenciája - KÉPAF 2011 PB - NJSZT CY - Szeged ER - TY - CONF T1 - Order-independent sequential thinning in arbitrary dimensions T2 - Signal and Image Processing and Applications (SIPA) Y1 - 2011 A1 - Péter Kardos A1 - Kálmán Palágyi ED - Ioannis Andreadis ED - M Zervakis AB -

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

JF - Signal and Image Processing and Applications (SIPA) PB - IASTED - Acta Press CY - Crete, Greek N1 - doi: 10.2316/P.2011.738-021 ER - TY - JOUR T1 - Thinning combined with iteration-by-iteration smoothing for 3D binary images JF - GRAPHICAL MODELS Y1 - 2011 A1 - Gábor Németh A1 - Péter Kardos A1 - Kálmán Palágyi AB -

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

VL - 73 SN - 1524-0703 IS - 6 N1 - ScopusID: 79952613010doi: 10.1016/j.gmod.2011.02.001 JO - GRAPH MODELS ER - TY - CONF T1 - A topológia-megőrzés elegendő feltételein alapuló 3D párhuzamos vékonyító algoritmusok T2 - A Képfeldolgozók és Alakfelismerők Társaságának konferenciája - KÉPAF 2011 Y1 - 2011 A1 - Gábor Németh A1 - Péter Kardos A1 - Kálmán Palágyi ED - Zoltan Kato ED - Kálmán Palágyi JF - A Képfeldolgozók és Alakfelismerők Társaságának konferenciája - KÉPAF 2011 PB - NJSZT CY - Szeged UR - http://www.inf.u-szeged.hu/kepaf2011/pdfs/S05_02.pdf ER - TY - CHAP T1 - On topology preservation for hexagonal parallel thinning algorithms T2 - Combinatorial Image Analysis (IWCIA) Y1 - 2011 A1 - Péter Kardos A1 - Kálmán Palágyi ED - Jake K Aggarwal ED - Reneta P Barneva ED - Valentin E Brimkov ED - Kostadin N Koroutchev ED - Elka R Korutcheva AB -

Topology preservation is the key concept in parallel thinning algorithms on any sampling schemes. This paper establishes some sufficient conditions for parallel thinning algorithms working on hexagonal grids (or triangular lattices) to preserve topology. By these results, various thinning (and shrinking to a residue) algorithms can be verified. To illustrate the usefulness of our sufficient conditions, we propose a new parallel thinning algorithm and prove its topological correctness. © 2011 Springer-Verlag Berlin Heidelberg.

JF - Combinatorial Image Analysis (IWCIA) T3 - Lecture Notes in Computer Science PB - Springer Verlag CY - Madrid, Spain SN - 978-3-642-21072-3 N1 - ScopusID: 79957628214doi: 10.1007/978-3-642-21073-0_6 JO - LNCS ER - TY - JOUR T1 - Topology Preserving Parallel Thinning Algorithms JF - INTERNATIONAL JOURNAL OF IMAGING SYSTEMS AND TECHNOLOGY Y1 - 2011 A1 - Gábor Németh A1 - Kálmán Palágyi AB -

Thinning is an iterative object reduction technique for extracting medial curves from binary objects. During a thinning process, some border points that satisfy certain topological and geometric constraints are deleted in iteration steps. Parallel thinning algorithms are composed of parallel reduction operators that delete a set of object points simultaneously. This article presents 21 parallel thinning algorithms for (8,4) binary pictures that are derived from the sufficient conditions for topology preservation accommodated to the three parallel thinning approaches. © 2011 Wiley Periodicals, Inc.

PB - Wiley Periodicals, Inc. VL - 21 SN - 0899-9457 IS - 1 N1 - UT: 000287789100005ScopusID: 79951782238doi: 10.1002/ima.20272 JO - INT J IMAG SYST TECH ER - TY - CONF T1 - Vetületi irányfüggőség a bináris tomográfiában T2 - A Képfeldolgozók és Alakfelismerők Társaságának konferenciája - KÉPAF 2011 Y1 - 2011 A1 - László Gábor Varga A1 - Péter Balázs A1 - Antal Nagy ED - Zoltan Kato ED - Kálmán Palágyi JF - A Képfeldolgozók és Alakfelismerők Társaságának konferenciája - KÉPAF 2011 PB - NJSZT CY - Szeged ER - TY - JOUR T1 - Bejárásfüggetlen szekvenciális vékonyítás JF - ALKALMAZOTT MATEMATIKAI LAPOK Y1 - 2010 A1 - Péter Kardos A1 - Gábor Németh A1 - Kálmán Palágyi VL - 27 SN - 0133-3399 IS - 1 JO - ALKALMAZOTT MATEMATIKAI LAPOK ER - TY - CHAP T1 - Parallel Thinning Algorithms Based on Ronse's Sufficient Conditions for Topology Preservation T2 - Progress in Combinatorial Image Analysis Y1 - 2010 A1 - Gábor Németh A1 - Kálmán Palágyi ED - Petra Wiederhold ED - Reneta P Barneva JF - Progress in Combinatorial Image Analysis PB - Scientific Research Publishing Inc. CY - Singapore UR - http://rpsonline.com.sg/rpsweb/iwcia09.html ER - TY - CONF T1 - Topology preserving 2-subfield 3D thinning algorithms T2 - Proceedings of the International Conference on Signal Processing, Pattern Recognition and Applications (SPPRA) Y1 - 2010 A1 - Gábor Németh A1 - Péter Kardos A1 - Kálmán Palágyi ED - B Zagar ED - A Kuijper ED - H Sahbi AB -

This paper presents a new family of 3D thinning algorithms for extracting skeleton-like shape features (i.e, centerline, medial surface, and topological kernel) from volumetric images. A 2-subfield strategy is applied: all points in a 3D picture are partitioned into two subsets which are alternatively activated. At each iteration, a parallel operator is applied for deleting some border points in the active subfield. The proposed algorithms are derived from Ma's sufficient conditions for topology preservation, and they use various endpoint characterizations.

JF - Proceedings of the International Conference on Signal Processing, Pattern Recognition and Applications (SPPRA) PB - IASTED ACTA Press CY - Innsbruck, Austria N1 - ScopusID: 77954590365 ER - TY - CHAP T1 - Topology Preserving 3D Thinning Algorithms using Four and Eight Subfields T2 - Proceedings of the International Conference on Image Analysis and Recognition (ICIAR) Y1 - 2010 A1 - Gábor Németh A1 - Péter Kardos A1 - Kálmán Palágyi ED - Aurélio Campilho ED - Mohamed Kamel AB -

Thinning is a frequently applied technique for extracting skeleton-like shape features (i.e., centerline, medial surface, and topological kernel) from volumetric binary images. Subfield-based thinning algorithms partition the image into some subsets which are alternatively activated, and some points in the active subfield are deleted. This paper presents a set of new 3D parallel subfield-based thinning algorithms that use four and eight subfields. The three major contributions of this paper are: 1) The deletion rules of the presented algorithms are derived from some sufficient conditions for topology preservation. 2) A novel thinning scheme is proposed that uses iteration-level endpoint checking. 3) Various characterizations of endpoints yield different algorithms. © 2010 Springer-Verlag.

JF - Proceedings of the International Conference on Image Analysis and Recognition (ICIAR) T3 - Lecture Notes in Computer Science PB - Springer Verlag CY - Póvoa de Varzim, Portugal VL - 6111 N1 - ScopusID: 77955432947doi: 10.1007/978-3-642-13772-3_32 JO - LNCS ER - TY - CHAP T1 - Topology Preserving Parallel Smoothing for 3D Binary Images T2 - Proceedings of the Computational Modeling of Objects Represented in Images (CMORI) Y1 - 2010 A1 - Gábor Németh A1 - Péter Kardos A1 - Kálmán Palágyi ED - Reneta P Barneva ED - Valentin E Brimkov ED - Herbert A Hauptman ED - Renato M Natal Jorge ED - João Manuel R S Tavares AB -

This paper presents a new algorithm for smoothing 3D binary images in a topology preserving way. Our algorithm is a reduction operator: some border points that are considered as extremities are removed. The proposed method is composed of two parallel reduction operators. We are to apply our smoothing algorithm as an iteration-by-iteration pruning for reducing the noise sensitivity of 3D parallel surface-thinning algorithms. An efficient implementation of our algorithm is sketched and its topological correctness for (26,6) pictures is proved. © 2010 Springer-Verlag.

JF - Proceedings of the Computational Modeling of Objects Represented in Images (CMORI) PB - Springer Verlag CY - Buffalo, USA VL - 6026 N1 - ScopusID: 77952401887doi: 10.1007/978-3-642-12712-0_26 ER - TY - JOUR T1 - Conference of PhD Students in Computer Science JF - ACTA CYBERNETICA-SZEGED Y1 - 2009 A1 - Kálmán Palágyi VL - 19 SN - 0324-721X IS - 1 JO - ACTA CYBERN-SZEGED ER - TY - CHAP T1 - Fully Parallel 3D Thinning Algorithms based on Sufficient Conditions for Topology Preservation T2 - Proceedings of Discrete Geometry for Computer Imagery (DGCI) Y1 - 2009 A1 - Kálmán Palágyi A1 - Gábor Németh ED - Srecko Brlek ED - Christophe Reutenauer ED - Xavier Provençal AB -

This paper presents a family of parallel thinning algorithms for extracting medial surfaces from 3D binary pictures. The proposed algorithms are based on sufficient conditions for 3D parallel reduction operators to preserve topology for (26,6) pictures. Hence it is self-evident that our algorithms are topology preserving. Their efficient implementation on conventional sequential computers is also presented. © 2009 Springer Berlin Heidelberg.

JF - Proceedings of Discrete Geometry for Computer Imagery (DGCI) PB - Springer Verlag CY - Montreal, Quebec, Canada SN - 978-3-642-04396-3 N1 - ScopusID: 77952414581doi: 10.1007/978-3-642-04397-0_41 ER - TY - CONF T1 - Kritikus párokat vizsgáló bejárásfüggetlen szekvenciális vékonyító algoritmus T2 - A Képfeldolgozók és Alakfelismerők Társaságának konferenciája - KÉPAF 2009 Y1 - 2009 JF - A Képfeldolgozók és Alakfelismerők Társaságának konferenciája - KÉPAF 2009 PB - Akaprint CY - Budapest ER - TY - CONF T1 - A morfológiai váz általánosítása szomszédsági szekvenciákkal T2 - A Képfeldolgozók és Alakfelismerők Társaságának konferenciája - KÉPAF 2009 Y1 - 2009 JF - A Képfeldolgozók és Alakfelismerők Társaságának konferenciája - KÉPAF 2009 PB - Akaprint CY - Budapest ER - TY - CHAP T1 - An order-independent sequential thinning algorithm T2 - Proceedings of the International Workshop on Combinatorial Image Analysis (IWCIA) Y1 - 2009 A1 - Péter Kardos A1 - Gábor Németh A1 - Kálmán Palágyi ED - Petra Wiederhold ED - Reneta P Barneva AB -

Thinning is a widely used approach for skeletonization. Sequential thinning algorithms use contour tracking: they scan border points and remove the actual one if it is not designated a skeletal point. They may produce various skeletons for different visiting orders. In this paper, we present a new 2-dimensional sequential thinning algorithm, which produces the same result for arbitrary visiting orders and it is capable of extracting maximally thinned skeletons. © Springer-Verlag Berlin Heidelberg 2009.

JF - Proceedings of the International Workshop on Combinatorial Image Analysis (IWCIA) PB - Springer Verlag CY - Playa del Carmen, Mexico SN - 978-3-642-10208-0 UR - http://link.springer.com/chapter/10.1007/978-3-642-10210-3_13 N1 - ScopusID: 78650496028doi: 10.1007/978-3-642-10210-3_13 ER - TY - JOUR T1 - Preface to the Special Issue JF - DISCRETE APPLIED MATHEMATICS Y1 - 2009 VL - 157 SN - 0166-218X IS - 3 N1 - UT: 000262243800001ScopusID: 56649097446doi: 10.1016/j.dam.2008.08.005 JO - DISCRETE APPL MATH ER - TY - JOUR T1 - A 3D fully parallel surface-thinning algorithm JF - THEORETICAL COMPUTER SCIENCE Y1 - 2008 A1 - Kálmán Palágyi AB -

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. © 2008 Elsevier B.V. All rights reserved.

PB - Elsevier CY - 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, VL - 406 SN - 0304-3975 IS - 1-2 N1 - UT: 000260289400014ScopusID: 51749087902doi: 10.1016/j.tcs.2008.06.041 JO - THEOR COMPUT SCI ER - TY - CONF T1 - Determination of geometric features of binary images from their projections by using decision trees T2 - Conference of PhD Students in Computer Science. Volume of Extended Abstracts Y1 - 2008 A1 - Mihály Gara A1 - Péter Balázs ED - Kálmán Palágyi ED - Balázs Bánhelyi ED - Tamás Gergely ED - István Matievics JF - Conference of PhD Students in Computer Science. Volume of Extended Abstracts PB - University of Szeged CY - Szeged, Hungary ER - TY - CHAP T1 - A képfeldolgozás kutatása a Szegedi Tudományegyetemen T2 - Informatika a felsőoktatásban 2008 Y1 - 2008 AB - A digitális képfeldolgozás kutatásának a Szegedi TudományegyetemTermészettudományi és Informatikai Karán, az Informatikai Tanszékcsoport Képfeldolgozás és Számítógépes Grafika Tanszékén közel négy évtizedes hagyománya van. A Tanszék valamennyi munkatársa nemzetközileg elismert kutatómunkát folytat, melyet már több száz rangos publikáció fémjelez. Számos, a képfeldolgozás kutatásában vezető egyetemmel és kutatóintézettel építettünk ki szoros kapcsolatot és folytattunk eredményes kutatómunkát, aktív résztvevői vagyunk a hazai és a nemzetközi tudományos közéletnek. A legfontosabb, jelenleg is folyó kutatásaink: orvosi képek feldolgozása, diszkrét tomográfia, képszegmentálás, térinformatika, távérzékelés, képregisztráció, vázkijelölés, műtéti tervezés. JF - Informatika a felsőoktatásban 2008 PB - Debreceni Egyetem Informatikai Kar CY - Debrecen UR - http://www.agr.unideb.hu/if2008/kiadvany/papers/E62.pdf N1 - Art. No.: E62 ER - TY - CHAP T1 - Skeletonization based on metrical neighborhood sequences T2 - Computer Vision Systems Y1 - 2008 A1 - Attila Fazekas A1 - Kálmán Palágyi A1 - György Kovács A1 - Gábor Németh ED - Antonios Gasteratos ED - Markus Vincze ED - John K Tsotsos AB -

Skeleton is a shape descriptor which summarizes the general formof objects. It can be expressed in terms of the fundamental morphological operations. The limitation of that characterization is that its construction based on digital disks such that cannot provide good approximation to the Euclidean disks. In this paper we define a new type of skeleton based on neighborhood sequences that is much closer to the Euclidean skeleton. A novel method for quantitative comparison of skeletonization algorithms is also proposed. © 2008 Springer- Verlag Berlin Heidelberg.

JF - Computer Vision Systems PB - Springer Verlag CY - Santorini, Greece SN - 978-3-540-79546-9 N1 - ScopusID: 44649159529doi: 10.1007/978-3-540-79547-6 ER - TY - CHAP T1 - Techniques of Virtual Dissection of the Colon Based on Spiral CT Data T2 - Image Processing in Radiology Y1 - 2008 A1 - Erich Sorantin A1 - Emese Balogh A1 - Anna Vilanova Bartroli A1 - Kálmán Palágyi A1 - László Gábor Nyúl A1 - Franz Lindbichler A1 - Andrea Ruppert ED - Emanuele Neri ED - Davide Caramella ED - Carlo Bartolozzi AB -

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

JF - Image Processing in Radiology PB - Springer-Verlag CY - Berlin N1 - doi: 10.1007/978-3-540-49830-8_18 ER - TY - CHAP T1 - A 3-subiteration surface-thinning algorithm T2 - Computer Analysis of Images and Patterns Y1 - 2007 A1 - Kálmán Palágyi ED - Walter G Kropatsch ED - Martin Kampel ED - Allan Hanbury AB -

Thinning is an iterative layer by layer erosion for extractingskeleton. This paper presents an efficient parallel 3D thinning algorithm which produces medial surfaces. A three-subiteration strategy is proposed: the thinning operation is changed from iteration to iteration with a period of three according to the three deletion directions. © Springer-Verlag Berlin Heidelberg 2007.

JF - Computer Analysis of Images and Patterns T3 - Lecture Notes in Computer Science PB - Springer Verlag CY - Vienna, Austria SN - 978-3-540-74271-5 JO - LNCS ER - TY - CONF T1 - Alakreprezentáció szférikus harmonikus sorfejtéssel T2 - A Képfeldolgozók és Alakfelismerők Társaságának konferenciája - KÉPAF 2007 Y1 - 2007 JF - A Képfeldolgozók és Alakfelismerők Társaságának konferenciája - KÉPAF 2007 PB - Képfeldolgozók és Alakfelismerők Társasága CY - Debrecen ER - TY - CONF T1 - Efficient Implementation of 3D Thinning Algorithms T2 - A Képfeldolgozók és Alakfelismerők Társaságának konferenciája - KÉPAF 2007 Y1 - 2007 A1 - Kálmán Palágyi ED - Attila Fazekas ED - András Hajdú JF - A Képfeldolgozók és Alakfelismerők Társaságának konferenciája - KÉPAF 2007 PB - Képfeldolgozók és Alakfelismerők Társasága CY - Debrecen ER - TY - CHAP T1 - A subiteration-based surface-thinning algorithm with a period of three T2 - Pattern Recognition Y1 - 2007 A1 - Kálmán Palágyi ED - Fred A Hamprecht ED - Christoph Schnorr ED - Bernd Jähne AB -

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. © Springer-Verlag Berlin Heidelberg 2007.

JF - Pattern Recognition T3 - Lecture Notes on Computer Science PB - Springer Verlag CY - Heidelberg, Germany SN - 978-3-540-74933-2 N1 - ScopusID: 38149004908 JO - LNCS ER - TY - CHAP T1 - A benchmark evaluation of large-scale optimization approaches to binary tomography T2 - Discrete Geometry for Computer Imagery Y1 - 2006 JF - Discrete Geometry for Computer Imagery PB - Springer-Verlag CY - Berlin; Heidelberg N1 - UT: 000241649600013doi: 10.1007/11907350_13 ER - TY - Generic T1 - Discrete Geometry for Computer Imagery T2 - Discrete Geometry for Computer Imagery Y1 - 2006 AB -

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.

JF - Discrete Geometry for Computer Imagery T3 - Lecture Notes in Computer Science PB - Springer-Verlag VL - 4245 UR - http://www.springerlink.com/content/t38633812l42/ N1 - UT: 000241649600007ScopusID: 33845210215doi: 10.1007/11907350 JO - LNCS ER - TY - CHAP T1 - New advances for imaging laryngo / trachealstenosis by post processing of spiral-CT data T2 - Digital (r)evolution in radiology Y1 - 2006 JF - Digital (r)evolution in radiology PB - Springer-Verlag CY - Wien; New York ER - TY - CHAP T1 - The number of line-convex directed polyominoes having the same orthogonal projections T2 - Discrete Geometry for Computer Imagery Y1 - 2006 AB -

The number of line-convex directed polyominoes with givenhorizontal and vertical projections is studied. It is proven that diagonally convex directed polyominoes are uniquely determined by their orthogonal projections. The proof of this result is algorithmical. As a counterpart, we show that ambiguity can be exponential if antidiagonal convexity is assumed about the polyomino. Then, the results are generalised to polyominoes having convexity property along arbitrary lines. © Springer-Verlag Berlin Heidelberg 2006.

JF - Discrete Geometry for Computer Imagery PB - Springer-Verlag CY - Berlin, Heidelberg N1 - UT: 000241649600007ScopusID: 33845210215 ER - TY - JOUR T1 - Quantitative analysis of pulmonary airway tree structures JF - COMPUTERS IN BIOLOGY AND MEDICINE Y1 - 2006 AB - A method for computationally efficient skeletonization of three-dimensional tubular structures is reported. The method is specifically targeting skeletonization of vascular and airway tree structures in medical images but it is general and applicable to many other skeletonization tasks. The developed approach builds on the following novel concepts and properties: fast curve-thinning algorithm to increase computational speed, endpoint re-checking to avoid generation of spurious side branches, depth-and-length sensitive pruning, and exact tree-branch partitioning allowing branch volume and surface measurements. The method was validated in computer and physical phantoms and in vivo CT scans of human lungs. The validation studies demonstrated sub-voxel accuracy of branch point positioning, insensitivity to changes of object orientation, and high reproducibility of derived quantitative indices of the tubular structures offering a significant improvement over previously reported methods (p ≪ 0.001). © 2005 Elsevier Ltd. All rights reserved. CY - 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, VL - 36 SN - 0010-4825 IS - 9 N1 - UT: 000239889900004ScopusID: 33746349840doi: 10.1016/j.compbiomed.2005.05.004 JO - COMPUT BIOL MED ER - TY - CHAP T1 - A 2-Subfield 3D Thinning Algorithm for Extracting Medial Curves T2 - Joint Hungarian-Austrian conference on image processing and pattern recognition. 5th conference of the Hungarian Association for Image Processing and Pattern Recognition (KÉPAF), 29th workshop of the Austrian Association for Pattern Reco Y1 - 2005 JF - Joint Hungarian-Austrian conference on image processing and pattern recognition. 5th conference of the Hungarian Association for Image Processing and Pattern Recognition (KÉPAF), 29th workshop of the Austrian Association for Pattern Reco PB - OCG CY - Vienna ER - TY - JOUR T1 - Matching and anatomical labeling of human airway tree JF - IEEE TRANSACTIONS ON MEDICAL IMAGING Y1 - 2005 AB - Matching of corresponding branchpoints between two human airway trees, as well as assigning anatomical names to the segments and branchpoints of the human airway tree, are of significant interest for clinical applications and physiological studies. In the past, these tasks were often performed manually due to the lack of automated algorithms that can tolerate false branches and anatomical variability typical for in vivo trees. In this paper, we present algorithms that perform both matching of branchpoints and anatomical labeling of in vivo trees without any human intervention and within a short computing time. No hand-pruning of false branches is required. The results from the automated methods show a high degree of accuracy when validated against reference data provided by human experts. 92.9% of the verifiable branchpoint matches found by the computer agree with experts' results. For anatomical labeling, 97.1 % of the automatically assigned segment labels were found to be correct. © 2005 IEEE. CY - 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 VL - 24 SN - 0278-0062 IS - 12 N1 - UT: 000233779000002ScopusID: 29144483584doi: 10.1109/TMI.2005.857653 JO - IEEE T MED IMAGING ER - TY - CHAP T1 - Techniques in 3D Assessment of Tracheal-Stenosis by the Mean of Spiral Computed Tomography (S-CT) and Their Applications T2 - Medical Imaging Systems Technology Y1 - 2005 AB - Endotracheal intubation is the most common cause of Laryngo-Tracheal Stenoses (LTS), followed by trauma and prior airway surgery.1–3 In rare cases LTS may have resulted also from inhalation injuries, gastro-esophageal reflux disease, neoplasia and autoimmune diseases like Wegeners granulomatosis or relapsing polychondritis.1,4 In pediatric patients vascular compression of the trachea is a common cause of tracheal indentations.5 Clinical management of these conditions requires information on localization, grade, length and dynamics of the stenosis. Exact LTS information is necessary, since stenoses with a length less than 1.0 cm can be treated by an endoscopic surgery.6,7 Besides Fiberoptic Endoscopy (FE), which represents the gold standard for airway evaluation, imaging modalities like conventional radiography, fluoroscopy, tracheal tomograms, Magnetic Resonance Imaging (MRI) and above all Spiral Computed Tomography (S-CT) are an essential part of the clinical work.1,8 S-CT and the recent introduction of multislice imaging allows volumetric data acquisition of the Laryngo–Tracheal Tract (LTT) during a short time span. Decreased motion artifacts and increased spatial resolution form the basis for high quality post processing.9,10 The improved performance of today's workstations permits the use of sophisticated post processing algorithms even on standard hardware like personal computers. Thus real time 3D display and virtual endoscopic views (virtual endoscopy) are just one mouse click away. Other algorithms compute the medial axis of tubular structures like airways or vessels in 3D, which can be used for the calculation of 3D cross sectional profiles for better demonstration of caliber changes.11 Thus display of S-CT axial source images is moving rapidly to 3D display. Moreover, established network connections within and between institutions allows telemedical cooperation. Web technologies offer an easy to use way for information exchange. The objective of this paper is to present an overview on 3D display and quantification of LTS as well as to provide information how these results can be presented and shared with the referring physicians on the hospitals computer network. This article is structured in seven parts; namely: S-CT data acquisition for LTS imaging; selected 3D image post processing algorithms; 3D display; Virtual endoscopy; Objective LTS degree and length estimation using LTT 3D — cross-sectional profiles; Intranet applications; and a conclusion is drawn in the final section. JF - Medical Imaging Systems Technology PB - World Scientific CY - Singapore N1 - doi: 10.1142/9789812701077_0003 ER - TY - JOUR T1 - Assessment of intrathoracic airway trees: Methods and in vivo validation JF - LECTURE NOTES IN COMPUTER SCIENCE Y1 - 2004 CY - 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 VL - 3117 SN - 0302-9743 N1 - 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 JO - LECT NOTES COMPUT SCI ER - TY - CONF T1 - Légutak vizsgálata 3D CT-képeken T2 - A Képfeldolgozók és Alakfelismerők Társaságának konferenciája - KÉPAF 2004 Y1 - 2004 JF - A Képfeldolgozók és Alakfelismerők Társaságának konferenciája - KÉPAF 2004 PB - Neumann János Számítógép-tudományi Társaság CY - Miskolc ER - TY - CHAP T1 - Liver segment approximation in CT data for surgical resection planning T2 - Medical Imaging 2004: Image Processing Y1 - 2004 AB - 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. JF - Medical Imaging 2004: Image Processing PB - SPIE CY - 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 N1 - ScopusID: 5644267870doi: 10.1117/12.535514 ER - TY - CONF T1 - Számítógépes képfeldolgozás oktatása a Szegedi Tudományegyetemen T2 - A Képfeldolgozók és Alakfelismerők Társaságának konferenciája - KÉPAF 2004 Y1 - 2004 AB -

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

JF - A Képfeldolgozók és Alakfelismerők Társaságának konferenciája - KÉPAF 2004 PB - Neumann János Számítógép-tudományi Társaság CY - Miskolc ER - TY - JOUR T1 - 3D cross section of the laryngotracheal tract. A new method for visualization and quantification of tracheal stenoses JF - RADIOLOGE Y1 - 2003 AB - 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. VL - 43 SN - 0033-832X IS - 12 N1 - UT: 000188058500005ScopusID: 9144241258doi: 10.1007/s00117-003-0990-8 JO - RADIOLOGE ER - TY - JOUR T1 - 3D cross section of the laryngotracheal tract. A new method for visualization and quantification of tracheal stenoses JF - RADIOLOGE Y1 - 2003 AB - 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. VL - 43 SN - 0033-832X IS - 12 N1 - UT: 000188058500005ScopusID: 9144241258doi: 10.1007/s00117-003-0990-8 JO - RADIOLOGE ER - TY - JOUR T1 - 3D-Querschnittsprofil des Laryngotrachealtrakts—Eine neue Methode zur Visualisierung und Quantifizierung von Trachealstenosen JF - Der Radiologe Y1 - 2003 A1 - Sorantin, Erich. A1 - Halmai, Csongor. A1 - Balázs Erdőhelyi A1 - Kálmán Palágyi A1 - László Gábor Nyúl A1 - Ollé, Krisztián. A1 - Geiger, B. A1 - Lindbichler, F. A1 - Friedrich, G. A1 - Kiesler, K. AB -

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.

 

PB - Springer-Verlag VL - 43 UR - http://dx.doi.org/10.1007/s00117-003-0990-8 ER - TY - JOUR T1 - Characterization of the interstitial lung diseases via density-based and texture-based analysis of computed tomography images of lung structure and function JF - ACADEMIC RADIOLOGY Y1 - 2003 CY - 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 VL - 10 SN - 1076-6332 IS - 10 N1 - UT: 000185944700005doi: 10.1016/S1076-6332(03)00330-1Workshop on Pulmonary Functional ImagingJUN, 2002 PHILADELPHIA, PENNSYLVANIA JO - ACAD RADIOL ER - TY - CHAP T1 - Quantitative analysis of intrathoracic airway trees: Methods and validation T2 - INFORMATION PROCESSING IN MEDICAL IMAGING, PROCEEDINGS Y1 - 2003 JF - INFORMATION PROCESSING IN MEDICAL IMAGING, PROCEEDINGS PB - Springer Verlag CY - 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 N1 - UT: 000185604900019ScopusID: 29144477913doi: 10.1007/978-3-540-45087-0_19 ER - TY - CHAP T1 - Quantitative analysis of three-dimensional tubular tree structures T2 - Medical Imaging 2003 Y1 - 2003 JF - Medical Imaging 2003 PB - SPIE - The International Society for Optical Engineering CY - Bellingham; Washington UR - http://spie.org/x648.html?product_id=459268 N1 - doi: 10.1117/12.481127 ER - TY - JOUR T1 - A 3-subiteration 3D thinning algorithm for extracting medial surfaces JF - PATTERN RECOGNITION LETTERS Y1 - 2002 CY - 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 VL - 23 SN - 0167-8655 IS - 6 N1 - UT: 000174470900005 JO - PATTERN RECOGN LETT ER - TY - CHAP T1 - Digitális képtároló és képtovábbító rendszer (PACS) a Szegedi Tudományegyetemen T2 - Képfeldolgozók és Alakfelismerők III. Konfereciája Y1 - 2002 JF - Képfeldolgozók és Alakfelismerők III. Konfereciája PB - NJSZT-KÉPAF CY - Szeged ER - TY - CHAP T1 - Digitális képtároló és képtovábbító rendszer (PACS) a Szegedi Tudományegyetemen T2 - Képfeldolgozók és Alakfelismerők III. Konfereciája Y1 - 2002 JF - Képfeldolgozók és Alakfelismerők III. Konfereciája PB - NJSZT-KÉPAF CY - Szeged ER - TY - BOOK T1 - Képfeldolgozók és Alakfelismerők III. Konfereciája Y1 - 2002 PB - NJSZT-KÉPAF CY - Szeged ER - TY - JOUR T1 - Medical Image Processing, Surgical Planning, Image-Guided Therapy and Robotic Applications: Recent Developments for Radiology JF - EUROPEAN RADIOLOGY Y1 - 2002 VL - 12 SN - 0938-7994 IS - 1 Suppl N1 - doi: 10.1007/s00330-002-0004-7 JO - EUR RADIOL ER - TY - JOUR T1 - Segmentation, skeletonization, and branchpoint matching - A fully automated quantitative evaluation of human intrathoratic airway trees JF - LECTURE NOTES IN COMPUTER SCIENCE Y1 - 2002 VL - 2489 SN - 0302-9743 JO - LECT NOTES COMPUT SCI ER - TY - CHAP T1 - A sequential 3D curve-thinning algorithm T2 - Képfeldolgozók és Alakfelismerők III. Konfereciája Y1 - 2002 JF - Képfeldolgozók és Alakfelismerők III. Konfereciája PB - NJSZT-KÉPAF CY - Szeged ER - TY - JOUR T1 - Spiral-CT-based assessment of tracheal stenoses using 3-D-skeletonization JF - IEEE TRANSACTIONS ON MEDICAL IMAGING Y1 - 2002 AB - 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. VL - 21 SN - 0278-0062 IS - 3 N1 - UT: 000175063900007ScopusID: 0036489382doi: 10.1109/42.996344 JO - IEEE T MED IMAGING ER - TY - CHAP T1 - Számítógépes képfeldolgozás oktatása a Szegedi Tudományegyetemen T2 - Informatika a felsőoktatásban Y1 - 2002 AB - A Szegedi Tudományegyetem tanterveiben 1993 óta szerepel aképfeldolgozás és alkalmazásainak oktatása. A tantárgy ez idő alatt sok változáson ment át. Jelenleg a Képfeldolgozás szakirányt választó hallgatók részesülnek ilyen képzésben. Az adott szakirányon belül különböző képfeldolgozási területek oktatása épül egymásra. Az oktatás során nem csak elméleti és gyakorlati ismereteket szerezhetnek a hallgatók, hanem néhány (főleg orvosi) alkalmazás is bemutatásra kerül. A kötelező jellegű tárgyak mellett speciálkollégiumok engednek bepillantást más kiegészítő területekre. A hallgatók a képfeldolgozás témával rendszeresen vesznek rész helyi és országos Tudományos DIákköri Konferenciákon. Az utóbbi időben sikerült a képfeldolgozásban érdekelt cégekkel felvenni a kapcsolatot, így évente több hallgató vehet részt ipari alkalmazások fejlesztésében. A doktori programon belül is meghirdetünk képfeldolgozáshoz kapcsolódó kutatási irányokat. Ezenkívül rendszeresen megrendezzük a nemzetközi Képfeldolgozó Nyári Iskolákat, ahol nemcsak Magyarországról, hanem a környező országokból is fogadunk hallgatókat és oktatókat. JF - Informatika a felsőoktatásban PB - Debreceni Egyetem CY - Debrecen N1 - A nyomtatott kötetben az absztrakt a 150. oldalon található.A teljes cikk a CD mellékleten, a D41.pdf fájlban, a megadott oldalszámokkal szerepel. ER - TY - CHAP T1 - Többdimenziós MRI képek feldolgozása T2 - Képfeldolgozók és Alakfelismerők III. Konfereciája Y1 - 2002 JF - Képfeldolgozók és Alakfelismerők III. Konfereciája PB - NJSZT-KÉPAF CY - Szeged ER - TY - JOUR T1 - Virtual dissection and automated polyp detection of the colon based on spiral CT - Techniques and preliminary experience on a cadaveric phantom JF - EUROPEAN SURGERY - ACTA CHIRURGICA AUSTRIACA Y1 - 2002 AB - Background: CT colonography was found to be sensitive andspecific for detection of colonic polyps and colorectal cancer (CRC). Depending on the software used, CT colonography requires a certain amount of operator interaction, which limits it's widespread usage. The goal of this papers is to present two novel automated techniques for displaying CT colonography: virtual dissection and automated colonic polyp detection. Methods: Virtual dissection refers to a technique where the entire colon is virtually stretched and flattened thus simulating the view on the pathologist's table. Colonic folds show a 'global outward bulging of the contour', whereas colonic polyps exhibit the inverse ('local inward bulging'). This feature is used to map areas of 'local inward bulging' with colours on 3D reconstructions. A cadaveric phantom with 13 artificially inserted polyps was used for validation of both techniques. Results: On virtual dissection all 13 inserted polyps could be identified. They appeared either as bumps or as local broadening of colonic folds. In addition, the automated colonic polyp detection algorithm was able to tag all polyps. Only 10 min of operator interaction were necessary for both techniques. Conclusions: Virtual dissection overcomes the shortcomings of CT colonography, and automated colonic polyp detection establishes a roadmap of the polyps. VL - 34 SN - 1682-8631 IS - 2 N1 - ScopusID: 0037000327doi: 10.1046/j.1563-2563.2002.02018.x JO - EUR SURG-ACA ER - TY - CHAP T1 - Virtual Dissection of the Colon T2 - Képfeldolgozók és Alakfelismerők III. Konfereciája Y1 - 2002 JF - Képfeldolgozók és Alakfelismerők III. Konfereciája PB - NJSZT-KÉPAF CY - Szeged ER - TY - CHAP T1 - Virtual Dissection of the Colon T2 - 3D Image Processing Y1 - 2002 JF - 3D Image Processing PB - Springer-Verlag CY - New York N1 - doi: 10.1007/978-3-642-59438-0_18 ER - TY - CHAP T1 - Virtual dissection of the colon: technique and first experiments with artificial and cadaveric phantoms T2 - Medical Imaging 2002: Visualization, Image-Guided Procedures, and Display Y1 - 2002 AB - 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. JF - Medical Imaging 2002: Visualization, Image-Guided Procedures, and Display PB - SPIE CY - Bellingham; Washington N1 - ScopusID: 0036061143doi: 10.1117/12.466982 ER - TY - JOUR T1 - A 3D parallel shrinking algorithm JF - Acta Cybernetica Y1 - 2001 A1 - Kálmán Palágyi AB -

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.

PB - University of Szeged CY - Szeged VL - 15 ER - TY - JOUR T1 - A 3D parallel shrinking algorithm JF - ACTA CYBERNETICA-SZEGED Y1 - 2001 VL - 15 SN - 0324-721X IS - 2 JO - ACTA CYBERN-SZEGED ER - TY - JOUR T1 - Affine matching of two sets of points in arbitrary dimensions. JF - ACTA CYBERNETICA-SZEGED Y1 - 2001 VL - 15 SN - 0324-721X IS - 1 N1 - ScopusID: 0034882398 JO - ACTA CYBERN-SZEGED ER - TY - JOUR T1 - A sequential 3D thinning algorithm and its medical applications JF - LECTURE NOTES IN COMPUTER SCIENCE Y1 - 2001 VL - 2082 SN - 0302-9743 UR - http://www.springerlink.com/content/py49qu0e434n0n16 N1 - doi: 10.1007/3-540-45729-1_42 JO - LECT NOTES COMPUT SCI ER - TY - CHAP T1 - Virtual Dissection of the Colon Based on Helical CT Data - Can It Be Done? T2 - Proceedings of the 2nd International Symposium on Image and Signal Processing and Analysis, ISPA 2001, Pula, Croatia Y1 - 2001 AB - Colorectal cancer is the third most commonly diagnosed cancer;and colonic polyps are known precursors of that particular cancer. Virtual dissection refers to a display technique for polyp detection based on helical CT data, where the colon is dissected and flattened as on the pathologist's table. The approach and image processing as well as the early experience are described in this paper. JF - Proceedings of the 2nd International Symposium on Image and Signal Processing and Analysis, ISPA 2001, Pula, Croatia PB - University of Zagreb CY - Zagreb N1 - doi: 10.1109/ISPA.2001.938632 ER - TY - JOUR T1 - A 3D 3-subiteration thinning algorithm for medial surfaces JF - LECTURE NOTES IN COMPUTER SCIENCE Y1 - 2000 CY - 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 VL - 1953 SN - 0302-9743 N1 - UT: 000171232100033doi: 10.1007/3-540-44438-6_33Discrete Geometry for Computer Imagery9th InternationalConference, DGCI 2000 Uppsala, Sweden, December 13-15, 2000 Proceedings Gunilla Borgefors, Ingela Nyström, Gabriella Sanniti di Baja (Eds.) ISBN: 3-540-41396-0 DOI: 10.1007/3-540-44438-6 JO - LECT NOTES COMPUT SCI ER - TY - CONF T1 - 3D vékonyítás és alkalmazása vérerek és légutak átmérőjének meghatározására T2 - A Képfeldolgozók és Alakfelismerők Társaságának konferenciája - KÉPAF 2000 Y1 - 2000 JF - A Képfeldolgozók és Alakfelismerők Társaságának konferenciája - KÉPAF 2000 PB - NJSZT CY - Noszvaj ER - TY - CHAP T1 - New advances for imaging of laryngotracheal stenosis by post processing of spiral-CT data T2 - Digital (R)Evolution in Radiology Y1 - 2000 JF - Digital (R)Evolution in Radiology PB - Springer-Verlag CY - Berlin; Heidelberg; New York; London; Paris; Tokyo ER - TY - JOUR T1 - Point-based registration assuming affine motion JF - LECTURE NOTES IN COMPUTER SCIENCE Y1 - 2000 VL - 1888 SN - 0302-9743 UR - http://www.inf.u-szeged.hu/ipcg/publications/papers/Tanacs_2000_AFPAC.pdf N1 - 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 JO - LECT NOTES COMPUT SCI ER - TY - JOUR T1 - 3D thinning and its applications to medical image processing JF - TASK QUARTERLY Y1 - 1999 VL - 3 SN - 1428-6394 IS - 4 JO - TASK Q ER - TY - JOUR T1 - Directional 3D thinning using 8 subiterations JF - LECTURE NOTES IN COMPUTER SCIENCE Y1 - 1999 CY - 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 VL - 1568 SN - 0302-9743 N1 - 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 JO - LECT NOTES COMPUT SCI ER - TY - JOUR T1 - A parallel 3D 12-subiteration thinning algorithm JF - GRAPHICAL MODELS AND IMAGE PROCESSING Y1 - 1999 CY - 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 VL - 61 SN - 1077-3169 UR - http://www.inf.u-szeged.hu/ipcg/publications/papers/PalagyiKuba_GMIP1999.pdf IS - 4 N1 - UT: 000082784900002 JO - GRAPH MODEL IM PROC ER - TY - CONF T1 - Target registration error of point-based methods assuming rigid-body and linear motions T2 - International Workshop on Biomedical Image Registration (WBIR) Y1 - 1999 JF - International Workshop on Biomedical Image Registration (WBIR) PB - Slovenian Society of Informatics CY - Ljubljana ER - TY - JOUR T1 - A 3D 6-subiteration thinning algorithm for extracting medial lines JF - PATTERN RECOGNITION LETTERS Y1 - 1998 CY - 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 VL - 19 SN - 0167-8655 IS - 7 N1 - UT: 000075051900009doi: 10.1016/S0167-8655(98)00031-2 JO - PATTERN RECOGN LETT ER - TY - JOUR T1 - A hybrid thinning algorithm for 3D medical images JF - CIT JOURNAL OF COMPUTING AND INFORMATION TECHNOLOGY Y1 - 1998 VL - 6 SN - 1330-1136 IS - 2 JO - J COMPUT INF TECHNOL (CIT) ER - TY - JOUR T1 - Medical image registration based on interactively identified anatomical landmark points JF - MACHINE GRAPHICS AND VISION Y1 - 1998 VL - 7 SN - 1230-0535 IS - 1/2 JO - MACH GRAPH VIS ER - TY - JOUR T1 - Medical image registration based on interactively identified anatomical landmark points JF - MACHINE GRAPHICS AND VISION Y1 - 1998 VL - 7 SN - 1230-0535 IS - 1/2 JO - MACH GRAPH VIS ER - TY - CONF T1 - Pont alapú regisztráció, képfúzió T2 - XXI. Neumann Kollokvium kiadványa Y1 - 1998 JF - XXI. Neumann Kollokvium kiadványa PB - Neumann János Számítógép-tudományi Társaság CY - Budapest ER - TY - CONF T1 - Pont alapú regisztráció, képfúzió T2 - XXI. Neumann Kollokvium kiadványa Y1 - 1998 JF - XXI. Neumann Kollokvium kiadványa PB - Neumann János Számítógép-tudományi Társaság CY - Budapest ER - TY - CONF T1 - Vékonyító algoritmusok 3D orvosi képekre T2 - XXI. Neumann Kollokvium kiadványa Y1 - 1998 JF - XXI. Neumann Kollokvium kiadványa PB - Neumann János Számítógép-tudományi Társaság CY - Budapest ER - TY - CONF T1 - An algorithm for thinning 3D medical images T2 - A Képfeldolgozók és Alakfelismerők Társaságának konferenciája - KÉPAF 1997 Y1 - 1997 JF - A Képfeldolgozók és Alakfelismerők Társaságának konferenciája - KÉPAF 1997 PB - Pannon Agrártudományi Egyetem Georgikon Mezőgazdaságtudományi Kar CY - Keszthely ER - TY - CONF T1 - Orvosi képek regisztrációja interaktívan kijelölt anatómiai pontok alapján T2 - Magyar Képfeldolgozók és Alakfelismerők Országos Konferenciája Y1 - 1997 JF - Magyar Képfeldolgozók és Alakfelismerők Országos Konferenciája PB - Pannon Agrártudományi Egyetem Georgikon Mezőgazdaságtudományi Kar CY - Keszthely ER - TY - CONF T1 - Orvosi képek regisztrációja interaktívan kijelölt anatómiai pontok alapján T2 - Magyar Képfeldolgozók és Alakfelismerők Országos Konferenciája Y1 - 1997 JF - Magyar Képfeldolgozók és Alakfelismerők Országos Konferenciája PB - Pannon Agrártudományi Egyetem Georgikon Mezőgazdaságtudományi Kar CY - Keszthely ER - TY - CHAP T1 - A parallel 12-subiteration 3D thinning algorithm to extract medial lines T2 - Computer analysis of images and patterns Y1 - 1997 JF - Computer analysis of images and patterns PB - Springer CY - Berlin ER - TY - CHAP T1 - A thinning algorithm to extract medial lines from 3D medical images T2 - INFORMATION PROCESSING IN MEDICAL IMAGING Y1 - 1997 JF - INFORMATION PROCESSING IN MEDICAL IMAGING PB - Springer Verlag CY - 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 N1 - UT: 000073946600035doi: 10.1007/3-540-63046-5_35 ER - TY - CONF T1 - DICOM Based PACS and Its Application in the Education T2 - International EuroPACS Meeting, EuroPACS '96 Y1 - 1996 AB -

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.

JF - International EuroPACS Meeting, EuroPACS '96 ER - TY - CONF T1 - DICOM Based PACS and Its Application in the Education T2 - International EuroPACS Meeting, EuroPACS '96 Y1 - 1996 AB -

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.

JF - International EuroPACS Meeting, EuroPACS '96 ER - TY - CONF T1 - Medical image registration based on fuzzy objects T2 - SUMMER WORKSHOP ON COMPUTATIONAL MODELLING, IMAGING AND VISUALIZATION IN BIOSCIENCES (COMBIO) Y1 - 1996 JF - SUMMER WORKSHOP ON COMPUTATIONAL MODELLING, IMAGING AND VISUALIZATION IN BIOSCIENCES (COMBIO) PB - KFKI CY - Budapest ER - TY - CONF T1 - Orvosi képek fuzzy objektumokon alapuló regisztrációja T2 - A számítástechnika orvosi és biológiai alkalmazásai: A XX. Neumann Kollokvium Kiadványa Y1 - 1996 JF - A számítástechnika orvosi és biológiai alkalmazásai: A XX. Neumann Kollokvium Kiadványa PB - NJSZT CY - Budapest ER - TY - CONF T1 - SZOTE-PACS: A Szent-Györgyi Albert Orvostudományi Egyetem képarchiváló és továbbító rendszerének szoftvere T2 - A számítástechnika orvosi és biológiai alkalmazásai: A XX. Neumann Kollokvium Kiadványa Y1 - 1996 AB -

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

JF - A számítástechnika orvosi és biológiai alkalmazásai: A XX. Neumann Kollokvium Kiadványa PB - NJSZT CY - Veszprém ER - TY - CONF T1 - SZOTE-PACS: A Szent-Györgyi Albert Orvostudományi Egyetem képarchiváló és továbbító rendszerének szoftvere T2 - A számítástechnika orvosi és biológiai alkalmazásai: A XX. Neumann Kollokvium Kiadványa Y1 - 1996 AB -

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

JF - A számítástechnika orvosi és biológiai alkalmazásai: A XX. Neumann Kollokvium Kiadványa PB - NJSZT CY - Veszprém ER - TY - CHAP T1 - A többdimenziós képfeldolgozás programjai és oktatásuk T2 - Informatika a felsőoktatásban '96 és Networkshop '96 Y1 - 1996 AB - Nowdays, the multidimensional (i.e. higher than 2-dimensional)image processing has been a strongly developing area. One of its most important application areas is the medicine, where numerous diagnostic imaging devices (e.g., CT, MR, SPECT etc.) are able to produce 3- or even higher dimensional images. We have studied the possibility of introduction of multidimensional image processing into the subjects of Image Processing at József Attila University. First, we considered the methods of generation of such images, then the different standards accepted in the medical applications. From the processing algorithms we have dealt with the 3D skeletons, binary operations, reconstruction and registration. These topics are discussed in the education of graduated and PhD students as well. JF - Informatika a felsőoktatásban '96 és Networkshop '96 PB - Debreceni Egyetem CY - Debrecen ER - TY - CHAP T1 - A többdimenziós képfeldolgozás programjai és oktatásuk T2 - Informatika a felsőoktatásban '96 és Networkshop '96 Y1 - 1996 AB - Nowdays, the multidimensional (i.e. higher than 2-dimensional)image processing has been a strongly developing area. One of its most important application areas is the medicine, where numerous diagnostic imaging devices (e.g., CT, MR, SPECT etc.) are able to produce 3- or even higher dimensional images. We have studied the possibility of introduction of multidimensional image processing into the subjects of Image Processing at József Attila University. First, we considered the methods of generation of such images, then the different standards accepted in the medical applications. From the processing algorithms we have dealt with the 3D skeletons, binary operations, reconstruction and registration. These topics are discussed in the education of graduated and PhD students as well. JF - Informatika a felsőoktatásban '96 és Networkshop '96 PB - Debreceni Egyetem CY - Debrecen ER - TY - CONF T1 - Presentation of 3D SPECT images T2 - 4th International Workshop Measurement Y1 - 1995 AB -

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.

JF - 4th International Workshop Measurement CY - Smolenice, Slovakia ER - TY - CONF T1 - Presentation of 3D SPECT images T2 - 4th International Workshop Measurement Y1 - 1995 AB -

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.

JF - 4th International Workshop Measurement CY - Smolenice, Slovakia ER - TY - CHAP T1 - Signature verification using neuron nets T2 - Proceedings of the 9th Scandinavian Conference on Image Analysis, SCIA '95 Y1 - 1995 JF - Proceedings of the 9th Scandinavian Conference on Image Analysis, SCIA '95 PB - World Sci. Publishing, River Edge, NJ CY - River Edge ER - TY - CHAP T1 - Szabványos képformák orvosi képek tárolására T2 - MEDICOMP '94, Számítástechnikai és kibernetikai módszerek az orvostudományban és a biológiában Y1 - 1994 AB - Az orvosi képalkotó berendezések fejlődésével elengedhetetlennévált a szabványos orvosi képformátumok kialakítása. A különféle eszközökön készült felvételek feldolgozását, összehasonlítását és hálózatban való továbbítását megnehezítette, hogy a gyártók a képeket csak egyéni, többé-kevésbé publikált formátumban tárolták. Ezen a helyzeten kívánnak változtatni különféle szervezetek olyan szabványok bevezetésével, amelyek speciálisan orvosi képek esetében lehetnek hasznosak. A szabványosítási törekvések eredményeként mára három nagy irányzat alakult ki: ACR-NEMA, DICOM és Interfile. Előadásunkban vázoljuk az orvosi képek tárolási formátumainál érvényesülő specifikus szempontokat, röviden ismertetjük az említett szabványokat és bemutatjuk az általunk eddig készített, a különféle formátumok közötti konverziót biztosító programokat. JF - MEDICOMP '94, Számítástechnikai és kibernetikai módszerek az orvostudományban és a biológiában PB - SZOTE CY - Szeged ER - TY - CHAP T1 - Szabványos képformák orvosi képek tárolására T2 - MEDICOMP '94, Számítástechnikai és kibernetikai módszerek az orvostudományban és a biológiában Y1 - 1994 AB - Az orvosi képalkotó berendezések fejlődésével elengedhetetlennévált a szabványos orvosi képformátumok kialakítása. A különféle eszközökön készült felvételek feldolgozását, összehasonlítását és hálózatban való továbbítását megnehezítette, hogy a gyártók a képeket csak egyéni, többé-kevésbé publikált formátumban tárolták. Ezen a helyzeten kívánnak változtatni különféle szervezetek olyan szabványok bevezetésével, amelyek speciálisan orvosi képek esetében lehetnek hasznosak. A szabványosítási törekvések eredményeként mára három nagy irányzat alakult ki: ACR-NEMA, DICOM és Interfile. Előadásunkban vázoljuk az orvosi képek tárolási formátumainál érvényesülő specifikus szempontokat, röviden ismertetjük az említett szabványokat és bemutatjuk az általunk eddig készített, a különféle formátumok közötti konverziót biztosító programokat. JF - MEDICOMP '94, Számítástechnikai és kibernetikai módszerek az orvostudományban és a biológiában PB - SZOTE CY - Szeged ER - TY - JOUR T1 - Lokális párhuzamos eljárás bináris képek zajszűrésére JF - ALKALMAZOTT MATEMATIKAI LAPOK Y1 - 1993 VL - 17 SN - 0133-3399 JO - ALKALMAZOTT MATEMATIKAI LAPOK ER - TY - CHAP T1 - Image processing on cellprocessors T2 - Proceedings of Conference on Intelligent Systems, CIS ’91 Y1 - 1991 JF - Proceedings of Conference on Intelligent Systems, CIS ’91 PB - NJSZT CY - Budapest ER - TY - CHAP T1 - Neural Network Implementation on Cellular Processor T2 - Proceedings of Conference on Intelligent Systems, CIS ’91 Y1 - 1991 JF - Proceedings of Conference on Intelligent Systems, CIS ’91 PB - NJSZT CY - Budapest ER - TY - CHAP T1 - Cellular program development for the M1 processor T2 - Proceedings of the 5th International Workshop Parallel Processing by Cellular Automata and Arrays, Parcella '90 Y1 - 1990 JF - Proceedings of the 5th International Workshop Parallel Processing by Cellular Automata and Arrays, Parcella '90 PB - Akademie Verlag CY - Berlin ER - TY - JOUR T1 - SOLUTION OF DENSE SYSTEMS OF LINEAR-EQUATIONS USING CELLULAR PROCESSORS JF - LECTURE NOTES IN COMPUTER SCIENCE Y1 - 1989 CY - 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, VL - 342 SN - 0302-9743 N1 - UT: A1989AB14600024doi: 10.1007/3-540-50647-0_123Gottfried Wolf, Tamáas Legendi and Udo Schendel (eds.):Parcella'88 Fourth International Workshop on Parallel Processing by Cellular Automata and Arrays Berlin, GDR, October 17-21, 1988, Proceedings Berlin ; Heidelberg : Springer, 1989 ISBN: 3-540-50647-0 JO - LECT NOTES COMPUT SCI ER - TY - CHAP T1 - Cellular algorithms for matrix multiplication T2 - Proceedings of the 3rd International Workshop Parallel Processing by Cellular Automata and Arrays, Parcella'86 Y1 - 1987 JF - Proceedings of the 3rd International Workshop Parallel Processing by Cellular Automata and Arrays, Parcella'86 PB - North-Holland Publishing Company CY - Amsterdam ER -