01192nas a2200169 4500008003900000245007100039210006900110260002000179300001100199520068500210100001600895700001300911700001400924700001600938700001400954856005400968 2018 d00aFeature extraction and classification for pupillary images of rats0 aFeature extraction and classification for pupillary images of ra aSzeged, Hungary a88--913 a
The investigation of the pupillary light reflex (PLR) is a well-known method to provide information about the functionality of the autonomic nervous system. Pupillometry, a non-invasive technique, was applied in our lab to study the schizophrenia-related PLR alterations in a new selectively bred rat substrain, named WISKET. The pupil responses to light impulses were recorded with an infrared camera; the videos were automatically processed and features were extracted. Besides the classical statistical analysis (ANOVA), feature selection and classification were applied to reveal the significant differences in the PLR parameters between the control and WISKET animals.
1 aKalrmár, G1 aBüki, A1 aKekesi, G1 aHorváth, G1 aNyúl, LG uhttp://www.inf.u-szeged.hu/~cscs/pdf/cscs2018.pdf02228nas a2200193 4500008004100000245011600041210006900157260002900226300001000255490000800265520152700273100001301800700001501813700001401828700001501842700001401857700001601871856014701887 2018 eng d00aImpaired pupillary control in “schizophrenia-like” WISKET rats. Autonomic Neuroscience: Basic and Clinical.0 aImpaired pupillary control in schizophrenialike WISKET rats Auto bElsevierc2018 September a34-420 v2133 aPatients with schizophrenia show impairments in autonomic regulation, including pupillomotor control. The aim of this study was to explore the changes of pupillary light reflex in a new substrain (WISKET) with several schizophrenia-like alterations.
Male WISKET rats housed individually (for four weeks) and treated with ketamine (for 3 × 5 days) after weaning and naive group-housed Wistar rats (controls) were involved in the study. The pupillary light reflex was studied in two series after sedation (diazepam) or anesthesia (chloral hydrate). Video recordings were evaluated with custom made video analyzer software.
Several significant changes were observed between the two groups: the initial and minimum pupil diameters were greater, the degree of the constriction was lower, and the flatness of the curve and the total duration of constriction were shorter in the sedated WISKET rats. No other pupillary parameters (latency, amplitude and redilation) showed significant alterations.
Chloral hydrate anesthesia prolonged the constriction and redilation processes compared to the sedated animals, and diminished the differences between the groups.
In conclusion, WISKET rats showed disturbances in the pupillary light reflex, suggesting a general shift of autonomic balance towards a sympathetic predominance. The results provide further evidence to support the validity of WISKET rats as a complex, chronic animal model of schizophrenia.
1 aBüki, A1 aKalmár, G1 aKekesi, G1 aBenedek, G1 aNyúl, LG1 aHorváth, G uhttps://www.inf.u-szeged.hu/publication/impaired-pupillary-control-in-schizophrenia-like-wisket-rats-autonomic-neuroscience-basic-and-clinical01406nas a2200181 4500008004100000245007000041210006800111260006600179300001200245490000700257520081800264100001501082700001301097700001401110700001601124700001401140856007001154 2017 eng d00aImage processing-based automatic pupillometry on infrared videos.0 aImage processingbased automatic pupillometry on infrared videos aSzegedbSzegedi Tudományegyetem / University of Szegedc2017 a599-6130 v233 aPupillometry is a non-invasive technique that can be used to objectively characterize pathophysiological changes involving the pupillary reflex. It is essentially the measurement of the pupil diameter over time. Here, specially designed computer algorithms provide fast, reliable and reproducible solutions for the analysis. These methods use a priori information about the shape and color of the pupil. Our study focuses on measuring the diameter and dynamics of the pupils of rats with schizophrenia using videos recorded with a modified digital camera under infrared (IR) illumination. We developed a novel, robust method that measures the size of a pupil even under poor circumstances (noise, blur, reflections and occlusions). We compare our results with measurements obtained using manual annotation.
1 aKalmár, G1 aBüki, A1 aKekesi, G1 aHorváth, G1 aNyúl, LG uhttp://cyber.bibl.u-szeged.hu/index.php/actcybern/article/view/2900651nas a2200169 4500008004100000022001400041245009800055210006900153260001900222300001200241490000700253100002000260700002000280700002000300700002300320856013800343 2015 eng d a1012-244300aBinary image reconstruction from a small number of projections and the morphological skeleton0 aBinary image reconstruction from a small number of projections a bSpringerc2015 a195-2160 v751 aHantos, Norbert1 aIván, Szabolcs1 aBalázs, Péter1 aPalágyi, Kálmán uhttps://www.inf.u-szeged.hu/publication/binary-image-reconstruction-from-a-small-number-of-projections-and-the-morphological-skeleton00706nas a2200217 4500008004100000245005900041210005900100260003400159300000900193100001900202700002000221700002000241700001900261700001700280700001700297700001900314700002200333700002000355700001400375856009900389 2015 eng d00aCollaborative Mobile 3D Reconstruction of Urban Scenes0 aCollaborative Mobile 3D Reconstruction of Urban Scenes aSingaporebSpringercNov 2014 a1-161 aTanacs, Attila1 aMajdik, András1 aHajder, Levente1 aMolnar, Jozsef1 aSanta, Zsolt1 aKato, Zoltan1 aChen, Chu-Song1 aKankanhall, Mohan1 aLai, Shang-Hong1 aHwee, Joo uhttps://www.inf.u-szeged.hu/publication/collaborative-mobile-3d-reconstruction-of-urban-scenes01429nas a2200157 4500008004100000245008400041210006900125260002900194300001200223490000600235520084300241100002701084700002001111700001601131856012401147 2015 eng d00aDiscrete tomographic reconstruction via adaptive weighting of gradient descents0 aDiscrete tomographic reconstruction via adaptive weighting of gr bTaylor&FranciscFeb 2014 a101-1090 v33 aDiscrete tomography (DT) is a set of tools for reconstructing the inner structure of objects consisting of only few different homogeneous materials. We propose a new method for multivalued DT, which performs the reconstruction as an energy minimisation task. For this algorithm, we define an energy function that can mathematically formulate the reconstruction task, and design a novel optimisation process for approximating the minima of this energy function. We validate the algorithm by comparing its performance with other cutting-edge reconstruction algorithms from the literature. We show that our method can compete with the currently used reconstruction techniques and under certain circumstances (e.g. with a low number of projections, or when the projection data are affected by random noise) it can even outperform them.
1 aVarga, László Gábor1 aBalázs, Péter1 aNagy, Antal uhttps://www.inf.u-szeged.hu/publication/discrete-tomographic-reconstruction-via-adaptive-weighting-of-gradient-descents00732nas a2200193 4500008004100000020002200041245008600063210006900149260004000218300001000258490000900268100002300277700002000300700001900320700002300339700002500362700002500387856012600412 2015 eng d a978-3-319-26144-700aEquivalent Sequential and Parallel Subiteration-Based Surface-Thinning Algorithms0 aEquivalent Sequential and Parallel SubiterationBased SurfaceThin aCalcutta, IndiabSpringercNov 2015 a31-450 v94481 aPalágyi, Kálmán1 aNémeth, Gábor1 aKardos, Péter1 aBarneva, Reneta, P1 aBhattacharya, B., B.1 aBrimkov, Valentin, E uhttps://www.inf.u-szeged.hu/publication/equivalent-sequential-and-parallel-subiteration-based-surface-thinning-algorithms02019nas a2200169 4500008004100000245006500041210006500106260002300171300001400194490000700208520145100215100001901666700002101685700002101706700001701727856010501744 2015 eng d00aEstimation of linear deformations of 2D and 3D fuzzy objects0 aEstimation of linear deformations of 2D and 3D fuzzy objects bElseviercApr 2015 a1387-13990 v483 aRegistration is a fundamental task in image processing, it is used to determine geometric correspondences between images taken at different times and/or from different viewpoints. Here we propose a general framework in n-dimensions to solve binary shape/object matching problems without the need of establishing additional point or other type of correspondences. The approach is based on generating and solving polynomial systems of equations. We also propose an extension which, provided that a suitable segmentation method can produce a fuzzy border representation, further increases the registration precision. Via numerous synthetic and real test we examine the different solution techniques of the polynomial systems of equations. We take into account a direct analytical, an iterative least-squares, and a combined method. Iterative and combined approaches produce the most precise results. Comparison is made against competing methods for rigid-body problems. Our method is orders of magnitude faster and is able to recover alignment regardless of the magnitude of the deformation compared to the narrow capture range of others. The applicability of the proposed methods is demonstrated on real X-ray images of hip replacement implants and 3D CT volumes of the pelvic area. Since the images must be parsed through only once, our approach is especially suitable for solving registration problems of large images.
1 aTanacs, Attila1 aLindbald, Joakim1 aSladoje, Nataša1 aKato, Zoltan uhttps://www.inf.u-szeged.hu/publication/estimation-of-linear-deformations-of-2d-and-3d-fuzzy-objects00536nas a2200133 4500008004100000245007000041210006900111260004800180300001200228490000700240100002000247700002300267856011200290 2015 eng d00aFast recognition of natural feature identifiers by a mobile phone0 aFast recognition of natural feature identifiers by a mobile phon aSzeged, HungarybUniversity of Szegedc2015 a101-1160 v221 aKatona, Melinda1 aNyúl, László, G uhttps://www.inf.u-szeged.hu/publication/fast-recognition-of-natural-feature-identifiers-by-a-mobile-phone-000771nas a2200181 4500008003900000245010000039210007500139260008600214300001100300100002700311700002000338700001900358700001900377700002000396700001800416700002300434856013200457 2015 d00aIdőskori makula degeneráció kvantitatív jellemzése SD-OCT képek automatikus elemzésével0 aIdőskori makula degeneráció kvantitatív jellemzése SDOCT képek a aVeszprém, HungarybNeumann János Számítógép-tudományi TársaságcNov 2015 a43-48.1 aVarga, László Gábor1 aKatona, Melinda1 aGrósz, Tamás1 aDombi, József1 aKovács, Attila1 aDégi, Rózsa1 aNyúl, László, G uhttps://www.inf.u-szeged.hu/publication/idoskori-makula-degeneracio-kvantitativ-jellemzese-sd-oct-kepek-automatikus-elemzesevel00544nas a2200133 4500008004100000245007600041210006900117260004800186300001000234490000700244100002000251700002300271856011600294 2015 eng d00aImproved QR Code Localization Using Boosted Cascade of Weak Classifiers0 aImproved QR Code Localization Using Boosted Cascade of Weak Clas aSzeged, HungarybUniversity of Szegedc2015 a21-330 v221 aBodnár, Péter1 aNyúl, László, G uhttps://www.inf.u-szeged.hu/publication/improved-qr-code-localization-using-boosted-cascade-of-weak-classifiers00569nas a2200157 4500008004100000245006200041210006200103260004400165300001200209100002000221700002800241700001200269700001600281700001200297856010200309 2015 eng d00aLocalization of Visual Codes using Fuzzy Inference System0 aLocalization of Visual Codes using Fuzzy Inference System aBerlin, GermanybSciTePresscMarch 2015 a345-3521 aBodnár, Péter1 aNyúl, László, Gábor1 aBraz, J1 aBattiato, S1 aImai, F uhttps://www.inf.u-szeged.hu/publication/localization-of-visual-codes-using-fuzzy-inference-system01337nas a2200169 4500008004100000245006900041210006700110260001300177300001200190490000800202520075900210100002000969700002100989700002501010700002301035856010901058 2015 eng d00aA Measure of Directional Convexity Inspired by Binary Tomography0 aMeasure of Directional Convexity Inspired by Binary Tomography cOct 2015 a151-1670 v1413 aInspired by binary tomography, we present a measure of directional convexity of binary images combining various properties of the configuration of 0s and 1s in the binary image. The measure can be supported by proper theory, is easy to compute, and as shown in our experiments, behaves intuitively. The measure can be useful in numerous applications of digital image processing and pattern recognition, and especially in binary tomography. We show in detail an application of this latter one, by providing a novel reconstruction algorithm for almost hv-convex binary images. We also present experimental results and mention some of the possible generalizations of the measure.
1 aBalázs, Péter1 aOzsvár, Zoltán1 aTasi, Tamás Sámuel1 aNyúl, László, G uhttps://www.inf.u-szeged.hu/publication/a-measure-of-directional-convexity-inspired-by-binary-tomography03356nas a2200277 4500008004100000245010600041210006900147260002400216300001400240490000700254520240400261100002202665700001902687700001902706700001802725700001902743700001902762700002202781700002002803700002502823700002302848700002002871700002002891700002102911856014602932 2015 eng d00aPeriosteal microcirculatory reactions in a zoledronate-induced osteonecrosis model of the jaw in rats0 aPeriosteal microcirculatory reactions in a zoledronateinduced os bSpringercJuly 2015 a1279-12880 v193 aObjectives
Nitrogen-containing bisphosphonates induce osteonecrosis mostly in the jaw and less frequently in other bones. Because of the crucial role of periosteal perfusion in bone repair, we investigated zoledronate-induced microcirculatory reactions in the mandibular periosteum in comparison with those in the tibia in a clinically relevant model of bisphosphonate-induced medication-related osteonecrosis of the jaw (MRONJ).
Materials and methods
Sprague–Dawley rats were treated with zoledronate (ZOL; 80 i.v. μg/kg/week over 8 weeks) or saline vehicle. The first two right mandibular molar teeth were extracted after 3 weeks. Various systemic and local (periosteal) microcirculatory inflammatory parameters were examined by intravital videomicroscopy after 9 weeks.
Results
Gingival healing disorders (∼100 %) and MRONJ developed in 70 % of ZOL-treated cases but not after saline (shown by micro-CT). ZOL induced significantly higher degrees of periosteal leukocyte rolling and adhesion in the mandibular postcapillary venules (at both extraction and intact sites) than at the tibia. Leukocyte NADPH-oxidase activity was reduced; leukocyte CD11b and plasma TNF-alpha levels were unchanged.
Conclusion
Chronic ZOL treatment causes a distinct microcirculatory inflammatory reaction in the mandibular periosteum but not in the tibia. The local reaction in the absence of augmented systemic leukocyte inflammatory activity suggests that topically different, endothelium-specific changes may play a critical role in the pathogenesis of MRONJ.
Clinical relevance
This model permits for the first time to explore the microvascular processes in the mandibular periosteum after chronic ZOL treatment. This approach may contribute to a better understanding of the pathomechanism and the development of strategies to counteract bisphosphonate-induced side effects.
1 aJanovszky, Ágnes1 aSzabó, Andrea1 aVarga, Renáta1 aGarab, Dénes1 aBoros, Mihály1 aMester, Csilla1 aBeretka, Nikolett1 aZombori, Tamás1 aWiesmann, Hans-Peter1 aBernhardt, Ricardo1 aOcsovszki, Imre1 aBalázs, Péter1 aPiffkó, József uhttps://www.inf.u-szeged.hu/publication/periosteal-microcirculatory-reactions-in-a-zoledronate-induced-osteonecrosis-model-of-the-jaw-in-rats00520nas a2200121 4500008004100000245007500041210007500116260004000191300001200231100002000243700002800263856010700291 2015 hun d00aQR kód lokalizáció kaszkádolt gyenge osztályozók használatával0 aQR kód lokalizáció kaszkádolt gyenge osztályozók használatával aKecskemét, MagyarországcJan 2015 a712-7211 aBodnár, Péter1 aNyúl, László, Gábor uhttps://www.inf.u-szeged.hu/publication/qr-kod-lokalizacio-kaszkadolt-gyenge-osztalyozok-hasznalataval01343nas a2200157 4500008004100000022001500041245006600056210006600122260002000188300000600208490000700214520082200221100001901043700001701062856010601079 2015 eng d a0162-8828 00aRealigning 2D and 3D Object Fragments without Correspondences0 aRealigning 2D and 3D Object Fragments without Correspondences bIEEEcJune 2015 a10 vpp3 aThis paper addresses the problem of simultaneous estimation of different linear deformations, resulting in a global non-linear transformation, between an original object and its broken fragments. A general framework is proposed without using correspondences, where the solution of a polynomial system of equations directly provides the parameters of the alignment. We quantitatively evaluate the proposed algorithm on a large synthetic dataset containing 2D and 3D images, where linear (rigid-body and affine) transformations are considered. We also conduct an exhaustive analysis of the robustness against segmentation errors and the numerical stability of the proposed method. Moreover, we present experiments on 2D real images as well as on volumetric medical images.
1 aDomokos, Csaba1 aKato, Zoltan uhttps://www.inf.u-szeged.hu/publication/realigning-2d-and-3d-object-fragments-without-correspondences00695nas a2200181 4500008003900000020002200039245007600061210006900137260006400206300001200270100002100282700002100303700001600324700001700340700001800357700002200375856011600397 2015 d a978-1-138-02926-200aSemi-automatic tumor contouring method using PET and MRI medical images0 aSemiautomatic tumor contouring method using PET and MRI medical aTenerife, SpainbCRC Press - Taylor&Francis GroupcOct 2015 a209-2141 aUrbán, Szabolcs1 aRuskó, László1 aNagy, Antal1 aManuel, Joao1 aTavares, R, S1 aJorge, R, M Natal uhttps://www.inf.u-szeged.hu/publication/semi-automatic-tumor-contouring-method-using-pet-and-mri-medical-images01065nas a2200133 4500008004100000245009600041210006900137260004000206300001200246520049700258100001900755700002300774856013400797 2015 eng d00aTopology Preserving Reductions and Additions on the Triangular, Square, and Hexagonal Grids0 aTopology Preserving Reductions and Additions on the Triangular S aKecskemét, MagyarországcJan 2015 a588-6003 aThe Euclidean plane can be partitioned into three kinds of
regular polygons, which results in triangular, square and hexagonal grids.
While the topology of the square grid is well-established, less emphasis
is put on the remaining two regular sampling schemes. In this paper we
summarize the results of our research that aimed to give some general
characterizations of simple pixels and sufficient conditions for topology-
preserving operators in the mentioned grids.
1 aKardos, Péter1 aPalágyi, Kálmán uhttps://www.inf.u-szeged.hu/publication/topology-preserving-reductions-and-additions-on-the-triangular-square-and-hexagonal-grids01481nas a2200205 4500008004500000020002200045245009700067210006900164260003600233300001200269520073500281100002301016700002001039700001901059700001601078700001401094700001401108700001601122856013701138 2015 engldsh a978-1-4673-8032-400aTopology-Preserving Equivalent Parallel and Sequential 4-Subiteration 2D Thinning Algorithms0 aTopologyPreserving Equivalent Parallel and Sequential 4Subiterat aZagreb, CroatiabIEEEc2015 Sep a304-3093 aThinning is a frequently applied technique for extracting centerlines from 2D binary objects. Parallel thinning algorithms can remove a set of object points simultaneously, while sequential algorithms traverse the boundary of objects, and consider the actually visited single point for possible removal. Two thinning algorithms are called equivalent if they produce the same result for each input picture. This paper presents the very first pair of equivalent 2D sequential and parallel subiteration-based thinning algorithms. These algorithms can be implemented directly on a conventional sequential computer or on a parallel computing device. Both of them preserve topology for (8, 4) pictures sampled on the square grid.
1 aPalágyi, Kálmán1 aNémeth, Gábor1 aKardos, Péter1 aLoncaric, S1 aLerski, D1 aEskola, H1 aBregovic, R uhttps://www.inf.u-szeged.hu/publication/topology-preserving-equivalent-parallel-and-sequential-4-subiteration-2d-thinning-algorithms00728nas a2200205 4500008003900000020002200039245005600061210005600117260008600173300001000259100001900269700002300288700002300311700002000334700001800354700002100372700001900393700002000412856009000432 2015 d a978-615-5036-10-100aÚjszülöttek monitorozása képfolyam elemzéssel0 aÚjszülöttek monitorozása képfolyam elemzéssel aVeszprém, HungarybNeumann János Számítógép-tudományi TársaságcNov 2015 a32-371 aNemeth, Jozsef1 aBánhalmi, András1 aNyúl, László, G1 aFidrich, Márta1 aSzkiva, Zsolt1 aFranczia, Péter1 aBerezki, Csaba1 aBilicki, Vilmos uhttps://www.inf.u-szeged.hu/publication/ujszulottek-monitorozasa-kepfolyam-elemzessel01177nas a2200145 4500008004100000245006100041210006000102260004000162300001200202520066300214100002000877700001900897700002300916856009200939 2015 hun d00aVékonyítás a végpont-megőrzés felülvizsgálatáva0 aVékonyítás a végpontmegőrzés felülvizsgálatáva aKecskemét, MagyarországcJan 2015 a578-5873 aA vékonyítás mint iteratív objektum redukció gyakran alkalmazott
vázkijelölo módszer. A legtöbb létezo vékonyító algoritmus végpontok - vagyis releváns geometriai információt hordozó objektumpontok - megorzésével biztosítja azt, hogy ne törlodjenek az objektumok alakját reprezentáló fontos részletek. Ennek a megközelítésnek hátránya, hogy számos nemkívánatos vázágat eredményezhet. Ebben a cikkben egy olyan módszert mutatunk be, amellyel jelentosen csökkentheto a hamis vázágak száma. Ráadásul az itt bemutatott megközelítés tetszoleges végpont-megorzo 2D vékonyító algoritmusban alkalmazható.
1 aNémeth, Gábor1 aKardos, Péter1 aPalágyi, Kálmán uhttps://www.inf.u-szeged.hu/publication/vekonyitas-a-vegpont-megorzes-felulvizsgalatava00621nas a2200145 4500008004100000245009400041210007900135260004000214300001200254100002000266700002800286700001900314700002000333856012200353 2015 hun d00aVizuális kódok lokalizációja mély egyenirányított neurális háló használatával0 aVizuális kódok lokalizációja mély egyenirányított neurális háló aKecskemét, MagyarországcJan 2015 a546-5611 aBodnár, Péter1 aNyúl, László, Gábor1 aGrósz, Tamás1 aTóth, László uhttps://www.inf.u-szeged.hu/publication/vizualis-kodok-lokalizacioja-mely-egyeniranyitott-neuralis-halo-hasznalataval00539nas a2200121 4500008004100000245008400041210007700125260004000202300001200242100002000254700002800274856011500302 2015 hun d00aVonalkódok és természetes vizuális azonosítók felismerése valós időben0 aVonalkódok és természetes vizuális azonosítók felismerése valós aKecskemét, MagyarországcJan 2015 a562-5771 aKatona, Melinda1 aNyúl, László, Gábor uhttps://www.inf.u-szeged.hu/publication/vonalkodok-es-termeszetes-vizualis-azonositok-felismerese-valos-idoben00720nas a2200205 4500008004100000245007200041210006900113260003200182300000800214100001900222700002100241700002500262700001700287700002700304700001400331700002100345700001600366700002000382856011200402 2014 eng d00a3D Reconstruction of Planar Patches Seen by Omnidirectional Cameras0 a3D Reconstruction of Planar Patches Seen by Omnidirectional Came aWollongong, AustraliabIEEE a1-81 aMolnar, Jozsef1 aFrohlich, Robert1 aDmitrij, Chetverikov1 aKato, Zoltan1 aBouzerdoum, Abdesselam1 aWang, Lei1 aOgunbona, Philip1 aLi, Wanqing1 aPhung, Son, Lam uhttps://www.inf.u-szeged.hu/publication/3d-reconstruction-of-planar-patches-seen-by-omnidirectional-cameras00615nas a2200169 4500008004100000245006700041210006600108260004600174300000900220100001900229700001500248700001700263700001600280700002400296700001900320856010600339 2014 eng d00a3D Reconstruction of Planar Surface Patches: A Direct Solution0 a3D Reconstruction of Planar Surface Patches A Direct Solution aSingapore, SzingapúrbSpringercNov 2014 a1-8.1 aMolnar, Jozsef1 aHuang, Rui1 aKato, Zoltan1 aZhang, Jian1 aBennamoun, Mohammed1 aPorikli, Fatih uhttps://www.inf.u-szeged.hu/publication/3d-reconstruction-of-planar-surface-patches-a-direct-solution00481nas a2200145 4500008003900000020002200039245004000061210004000101260004400141300001400185100001700199700001700216700002200233856008000255 2014 d a978-4-9906441-0-900aAffine Alignment of Occluded Shapes0 aAffine Alignment of Occluded Shapes aStockholm, SvédországbIEEEcAug 2014 a2155-21601 aSanta, Zsolt1 aKato, Zoltan1 aFelsberg, Michael uhttps://www.inf.u-szeged.hu/publication/affine-alignment-of-occluded-shapes02441nas a2200253 4500008004100000020001400041245013800055210006900193260000900262300001400271490000700285520152000292100002001812700002301832700002101855700002001876700001701896700002101913700001401934700002001948700002001968700002201988856017702010 2014 eng d a0066-480400aApplication of DNA chip scanning technology for the automatic detection of Chlamydia trachomatis and Chlamydia pneumoniae inclusions.0 aApplication of DNA chip scanning technology for the automatic de c2014 a405 - 4130 v583 aChlamydiae are obligate intracellular bacteria that propagate in the inclusion, a specific niche inside the host cell. The standard method for counting chlamydiae is the immunofluorescent staining and manual counting of chlamydial inclusions. High or medium throughput estimation of the reduction in chlamydia inclusions should be the basis of testing antichlamydial compounds and other drugs that positively or negatively influence chlamydial growth, yet low-throughput manual counting is the common approach. To overcome the time-consuming and subjective manual counting we developed an automatic inclusion counting system based on a commercially available DNA chip scanner. Fluorescently labeled inclusions are detected by the scanner, and the image is processed by ChlamyCount, a custom plugin of the ImageJ software environment. ChlamyCount was able to measure the inclusion counts over a one log dynamic range with high correlation to the theoretical counts. ChlamyCount was capable of accurately determining the minimum inhibitory concentration of the novel antimicrobial compound PCC00213 and the already known antichlamydial antibiotics moxifloxacin and tetracycline. ChlamyCount was also able to measure the chlamydial growth altering effect of drugs that influence host-bacterium interaction such as interferon-gamma, DEAE-dextran and cycloheximide. ChlamyCount is an easily adaptable system for testing antichlamydial antimicrobials and other compounds that influence Chlamydia-host interactions.
1 aBogdanov, Anita1 aEndrész, Valéria1 aUrbán, Szabolcs1 aLantos, Ildikó1 aDeák, Judit1 aBurián, Katalin1 aÖnder, K1 aAyaydin, Ferhan1 aBalázs, Péter1 aVirók, Dezső, P uhttps://www.inf.u-szeged.hu/publication/application-of-dna-chip-scanning-technology-for-the-automatic-detection-of-chlamydia-trachomatis-and-chlamydia-pneumoniae-inclusions00462nas a2200121 4500008004100000245006700041210006700108300001000175490000700185100002000192700002800212856010000240 2014 eng d00aAutomatikus azonosítás és hitelesítés vizuális kódokkal0 aAutomatikus azonosítás és hitelesítés vizuális kódokkal a40-470 v691 aKatona, Melinda1 aNyúl, László, Gábor uhttps://www.inf.u-szeged.hu/publication/automatikus-azonositas-es-hitelesites-vizualis-kodokkal00460nas a2200121 4500008004100000245005600041210005600097260004200153300000700195100002000202700002000222856009600242 2014 eng d00aEliminating switching components in binary matrices0 aEliminating switching components in binary matrices aSzeged, HungarybUniversity of Szeged a211 aHantos, Norbert1 aBalázs, Péter uhttps://www.inf.u-szeged.hu/publication/eliminating-switching-components-in-binary-matrices00528nas a2200145 4500008004100000245005100041210005100092260004600143300001300189100002300202700002300225700002400248700001900272856009100291 2014 eng d00aEquivalent 2D sequential and parallel thinning0 aEquivalent 2D sequential and parallel thinning aBrno, Czech RepublicbSpringer cMay 2014 a91 - 1001 aPalágyi, Kálmán1 aBarneva, Reneta, P1 aBrimkov, Valentin E1 aŠlapal, Josef uhttps://www.inf.u-szeged.hu/publication/equivalent-2d-sequential-and-parallel-thinning00718nas a2200217 4500008004100000245006200041210006200103260003800165300000800203100001900211700002000230700001900250700001400269700001700283700002700300700001400327700002100341700001600362700002000378856010200398 2014 eng d00aEstablishing Correspondences between Planar Image Patches0 aEstablishing Correspondences between Planar Image Patches aWollongong, AustraliabIEEEc2014 a1-71 aTanacs, Attila1 aMajdik, András1 aMolnar, Jozsef1 aRai, Atul1 aKato, Zoltan1 aBouzerdoum, Abdesselam1 aWang, Lei1 aOgunbona, Philip1 aLi, Wanqing1 aPhung, Son, Lam uhttps://www.inf.u-szeged.hu/publication/establishing-correspondences-between-planar-image-patches01143nas a2200181 4500008004100000020002200041022001400063245008900077210006900166260004400235300001000279520046200289100002000751700002000771700002500791700001600816856012900832 2014 eng d a978-3-319-12567-1 a0302-974300aFast Heuristics for Eliminating Switching Components in Binary Matrices by 0-1 Flips0 aFast Heuristics for Eliminating Switching Components in Binary M aPuerto Vallarta, MexicobSpringerc2014 a62-693 aSwitching components are special patterns in binary matrices that play an essential role in many image processing and pattern analysis tasks. Finding the minimal number of 0s that must be switched to 1s in order to eliminate all switching components is an NP-complete problem. We present two novel-type heuristics for the above problems and show via experiments that they outperform the formerly proposed ones, both in optimality and in running time.
1 aHantos, Norbert1 aBalázs, Péter1 aBayro-Corrochano, E.1 aHancock, E. uhttps://www.inf.u-szeged.hu/publication/fast-heuristics-for-eliminating-switching-components-in-binary-matrices-by-0-1-flips00537nas a2200121 4500008004100000245007000041210006900111260007000180300000700250100002000257700002800277856011000305 2014 eng d00aFast recognition of natural feature identifiers by a mobile phone0 aFast recognition of natural feature identifiers by a mobile phon aSzegedbInstitute of Informatics, University of SzegedcJune 2014 a261 aKatona, Melinda1 aNyúl, László, Gábor uhttps://www.inf.u-szeged.hu/publication/fast-recognition-of-natural-feature-identifiers-by-a-mobile-phone00833nas a2200253 4500008004100000022002200041245005600063210005500119260005200174300001200226100002000238700001800258700001700276700001600293700002000309700002800329700002300357700001900380700002700399700001900426700001800445700002400463856009200487 2014 hun d a978-963-473-712-400aKépfeldolgozás a szegedi informatikus-képzésben0 aKépfeldolgozás a szegedi informatikusképzésben aDebrecen, HungarybUniversity of Debrecenc2014 a667-6751 aBalázs, Péter1 aKatona, Endre1 aKato, Zoltan1 aNagy, Antal1 aNémeth, Gábor1 aNyúl, László, Gábor1 aPalágyi, Kálmán1 aTanacs, Attila1 aVarga, László Gábor1 aKunkli, Roland1 aPapp, Ildikó1 aRutkovszky, Edéné uhttps://www.inf.u-szeged.hu/publication/kepfeldolgozas-a-szegedi-informatikus-kepzesben01716nas a2200157 4500008004100000020001400041245007000055210006900125260000900194520115400203100002701357700002801384700001601412700002001428856011001448 2014 eng d a1077-314200aLocal and global uncertainty in binary tomographic reconstruction0 aLocal and global uncertainty in binary tomographic reconstructio c20143 aIn binary tomography the goal is to reconstruct the innerstructure of homogeneous objects from their projections. This is usually required from a low number of projections, which are also likely to be affected by noise and measurement errors. In general, the distorted and incomplete projection data holds insufficient information for the correct reconstruction of the original object. In this paper, we describe two methods for approximating the local uncertainty of the reconstructions, i.e., identifying how the information stored in the projections determine each part of the reconstructed image. These methods can measure the uncertainty of the reconstruction without any knowledge from the original object itself. Moreover, we provide a global uncertainty measure that can assess the information content of a projection set and predict the error to be expected in the reconstruction of a homogeneous object. We also give an experimental evaluation of our proposed methods, mention some of their possible applications, and describe how the uncertainty measure can be used to improve the performance of the DART reconstruction algorithm.
1 aVarga, László Gábor1 aNyúl, László, Gábor1 aNagy, Antal1 aBalázs, Péter uhttps://www.inf.u-szeged.hu/publication/local-and-global-uncertainty-in-binary-tomographic-reconstruction00700nas a2200181 4500008004100000245008600041210006900127260003100196100002000227700001900247700002000266700002800286700002000314700001900334700001900353700002000372856012600392 2014 eng d00aLocalization of Visual Codes in the DCT Domain Using Deep Rectier Neural Networks0 aLocalization of Visual Codes in the DCT Domain Using Deep Rectie aSetúbalbSCITEPRESSc20141 aBodnár, Péter1 aGrósz, Tamás1 aTóth, László1 aNyúl, László, Gábor1 aFilipe, Joaquim1 aGusikhin, Oleg1 aMadani, Kurosh1 aSasiadek, Jurek uhttps://www.inf.u-szeged.hu/publication/localization-of-visual-codes-in-the-dct-domain-using-deep-rectier-neural-networks00565nas a2200121 4500008003900000020002200039245009300061210007800154260004800232300001200280100002800292856012300320 2014 d a978-963-396-040-000aOrvosi képfeldolgozás az SZTE Képfeldolgozás és Számítógépes Grafika Tanszéken0 aOrvosi képfeldolgozás az SZTE Képfeldolgozás és Számítógépes Gra aSzeged, HungarybPannon Egyetem, Veszprém a119-1221 aNyúl, László, Gábor uhttps://www.inf.u-szeged.hu/publication/orvosi-kepfeldolgozas-az-szte-kepfeldolgozas-es-szamitogepes-grafika-tanszeken00532nas a2200121 4500008004100000245006700041210006700108260007000175300001000245100002000255700002800275856010700303 2014 eng d00aQR Code Localization Using Boosted Cascade of Weak Classifiers0 aQR Code Localization Using Boosted Cascade of Weak Classifiers aSzegedbInstitute of Informatics, University of SzegedcJune 2014 a6 - 71 aBodnár, Péter1 aNyúl, László, Gábor uhttps://www.inf.u-szeged.hu/publication/qr-code-localization-using-boosted-cascade-of-weak-classifiers01166nas a2200145 4500008004100000245006700041210006700108260005000175520059600225100002000821700002800841700001900869700002300888856010900911 2014 eng d00aQR Code Localization Using Boosted Cascade of Weak Classifiers0 aQR Code Localization Using Boosted Cascade of Weak Classifiers aVilamura, PortugalbSpringer-VerlagcOct 20143 aUsage of computer-readable visual codes became common in oureveryday life at industrial environments and private use. The reading process of visual codes consists of two steps: localization and data decoding. Unsupervised localization is desirable at industrial setups and for visually impaired people. This paper examines localization efficiency of cascade classifiers using Haar-like features, Local Binary Patterns and Histograms of Oriented Gradients, trained for the finder patterns of QR codes and for the whole code region as well, and proposes improvements in post-processing.
1 aBodnár, Péter1 aNyúl, László, Gábor1 aKamel, Mohamed1 aCampilho, Aurélio uhttps://www.inf.u-szeged.hu/publication/qr-code-localization-using-boosted-cascade-of-weak-classifiers-000651nas a2200193 4500008004100000245005200041210005200093260004400145100001900189700002000208700002000228700002800248700001900276700001800295700001700313700001600330700001900346856009200365 2014 eng d00aQR code localization using deep neural networks0 aQR code localization using deep neural networks aSep 2014, Reims, FrancebIEEEcSep 20141 aGrósz, Tamás1 aBodnár, Péter1 aTóth, László1 aNyúl, László, Gábor1 aMamadou, Mboup1 aTülay, Adali1 aMoreau, Eric1 aLarsen, Jan1 aGuelton, Kevin uhttps://www.inf.u-szeged.hu/publication/qr-code-localization-using-deep-neural-networks01715nas a2200157 4500008004100000020001400041245010000055210006900155260001200224490000700236520111600243100001901359700002001378700001901398856014001417 2014 eng d a0143-080700aReal-time analysis of mechanical and electrical resonances with open-source sound card software0 aRealtime analysis of mechanical and electrical resonances with o c2014///0 v353 aWe present an easily reproducible, open-source, sound card based experimental set-up to support transfer function measurement. Our system is able to visualize the signals of mechanical and electrical resonances and their spectra in real time. We give a brief description of the system, and show some examples of electrical and mechanical resonance experiments that are supported by the system. The theoretical background, experimental set-up, component selection and digital signal processing are all discussed, and more detailed information (building instructions, software download) is provided on a dedicated web page ( www.noise.inf.u-szeged.hu/edudev/RealTimeAnalysisOfResonances/ [http://www.noise.inf.u-szeged.hu/edudev/RealTimeAnalysisOfResonances/] ). The experimental set-up can support the undergraduate and graduate education of students of physics, physics education and engineering by means of experimental demonstrations and laboratory exercises. The very low cost, high efficiency and transparent system provides a scalable experimental environment that can be easily built in several instances.1 aMakan, Gergely1 aKopasz, Katalin1 aGingl, Zoltán uhttps://www.inf.u-szeged.hu/publication/real-time-analysis-of-mechanical-and-electrical-resonances-with-open-source-sound-card-software00598nas a2200121 4500008004100000245011800041210006900159260004200228300000700270100002100277700002000298856015800318 2014 eng d00aReconstruction of hv-convex binary matrices from horizontal and vertical projections based on simulated annealing0 aReconstruction of hvconvex binary matrices from horizontal and v aSzeged, HungarybUniversity of Szeged a501 aOzsvár, Zoltán1 aBalázs, Péter uhttps://www.inf.u-szeged.hu/publication/reconstruction-of-hv-convex-binary-matrices-from-horizontal-and-vertical-projections-based-on-simulated-annealing00495nas a2200145 4500008004100000245004400041210004400085260005500129300001400184100001600198700002300214700002500237700001900262856006800281 2014 eng d00aSmoothing Filters in the DART Algorithm0 aSmoothing Filters in the DART Algorithm aMay 2014, Brno, Czech RepublicbSpringercMay 2014 a224 - 2371 aNagy, Antal1 aBarneva, Reneta, P1 aBrimkov, Valentin, E1 aŠlapal, Josef uhttp://link.springer.com/chapter/10.1007%2F978-3-319-07148-0_2001195nas a2200205 4500008004100000020002200041022002200063245007200085210006900157260005100226300001400277490000900291520053000300100001900830700002300849700002300872700002400895700001900919856005100938 2014 eng d a978-3-319-07147-3 a978-3-319-07147-300aSufficient conditions for general 2D operators to preserve topology0 aSufficient conditions for general 2D operators to preserve topol aMay 2014, Brno, Czech RepublicbSpringerc2014 a101 - 1120 v84663 aAn 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.
1 aKardos, Péter1 aPalágyi, Kálmán1 aBarneva, Reneta, P1 aBrimkov, Valentin E1 aŠlapal, Josef uhttp://dx.doi.org/10.1007/978-3-319-07148-0_1000585nas a2200157 4500008004100000020002200041245006700063210006500130260003500195300001200230100002000242700002100262700001900283700001900302856010600321 2014 eng d a978-1-941643-24-200aSZTE-NLP: Clinical Text Analysis with Named Entity Recognition0 aSZTENLP Clinical Text Analysis with Named Entity Recognition aDublin, IrelandbACLcAug 2014 a615-6181 aKatona, Melinda1 aFarkas, Richárd1 aNakov, Preslav1 aZesch, Torsten uhttps://www.inf.u-szeged.hu/publication/szte-nlp-clinical-text-analysis-with-named-entity-recognition00765nas a2200217 4500008004100000245007700041210006900118260003200187300001200219490000900231100002300240700002100263700002000284700002800304700002100332700002200353700001800375700001900393700001800412856011700430 2014 eng d00aWlab of University of Szeged at ImageCLEF 2014 Plant Identification Task0 aWlab of University of Szeged at ImageCLEF 2014 Plant Identificat aSheffield, UKbCEUR-WScSep a685-6920 v11801 aBánhalmi, András1 aPaczolay, Dénes1 aBilicki, Vilmos1 aNyúl, László, Gábor1 aSárosi, Árpád1 aCappellato, Linda1 aFerro, Nicola1 aHalvey, Martin1 aKraai, Wessel uhttps://www.inf.u-szeged.hu/publication/wlab-of-university-of-szeged-at-imageclef-2014-plant-identification-task00451nas a2200121 4500008004100000245005600041210005500097260007200152100001900224700001800243700002100261856004700282 2014 eng d00aX. Magyar Számítógépes Nyelvészeti Konferencia0 aX Magyar Számítógépes Nyelvészeti Konferencia aSzegedbSzegedi Tudományegyetem Informatikai Tanszékcsoportc20141 aTanacs, Attila1 aVarga, Viktor1 aVincze, Veronika uhttp://www.inf.u-szeged.hu/rgai/mszny2014/00668nas a2200157 4500008004100000245010600041210007600147260003800223300001400261100001900275700002100294700002100315700001700336700002100353856013600374 2013 eng d00a2D és 3D bináris objektumok lineáris deformáció-becslésének numerikus megoldási lehetőségei0 a2D és 3D bináris objektumok lineáris deformációbecslésének numer aVeszprémbNJSZT-KÉPAFcJan 2013 a526 - 5411 aTanacs, Attila1 aLindblad, Joakim1 aSladoje, Nataša1 aKato, Zoltan1 aCzúni, László uhttps://www.inf.u-szeged.hu/publication/2d-es-3d-binaris-objektumok-linearis-deformacio-becslesenek-numerikus-megoldasi-lehetosegei00878nas a2200229 4500008004100000020001400041245013900055210006900194260000900263300001400272490000700286100002000293700002000313700002300333700002100356700001700377700002100394700001400415700002000429700002200449856017700471 2013 eng d a1217-895000aAPPLICATION OF DNA CHIP SCANNING TECHNOLOGY FOR THE AUTOMATIC DETECTION OF CHLAMYDIA TRACHOMATIS AND CHLAMYDIA PNEUMONIAE INCLUSIONS0 aAPPLICATION OF DNA CHIP SCANNING TECHNOLOGY FOR THE AUTOMATIC DE c2013 a173 - 1740 v601 aLantos, Ildikó1 aBogdanov, Anita1 aEndrész, Valéria1 aUrbán, Szabolcs1 aDeák, Judit1 aBurián, Katalin1 aÖnder, K1 aBalázs, Péter1 aVirók, Dezső, P uhttps://www.inf.u-szeged.hu/publication/application-of-dna-chip-scanning-technology-for-the-automatic-detection-of-chlamydia-trachomatis-and-chlamydia-pneumoniae-inclusions01096nas a2200157 4500008004100000020001400041245008400055210006900139260000900208300001200217490000700229520053200236100002000768700002800788856012200816 2013 eng d a0324-721X00aBarcode detection using local analysis, mathematical morphology, and clustering0 aBarcode detection using local analysis mathematical morphology a c2013 a21 - 350 v213 aBarcode detection is required in a wide range of real-lifeapplications. Imaging conditions and techniques vary considerably and each application has its own requirements for detection speed and accuracy. In our earlier works we built barcode detectors using morphological operations and uniform partitioning with several approaches and showed their behaviour on a set of test images. In this work, we extend those ideas with clustering, contrast measuring, distance transformation and probabilistic Hough transformation.
1 aBodnár, Péter1 aNyúl, László, Gábor uhttps://www.inf.u-szeged.hu/publication/barcode-detection-using-local-analysis-mathematical-morphology-and-clustering01045nas a2200145 4500008004100000245007600041210006900117260005400186300001200240520052600252100002000778700002800798700001400826856005900840 2013 eng d00aBarcode detection with uniform partitioning and distance transformation0 aBarcode detection with uniform partitioning and distance transfo aInnsbruck, AustriabIASTED - Acta PresscFeb 2013 a48 - 533 aBarcode detection is required in a wide range of real-lifeapplications. Imaging conditions and techniques vary considerably and each application has its own requirements for detection speed and accuracy. In our earlier works we used uniform partitioning with several approaches for detection of various types of 1D and 2D barcodes and showed their behaviour on a set of test images. In this work, we extend the partitioning idea and replace scan-line based methods with distance transformation to improve accuracy.
1 aBodnár, Péter1 aNyúl, László, Gábor1 aLinsen, L uhttp://www.actapress.com/PaperInfo.aspx?paperId=45498800593nas a2200145 4500008004100000245008100041210007800122260003800200300001400238100002000252700002000272700002300292700002100315856011100336 2013 eng d00aBináris képek rekonstrukciója két vetületből és morfológiai vázból0 aBináris képek rekonstrukciója két vetületből és morfológiai vázb aVeszprémbNJSZT-KÉPAFcJan 2013 a182 - 1931 aHantos, Norbert1 aBalázs, Péter1 aPalágyi, Kálmán1 aCzúni, László uhttps://www.inf.u-szeged.hu/publication/binaris-kepek-rekonstrukcioja-ket-vetuletbol-es-morfologiai-vazbol00641nas a2200169 4500008004100000245006200041210006200103260006700165300001400232100001900246700001900265700002200284700002100306700002000327700002200347856010200369 2013 eng d00aCar Recognition from Frontal Images in Mobile Environment0 aCar Recognition from Frontal Images in Mobile Environment aTriestebUniversity of Zagreb; University of TriestecSep 2013 a812 - 8161 aVarjas, Viktor1 aTanacs, Attila1 aRamponi, Giovanni1 aLončarić, Sven1 aCarini, Alberto1 aEgiazarian, Karen uhttps://www.inf.u-szeged.hu/publication/car-recognition-from-frontal-images-in-mobile-environment00632nas a2200133 4500008004100000245011700041210006900158260003800227300001400265100002100279700002000300700002100320856015700341 2013 eng d00aA comparison of heuristics for reconstructing hv-convex binary matrices from horizontal and vertical projections0 acomparison of heuristics for reconstructing hvconvex binary matr aVeszprémbNJSZT-KÉPAFcJan 2013 a168 - 1811 aOzsvár, Zoltán1 aBalázs, Péter1 aCzúni, László uhttps://www.inf.u-szeged.hu/publication/a-comparison-of-heuristics-for-reconstructing-hv-convex-binary-matrices-from-horizontal-and-vertical-projections00595nas a2200133 4500008004100000020001400041245012200055210006900177260000900246300001600255490000800271100002000279856016200299 2013 eng d a0166-218X00aComplexity results for reconstructing binary images with disjoint components from horizontal and vertical projections0 aComplexity results for reconstructing binary images with disjoin c2013 a2224 - 22350 v1611 aBalázs, Péter uhttps://www.inf.u-szeged.hu/publication/complexity-results-for-reconstructing-binary-images-with-disjoint-components-from-horizontal-and-vertical-projections00433nas a2200133 4500008004100000020001400041245005100055210005100106260000900157300001000166490000700176100002300183856009300206 2013 eng d a0324-721X00aConference of PhD Students in Computer Science0 aConference of PhD Students in Computer Science c2013 a1 - 30 v211 aPalágyi, Kálmán uhttps://www.inf.u-szeged.hu/publication/conference-of-phd-students-in-computer-science-001349nas a2200133 4500008004100000245007600041210006900117260003900186300001600225520082400241100001701065700001701082856011601099 2013 eng d00aCorrespondence-less non-rigid registration of triangular surface meshes0 aCorrespondenceless nonrigid registration of triangular surface m aPortland, OR, USAbIEEEcJune 2013 a2275 - 22823 aA novel correspondence-less approach is proposed to find a thin plate spline map between a pair of deformable 3D objects represented by triangular surface meshes. The proposed method works without landmark extraction and feature correspondences. The aligning transformation is found simply by solving a system of nonlinear equations. Each equation is generated by integrating a nonlinear function over the object's domains. We derive recursive formulas for the efficient computation of these integrals. Based on a series of comparative tests on a large synthetic dataset, our triangular mesh-based algorithm outperforms state of the art methods both in terms of computing time and accuracy. The applicability of the proposed approach has been demonstrated on the registration of 3D lung CT volumes. © 2013 IEEE.
1 aSanta, Zsolt1 aKato, Zoltan uhttps://www.inf.u-szeged.hu/publication/correspondence-less-non-rigid-registration-of-triangular-surface-meshes01213nas a2200157 4500008004100000020002200041245006900063210006900132260004300201300001200244520065200256100002300908700002600931700003100957856006700988 2013 eng d a978-3-642-41821-100aDeletion Rules for Equivalent Sequential and Parallel Reductions0 aDeletion Rules for Equivalent Sequential and Parallel Reductions aBerlin; HeidelbergbSpringercNov 2013 a17 - 243 aA 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.
1 aPalágyi, Kálmán1 aRuiz-Shulcloper, Jose1 aSanniti di Baja, Gabriella uhttp://link.springer.com/chapter/10.1007%2F978-3-642-41822-8_301468nas a2200169 4500008004100000245005600041210005600097260004600153300001100199520089100210100002501101700002801126700002001154700003101174700002601205856006701231 2013 eng d00aDirectional Convexity Measure for Binary Tomography0 aDirectional Convexity Measure for Binary Tomography aBerlin; HeidelbergbSpringer Verlagc2013 a9 - 163 aThere is an increasing demand for a new measure of convexity fordiscrete sets for various applications. For example, the well- known measures for h-, v-, and hv-convexity of discrete sets in binary tomography pose rigorous criteria to be satisfied. Currently, there is no commonly accepted, unified view on what type of discrete sets should be considered nearly hv-convex, or to what extent a given discrete set can be considered convex, in case it does not satisfy the strict conditions. We propose a novel directional convexity measure for discrete sets based on various properties of the configuration of 0s and 1s in the set. It can be supported by proper theory, is easy to compute, and according to our experiments, it behaves intuitively. We expect it to become a useful alternative to other convexity measures in situations where the classical definitions cannot be used.
1 aTasi, Tamás Sámuel1 aNyúl, László, Gábor1 aBalázs, Péter1 aSanniti di Baja, Gabriella1 aRuiz-Shulcloper, Jose uhttp://link.springer.com/chapter/10.1007%2F978-3-642-41827-3_201419nas a2200181 4500008004100000020001400041245004900055210004900104260000900153300001400162490000800176520087500184100002401059700002801083700002001111700001701131856008901148 2013 eng d a1077-314200aDynamic angle selection in binary tomography0 aDynamic angle selection in binary tomography c2013 a306 - 3180 v1173 aIn this paper, we present an algorithm for the dynamic selection of projection angles in binary tomography. Based on the information present in projections that have already been measured, a new projection angle is computed, which aims to maximize the information gained by adding this projection to the set of measurements. The optimization model used for angle selection is based on a characterization of solutions of the binary reconstruction problem, and a related definition of information gain. From this formal model, an algorithm is obtained by several approximation steps. Results from a series of simulation experiments demonstrate that the proposed angle selection scheme is indeed capable of finding angles for which the reconstructed image is much more accurate than for the standard angle selection scheme. © 2012 Elsevier Inc. All rights reserved.
1 aBatenburg, Joost, K1 aPalenstijn, Willem, Jan1 aBalázs, Péter1 aSijbers, Jan uhttps://www.inf.u-szeged.hu/publication/dynamic-angle-selection-in-binary-tomography01550nas a2200169 4500008004100000245007200041210006900113260005000182300001400232520091200246100002001158700002801178700002101206700002301227700001801250856011201268 2013 eng d00aEfficient 1D and 2D barcode detection using mathematical morphology0 aEfficient 1D and 2D barcode detection using mathematical morphol aBerlin; HeidelbergbSpringer-VerlagcMay 2013 a464 - 4753 aBarcode technology is essential in automatic identification,and is used in a wide range of real-time applications. Different code types and applications impose special problems, so there is a continuous need for solutions with improved performance. Several methods exist for code localization, that are well characterized by accuracy and speed. Particularly, high-speed processing places need reliable automatic barcode localization, e.g. conveyor belts and automated production, where missed detections cause loss of profit. Our goal is to detect automatically, rapidly and accurately the barcode location with the help of extracted image features. We propose a new algorithm variant, that outperforms in both accuracy and efficiency other detectors found in the literature using similar ideas, and also improves on the detection performance in detecting 2D codes compared to our previous algorithm.
1 aKatona, Melinda1 aNyúl, László, Gábor1 aLuengo, Chris, L1 aBorgefors, Gunilla1 aStrand, Robin uhttps://www.inf.u-szeged.hu/publication/efficient-1d-and-2d-barcode-detection-using-mathematical-morphology01409nas a2200157 4500008004100000245005000041210005000091260002900141300001000170520094300180100001701123700001701140700001601157700002001173856005801193 2013 eng d00aElastic Registration of 3D Deformable Objects0 aElastic Registration of 3D Deformable Objects aNew YorkbIEEEcNov 2013 a1 - 73 aA novel correspondence-less approach is proposed to find a non-linear aligning transformation between a pair of deformable 3D objects. Herein, we consider a polynomial deformation model, but our framework can be easily adapted to other common deformations. The basic idea of the proposed method is to set up a system of nonlinear equations whose solution directly provides the parameters of the aligning transformation. Each equation is generated by integrating a nonlinear function over the object's domains. Thus the number of equations is determined by the number of adopted nonlinear functions yielding a flexible mechanism to generate sufficiently many equations. While classical approaches would establish correspondences between the shapes, our method works without landmarks. The efficiency of the proposed approach has been demonstrated on a large synthetic dataset as well as in the context of medical image registration.
1 aSanta, Zsolt1 aKato, Zoltan1 aWest, Geoff1 aKövesi, Péter uhttp://www.inf.u-szeged.hu/~kato/papers/dicta2012.pdf01382nas a2200157 4500008004100000020001400041245010800055210006900163260000900232300001400241490000700255520077300262100002101035700002001056856014801076 2013 eng d a0324-721X00aAn empirical study of reconstructing hv-convex binary matrices from horizontal and vertical projections0 aempirical study of reconstructing hvconvex binary matrices from c2013 a149 - 1630 v213 aThe reconstruction of hv-convex binary matrices (or equivalently, binary images) from their horizontal and vertical projections is proved to be NP-hard. In this paper we take a closer look at the difficulty of the problem. We investigate different heuristic reconstruction algorithms of the class, and compare them from the viewpoint of running-time and reconstruction quality. Using a large set of test images of different sizes and with varying number of components, we show that the reconstruction quality can depend not only on the size of the image, but on the number and location of its components, too. We also reveal that the reconstruction time can also be affected by the number of the so-called switching components present in the image.
1 aOzsvár, Zoltán1 aBalázs, Péter uhttps://www.inf.u-szeged.hu/publication/an-empirical-study-of-reconstructing-hv-convex-binary-matrices-from-horizontal-and-vertical-projections01890nas a2200193 4500008004100000245010100041210006900142260002800211300001400239520116200253100001901415700001901434700001701453700002201470700002101492700002001513700002201533856014101555 2013 eng d00aEvaluation of Point Matching Methods for Wide-baseline Stereo Correspondence on Mobile Platforms0 aEvaluation of Point Matching Methods for Widebaseline Stereo Cor aTriestebIEEEcSep 2013 a806 - 8113 aWide-baseline stereo matching is a common problem of computer vision. By the explosion of smartphones equipped with camera modules, many classical computer vision solutions have been adapted to such platforms. Considering the widespread use of various networking options for mobile phones, one can consider a set of smart phones as an ad-hoc camera network, where each camera is equipped with a more and more powerful computing engine in addition to a limited bandwidth communication with other devices. Therefore the performance of classical vision algorithms in a collaborative mobile environment is of particular interest. In such a scenario we expect that the images are taken almost simultaneously but from different viewpoints, implying that the camera poses are significantly different but lighting conditions are the same. In this work, we provide quantitative comparison of the most important keypoint detectors and descriptors in the context of wide baseline stereo matching. We found that for resolution of 2 megapixels images the current mobile hardware is capable of providing results efficiently.
1 aJuhász, Endre1 aTanacs, Attila1 aKato, Zoltan1 aRamponi, Giovanni1 aLončarić, Sven1 aCarini, Alberto1 aEgiazarian, Karen uhttps://www.inf.u-szeged.hu/publication/evaluation-of-point-matching-methods-for-wide-baseline-stereo-correspondence-on-mobile-platforms00485nas a2200133 4500008004100000245005500041210005500096260003800151300001400189100001900203700001900222700002100241856008900262 2013 eng d00aGépkocsi felismerés elölnézeti képek alapján0 aGépkocsi felismerés elölnézeti képek alapján aVeszprémbNJSZT-KÉPAFcJan 2013 a294 - 3081 aVarjas, Viktor1 aTanacs, Attila1 aCzúni, László uhttps://www.inf.u-szeged.hu/publication/gepkocsi-felismeres-elolnezeti-kepek-alapjan00613nas a2200145 4500008004100000245009200041210007500133260003800208300001400246100002700260700002000287700001600307700002100323856012300344 2013 eng d00aGradiens módszerek automatikus súlyozásán alapuló diszkrét tomográfiai eljárás0 aGradiens módszerek automatikus súlyozásán alapuló diszkrét tomog aVeszprémbNJSZT-KÉPAFcJan 2013 a210 - 2231 aVarga, László Gábor1 aBalázs, Péter1 aNagy, Antal1 aCzúni, László uhttps://www.inf.u-szeged.hu/publication/gradiens-modszerek-automatikus-sulyozasan-alapulo-diszkret-tomografiai-eljaras00451nas a2200109 4500008003900000245007400039210007400113300001200187100001800199700001900217856010500236 2013 d00aHáromszöghálók nemlineáris illesztése megfeleltetések nélkül0 aHáromszöghálók nemlineáris illesztése megfeleltetések nélkül a224-2391 aZsolt, Sánta1 aZoltán, Kató uhttps://www.inf.u-szeged.hu/publication/haromszoghalok-nemlinearis-illesztese-megfeleltetesek-nelkul00547nas a2200133 4500008004100000245007100041210006900112260003800181300001400219100002000233700002800253700002100281856011100302 2013 eng d00aImproved 1D and 2D barcode detection with morphological operations0 aImproved 1D and 2D barcode detection with morphological operatio aVeszprémbNJSZT-KÉPAFcJan 2013 a309 - 3241 aKatona, Melinda1 aNyúl, László, Gábor1 aCzúni, László uhttps://www.inf.u-szeged.hu/publication/improved-1d-and-2d-barcode-detection-with-morphological-operations01221nas a2200145 4500008004100000245006500041210006500106260008200171300001100253520069600264100001700960700001800977700002100995856005901016 2013 eng d00aLinear and nonlinear shape alignment without correspondences0 aLinear and nonlinear shape alignment without correspondences aBerlin; Heidelberg; New York; London; Paris; TokyobSpringer VerlagcFeb 2013 a3 - 173 aWe consider the estimation of diffeomorphic deformations aligning a known binary shape and its distorted observation. The classical solution consists in extracting landmarks, establishing correspondences and then the aligning transformation is obtained via a complex optimization procedure. Herein we present an alternative solution which works without landmark correspondences, is independent of the magnitude of transformation, easy to implement, and has a linear time complexity. The proposed universal framework is capable of recovering linear as well as nonlinear deformations.
1 aKato, Zoltan1 aRichard, Paul1 aCsurka, Gabriela uhttp://www.inf.u-szeged.hu/~kato/papers/visapp2012.pdf01266nas a2200169 4500008004100000245005900041210005900100260004300159300001400202520067100216100002700887700002800914700001600942700002000958700001900978856009900997 2013 eng d00aLocal uncertainty in binary tomographic reconstruction0 aLocal uncertainty in binary tomographic reconstruction aCalgarybIASTED - Acta PresscFeb 2013 a490 - 4963 aWe describe a new approach for the uncertainty problem arisingin the field of discrete tomography, when the low number of projections does not hold enough information for an accurate, and reliable reconstruction. In this case the lack of information results in uncertain parts on the reconstructed image which are not determined by the projections and cannot be reliably reconstructed without additional information. We provide a method that can approximate this local uncertainty of reconstructions, and show how each pixel of the reconstructed image is determined by a set of given projections. We also give experimental results for validating our approach.
1 aVarga, László Gábor1 aNyúl, László, Gábor1 aNagy, Antal1 aBalázs, Péter1 aKampel, Martin uhttps://www.inf.u-szeged.hu/publication/local-uncertainty-in-binary-tomographic-reconstruction01091nas a2200157 4500008004100000245006000041210005800101260003900159300001400198520053100212100002000743700002800763700001900791700002300810856010000833 2013 eng d00aA Novel Method for Barcode Localization in Image Domain0 aNovel Method for Barcode Localization in Image Domain aBerlinbSpringer-VerlagcJune 2013 a189 - 1963 aBarcode localization is an essential step of the barcode readingprocess. For industrial environments, having high-resolution cameras and eventful scenarios, fast and reliable localization is crucial. Images acquired in those setups have limited parameters, however, they vary at each application. In earlier works we have already presented various barcode features to track for localization process. In this paper, we present a novel approach for fast barcode localization using a limited set of pixels in image domain.
1 aBodnár, Péter1 aNyúl, László, Gábor1 aKamel, Mohamed1 aCampilho, Aurélio uhttps://www.inf.u-szeged.hu/publication/a-novel-method-for-barcode-localization-in-image-domain00717nas a2200193 4500008004100000245008800041210006900129260011600198300001400314100001300328700001300341700001300354700001500367700001500382700001400397700001700411700002300428856007200451 2013 eng d00aOn-water Measurement and Analysis System for Estimating Kayak Paddlers' Performance0 aOnwater Measurement and Analysis System for Estimating Kayak Pad aRijekabCroatian Society for Information and Communication Technology Electronics and Microelectronicsc2013/// a144 - 1491 aG, Vadai1 aG, Makan1 aZ, Gingl1 aR, Mingesz1 aJ, Mellár1 aT, Szépe1 aA, Csamangó1 aBiljanović, Petar uhttp://www.inf.u-szeged.hu/~gingl/Publications/2013_Vadai_MIPRO.pdf01451nas a2200133 4500008004100000245007100041210006900112260005200181300001200233520092000245100002301165700001801188856011101206 2013 eng d00aParallel 3D 12-Subiteration Thinning Algorithms Based on Isthmuses0 aParallel 3D 12Subiteration Thinning Algorithms Based on Isthmuse aHeidelberg; New YorkbSpringer VerlagcJul 2013 a87 - 983 aThinning 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.
1 aPalágyi, Kálmán1 aBebis, George uhttps://www.inf.u-szeged.hu/publication/parallel-3d-12-subiteration-thinning-algorithms-based-on-isthmuses00454nas a2200133 4500008004100000245004100041210004100082260003800123300001400161100002000175700002300195700002100218856008100239 2013 eng d00aParallel Thinning Based on Isthmuses0 aParallel Thinning Based on Isthmuses aVeszprémbNJSZT-KÉPAFcJan 2013 a512 - 5251 aNémeth, Gábor1 aPalágyi, Kálmán1 aCzúni, László uhttps://www.inf.u-szeged.hu/publication/parallel-thinning-based-on-isthmuses01135nas a2200157 4500008004100000020002300041245004500064210004500109260002900154300001400183520063300197100001900830700002300849700002000872856008500892 2013 eng d a978-1-4799-1543-9 00aParallel Thinning on the Triangular Grid0 aParallel Thinning on the Triangular Grid aBudapestbIEEEcDec 2013 a277 - 2823 aOne 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.
1 aKardos, Péter1 aPalágyi, Kálmán1 aBaranyi, Péter uhttps://www.inf.u-szeged.hu/publication/parallel-thinning-on-the-triangular-grid00523nas a2200145 4500008004100000245009500041210006900136260003000205100001300235700001300248700001500261700001300276700001700289856007100306 2013 eng d00aPerformance estimation of kayak paddlers based on fluctuation analysis of movement signals0 aPerformance estimation of kayak paddlers based on fluctuation an aPiscatawaybIEEEc2013///1 aG, Vadai1 aZ, Gingl1 aR, Mingesz1 aG, Makan1 aVarani, Luca uhttp://www.inf.u-szeged.hu/~gingl/Publications/2013_Vadai_ICNF.pdf01710nas a2200169 4500008004100000245005300041210005200094260002900146300001200175520116500187100001701352700001701369700002001386700002001406700002101426856009301447 2013 eng d00aPose Estimation of Ad-hoc Mobile Camera Networks0 aPose Estimation of Adhoc Mobile Camera Networks aHobart, TAS bIEEEc2013 a88 - 953 aAn algorithm is proposed for the pose estimation of ad-hoc mobile camera networks with overlapping views. The main challenge is to estimate camera parameters with respect to the 3D scene without any specific calibration pattern, hence allowing for a consistent, camera-independent world coordinate system. The only assumption about the scene is that it contains a planar surface patch of a low-rank texture, which is visible in at least two cameras. Such low-rank patterns are quite common in urban environments. The proposed algorithm consists of three main steps: relative pose estimation of the cameras within the network, followed by the localization of the network within the 3D scene using a low-rank surface patch, and finally the estimation of a consistent scale for the whole system. The algorithm follows a distributed architecture, hence the computing power of the participating mobile devices are efficiently used. The performance and robustness of the proposed algorithm have been analyzed on both synthetic and real data. Experimental results confirmed the relevance and applicability of the method.
1 aSanta, Zsolt1 aKato, Zoltan1 ade Souza, Paulo1 aEngelke, Ulrich1 aRahman, Ashfaqur uhttps://www.inf.u-szeged.hu/publication/pose-estimation-of-ad-hoc-mobile-camera-networks00488nas a2200097 4500008004100000245008700041210006900128260004800197100002000245856012500265 2013 eng d00aPrior Information, Machine Learning, and Direction Dependency in Binary Tomography0 aPrior Information Machine Learning and Direction Dependency in B aSzeged, HungarybUniversity of Szegedc20131 aBalázs, Péter uhttps://www.inf.u-szeged.hu/publication/prior-information-machine-learning-and-direction-dependency-in-binary-tomography00680nas a2200157 4500008004100000020002200041245009300063210006900156260005300225300001400278100002000292700002000312700002600332700003100358856013300389 2013 eng d a978-3-642-41821-100aReconstruction and Enumeration of hv-Convex Polyominoes with Given Horizontal Projection0 aReconstruction and Enumeration of hvConvex Polyominoes with Give aHeidelberg; London; New YorkbSpringercNov 2013 a100 - 1071 aHantos, Norbert1 aBalázs, Péter1 aRuiz-Shulcloper, Jose1 aSanniti di Baja, Gabriella uhttps://www.inf.u-szeged.hu/publication/reconstruction-and-enumeration-of-hv-convex-polyominoes-with-given-horizontal-projection00623nas a2200145 4500008004100000020001400041245012100055210006900176260000900245300001400254490000800268100002000276700002000296856016100316 2013 eng d a0169-296800aThe reconstruction of polyominoes from horizontal and vertical projections and morphological skeleton is NP-complete0 areconstruction of polyominoes from horizontal and vertical proje c2013 a343 - 3590 v1251 aHantos, Norbert1 aBalázs, Péter uhttps://www.inf.u-szeged.hu/publication/the-reconstruction-of-polyominoes-from-horizontal-and-vertical-projections-and-morphological-skeleton-is-np-complete01777nas a2200205 4500008004100000020002200041245006700063210006700130260007800197300001200275520103100287100001901318700002001337700002501357700002201382700002201404700001701426700002101443856010701464 2013 eng d a978-3-319-02894-100aRestoration of blurred binary images using discrete tomography0 aRestoration of blurred binary images using discrete tomography aBerlin; Heidelberg; New York; London; Paris; TokyobSpringer Verlagc2013 a80 - 903 aEnhancement of degraded images of binary shapes is an important task in many image processing applications, e.g. to provide appropriate image quality for optical character recognition. Although many image restoration methods can be found in the literature, most of them are developed for grayscale images. In this paper we propose a novel binary image restoration algorithm. As a first step, it restores the projections of the shape using 1-dimensional deconvolution, then reconstructs the image from these projections using a discrete tomography technique. The method does not require any parameter setting or prior knowledge like an estimation of the signal-to-noise ratio. Numerical experiments on a synthetic dataset show that the proposed algorithm is robust to the level of the noise. The efficiency of the method has also been demonstrated on real out-of-focus alphanumeric images.
1 aNemeth, Jozsef1 aBalázs, Péter1 aBlanc-Talon, Jacques1 aKasinski, Andrzej1 aPhilips, Wilfried1 aPopescu, Dan1 aScheunders, Paul uhttps://www.inf.u-szeged.hu/publication/restoration-of-blurred-binary-images-using-discrete-tomography01250nas a2200157 4500008004100000020001400041245008300055210006900138260006500207300001300272490000700285520064000292100001900932700002000951856012100971 2013 eng d a0324-721X00aSpectrum Skeletonization: A New Method for Acoustic Signal Feature Extraction.0 aSpectrum Skeletonization A New Method for Acoustic Signal Featur aSzegedbUniversity of Szeged, Institute of Informaticsc2013 a89 - 1030 v213 aVibration Analysis Tests (VAT) and Acoustic Emission tests (AE) are used in several industrial applications. Many of them perform analysis in the frequency domain. Peaks in the power density spectrum hold relevant information about acoustic events. In this paper we propose a novel method for feature extraction of vibration samples by analyzing the shape of their auto power spectrum density function. The approach uses skeletonization techniques in order to find the hierarchical structure of the spectral peaks. The proposed method can be applied as a preprocessing step for spectrum analysis of vibration signals.
1 aDobján, Tibor1 aNémeth, Gábor uhttps://www.inf.u-szeged.hu/publication/spectrum-skeletonization-a-new-method-for-acoustic-signal-feature-extraction01597nas a2200145 4500008004100000245008200041210006900123260004300192300001400235520102400249100001901273700002301292700001401315856012201329 2013 eng d00aSufficient Conditions for Topology Preserving Additions and General Operators0 aSufficient Conditions for Topology Preserving Additions and Gene aCalgarybIASTED - Acta PresscFeb 2013 a107 - 1143 aTopology 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.
1 aKardos, Péter1 aPalágyi, Kálmán1 aLinsen, L uhttps://www.inf.u-szeged.hu/publication/sufficient-conditions-for-topology-preserving-additions-and-general-operators01864nas a2200181 4500008004100000245006400041210006200105260003300167300001400200520125000214100002001464700001701484700001601501700002401517700001901541700002001560856010201580 2013 eng d00aTargetless Calibration of a Lidar - Perspective Camera Pair0 aTargetless Calibration of a Lidar Perspective Camera Pair aSydney, NSW bIEEEcDec 2013 a668 - 6753 aA novel method is proposed for the calibration of a camera - 3D lidar pair without the use of any special calibration pattern or point correspondences. The proposed method has no specific assumption about the data source: plain depth information is expected from the lidar scan and a simple perspective camera is used for the 2D images. The calibration is solved as a 2D-3D registration problem using a minimum of one (for extrinsic) or two (for intrinsic-extrinsic) planar regions visible in both cameras. The registration is then traced back to the solution of a non-linear system of equations which directly provides the calibration parameters between the bases of the two sensors. The method has been tested on a large set of synthetic lidar-camera image pairs as well as on real data acquired in outdoor environment.
1 aLevente, Tamás1 aKato, Zoltan1 aZhang, Jian1 aBennamoun, Mohammed1 aSchonfeld, Dan1 aZhang, Zhengyou uhttps://www.inf.u-szeged.hu/publication/targetless-calibration-of-a-lidar-perspective-camera-pair01101nas a2200181 4500008004100000245007200041210006700113260002800180300001400208520046000222100001900682700002300701700002200724700002100746700002000767700002200787856011000809 2013 eng d00aOn Topology Preservation in Triangular, Square, and Hexagonal Grids0 aTopology Preservation in Triangular Square and Hexagonal Grids aTriestebIEEEcSep 2013 a782 - 7873 aThere 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.
1 aKardos, Péter1 aPalágyi, Kálmán1 aRamponi, Giovanni1 aLončarić, Sven1 aCarini, Alberto1 aEgiazarian, Karen uhttps://www.inf.u-szeged.hu/publication/on-topology-preservation-in-triangular-square-and-hexagonal-grids00513nas a2200133 4500008004100000245006100041210006100102260003800163300001400201100001900215700002300234700002100257856010100278 2013 eng d00aTopology preserving parallel thinning on hexagonal grids0 aTopology preserving parallel thinning on hexagonal grids aVeszprémbNJSZT-KÉPAFcJan 2013 a250 - 2641 aKardos, Péter1 aPalágyi, Kálmán1 aCzúni, László uhttps://www.inf.u-szeged.hu/publication/topology-preserving-parallel-thinning-on-hexagonal-grids01108nas a2200157 4500008004100000020001400041245004300055210004200098260002700140300001600167490000700183520064200190100001900832700002300851856007600874 2013 eng d a0020-716000aTopology-preserving hexagonal thinning0 aTopologypreserving hexagonal thinning bTaylor & Francisc2013 a1607 - 16170 v903 aThinning 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.
1 aKardos, Péter1 aPalágyi, Kálmán uhttp://www.tandfonline.com/doi/abs/10.1080/00207160.2012.724198#preview01211nas a2200145 4500008004100000020001400041245009400055210006900149260004300218300001200261490001300273520062800286100001700914856013400931 2013 eng d a1865-092900aA unifying framework for correspondence-less shape alignment and its medical applications0 aunifying framework for correspondenceless shape alignment and it aAllahabad, IndiabSpringercMarch 2013 a40 - 520 v276 CCIS3 aWe give an overview of our general framework for registering 2D and 3D objects without correspondences. Classical solutions consist in extracting landmarks, establishing correspondences and then the aligning transformation is obtained via a complex optimization procedure. In contrast, our framework works without landmark correspondences, is independent of the magnitude of transformation, easy to implement, and has a linear time complexity. The efficiency and robustness of the method has been demonstarted using various deformations models. Herein, we will focus on medical applications. © 2013 Springer-Verlag.
1 aKato, Zoltan uhttps://www.inf.u-szeged.hu/publication/a-unifying-framework-for-correspondence-less-shape-alignment-and-its-medical-applications01721nas a2200181 4500008004100000245013300041210006900174260002800243300001400271520095600285100002001241700002001261700002201281700002101303700002001324700002201344856017301366 2013 eng d00aA uniqueness result for reconstructing hv-convex polyominoes from horizontal and vertical projections and morphological skeleton0 auniqueness result for reconstructing hvconvex polyominoes from h aTriestebIEEEcSep 2013 a788 - 7933 aIn this article we study the uniqueness of the reconstruction in a special class of 4-connected hv-convex images, using two projections and the so-called morphological skeleton. Generally, if just the two projections are given, there can be exponentially many hv-convex 4-connected images satisfying them. Knowing the morphological skeleton in addition, we can reduce the number of solutions. In the studied class, the images are defined by two parameters. We show that the uniqueness of their reconstruction depends only on the values of those parameters.
1 aHantos, Norbert1 aBalázs, Péter1 aRamponi, Giovanni1 aLončarić, Sven1 aCarini, Alberto1 aEgiazarian, Karen uhttps://www.inf.u-szeged.hu/publication/a-uniqueness-result-for-reconstructing-hv-convex-polyominoes-from-horizontal-and-vertical-projections-and-morphological-skeleton00584nas a2200133 4500008004100000245009100041210007800132260003800210300001400248100002000262700002800282700002100310856011900331 2013 hun d00aVizuális kódok lokalizálásának javítása egyszerű jellemzők kombinációjával0 aVizuális kódok lokalizálásának javítása egyszerű jellemzők kombi aVeszprémbNJSZT-KÉPAFcJan 2013 a483 - 4951 aBodnár, Péter1 aNyúl, László, Gábor1 aCzúni, László uhttps://www.inf.u-szeged.hu/publication/vizualis-kodok-lokalizalasanak-javitasa-egyszeru-jellemzok-kombinaciojaval01225nas a2200205 4500008004100000245005500041210005500096260005200151300001400203490000900217520059400226100002000820700002300840700002500863700002200888700001700910700002100927700002000948856005100968 2012 eng d00a3D Parallel Thinning Algorithms Based on Isthmuses0 a3D Parallel Thinning Algorithms Based on Isthmuses aBrno, Czech RepublicbSpringer VerlagcSep 2012 a325 - 3350 v75173 aThinning 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.
1 aNémeth, Gábor1 aPalágyi, Kálmán1 aBlanc-Talon, Jacques1 aPhilips, Wilfried1 aPopescu, Dan1 aScheunders, Paul1 aZemčík, Pavel uhttp://dx.doi.org/10.1007/978-3-642-33140-4_2901000nas a2200133 4500008004100000245003800041210003800079260001200117520061500129100001900744700001900763700001700782856006700799 2012 eng d00aAffine Registration of 3D Objects0 aAffine Registration of 3D Objects c2012///3 aThis is the sample implementation and benchmark dataset of the binary image registration algorithm described in the following papers: Attila Tanacs and Zoltan Kato. Fast Linear Registration of 3D Objects Segmented from Medical Images. In Proceedings of International Conference on BioMedical Engineering and Informatics, Shanghai, China, pages 299--303, October 2011. IEEE. Attila Tanacs, Joakim Lindblad, Natasa Sladoje and Zoltan Kato. Estimation of Linear Deformations of 3D Objects. In Proceedings of International Conference on Image Processing, Hong Kong, China, pp. 153-156, September 2010. IEEE.
1 aVarjas, Viktor1 aTanacs, Attila1 aKato, Zoltan uhttp://www.inf.u-szeged.hu/~kato/software/affbin3dregdemo.html02171nas a2200133 4500008004100000245005900041210005900100260006700159300000700226520166700233100001801900700002001918856009901938 2012 eng d00aArtificial intelligence methods in discrete tomography0 aArtificial intelligence methods in discrete tomography aSzegedbUniversity Szeged, Institute of InformaticscJune 2012 a163 aTomography is an imaging procedure to examine the internal structure of objects. The crosssection
images are constructed with the aid of the object’s projections. It is often necessary to
minimize the number of those projections to avoid the damage or destruction of the examined
object, since in most cases the projections are made by destructive rays.
Sometimes the number of available projections are so small that conventional methods cannot
provide satisfactory results. In these cases Discrete Tomograpy can provide acceptable solutions,
but it can only be used with the assumption the object is made of only a few materials,
thus only a small number of intensity values appear in the reconstructed cross-section image.
Although there are a lot of discrete tomographic reconstruction algorithms, only a few papers
deal with the determination of intensity values of the image, in advance. In our work we
try to fill this gap by using different learning methods. During the learning and classification
we used the projection values as input arguments.
In the second part of our talk we concentrate on Binary Tomography (a special kind of Discrete
Tomography)where it is supposed that the object is composed of onematerial. Thus, there
can be only two intensities on the cross-section image - one for the object points and one for
the background. Here, we compared our earlier presented binary tomographic evolutionary
reconstruction algorithm to two others. We present the details of the above-mentioned reconstruction
method and our experimental results. This paper is based on our previous works.
1 aGara, Mihály1 aBalázs, Péter uhttps://www.inf.u-szeged.hu/publication/artificial-intelligence-methods-in-discrete-tomography01090nas a2200169 4500008004100000245006700041210006700108260004900175300001200224520047500236100002000711700002800731700001400759700001500773700002500788856010700813 2012 eng d00aBarcode Detection with Morphological Operations and Clustering0 aBarcode Detection with Morphological Operations and Clustering aCrete, GreekbIASTED - Acta PresscJune 2012 a51 - 573 aBarcode detection has many applications and detection methods. Each application has its own requirements for speed and detection accuracy. Fine-tuning, upgrading or combining existing methods gives fast and robust solutions for detection. Modern computer vision techniques help the whole process to be fully automated. Different detection approaches are examined in this paper, and new methods are introduced.
1 aBodnár, Péter1 aNyúl, László, Gábor1 aPetrou, M1 aSappa, A D1 aTriantafyllidis, A G uhttps://www.inf.u-szeged.hu/publication/barcode-detection-with-morphological-operations-and-clustering00554nas a2200121 4500008004100000245007700041210006900118260007000187300001000257100002000267700002800287856011700315 2012 eng d00aBarcode Detection with Uniform Partitioning and Morphological Operations0 aBarcode Detection with Uniform Partitioning and Morphological Op aSzegedbUniversity of Szeged, Institute of InformaticscJune 2012 a4 - 51 aBodnár, Péter1 aNyúl, László, Gábor uhttps://www.inf.u-szeged.hu/publication/barcode-detection-with-uniform-partitioning-and-morphological-operations01221nas a2200181 4500008004100000245007800041210006900119260008200188300001400270520050400284100002000788700002000808700002300828700002300851700002500874700002200899856011800921 2012 eng d00aBinary image reconstruction from two projections and skeletal information0 aBinary image reconstruction from two projections and skeletal in aBerlin; Heidelberg; New York; London; Paris; TokyobSpringer VerlagcNov 2012 a263 - 2733 aIn 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.
1 aHantos, Norbert1 aBalázs, Péter1 aPalágyi, Kálmán1 aBarneva, Reneta, P1 aBrimkov, Valentin, E1 aAggarwal, Jake, K uhttps://www.inf.u-szeged.hu/publication/binary-image-reconstruction-from-two-projections-and-skeletal-information00601nas a2200145 4500008004100000245007100041210006900112260006000181300000700241490003300248100002000281700002000301700002300321856011100344 2012 eng d00aBinary tomography using two projections and morphological skeleton0 aBinary tomography using two projections and morphological skelet aSzegedbUniv Szeged Institute of InformaticscJune 2012 a200 vVolume of Extended Abstracts1 aHantos, Norbert1 aBalázs, Péter1 aPalágyi, Kálmán uhttps://www.inf.u-szeged.hu/publication/binary-tomography-using-two-projections-and-morphological-skeleton01188nas a2200157 4500008004100000245009700041210006900138260007600207300001400283520051000297100002000807700002400827700002300851700001900874856013700893 2012 eng d00aA central reconstruction based strategy for selecting projection angles in binary tomography0 acentral reconstruction based strategy for selecting projection a aBerlin; Heidelberg; New York; London; Paris; TokyobSpringercJune 2012 a382 - 3913 aIn this paper we propose a novel strategy for selecting projection angles in binary tomography which yields significantly more accurate reconstructions than others. In contrast with previous works which are of experimental nature, the method we present is based on theoretical observations. We report on experiments for different phantom images to show the effectiveness and roboustness of our procedure. The practically important case of noisy projections is also studied. © 2012 Springer-Verlag.
1 aBalázs, Péter1 aBatenburg, Joost, K1 aCampilho, Aurélio1 aKamel, Mohamed uhttps://www.inf.u-szeged.hu/publication/a-central-reconstruction-based-strategy-for-selecting-projection-angles-in-binary-tomography00870nas a2200217 4500008004100000245009900041210007400140260009400214300000700308100002000315700002100335700002300356700002100379700002000400700001700420700002200437700002000459700002000479700002200499856013100521 2012 eng d00aChlamydia inklúziók automatizált számolása fluoreszcens DNS-chip szkenner segítségével0 aChlamydia inklúziók automatizált számolása fluoreszcens DNSchip aSzegedbSZTE ÁOK II. sz. Belgyógyászati Klinika és Kardiológiai Központc2012.11.23 a371 aBogdanov, Anita1 aUrbán, Szabolcs1 aEndrész, Valéria1 aBurián, Katalin1 aBalázs, Péter1 aDeák, Judit1 aVirók, Dezső, P1 aForster, Tamás1 aFarkas, András1 aCsanády, Miklós uhttps://www.inf.u-szeged.hu/publication/chlamydia-inkluziok-automatizalt-szamolasa-fluoreszcens-dns-chip-szkenner-segitsegevel00604nas a2200121 4500008004100000245010700041210006900148260007000217300000700287100002100294700002000315856014700335 2012 eng d00aEmpirical studies of reconstructing hv-convex binary matrices from horizontal and vertical projections0 aEmpirical studies of reconstructing hvconvex binary matrices fro aSzegedbUniversity of Szeged, Institute of InformaticscJune 2012 a441 aOzsvár, Zoltán1 aBalázs, Péter uhttps://www.inf.u-szeged.hu/publication/empirical-studies-of-reconstructing-hv-convex-binary-matrices-from-horizontal-and-vertical-projections01133nas a2200193 4500008004100000245008800041210006900129260005500198300001400253520037300267100002700640700002000667700001600687700002800703700002400731700002600755700003000781856012800811 2012 eng d00aAn energy minimization reconstruction algorithm for multivalued discrete tomography0 aenergy minimization reconstruction algorithm for multivalued dis aLondonbCRC Press - Taylor and Frances Groupc2012 a179 - 1853 aWe propose a new algorithm for multivalued discrete tomography, that reconstructs images from few projections by approximating the minimum of a suitably constructed energy function with a deterministic optimization method. We also compare the proposed algorithm to other reconstruction techniques on software phantom images, in order to prove its applicability.
1 aVarga, László Gábor1 aBalázs, Péter1 aNagy, Antal1 aDi Giamberardino, Paolo1 aIacoviello, Daniela1 aJorge, Renato M Natal1 aTaveres, Joao, Manuel R S uhttps://www.inf.u-szeged.hu/publication/an-energy-minimization-reconstruction-algorithm-for-multivalued-discrete-tomography00550nas a2200121 4500008004100000245007800041210006900119260007000188300000700258100002500265700002000290856011800310 2012 eng d00aExtracting geometrical features of discrete images from their projections0 aExtracting geometrical features of discrete images from their pr aSzegedbUniversity of Szeged, Institute of InformaticscJune 2012 a521 aTasi, Tamás Sámuel1 aBalázs, Péter uhttps://www.inf.u-szeged.hu/publication/extracting-geometrical-features-of-discrete-images-from-their-projections01373nas a2200193 4500008004100000020002200041245010000063210006900163260005500232300001200287520059000299100001900889700002300908700002800931700002400959700002600983700003001009856014001039 2012 eng d a978-0-415-62134-200aHexagonal parallel thinning algorithms based on sufficient conditions for topology preservation0 aHexagonal parallel thinning algorithms based on sufficient condi aLondonbCRC Press - Taylor and Frances Groupc2012 a63 - 683 aThinning 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.
1 aKardos, Péter1 aPalágyi, Kálmán1 aDi Giamberardino, Paolo1 aIacoviello, Daniela1 aJorge, Renato M Natal1 aTaveres, Joao, Manuel R S uhttps://www.inf.u-szeged.hu/publication/hexagonal-parallel-thinning-algorithms-based-on-sufficient-conditions-for-topology-preservation01572nas a2200181 4500008004100000245006900041210006900110260003400179300001400213520092800227100002001155700002801175700002101203700002001224700002001244700001701264856010901281 2012 eng d00aImproving barcode detection with combination of simple detectors0 aImproving barcode detection with combination of simple detectors aNaples, ItalybIEEEcNov 2012 a300 - 3063 aBarcode detection is required in a wide range of real-life applications. Imaging conditions and techniques vary considerably and each application has its own requirements for detection speed and accuracy. In our earlier works we built barcode detectors using morphological operations and uniform partitioning with several approaches and showed their behaviour on a set of test images. In this work, we examine ensemble efficiency of those simple detectors using various aggregation methods. Using a combination of several simple features localization performance improves significantly.
1 aBodnár, Péter1 aNyúl, László, Gábor1 aYetongnon, Kokou1 aChbeir, Richard1 aDipanda, Albert1 aGallo, Luigi uhttps://www.inf.u-szeged.hu/publication/improving-barcode-detection-with-combination-of-simple-detectors01379nas a2200169 4500008004100000245005600041210005400097260004700151300001200198520082900210100001901039700002301058700001401081700001601095700002501111856007301136 2012 eng d00aIsthmus-based Order-Independent Sequential Thinning0 aIsthmusbased OrderIndependent Sequential Thinning aCrete, GreekbIASTED ACTA PresscJune 2012 a28 - 343 aThinning 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.
1 aKardos, Péter1 aPalágyi, Kálmán1 aPetrou, M1 aSappa, A, D1 aTriantafyllidis, A G uhttp://www.actapress.com/Content_of_Proceeding.aspx?proceedingID=73601366nas a2200181 4500008004100000245006900041210006900110260008200179300001400261520067500275100001800950700002500968700002000993700002001013700002301033700001901056856010901075 2012 eng d00aMachine learning as a preprocessing phase in discrete tomography0 aMachine learning as a preprocessing phase in discrete tomography aBerlin; Heidelberg; New York; London; Paris; TokyobSpringer VerlagcAug 2012 a109 - 1243 aIn this paper we investigate for two well-known machine learning methods, decision trees and neural networks, how they classify discrete images from their projections. As an example, we present classification results when the task is to guess the number of intensity values of the discrete image. Machine learning can be used in Discrete Tomography as a preprocessing step in order to choose the proper reconstruction algorithm or - with the aid of the knowledge acquired - to improve its accuracy. We also show how to design new evolutionary reconstruction methods that can exploit the information gained by machine learning classifiers. © 2012 Springer-Verlag.
1 aGara, Mihály1 aTasi, Tamás Sámuel1 aBalázs, Péter1 aKöthe, Ullrich1 aMontanvert, Annick1 aSoille, Pierre uhttps://www.inf.u-szeged.hu/publication/machine-learning-as-a-preprocessing-phase-in-discrete-tomography00617nam a2200121 4500008004100000245004700041210004700088260003800135520019700173100001700370700002100387856008700408 2012 eng d00aMarkov random fields in image segmentation0 aMarkov random fields in image segmentation aHanover, NHbNow Publishersc20123 aMarkov Random Fields in Image Segmentation introduces the fundamentals of Markovian modeling in image segmentation as well as providing a brief overview of recent advances in the field.
1 aKato, Zoltan1 aZerubia, Josiane uhttps://www.inf.u-szeged.hu/publication/markov-random-fields-in-image-segmentation01979nas a2200193 4500008004100000020002300041245008200064210006900146260003500215300001600250520128600266100001801552700001701570700001601587700002201603700001701625700002101642856012201663 2012 eng d a978-1-4673-2216-4 00aA Multi-Layer Phase Field Model for Extracting Multiple Near-Circular Objects0 aMultiLayer Phase Field Model for Extracting Multiple NearCircula aTsukuba, JapanbIEEEcNov 2012 a1427 - 14303 aThis paper proposes a functional that assigns low `energy' to sets of subsets of the image domain consisting of a number of possibly overlapping near-circular regions of approximately a given radius: a `gas of circles'. The model can be used as a prior for object extraction whenever the objects conform to the `gas of circles' geometry, e.g. cells in biological images. Configurations are represented by a multi-layer phase field. Each layer has an associated function, regions being defined by thresholding. Intra-layer interactions assign low energy to configurations consisting of non-overlapping near-circular regions, while overlapping regions are represented in separate layers. Inter-layer interactions penalize overlaps. Here we present a theoretical and experimental analysis of the model.
1 aMolnar, Csaba1 aKato, Zoltan1 aJermyn, Ian1 aEklundh, Jan-Olof1 aOhta, Yuichi1 aTanimoto, Steven uhttps://www.inf.u-szeged.hu/publication/a-multi-layer-phase-field-model-for-extracting-multiple-near-circular-objects01673nas a2200169 4500008004100000020001400041245005700055210005700112260001500169300001400184490000700198520116800205100001901373700001901392700001701411856007501428 2012 eng d a0162-882800aNonlinear Shape Registration without Correspondences0 aNonlinear Shape Registration without Correspondences bIEEEc2012 a943 - 9580 v343 aIn this paper, we propose a novel framework to estimate the parameters of a diffeomorphism that aligns a known shape and its distorted observation. Classical registration methods first establish correspondences between the shapes and then compute the transformation parameters from these landmarks. Herein, we trace back the problem to the solution of a system of nonlinear equations which directly gives the parameters of the aligning transformation. The proposed method provides a generic framework to recover any diffeomorphic deformation without established correspondences. It is easy to implement, not sensitive to the strength of the deformation, and robust against segmentation errors. The method has been applied to several commonly used transformation models. The performance of the proposed framework has been demonstrated on large synthetic data sets as well as in the context of various applications.
1 aDomokos, Csaba1 aNemeth, Jozsef1 aKato, Zoltan uhttp://www.inf.u-szeged.hu/~kato/papers/TPAMI-2010-03-0146.R2_Kato.pdf02235nas a2200193 4500008004100000020002300041245009400064210006900158260003400227300001400261520150600275100002001781700002801801700002101829700002001850700002001870700001701890856013401907 2012 eng d a978-1-4673-5152-2 00aA novel method for accurate and efficient barcode detection with morphological operations0 anovel method for accurate and efficient barcode detection with m aNaples, ItalybIEEEcNov 2012 a307 - 3143 aBarcode technology is the pillar of automatic identification, that is used in a wide range of real-time applications with various types of codes. The different types of codes and applications impose special problems, so there is a continuous need for solutions with improved effectiveness. There are several methods for barcode localization, that are well characterized by accuracy and speed. Particularly, high-speed processing places need automatic barcode localization, e.g. conveyor belts, automated production, where missed detections cause loss of profit. In this paper, we mainly deal with segmentation of images with 1D barcode, but also analyze the operation of different methods for 2D barcode images as well. Our goal is to detect automatically, rapidly and accurately the barcode location by the help of extracted features. We compare some published method from the literature, which basically rely on the contrast between the background and the shape that represent the code. We also propose a novel algorithm, that outperforms the others in both accuracy and efficiency in detecting 1D codes.
1 aKatona, Melinda1 aNyúl, László, Gábor1 aYetongnon, Kokou1 aChbeir, Richard1 aDipanda, Albert1 aGallo, Luigi uhttps://www.inf.u-szeged.hu/publication/a-novel-method-for-accurate-and-efficient-barcode-detection-with-morphological-operations00608nas a2200133 4500008004100000245009200041210006900133260007000202300000700272100002700279700002000306700001600326856013200342 2012 eng d00aA novel optimization-based reconstruction algorithm for multivalued discrete tomography0 anovel optimizationbased reconstruction algorithm for multivalued aSzegedbUniversity of Szeged, Institute of InformaticscJune 2012 a571 aVarga, László Gábor1 aBalázs, Péter1 aNagy, Antal uhttps://www.inf.u-szeged.hu/publication/a-novel-optimization-based-reconstruction-algorithm-for-multivalued-discrete-tomography00581nas a2200133 4500008004100000245008700041210006900128260004800197300001200245100002700257700002000284700001600304856012700320 2012 eng d00aAn optimization-based reconstruction algorithm for multivalued discrete tomography0 aoptimizationbased reconstruction algorithm for multivalued discr aVeszprémbUniversity of PannoniacDec 2012 a39 - 401 aVarga, László Gábor1 aBalázs, Péter1 aNagy, Antal uhttps://www.inf.u-szeged.hu/publication/an-optimization-based-reconstruction-algorithm-for-multivalued-discrete-tomography01390nas a2200157 4500008004100000020002300041245004700064210004400111260003400155300001400189520091000203100001901113700002301132700000501155856007201160 2012 eng d a978-1-4673-5187-4 00aOn Order–Independent Sequential Thinning0 aOrder–Independent Sequential Thinning aKosice, Slovakia bIEEEc2012 a149 - 1543 aThe 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.
1 aKardos, Péter1 aPalágyi, Kálmán1 a uhttp://ieeexplore.ieee.org/xpl/mostRecentIssue.jsp?punumber=641330502317nas a2200169 4500008004100000020002200041245009300063210006900156260007100225300001400296520160900310100002601919700001801945700001701963700003401980856013302014 2012 eng d a978-1-4419-6189-100aParametric Stochastic Modeling for Color Image Segmentation and Texture Characterization0 aParametric Stochastic Modeling for Color Image Segmentation and aBerlin; Heidelberg; New York; London; Paris; TokyobSpringerc2012 a279 - 3253 aBlack should be made a color of light Clemence Boulouque
Parametric stochastic models offer the definition of color and/or texture features based on model parameters, which is of interest for color texture classification, segmentation and synthesis.
In this chapter, distribution of colors in the images through various parametric approximations including multivariate Gaussian distribution, multivariate Gaussian mixture models (MGMM) and Wishart distribution, is discussed. In the context of Bayesian color image segmentation, various aspects of sampling from the posterior distributions to estimate the color distribution from MGMM and the label field, using different move types are also discussed. These include reversible jump mechanism from MCMC methodology. Experimental results on color images are presented and discussed.
Then, we give some materials for the description of color spatial structure using Markov Random Fields (MRF), and more particularly multichannel GMRF, and multichannel linear prediction models. In this last approach, two dimensional complex multichannel versions of both causal and non-causal models are discussed to perform the simultaneous parametric power spectrum estimation of the luminance and the chrominance channels of the color image. Application of these models to the classification and segmentation of color texture images is also illustrated.
1 aQazi, Imtnan-Ul-Haque1 aAlata, Oliver1 aKato, Zoltan1 aFernandez-Maloigne, Christine uhttps://www.inf.u-szeged.hu/publication/parametric-stochastic-modeling-for-color-image-segmentation-and-texture-characterization01180nas a2200181 4500008004100000245008800041210006900129260004700198300001400245520049500259100002500754700001600779700002000795700001400815700001600829700002500845856012800870 2012 eng d00aPerimeter estimation of some discrete sets from horizontal and vertical projections0 aPerimeter estimation of some discrete sets from horizontal and v aCrete, GreekbIASTED ACTA PresscJune 2012 a174 - 1813 aIn this paper, we design neural networks to estimate the perimeter of simple and more complex discrete sets from their horizontal and vertical projections. The information extracted this way can be useful to simplify the problem of reconstructing the discrete set from its projections, which task is in focus of discrete tomography. Beside presenting experimental results with neural networks, we also reveal some statistical properties of the perimeter of the studied discrete sets.
1 aTasi, Tamás Sámuel1 aHegedűs, M1 aBalázs, Péter1 aPetrou, M1 aSappa, A, D1 aTriantafyllidis, A G uhttps://www.inf.u-szeged.hu/publication/perimeter-estimation-of-some-discrete-sets-from-horizontal-and-vertical-projections01249nas a2200181 4500008004100000020002300041245005600064210005600120260003500176300001100211520065300222100001900875700001700894700002200911700001700933700002100950856009600971 2012 eng d a978-1-4673-2216-4 00aSimultaneous Affine Registration of Multiple Shapes0 aSimultaneous Affine Registration of Multiple Shapes aTsukuba, JapanbIEEEcNov 2012 a9 - 123 aThe problem of simultaneously estimating affine deformations between multiple objects occur in many applications. Herein, a direct method is proposed which provides the result as a solution of a linear system of equations without establishing correspondences between the objects. The key idea is to construct enough linearly independent equations using covariant functions, and then finding the solution simultaneously for all affine transformations. Quantitative evaluation confirms the performance of the method.
1 aDomokos, Csaba1 aKato, Zoltan1 aEklundh, Jan-Olof1 aOhta, Yuichi1 aTanimoto, Steven uhttps://www.inf.u-szeged.hu/publication/simultaneous-affine-registration-of-multiple-shapes00552nas a2200133 4500008004100000245007500041210006900116260004800185300000700233100002000240700002000260700002300280856011500303 2012 eng d00aSolving binary tomography from morphological skeleton via optimization0 aSolving binary tomography from morphological skeleton via optimi aVeszprémbUniversity of PannoniacDec 2012 a421 aHantos, Norbert1 aBalázs, Péter1 aPalágyi, Kálmán uhttps://www.inf.u-szeged.hu/publication/solving-binary-tomography-from-morphological-skeleton-via-optimization03162nas a2200265 4500008004100000020002300041245008800064210006900152260003500221300001600256520231800272100001802590700001702608700001802625700001902643700001902662700001902681700001802700700002102718700002402739700002202763700001702785700002102802856007302823 2012 eng d a978-1-4673-2216-4 00aSpectral clustering to model deformations for fast multimodal prostate registration0 aSpectral clustering to model deformations for fast multimodal pr aTsukuba, JapanbIEEEcNov 2012 a2622 - 26253 aThis paper proposes a method to learn deformation parameters off-line for fast multimodal registration of ultrasound and magnetic resonance prostate images during ultrasound guided needle biopsy. The registration method involves spectral clustering of the deformation parameters obtained from a spline-based nonlinear diffeomorphism between training magnetic resonance and ultrasound prostate images. The deformation models built from the principal eigen-modes of the clusters are then applied on a test magnetic resonance image to register with the test ultrasound prostate image. The deformation model with the least registration error is finally chosen as the optimal model for deformable registration. The rationale behind modeling deformations is to achieve fast multimodal registration of prostate images while maintaining registration accuracies which is otherwise computationally expensive. The method is validated for 25 patients each with a pair of corresponding magnetic resonance and ultrasound images in a leave-one-out validation framework. The average registration accuracies i.e. Dice similarity coefficient of 0.927 ± 0.025, 95% Hausdorff distance of 5.14 ± 3.67 mm and target registration error of 2.44 ± 1.17 mm are obtained by our method with a speed-up in computation time by 98% when compared to Mitra et al. [7].
1 aMitra, Jhimli1 aKato, Zoltan1 aGhose, Soumya1 aSidibe, Desire1 aMartí, Robert1 aLladó, Xavier1 aArnau, Oliver1 aVilanova, Joan C1 aMeriaudeau, Fabrice1 aEklundh, Jan-Olof1 aOhta, Yuichi1 aTanimoto, Steven uhttp://hal.archives-ouvertes.fr/docs/00/71/09/43/PDF/ICPR_Jhimli.pdf02351nas a2200253 4500008004100000020001400041245008300055210006900138260001300207300001600220490000700236520154200243100001801785700001701803700001901820700001801839700001901857700001901876700001801895700002101913700001701934700002401951856012201975 2012 eng d a1361-841500aA spline-based non-linear diffeomorphism for multimodal prostate registration.0 asplinebased nonlinear diffeomorphism for multimodal prostate reg cAug 2012 a1259 - 12790 v163 aThis paper presents a novel method for non-rigid registration of transrectal ultrasound and magnetic resonance prostate images based on a non-linear regularized framework of point correspondences obtained from a statistical measure of shape-contexts. The segmented prostate shapes are represented by shape-contexts and the Bhattacharyya distance between the shape representations is used to find the point correspondences between the 2D fixed and moving images. The registration method involves parametric estimation of the non-linear diffeomorphism between the multimodal images and has its basis in solving a set of non-linear equations of thin-plate splines. The solution is obtained as the least-squares solution of an over-determined system of non-linear equations constructed by integrating a set of non-linear functions over the fixed and moving images. However, this may not result in clinically acceptable transformations of the anatomical targets. Therefore, the regularized bending energy of the thin-plate splines along with the localization error of established correspondences should be included in the system of equations. The registration accuracies of the proposed method are evaluated in 20 pairs of prostate mid-gland ultrasound and magnetic resonance images. The results obtained in terms of Dice similarity coefficient show an average of 0.980+/-0.004, average 95% Hausdorff distance of 1.63+/-0.48mm and mean target registration and target localization errors of 1.60+/-1.17mm and 0.15+/-0.12mm respectively.
1 aMitra, Jhimli1 aKato, Zoltan1 aMartí, Robert1 aArnau, Oliver1 aLladó, Xavier1 aSidibe, Desire1 aGhose, Soumya1 aVilanova, Joan C1 aComet, Josep1 aMeriaudeau, Fabrice uhttps://www.inf.u-szeged.hu/publication/a-spline-based-non-linear-diffeomorphism-for-multimodal-prostate-registration01134nas a2200181 4500008004100000020002200041245006400063210006100127260004700188300001400235520048800249100001900737700002300756700002300779700002400802700002200826856010400848 2012 eng d a978-3-642-34731-300aOn topology preservation for triangular thinning algorithms0 atopology preservation for triangular thinning algorithms aAustin, TX, USAbSpringer VerlagcNov 2012 a128 - 1423 aThinning 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.
1 aKardos, Péter1 aPalágyi, Kálmán1 aBarneva, Reneta, P1 aBrimkov, Valentin E1 aAggarwal, Jake, K uhttps://www.inf.u-szeged.hu/publication/on-topology-preservation-for-triangular-thinning-algorithms01191nas a2200181 4500008004100000020002200041245005600063210005600119260002600175300001400201520058900215100002300804700002000827700001900847700002400866700002300890856009600913 2012 eng d a978-94-007-4173-700aTopology Preserving Parallel 3D Thinning Algorithms0 aTopology Preserving Parallel 3D Thinning Algorithms bSpringer-Verlagc2012 a165 - 1883 aA 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.
1 aPalágyi, Kálmán1 aNémeth, Gábor1 aKardos, Péter1 aBrimkov, Valentin E1 aBarneva, Reneta, P uhttps://www.inf.u-szeged.hu/publication/topology-preserving-parallel-3d-thinning-algorithms01359nas a2200145 4500008004100000020002200041245007200063210006900135260004900204300001400253520079400267100001701061700002301078856011201101 2012 eng d a978-3-642-31294-600aA Unifying Framework for Correspondence-less Linear Shape Alignment0 aUnifying Framework for Correspondenceless Linear Shape Alignment aAveiro, PortugalbSpringer VerlagcJune 2012 a277 - 2843 aWe consider the estimation of linear transformations aligning a known binary shape and its distorted observation. The classical way to solve this registration problem is to find correspondences between the two images and then compute the transformation parameters from these landmarks. Here we propose a unified framework where the exact transformation is obtained as the solution of either a polynomial or a linear system of equations without establishing correspondences. The advantages of the proposed solutions are that they are fast, easy to implement, have linear time complexity, work without landmark correspondences and are independent of the magnitude of transformation.
1 aKato, Zoltan1 aCampilho, Aurélio uhttps://www.inf.u-szeged.hu/publication/a-unifying-framework-for-correspondence-less-linear-shape-alignment01488nas a2200145 4500008004100000020002300041245006700064210006400131260003800195300001400233520099700247100001701244700001701261856006401278 2012 eng d a978-1-4673-5187-4 00aA Unifying Framework for Non-linear Registration of 3D Objects0 aUnifying Framework for Nonlinear Registration of 3D Objects aKosice, Slovakia bIEEEcDec 2012 a547 - 5523 aAn extension of our earlier work is proposed to find a non-linear aligning transformation between a pair of deformable 3D objects. The basic idea is to set up a system of nonlinear equations whose solution directly provides the parameters of the aligning transformation. Each equation is generated by integrating a nonlinear function over the object's domains. Thus the number of equations is determined by the number of adopted nonlinear functions yielding a flexible mechanism to generate sufficiently many equations. While classical approaches would establish correspondences between the shapes, our method works without landmarks. Experiments with 3D polynomial and thin plate spline deformations confirm the performance of the framework.
1 aSanta, Zsolt1 aKato, Zoltan uhttp://www.inf.u-szeged.hu/~kato/papers/coginfocomm2012.pdf01310nas a2200181 4500008004100000020002300041245006600064210006500130260004000195300001400235520067200249100002000921700002300941700002100964700002200985700001501007856010601022 2011 eng d a978-1-4577-0841-1 00a2D Parallel Thinning Algorithms Based on Isthmus-Preservation0 a2D Parallel Thinning Algorithms Based on IsthmusPreservation aDubrovnik, CroatiabIEEEcSep 2011 a585 - 5903 aSkeletons 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.
1 aNémeth, Gábor1 aPalágyi, Kálmán1 aLončarić, Sven1 aRamponi, Giovanni1 aSersic, D. uhttps://www.inf.u-szeged.hu/publication/2d-parallel-thinning-algorithms-based-on-isthmus-preservation01305nas a2200169 4500008004100000020001400041245009600055210006900151260006500220300001400285490000700299520063100306100002000937700001900957700002300976856013600999 2011 eng d a0324-721X00a2D parallel thinning and shrinking based on sufficient conditions for topology preservation0 a2D parallel thinning and shrinking based on sufficient condition aSzegedbUniversity of Szeged, Institute of Informaticsc2011 a125 - 1440 v203 aThinning 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.
1 aNémeth, Gábor1 aKardos, Péter1 aPalágyi, Kálmán uhttps://www.inf.u-szeged.hu/publication/2d-parallel-thinning-and-shrinking-based-on-sufficient-conditions-for-topology-preservation00572nas a2200169 4500008004100000245005500041210005500096260002800151300001400179100001900193700002100212700002100233700001700254700001700271700002300288856009100311 2011 eng d00a3D objektumok lineáris deformációinak becslése0 a3D objektumok lineáris deformációinak becslése aSzegedbNJSZTcJan 2011 a471 - 4801 aTanacs, Attila1 aLindblad, Joakim1 aSladoje, Nataša1 aKato, Zoltan1 aKato, Zoltan1 aPalágyi, Kálmán uhttps://www.inf.u-szeged.hu/publication/3d-objektumok-linearis-deformacioinak-becslese00524nas a2200145 4500008004100000245008900041210007300130260002800203300001400231100001900245700001700264700001700281700002300298856005700321 2011 eng d00aAffin Puzzle: Deformált objektumdarabok helyreállítása megfeleltetések nélkül0 aAffin Puzzle Deformált objektumdarabok helyreállítása megfelelte aSzegedbNJSZTcJan 2011 a206 - 2201 aDomokos, Csaba1 aKato, Zoltan1 aKato, Zoltan1 aPalágyi, Kálmán uhttp://www.inf.u-szeged.hu/kepaf2011/pdfs/S05_03.pdf00582nas a2200145 4500008004100000245008300041210007500124260002800199300001400227100001800241700002000259700001700279700002300296856011700319 2011 eng d00aBináris tomográfiai rekonstrukció objektum alapú evolúciós algoritmussal0 aBináris tomográfiai rekonstrukció objektum alapú evolúciós algor aSzegedbNJSZTcJan 2011 a117 - 1271 aGara, Mihály1 aBalázs, Péter1 aKato, Zoltan1 aPalágyi, Kálmán uhttps://www.inf.u-szeged.hu/publication/binaris-tomografiai-rekonstrukcio-objektum-alapu-evolucios-algoritmussal00427nas a2200133 4500008004100000020001400041245005100055210005100106260000900157300000600166490000700172100002300179856009100202 2011 eng d a0324-721X00aConference of PhD Students in Computer Science0 aConference of PhD Students in Computer Science c2011 a30 v201 aPalágyi, Kálmán uhttps://www.inf.u-szeged.hu/publication/conference-of-phd-students-in-computer-science01423nas a2200169 4500008004100000020001400041245007300055210006900128260001300197300001400210490000700224520084600231100002701077700002001104700001601124856011301140 2011 eng d a1524-070300aDirection-dependency of binary tomographic reconstruction algorithms0 aDirectiondependency of binary tomographic reconstruction algorit cNov 2011 a365 - 3750 v733 aIn this work we study the relation between the quality of a binary tomographic reconstruction and the choice of angles of the projections. We conduct experiments on a set of software phantoms by reconstructing them from different projection sets using three different discrete tomography reconstruction algorithms, and compare the accuracy of the corresponding reconstructions with suitable approaches. To validate our results for possible real-world applications, we conduct the experiments by adding random noise of different characteristics to the simulated projection data, and by applying small topological changes on the phantom images as well. In addition, we also discuss some consequences of the angle-selection dependency and possible practical applications arising from the field of non-destructive testing, too.
1 aVarga, László Gábor1 aBalázs, Péter1 aNagy, Antal uhttps://www.inf.u-szeged.hu/publication/direction-dependency-of-binary-tomographic-reconstruction-algorithms00689nas a2200205 4500008004100000245009700041210008000138260002800218300001400246100001700260700001700277700001600294700001700310700001900327700002000346700002000366700001700386700002300403856005700426 2011 eng d00aÉlősejt szegmentálása gráfvágás segítségével fluoreszcenciás mikroszkóp képeken0 aÉlősejt szegmentálása gráfvágás segítségével fluoreszcenciás mik aSzegedbNJSZTcJan 2011 a319 - 3281 aLesko, Milan1 aKato, Zoltan1 aNagy, Antal1 aGombos, Imre1 aTörök, Zsolt1 aVígh, László1 aVígh, László1 aKato, Zoltan1 aPalágyi, Kálmán uhttp://www.inf.u-szeged.hu/kepaf2011/pdfs/S08_02.pdf01818nas a2200217 4500008004100000020002200041245008300063210006900146260004500215300001200260520102200272100002001294700001901314700002301333700002201356700002301378700002401401700002801425700002401453856012301477 2011 eng d a978-3-642-21072-300aA family of topology-preserving 3d parallel 6-subiteration thinning algorithms0 afamily of topologypreserving 3d parallel 6subiteration thinning aMadrid, SpainbSpringer VerlagcMay 2011 a17 - 303 aThinning 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.
1 aNémeth, Gábor1 aKardos, Péter1 aPalágyi, Kálmán1 aAggarwal, Jake, K1 aBarneva, Reneta, P1 aBrimkov, Valentin E1 aKoroutchev, Kostadin, N1 aKorutcheva, Elka, R uhttps://www.inf.u-szeged.hu/publication/a-family-of-topology-preserving-3d-parallel-6-subiteration-thinning-algorithms01274nas a2200205 4500008004100000020002300041245007300064210006900137260002900206300001400235520058300249100001900832700001700851700002000868700001900888700001400907700001900921700001500940856011300955 2011 eng d a978-1-4244-9351-7 00aFast linear registration of 3D objects segmented from medical images0 aFast linear registration of 3D objects segmented from medical im aShanghaibIEEEcOct 2011 a294 - 2983 aIn this paper a linear registration framework is used for medical image registration using segmented binary objects. The method is best suited for problems where the segmentation is available, but we also propose a general bone segmentation approach for CT images. We focus on the case when the objects to be registered differ considerably because of segmentation errors. We check the applicability of the method to bone segmentation of pelvic and thoracic CT images. Comparison is also made against a classical mutual information-based registration method. © 2011 IEEE.
1 aTanacs, Attila1 aKato, Zoltan1 aDing, Yongsheng1 aPeng, Yonghong1 aShi, Riyi1 aHao, Kuangrong1 aWang, Lipo uhttps://www.inf.u-szeged.hu/publication/fast-linear-registration-of-3d-objects-segmented-from-medical-images00332nam a2200097 4500008004100000245003400041210003400075260003500109100001600144856007400160 2011 eng d00aFejlett Grafikai Algoritmusok0 aFejlett Grafikai Algoritmusok aBudapestbTypotex Kiadóc20111 aNagy, Antal uhttps://www.inf.u-szeged.hu/publication/fejlett-grafikai-algoritmusok00520nas a2200157 4500008004100000245006000041210006000101260002800161300001400189100001900203700002000222700002300242700001700265700002300282856005700305 2011 eng d00aIterációnkénti simítással kombinált vékonyítás0 aIterációnkénti simítással kombinált vékonyítás aSzegedbNJSZTcJan 2011 a174 - 1891 aKardos, Péter1 aNémeth, Gábor1 aPalágyi, Kálmán1 aKato, Zoltan1 aPalágyi, Kálmán uhttp://www.inf.u-szeged.hu/kepaf2011/pdfs/S05_01.pdf00326nam a2200097 4500008004100000245003300041210003300074260002800107100002300135856007000158 2011 eng d00aKépfeldolgozás haladóknak0 aKépfeldolgozás haladóknak aBudapestbTypotexc20111 aPalágyi, Kálmán uhttps://www.inf.u-szeged.hu/publication/kepfeldolgozas-haladoknak00332nam a2200109 4500008004100000245002300041210002300064260003500087100002000122700001900142856006100161 2011 eng d00aKéprekonstrukció0 aKéprekonstrukció aBudapestbTypotex Kiadóc20111 aBalázs, Péter1 aJuhász, Lehel uhttps://www.inf.u-szeged.hu/publication/keprekonstrukcio00559nas a2200145 4500008004100000245007200041210007200113260002800185300001400213100002000227700002000247700001700267700002300284856010600307 2011 eng d00aMediánszűrés alkalmazása algebrai rekonstrukciós módszerekben0 aMediánszűrés alkalmazása algebrai rekonstrukciós módszerekben aSzegedbNJSZTcJan 2011 a106 - 1161 aHantos, Norbert1 aBalázs, Péter1 aKato, Zoltan1 aPalágyi, Kálmán uhttps://www.inf.u-szeged.hu/publication/medianszures-alkalmazasa-algebrai-rekonstrukcios-modszerekben00545nas a2200145 4500008004100000245007400041210006900115260003000184490000900214100001600223700001900239700002800258700001400286856009900300 2011 eng d00aMIPPR 2011: Multispectral Image Acquisition, Processing, and Analysis0 aMIPPR 2011 Multispectral Image Acquisition Processing and Analys aGuilin, ChinabSPIEc20110 v80021 aCao, Zhigou1 aFenster, Aaron1 aNyúl, László, Gábor1 aCai, Chao uhttps://www.inf.u-szeged.hu/mippr-2011-multispectral-image-acquisition-processing-and-analysis01714nas a2200217 4500008004100000020002200041245011700063210006900180260004600249300001400295520093900309100001901248700001701267700001601284700002501300700002201325700001701347700002101364700002301385856008801408 2011 eng d a978-3-642-23686-000aA Multi-Layer 'Gas of Circles' Markov Random Field Model for the Extraction of Overlapping Near-Circular Objects0 aMultiLayer Gas of Circles Markov Random Field Model for the Extr aGhent, BelgiumbSpringer-VerlagcAug 2011 a171 - 1823 aWe propose a multi-layer binary Markov random field (MRF) model that assigns high probability to object configurations in the image domain consisting of an unknown number of possibly touching or overlapping near-circular objects of approximately a given size. Each layer has an associated binary field that specifies a region corresponding to objects. Overlapping objects are represented by regions in different layers. Within each layer, long-range interactions favor connected components of approximately circular shape, while regions in different layers that overlap are penalized. Used as a prior coupled with a suitable data likelihood, the model can be used for object extraction from images, e.g. cells in biological images or densely-packed tree crowns in remote sensing images. We present a theoretical and experimental analysis of the model, and demonstrate its performance on various synthetic and biomedical images.
1 aNemeth, Jozsef1 aKato, Zoltan1 aJermyn, Ian1 aBlanc-Talon, Jacques1 aPhilips, Wilfried1 aPopescu, Dan1 aScheunders, Paul1 aKleihorst, Richard uhttp://www.inf.u-szeged.hu/ipcg/publications/Year/2011.complete.xml#Nemeth-etal201102227nas a2200217 4500008004100000020002300041245007800064210006900142260003200211300001200243520148200255100001801737700001701755700001901772700001801791700001901809700001801828700002101846700002401867856011801891 2011 eng d a978-1-4577-2006-2 00aA non-linear diffeomorphic framework for prostate multimodal registration0 anonlinear diffeomorphic framework for prostate multimodal regist aNoosa, QLD bIEEEcDec 2011 a31 - 363 aThis paper presents a novel method for non-rigid registration of prostate multimodal images based on a nonlinear framework. The parametric estimation of the non-linear diffeomorphism between the 2D fixed and moving images has its basis in solving a set of non-linear equations of thin-plate splines. The regularized bending energy of the thin-plate splines along with the localization error of established correspondences is jointly minimized with the fixed and transformed image difference, where, the transformed image is represented by the set of non-linear equations defined over the moving image. The traditional thin-plate splines with established correspondences may provide good registration of the anatomical targets inside the prostate but may fail to provide improved contour registration. On the contrary, the proposed framework maintains the accuracy of registration in terms of overlap due to the non-linear thinplate spline functions while also producing smooth deformations of the anatomical structures inside the prostate as a result of established corrspondences. The registration accuracies of the proposed method are evaluated in 20 pairs of prostate midgland ultrasound and magnetic resonance images in terms of Dice similarity coefficient with an average of 0.982 ± 0.004, average 95% Hausdorff distance of 1.54 ± 0.46 mm and mean target registration and target localization errors of 1.90±1.27 mm and 0.15 ± 0.12 mm respectively. © 2011 IEEE.
1 aMitra, Jhimli1 aKato, Zoltan1 aMartí, Robert1 aArnau, Oliver1 aLladó, Xavier1 aGhose, Soumya1 aVilanova, Joan C1 aMeriaudeau, Fabrice uhttps://www.inf.u-szeged.hu/publication/a-non-linear-diffeomorphic-framework-for-prostate-multimodal-registration00956nas a2200145 4500008004100000245005700041210005700098260001200155520048800167100002900655700001900684700001900703700001700722856007100739 2011 eng d00aNonlinear Shape Registration without Correspondences0 aNonlinear Shape Registration without Correspondences c2011///3 aThis is the sample implementation and benchmark dataset of the nonlinear registration of 2D shapes described in the following papers: Csaba Domokos, Jozsef Nemeth, and Zoltan Kato. Nonlinear Shape Registration without Correspondences. IEEE Transactions on Pattern Analysis and Machine Intelligence, 34(5):943--958, May 2012. Note that the current demo program implements only planar homography deformations. Other deformations can be easily implemented based on the demo code.
1 aTörök, Zoltán Kornél1 aDomokos, Csaba1 aNemeth, Jozsef1 aKato, Zoltan uhttp://www.inf.u-szeged.hu/~kato/software/planarhombinregdemo.html01090nas a2200157 4500008004100000245006600041210006500107260004900172300001400221520051000235100001900745700002300764700002300787700001600810856010600826 2011 eng d00aOrder-independent sequential thinning in arbitrary dimensions0 aOrderindependent sequential thinning in arbitrary dimensions aCrete, GreekbIASTED - Acta PresscJune 2011 a129 - 1343 aSkeletons 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.
1 aKardos, Péter1 aPalágyi, Kálmán1 aAndreadis, Ioannis1 aZervakis, M uhttps://www.inf.u-szeged.hu/publication/order-independent-sequential-thinning-in-arbitrary-dimensions00552nas a2200133 4500008004100000245008200041210007600123260003500199300001300234100001900247700002100266700001900287856011200306 2011 hun d00aOrvosi képfeldolgozás, Orvosi algoritmusok, Távérzékelés, mikroszkópia0 aOrvosi képfeldolgozás Orvosi algoritmusok Távérzékelés mikroszkó aBudapestbTypotex Kiadóc2011 a57 - 1051 aTanacs, Attila1 aCzúni, László1 aTanacs, Attila uhttps://www.inf.u-szeged.hu/publication/orvosi-kepfeldolgozas-orvosi-algoritmusok-taverzekeles-mikroszkopia00455nas a2200097 4500008004100000245007300041210006900114260004200183100001900225856011300244 2011 eng d00aParametric Estimation of Affine Deformations without Correspondences0 aParametric Estimation of Affine Deformations without Corresponde aSzeged, HungarybUniversity of Szeged1 aDomokos, Csaba uhttps://www.inf.u-szeged.hu/publication/parametric-estimation-of-affine-deformations-without-correspondences01790nas a2200169 4500008004100000020001400041245005700055210005700112260006500169300001400234490000700248520120500255100002701460700002001487700001601507856009701523 2011 eng d a0324-721X00aProjection selection dependency in binary tomography0 aProjection selection dependency in binary tomography aSzegedbUniversity of Szeged, Institute of Informaticsc2011 a167 - 1870 v203 aIt has already been shown that the choice of projection angles can significantly influence the quality of reconstructions in discrete tomography. In this contribution we summarize and extend the previous results by explaining and demonstrating tile effects of projection selection dependency, in a set of experimental software tests. We perform reconstructions of software phantoms, by using different binary tomography reconstruction algorithms, from different equiangular and non-equiangular projections sets, under various conditions (i.e., when the objects to be reconstructed undergo slight topological changes, or the projection data is affected by noise) and compare the results with suitable approaches. Based on our observations, we reveal regularities in the resulting data and discuss possible consequences of such projection selection dependency in binary tomography.
1 aVarga, László Gábor1 aBalázs, Péter1 aNagy, Antal uhttps://www.inf.u-szeged.hu/publication/projection-selection-dependency-in-binary-tomography00860nas a2200133 4500008004100000245007200041210006900113260002500182300001100207490000700218520037000225100001900595856011200614 2011 eng d00aSufficient conditions for order-independency in sequential thinning0 aSufficient conditions for orderindependency in sequential thinni bUniversity of Szeged a87-1000 v203 aThe main issue of this paper is to introduce some conditions for template-based sequential thinning that are capable of producing the same skeleton for a given binary image, independent of the visiting order of object points. As an example, we introduce two order-independent thinning algorithms for 2D binary images that satisfy these conditions.
1 aKardos, Péter uhttps://www.inf.u-szeged.hu/publication/sufficient-conditions-for-order-independency-in-sequential-thinning00345nam a2200109 4500008004100000245002900041210002900070260003500099100001700134700002100151856006300172 2011 hun d00aSzámítógépes látás0 aSzámítógépes látás aBudapestbTypotex Kiadóc20111 aKato, Zoltan1 aCzúni, László uhttps://www.inf.u-szeged.hu/publication/szamitogepes-latas00649nas a2200145 4500008004100000245009900041210007200140260005900212300001400271100002000285700002400305700001900329700002000348856013500368 2011 hun d00aTehetséggondozó program a Szegedi Tudományegyetem Informatikai Tanszékcsoport BSc szakjain0 aTehetséggondozó program a Szegedi Tudományegyetem Informatikai T aDebrecenbDebreceni Egyetem Informatikai KarcAug 2011 a905 - 9121 aBalázs, Péter1 aNémeth, Zoltán, L1 aCser, László1 aHerdon, Miklós uhttps://www.inf.u-szeged.hu/publication/tehetseggondozo-program-a-szegedi-tudomanyegyetem-informatikai-tanszekcsoport-bsc-szakjain01086nas a2200169 4500008004100000020001400041245008100055210006900136260001300205300001400218490000700232520049400239100002000733700001900753700002300772856012100795 2011 eng d a1524-070300aThinning combined with iteration-by-iteration smoothing for 3D binary images0 aThinning combined with iterationbyiteration smoothing for 3D bin cNov 2011 a335 - 3450 v733 aIn 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.
1 aNémeth, Gábor1 aKardos, Péter1 aPalágyi, Kálmán uhttps://www.inf.u-szeged.hu/publication/thinning-combined-with-iteration-by-iteration-smoothing-for-3d-binary-images00578nas a2200157 4500008004100000245010100041210007700142260002800219300001400247100002000261700001900281700002300300700001700323700002300340856005700363 2011 hun d00aA topológia-megőrzés elegendő feltételein alapuló 3D párhuzamos vékonyító algoritmusok0 atopológiamegőrzés elegendő feltételein alapuló 3D párhuzamos vék aSzegedbNJSZTcJan 2011 a190 - 2051 aNémeth, Gábor1 aKardos, Péter1 aPalágyi, Kálmán1 aKato, Zoltan1 aPalágyi, Kálmán uhttp://www.inf.u-szeged.hu/kepaf2011/pdfs/S05_02.pdf01286nas a2200205 4500008004100000020002200041245007200063210006900135260004500204300001200249520054400261100001900805700002300824700002200847700002300869700002400892700002800916700002400944856011200968 2011 eng d a978-3-642-21072-300aOn topology preservation for hexagonal parallel thinning algorithms0 atopology preservation for hexagonal parallel thinning algorithms aMadrid, SpainbSpringer VerlagcMay 2011 a31 - 423 aTopology 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.
1 aKardos, Péter1 aPalágyi, Kálmán1 aAggarwal, Jake, K1 aBarneva, Reneta, P1 aBrimkov, Valentin E1 aKoroutchev, Kostadin, N1 aKorutcheva, Elka, R uhttps://www.inf.u-szeged.hu/publication/on-topology-preservation-for-hexagonal-parallel-thinning-algorithms01129nas a2200157 4500008004100000020001400041245005300055210005300108260003800161300001200199490000700211520061700218100002000835700002300855856009300878 2011 eng d a0899-945700aTopology Preserving Parallel Thinning Algorithms0 aTopology Preserving Parallel Thinning Algorithms bWiley Periodicals, Inc.cFeb 2011 a37 - 440 v213 aThinning 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.
1 aNémeth, Gábor1 aPalágyi, Kálmán uhttps://www.inf.u-szeged.hu/publication/topology-preserving-parallel-thinning-algorithms00522nas a2200121 4500008004100000245008200041210006900123260003100192300001400223100002400237700001700261856012200278 2011 eng d00aValue of virtual fracture reduction exemplified in CT data of pilon fractures0 aValue of virtual fracture reduction exemplified in CT data of pi bSpringer-VerlagcJune 2011 a108 - 1161 aErdőhelyi, Balázs1 aKamer, Lukas uhttps://www.inf.u-szeged.hu/publication/value-of-virtual-fracture-reduction-exemplified-in-ct-data-of-pilon-fractures00552nas a2200157 4500008004100000245005900041210005900100260002800159300001300187100002700200700002000227700001600247700001700263700002300280856009100303 2011 hun d00aVetületi irányfüggőség a bináris tomográfiában0 aVetületi irányfüggőség a bináris tomográfiában aSzegedbNJSZTcJan 2011 a92 - 1051 aVarga, László Gábor1 aBalázs, Péter1 aNagy, Antal1 aKato, Zoltan1 aPalágyi, Kálmán uhttps://www.inf.u-szeged.hu/publication/vetuleti-iranyfuggoseg-a-binaris-tomografiaban00431nas a2200121 4500008004100000020002200041245005900063210005800122260004700180100001900227700002100246856004200267 2011 eng d a978-963-306-121-300aVIII. Magyar Számítógépes Nyelvészeti Konferencia0 aVIII Magyar Számítógépes Nyelvészeti Konferencia aSzegedbSzegedi TudományegyetemcDec 20111 aTanacs, Attila1 aVincze, Veronika uhttp://www.inf.u-szeged.hu/mszny2011/01393nas a2200193 4500008004100000020002200041022001400063245008000077210006900157260003800226300001400264520070300278100001900981700001701000700002301017700002001040700002001060856011901080 2010 eng d a978-3-642-15551-2 a0302-974300aAffine puzzle: Realigning deformed object fragments without correspondences0 aAffine puzzle Realigning deformed object fragments without corre aCrete, GreecebSpringercSep 2010 a777 - 7903 aThis paper is addressing the problem of realigning broken objects without correspondences. We consider linear transformations between the object fragments and present the method through 2D and 3D affine transformations. The basic idea is to construct and solve a polynomial system of equations which provides the unknown parameters of the alignment. We have quantitatively evaluated the proposed algorithm on a large synthetic dataset containing 2D and 3D images. The results show that the method performs well and robust against segmentation errors. We also present experiments on 2D real images as well as on volumetric medical images applied to surgical planning. © 2010 Springer-Verlag.
1 aDomokos, Csaba1 aKato, Zoltan1 aDaniilidis, Kostas1 aMaragos, Petros1 aParagios, Nikos uhttps://www.inf.u-szeged.hu/publication/affine-puzzle-realigning-deformed-object-fragments-without-correspondences00435nas a2200109 4500008004100000245006500041210006300106260001200169100001700181700002400198856010300222 2010 eng d00aAngular Stable Locking System. Milestone in IM nailing? ASLS0 aAngular Stable Locking System Milestone in IM nailing ASLS c2010///1 aVarga, Endre1 aErdőhelyi, Balázs uhttps://www.inf.u-szeged.hu/publication/angular-stable-locking-system-milestone-in-im-nailing-asls00495nas a2200157 4500008004100000020001400041245005300055210005300108260000900161300001200170490000700182100001900189700002000208700002300228856008600251 2010 eng d a0133-339900aBejárásfüggetlen szekvenciális vékonyítás0 aBejárásfüggetlen szekvenciális vékonyítás c2010 a17 - 400 v271 aKardos, Péter1 aNémeth, Gábor1 aPalágyi, Kálmán uhttps://www.inf.u-szeged.hu/publication/bejarasfuggetlen-szekvencialis-vekonyitas00525nas a2200121 4500008004100000245008200041210006900123260004400192300000700236100001800243700002000261856012200281 2010 eng d00aBinary tomographic reconstruction with an object-based evolutionary algorithm0 aBinary tomographic reconstruction with an objectbased evolutiona aSzegedbUniversity of SzegedcJune 2010 a311 aGara, Mihály1 aBalázs, Péter uhttps://www.inf.u-szeged.hu/publication/binary-tomographic-reconstruction-with-an-object-based-evolutionary-algorithm01535nas a2200217 4500008004100000020002200041245007400063210006900137260004800206300001400254520074200268100002701010700002001037700001601057700002301073700002501096700002501121700002601146700003101172856011401203 2010 eng d a978-3-642-12711-300aDirection-dependency of a binary tomographic reconstruction algorithm0 aDirectiondependency of a binary tomographic reconstruction algor aBuffalo, NY, USAbSpringer VerlagcMay 2010 a242 - 2533 aWe study how the quality of an image reconstructed by a binary tomographic algorithm depends on the direction of the observed object in the scanner, if only a few projections are available. To do so we conduct experiments on a set of software phantoms by reconstructing them form different projection sets using an algorithm based on D.C. programming (a method for minimizing the difference of convex functions), and compare the accuracy of the corresponding reconstructions by two suitable approaches. Based on the experiments, we discuss consequences on applications arising from the field of non-destructive testing, as well.
1 aVarga, László Gábor1 aBalázs, Péter1 aNagy, Antal1 aBarneva, Reneta, P1 aBrimkov, Valentin, E1 aHauptman, Herbert, A1 aJorge, Renato M Natal1 aTavares, João, Manuel R S uhttps://www.inf.u-szeged.hu/publication/direction-dependency-of-a-binary-tomographic-reconstruction-algorithm01140nas a2200157 4500008004100000245005200041210005200093260004100145300001400186520061200200100001900812700002100831700002100852700001700873856009200890 2010 eng d00aEstimation of linear deformations of 3D objects0 aEstimation of linear deformations of 3D objects aHong Kong, Hong KongbIEEEcSep 2010 a153 - 1563 aWe propose a registration method to find affine transformations between 3D objects by constructing and solving an overdetermined system of polynomial equations. We utilize voxel coverage information for more precise object boundary description. An iterative solution enables us to easily adjust the method to recover e.g. rigid-body and similarity transformations. Synthetic tests show the advantage of the voxel coverage representation, and reveal the robustness properties of our method against different types of segmentation errors. The method is tested on a real medical CT volume. © 2010 IEEE.
1 aTanacs, Attila1 aLindblad, Joakim1 aSladoje, Nataša1 aKato, Zoltan uhttps://www.inf.u-szeged.hu/publication/estimation-of-linear-deformations-of-3d-objects01929nas a2200193 4500008004100000020001400041245007900055210006900134260000900203300001400212490000700226520127600233100001901509700001701528700002801545700002301573700002101596856011801617 2010 eng d a1361-841500aGlaucoma Risk Index: Automated glaucoma detection from color fundus images0 aGlaucoma Risk Index Automated glaucoma detection from color fund c2010 a471 - 4810 v143 aGlaucoma as a neurodegeneration of the optic nerve is one of themost common causes of blindness. Because revitalization of the degenerated nerve fibers of the optic nerve is impossible early detection of the disease is essential. This can be supported by a robust and automated mass-screening. We propose a novel automated glaucoma detection system that operates on inexpensive to acquire and widely used digital color fundus images. After a glaucoma specific preprocessing, different generic feature types are compressed by an appearance-based dimension reduction technique. Subsequently, a probabilistic two-stage classification scheme combines these features types to extract the novel Glaucoma Risk Index (GRI) that shows a reasonable glaucoma detection performance. On a sample set of 575 fundus images a classification accuracy of 80% has been achieved in a 5-fold cross-validation setup. The GRI gains a competitive area under ROC (AUC) of 88% compared to the established topography- based glaucoma probability score of scanning laser tomography with AUC of 87%. The proposed color fundus image-based GRI achieves a competitive and reliable detection performance on a low-priced modality by the statistical analysis of entire images of the optic nerve head.
1 aBock, Rudriger1 aMeier, Jörg1 aNyúl, László, Gábor1 aHornegger, Joachim1 aMichelson, Georg uhttps://www.inf.u-szeged.hu/publication/glaucoma-risk-index-automated-glaucoma-detection-from-color-fundus-images00462nas a2200097 4500008004100000245008900041210006900130260000900199100002800208856012800236 2010 eng d00aImage analysis methods for medical research, diagnostic and therapeutic applications0 aImage analysis methods for medical research diagnostic and thera c20101 aNyúl, László, Gábor uhttps://www.inf.u-szeged.hu/publication/image-analysis-methods-for-medical-research-diagnostic-and-therapeutic-applications01693nas a2200289 4500008004100000020002200041245009900063210006900162260005400231300001400285520070400299100002001003700002001023700001801043700001901061700001901080700001901099700001801118700001901136700002201155700001701177700001901194700002101213700001501234700001601249856013801265 2010 eng d a978-3-642-17276-200aImage enhancement by median filters in algebraic reconstruction methods: an experimental study0 aImage enhancement by median filters in algebraic reconstruction aLas Vegas, NV, USAbSpringer VerlagcNov-Dec 2010 a339 - 3483 aAlgebraic methods for image reconstruction provide good solutions even if only few projections are available. However, they can create noisy images if the number of iterations or the computational time is limited. In this paper, we show how to decrease the effect of noise by using median filters during the iterations. We present an extensive study by applying filters of different sizes and in various times of the reconstruction process. Also, our test images are of different structural complexity. Our study concentrates on the ART and its discrete variant DART reconstruction methods.
1 aHantos, Norbert1 aBalázs, Péter1 aBebis, George1 aBoyle, Richard1 aParvin, Bahram1 aKoracin, Darko1 aChung, Ronald1 aHammound, Riad1 aHussain, Muhammad1 aKar-Han, Tan1 aCrawfis, Roger1 aThalmann, Daniel1 aKao, David1 aAvila, Lisa uhttps://www.inf.u-szeged.hu/publication/image-enhancement-by-median-filters-in-algebraic-reconstruction-methods-an-experimental-study01157nas a2200229 4500008004100000020002300041022001500064245006800079210006800147260003700215300001600252520040600268100001700674700001700691700001600708700001700724700001900741700002000760700002000780700001700800856011000817 2010 eng d a978-1-4244-7542-1 a1051-4651 00aLive cell segmentation in fluorescence microscopy via graph cut0 aLive cell segmentation in fluorescence microscopy via graph cut aIstanbul, TurkeybIEEEcAug 2010 a1485 - 14883 aWe propose a novel Markovian segmentation model which takes into account edge information. By construction, the model uses only pairwise interactions and its energy is submodular. Thus the exact energy minima is obtained via a max-flow/min-cut algorithm. The method has been quantitatively evaluated on synthetic images as well as on fluorescence microscopic images of live cells. © 2010 IEEE.
1 aLesko, Milan1 aKato, Zoltan1 aNagy, Antal1 aGombos, Imre1 aTörök, Zsolt1 aVígh, László1 aVígh, László1 aErcil, Aytul uhttps://www.inf.u-szeged.hu/publication/live-cell-segmentation-in-fluorescence-microscopy-via-graph-cut-000640nas a2200169 4500008004100000245007000041210006900111260004100180300001400221100002000235700001800255700002500273700002000298700002300318700001900341856011000360 2010 eng d00aMachine learning for supporting binary tomographic reconstruction0 aMachine learning for supporting binary tomographic reconstructio aIstambul, TurkeybSpringercAug 2010 a101 - 1051 aBalázs, Péter1 aGara, Mihály1 aTasi, Tamás Sámuel1 aKöthe, Ullrich1 aMontanvert, Annick1 aSoille, Pierre uhttps://www.inf.u-szeged.hu/publication/machine-learning-for-supporting-binary-tomographic-reconstruction00474nas a2200121 4500008004100000245005700041210005700098260005300155300000700208100002000215700002000235856009700255 2010 eng d00aMedian filtering in algebraic reconstruction methods0 aMedian filtering in algebraic reconstruction methods aSzeged, HungarybUniversity of SzegedcJune 2010 a361 aHantos, Norbert1 aBalázs, Péter uhttps://www.inf.u-szeged.hu/publication/median-filtering-in-algebraic-reconstruction-methods00387nas a2200121 4500008004100000245004300041210004300084260000900127300001200136100001700148700002400165856007600189 2010 eng d00aMűtétek tervezése számítógéppel0 aMűtétek tervezése számítógéppel c2010 a38 - 401 aVarga, Endre1 aErdőhelyi, Balázs uhttps://www.inf.u-szeged.hu/publication/mutetek-tervezese-szamitogeppel00533nas a2200133 4500008004100000245006500041210006500106260005300171300000700224100002700231700002000258700001600278856010500294 2010 eng d00aObject rotation effects on binary tomographic reconstruction0 aObject rotation effects on binary tomographic reconstruction aSzeged, HungarybUniversity of SzegedcJune 2010 a761 aVarga, László Gábor1 aBalázs, Péter1 aNagy, Antal uhttps://www.inf.u-szeged.hu/publication/object-rotation-effects-on-binary-tomographic-reconstruction00571nas a2200121 4500008004100000245009700041210006900138260005300207300000700260100002500267700002000292856013700312 2010 eng d00aObtaining geometrical properties of binary images from two projections using neural networks0 aObtaining geometrical properties of binary images from two proje aSzeged, HungarybUniversity of SzegedcJune 2010 a691 aTasi, Tamás Sámuel1 aBalázs, Péter uhttps://www.inf.u-szeged.hu/publication/obtaining-geometrical-properties-of-binary-images-from-two-projections-using-neural-networks00565nas a2200145 4500008004100000245009800041210006900139260006100208300001400269100002000283700002300303700002200326700002300348856004800371 2010 eng d00aParallel Thinning Algorithms Based on Ronse's Sufficient Conditions for Topology Preservation0 aParallel Thinning Algorithms Based on Ronses Sufficient Conditio aSingaporebScientific Research Publishing Inc.cMay 2010 a183 - 1941 aNémeth, Gábor1 aPalágyi, Kálmán1 aWiederhold, Petra1 aBarneva, Reneta, P uhttp://rpsonline.com.sg/rpsweb/iwcia09.html00511nas a2200145 4500008004100000020001400041245006600055210006600121260001500187300001400202490000700216100001900223700001700242856010600259 2010 eng d a0031-320300aParametric estimation of affine deformations of planar shapes0 aParametric estimation of affine deformations of planar shapes cMarch 2010 a569 - 5780 v431 aDomokos, Csaba1 aKato, Zoltan uhttps://www.inf.u-szeged.hu/publication/parametric-estimation-of-affine-deformations-of-planar-shapes00683nas a2200193 4500008004100000245006000041210006000101260005000161300001400211100002700225700002000252700001600272700002500288700001400313700002200327700001700349700002100366856010200387 2010 eng d00aProjection selection algorithms for discrete tomography0 aProjection selection algorithms for discrete tomography aSydney, Australia bSpringer VerlagcDec 2010 a390 - 4011 aVarga, László Gábor1 aBalázs, Péter1 aNagy, Antal1 aBlanc-Talon, Jacques1 aBone, Don1 aPhilips, Wilfried1 aPopescu, Dan1 aScheunders, Paul uhttps://www.inf.u-szeged.hu/publication/projection-selection-algorithms-for-discrete-tomography-000613nas a2200157 4500008004100000245007500041210006900116260005200185300000700237100002000244700001700264700002000281700002000301700002100321856011300342 2010 eng d00aSITIS 2010: Track SIT editorial message: Signal and Image Technologies0 aSITIS 2010 Track SIT editorial message Signal and Image Technolo aKuala LumpurbIEEE Computer Society Pressc2010 aXV1 aDipanda, Albert1 aKato, Zoltan1 aDipanda, Albert1 aChbeir, Richard1 aYetongnon, Kokou uhttps://www.inf.u-szeged.hu/publication/sitis-2010-track-sit-editorial-message-signal-and-image-technologies01180nas a2200181 4500008004100000245005800041210005700099260005200156300001400208520057500222100002000797700001900817700002300836700001300859700001500872700001300887856009800900 2010 eng d00aTopology preserving 2-subfield 3D thinning algorithms0 aTopology preserving 2subfield 3D thinning algorithms aInnsbruck, AustriabIASTED ACTA PresscFeb 2010 a310 - 3163 aThis 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.
1 aNémeth, Gábor1 aKardos, Péter1 aPalágyi, Kálmán1 aZagar, B1 aKuijper, A1 aSahbi, H uhttps://www.inf.u-szeged.hu/publication/topology-preserving-2-subfield-3d-thinning-algorithms01486nas a2200181 4500008004100000245007800041210006900119260005900188300001400247490000900261520081200270100002001082700001901102700002301121700002301144700001901167856011801186 2010 eng d00aTopology Preserving 3D Thinning Algorithms using Four and Eight Subfields0 aTopology Preserving 3D Thinning Algorithms using Four and Eight aPóvoa de Varzim, PortugalbSpringer VerlagcJune 2010 a316 - 3250 v61113 aThinning 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.
1 aNémeth, Gábor1 aKardos, Péter1 aPalágyi, Kálmán1 aCampilho, Aurélio1 aKamel, Mohamed uhttps://www.inf.u-szeged.hu/publication/topology-preserving-3d-thinning-algorithms-using-four-and-eight-subfields01333nas a2200217 4500008004100000245006400041210006400105260004400169300001400213490000900227520058400236100002000820700001900840700002300859700002300882700002400905700002500929700002600954700003100980856010401011 2010 eng d00aTopology Preserving Parallel Smoothing for 3D Binary Images0 aTopology Preserving Parallel Smoothing for 3D Binary Images aBuffalo, USAbSpringer VerlagcMay 2010 a287 - 2980 v60263 aThis 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.
1 aNémeth, Gábor1 aKardos, Péter1 aPalágyi, Kálmán1 aBarneva, Reneta, P1 aBrimkov, Valentin E1 aHauptman, Herbert, A1 aJorge, Renato M Natal1 aTavares, João, Manuel R S uhttps://www.inf.u-szeged.hu/publication/topology-preserving-parallel-smoothing-for-3d-binary-images00454nas a2200109 4500008004100000245007100041210006900112260001200181100001700193700002400210856011000234 2010 eng d00aTraumArt:a computer assisted planning system for orthopedic-trauma0 aTraumArta computer assisted planning system for orthopedictrauma c2010///1 aVarga, Endre1 aErdőhelyi, Balázs uhttps://www.inf.u-szeged.hu/publication/traumarta-computer-assisted-planning-system-for-orthopedic-trauma00404nam a2200109 4500008004100000245005800041210005700099260004300156100001900199700002100218856005500239 2010 eng d00aVII. Magyar Számítógépes Nyelvészeti Konferencia0 aVII Magyar Számítógépes Nyelvészeti Konferencia aSzegedbSzegedi Tudományegyetemc20101 aTanacs, Attila1 aVincze, Veronika uhttp://www.inf.u-szeged.hu/mszny2010/mszny2010.pdf01287nas a2200157 4500008004100000020002300041022001500064245006000079210005900139260003300198300001400231520074900245100001900994700001701013856009901030 2009 eng d a978-1-4244-5653-6 a1522-4880 00aAffine alignment of compound objects: A direct approach0 aAffine alignment of compound objects A direct approach aCairo, EgyptbIEEEcNov 2009 a169 - 1723 aA direct approach for parametric estimation of 2D affine deformations between compound shapes is proposed. It provides the result as a least-square solution of a linear system of equations. The basic idea is to fit Gaussian densities over the objects yielding covariant functions, which preserves the effect of the unknown transformation. Based on these functions, linear equations are constructed by integrating nonlinear functions over appropriate domains. The main advantages are: linear complexity, easy implementation, works without any time consuming optimization or established correspondences. Comparative tests show that it outperforms state-of-the-art methods both in terms of precision, robustness and complexity. ©2009 IEEE.
1 aDomokos, Csaba1 aKato, Zoltan uhttps://www.inf.u-szeged.hu/publication/affine-alignment-of-compound-objects-a-direct-approach00675nas a2200133 4500008004100000245004100041210004100082260001200123520028700135100001800422700001900440700001700459856006500476 2009 eng d00aAffine Registration of Planar Shapes0 aAffine Registration of Planar Shapes c2009///3 aThis is the sample implementation and benchmark dataset of the binary image registration algorithm described in the following paper: Csaba Domokos and Zoltan Kato. Parametric Estimation of Affine Deformations of Planar Shapes. Pattern Recognition, 43(3):569--578, March 2010.
1 aKatona, Zsolt1 aDomokos, Csaba1 aKato, Zoltan uhttp://www.inf.u-szeged.hu/~kato/software/affbinregdemo.html00503nas a2200133 4500008004100000020001400041245007000055210006700125260002300192300001600215490000800231100002000239856011000259 2009 eng d a0166-218X00aA benchmark set for the reconstruction of hv-convex discrete sets0 abenchmark set for the reconstruction of hvconvex discrete sets bElseviercAug 2009 a3447 - 34560 v1571 aBalázs, Péter uhttps://www.inf.u-szeged.hu/publication/a-benchmark-set-for-the-reconstruction-of-hv-convex-discrete-sets03870nas a2200733 4500008004100000020001400041245008100055210006900136260027000205300001600475490000700491520149600498100002001994700002402014700002202038700002002060700001902080700002102099700001802120700002202138700002302160700001902183700002002202700001702222700001902239700002202258700002302280700001402303700002102317700002202338700002002360700002002380700002202400700002002422700002302442700002402465700002302489700002302512700001902535700001802554700001802572700001802590700001202608700001402620700002402634700002002658700002202678700002202700700002502722700002002747700002102767700002002788700002102808700002002829700002102849700002202870700002002892700001902912700002702931700002302958700002002981700001403001856012103015 2009 eng d a0278-006200aComparison and evaluation of methods for liver segmentation from CT datasets0 aComparison and evaluation of methods for liver segmentation from aPrice, K., Anything you can do, I can do better (no you can't) (1986) Comput. Vis. Graph. Image Process, 36 (2-3), pp. 387-391;S. G. Armato, G. McLennan, M. F. McNitt-Gray, C. R. Meyer, D. Yankelevitz, D. R. Aberle, C. I. Henschke, E. A. Hoffman, E. A. KacAug 2009 a1251 - 12650 v283 aThis paper presents a comparison study between 10 automatic and six interactive methods for liver segmentation from contrast-enhanced CT images. It is based on results from the "MICCAI 2007 Grand Challenge" workshop, where 16 teams evaluated their algorithms on a common database. A collection of 20 clinical images with reference segmentations was provided to train and tune algorithms in advance. Participants were also allowed to use additional proprietary training data for that purpose. All teams then had to apply their methods to 10 test datasets and submit the obtained results. Employed algorithms include statistical shape models, atlas registration, level-sets, graph-cuts and rule-based systems. All results were compared to reference segmentations five error measures that highlight different aspects of segmentation accuracy. All measures were combined according to a specific scoring system relating the obtained values to human expert variability. In general, interactive methods reached higher average scores than automatic approaches and featured a better consistency of segmentation quality. However, the best automatic methods (mainly based on statistical shape models with some additional free deformation) could compete well on the majority of test images. The study provides an insight in performance of different segmentation approaches under real-world conditions and highlights achievements and limitations of current image analysis techniques. © 2009 IEEE.
1 aHeimann, Tobias1 aVan Ginneken, Brahm1 aStyner, Martin, A1 aArzhaeva, Yulia1 aAurich, Volker1 aBauer, Christian1 aBeck, Andreas1 aBecker, Christoph1 aBeichel, Reinhardt1 aBekes, György1 aBello, Fernando1 aBinnig, Gerd1 aBischof, Horst1 aBornik, Alexander1 aCashman, Peter, MM1 aChi, Ying1 aCórdova, Andres1 aDawant, Benoit, M1 aFidrich, Márta1 aFurst, Jacob, D1 aFurukawa, Daisuke1 aGrenacher, Lars1 aHornegger, Joachim1 aKainmüller, Dagmar1 aKitney, Richard, I1 aKobatake, Hidefumi1 aLamecker, Hans1 aLange, Thomas1 aLee, Jeongjin1 aLennon, Brian1 aLi, Rui1 aLi, Senhu1 aMeinzer, Hans-Peter1 aNémeth, Gábor1 aRaicu, Daniela, S1 aRau, Anne-Mareike1 aVan Rikxoort, Eva, M1 aRousson, Mikael1 aRuskó, László1 aSaddi, Kinda, A1 aSchmidt, Günter1 aSeghers, Dieter1 aShimizu, Akinobi1 aSlagmolen, Pieter1 aSorantin, Erich1 aSoza, Grzegorz1 aSusomboon, Ruchaneewan1 aWaite, Jonathan, M1 aWimmer, Andreas1 aWolf, Ivo uhttps://www.inf.u-szeged.hu/publication/comparison-and-evaluation-of-methods-for-liver-segmentation-from-ct-datasets00432nas a2200133 4500008004100000020001400041245005100055210005100106260001200157300000600169490000700175100002300182856009300205 2009 eng d a0324-721X00aConference of PhD Students in Computer Science0 aConference of PhD Students in Computer Science c2009/// a30 v191 aPalágyi, Kálmán uhttps://www.inf.u-szeged.hu/publication/conference-of-phd-students-in-computer-science-101146nas a2200181 4500008004100000020001400041245009500055210006900150260001500219300001600234490000700250520049500257100001900752700002000771700001700791700002100808856013500829 2009 eng d a1057-714900aDetection of Object Motion Regions in Aerial Image Pairs with a Multilayer Markovian Model0 aDetection of Object Motion Regions in Aerial Image Pairs with a bIEEEc2009 a2303 - 23150 v183 aWe propose a new Bayesian method for detectingthe regions of object displacements in aerial image pairs. We use a robust but coarse 2-D image registration algorithm. Our main challenge is to eliminate the registration errors from the extracted change map. We introduce a three-layer Markov Random Field (L3MRF) model which integrates information from two different features, and ensures connected homogenous regions in the segmented images. Validation is given on real aerial photos.
1 aBenedek, Csaba1 aSziranyi, Tamas1 aKato, Zoltan1 aZerubia, Josiane uhttps://www.inf.u-szeged.hu/publication/detection-of-object-motion-regions-in-aerial-image-pairs-with-a-multilayer-markovian-model00577nas a2200145 4500008004100000245007400041210007400115260003300189300002100222100001800243700002000261700002500281700002000306856010500326 2009 hun d00aDöntési fákon alapuló előfeldolgozás a bináris tomográfiában0 aDöntési fákon alapuló előfeldolgozás a bináris tomográfiában aBudapestbAkaprintcJan 2009 anincs számozás1 aGara, Mihály1 aBalázs, Péter1 aChetverikov, Dmitrij1 aSziranyi, Tamas uhttps://www.inf.u-szeged.hu/publication/dontesi-fakon-alapulo-elofeldolgozas-a-binaris-tomografiaban00509nas a2200133 4500008004100000020001400041245008400055210007400139260000900213300001400222490000700236100001600243856011600259 2009 eng d a0133-339900aEmissziós Diszkrét Tomográfiai Módszerek Alkalmazása Faktorstruktúrákra.0 aEmissziós Diszkrét Tomográfiai Módszerek Alkalmazása Faktorstruk c2009 a329 - 3500 v261 aNagy, Antal uhttps://www.inf.u-szeged.hu/publication/emisszios-diszkret-tomografiai-modszerek-alkalmazasa-faktorstrukturakra01354nas a2200181 4500008004100000020002200041245008700063210006900150260004500219300001400264520065900278100002000937700001800957700002400975700002600999700002001025856012701045 2009 eng d a978-3-642-02229-600aAn evolutionary approach for object-based image reconstruction using learnt priors0 aevolutionary approach for objectbased image reconstruction using aOslo, NorwaybSpringer-VerlagcJune 2009 a520 - 5293 aIn this paper we present a novel algorithm for reconstructingbinary images containing objects which can be described by some parameters. In particular, we investigate the problem of reconstructing binary images representing disks from four projections. We develop a genetic algorithm for this and similar problems. We also discuss how prior information on the number of disks can be incorporated into the reconstruction in order to obtain more accurate images. In addition, we present a method to exploit such kind of knowledge from the projections themselves. Experiments on artificial data are also conducted. © 2009 Springer Berlin Heidelberg.
1 aBalázs, Péter1 aGara, Mihály1 aSalberg, Arnt-Borre1 aHardeberg, Jon, Yngve1 aJenssen, Robert uhttps://www.inf.u-szeged.hu/publication/an-evolutionary-approach-for-object-based-image-reconstruction-using-learnt-priors01191nas a2200181 4500008004100000020002200041245009900063210006900162260005600231300001400287520045800301100002300759700002000782700001800802700002700820700002300847856013900870 2009 eng d a978-3-642-04396-300aFully Parallel 3D Thinning Algorithms based on Sufficient Conditions for Topology Preservation0 aFully Parallel 3D Thinning Algorithms based on Sufficient Condit aMontreal, Quebec, CanadabSpringer VerlagcSep 2009 a481 - 4923 aThis 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.
1 aPalágyi, Kálmán1 aNémeth, Gábor1 aBrlek, Srecko1 aReutenauer, Christophe1 aProvençal, Xavier uhttps://www.inf.u-szeged.hu/publication/fully-parallel-3d-thinning-algorithms-based-on-sufficient-conditions-for-topology-preservation00453nas a2200121 4500008004100000245005700041210005500098260004200153300001200195490000900207100001800216856009700234 2009 eng d00aA Graph Based Data Model for Graphics Interpretation0 aGraph Based Data Model for Graphics Interpretation aVenice, ItalybSpringercOctober 2009 a355-3640 v55341 aKatona, Endre uhttps://www.inf.u-szeged.hu/publication/a-graph-based-data-model-for-graphics-interpretation00652nas a2200169 4500008004100000020001400041245010700055210006900162260001200231300001400243490000700257100001900264700001600283700001700299700002100316856014500337 2009 eng d a0031-320300aA higher-order active contour model of a 'gas of circles' and its application to tree crown extraction0 ahigherorder active contour model of a gas of circles and its app c2009/// a699 - 7090 v421 aHorvath, Peter1 aJermyn, Ian1 aKato, Zoltan1 aZerubia, Josiane uhttps://www.inf.u-szeged.hu/publication/a-higher-order-active-contour-model-of-a-gas-of-circles-and-its-application-to-tree-crown-extraction00563nas a2200157 4500008004100000245007200041210007200113260003300185300001000218100002300228700001600251700001700267700002500284700002000309856007600329 2009 hun d00aKör alakú objektumok szegmentálása Markov mező segítségével0 aKör alakú objektumok szegmentálása Markov mező segítségével aBudapestbAkaprintcJan 2009 a1 - 91 aBlaskovics, Tamás1 aJermyn, Ian1 aKato, Zoltan1 aChetverikov, Dmitrij1 aSziranyi, Tamas uhttp://vision.sztaki.hu/~kepaf/kepaf2009_CD/files/116-4-MRFCircle08.pdf00641nas a2200157 4500008004100000245009200041210007800133260003300211300001000244100001900254700002000273700002300293700002500316700002000341856012200361 2009 hun d00aKritikus párokat vizsgáló bejárásfüggetlen szekvenciális vékonyító algoritmus0 aKritikus párokat vizsgáló bejárásfüggetlen szekvenciális vékonyí aBudapestbAkaprintcJan 2009 a1 - 81 aKardos, Péter1 aNémeth, Gábor1 aPalágyi, Kálmán1 aChetverikov, Dmitrij1 aSziranyi, Tamas uhttps://www.inf.u-szeged.hu/publication/kritikus-parokat-vizsgalo-bejarasfuggetlen-szekvencialis-vekonyito-algoritmus00575nas a2200157 4500008004100000020001400041245008100055210006900136260000900205300001200214490000700226100001800233700002500251700002000276856012100296 2009 eng d a1218-458600aLearning connectedness and convexity of binary images from their projections0 aLearning connectedness and convexity of binary images from their c2009 a27 - 480 v201 aGara, Mihály1 aTasi, Tamás Sámuel1 aBalázs, Péter uhttps://www.inf.u-szeged.hu/publication/learning-connectedness-and-convexity-of-binary-images-from-their-projections01105nas a2200157 4500008004100000020002300041245006800064210006500132260003300197300001600230520053700246100002300783700001700806700001600823856010800839 2009 eng d a978-1-4244-5653-6 00aA Markov random field model for extracting near-circular shapes0 aMarkov random field model for extracting nearcircular shapes aCairo, EgyptbIEEEcNov 2009 a1073 - 10763 aWe propose a binary Markov Random Field (MRF) model that assigns high probability to regions in the image domain consisting of an unknown number of circles of a given radius. We construct the model by discretizing the 'gas of circles' phase field model in a principled way, thereby creating an 'equivalent'MRF. The behaviour of the resultingMRF model is analyzed, and the performance of the new model is demonstrated on various synthetic images as well as on the problem of tree crown detection in aerial images. ©2009 IEEE.
1 aBlaskovics, Tamás1 aKato, Zoltan1 aJermyn, Ian uhttps://www.inf.u-szeged.hu/publication/a-markov-random-field-model-for-extracting-near-circular-shapes00679nas a2200157 4500008004100000245010800041210006900149260003800218490001800256100002000274700001800294700002800312700001700340700001600357856014800373 2009 eng d00aMethod and system for automatically segmenting organs from three dimensional computed tomography images0 aMethod and system for automatically segmenting organs from three aAmerikai Egyesült Államokc20090 vUS200509076901 aFidrich, Márta1 aMáté, Eörs1 aNyúl, László, Gábor1 aKuba, Attila1 aKiss, Bence uhttps://www.inf.u-szeged.hu/publication/method-and-system-for-automatically-segmenting-organs-from-three-dimensional-computed-tomography-images00581nam a2200157 4500008004100000020001900041245006300060210006200123260004300185490000900228100002200237700001500259700002800274700001900302856010200321 2009 eng d a9780819478054 00aMIPPR 2009: Multispectral Image Acquisition and Processing0 aMIPPR 2009 Multispectral Image Acquisition and Processing aBellingham; WashingtonbSPIEcOct 20090 v74941 aUdupa, Jayaram, K1 aSang, Nong1 aNyúl, László, Gábor1 aTong, Hengqing uhttps://www.inf.u-szeged.hu/publication/mippr-2009-multispectral-image-acquisition-and-processing00635nas a2200169 4500008004100000245007400041210007200115260003300187300001100220100002000231700002100251700002300272700002000295700002500315700002000340856010500360 2009 eng d00aA morfológiai váz általánosítása szomszédsági szekvenciákkal0 amorfológiai váz általánosítása szomszédsági szekvenciákkal aBudapestbAkaprintcJan 2009 a1 - 101 aNémeth, Gábor1 aKovács, György1 aPalágyi, Kálmán1 aFazekas, Attila1 aChetverikov, Dmitrij1 aSziranyi, Tamas uhttps://www.inf.u-szeged.hu/publication/a-morfologiai-vaz-altalanositasa-szomszedsagi-szekvenciakkal03178nas a2200193 4500008004100000020001400041245011300055210006900168260000900237300000800246490000700254520246200261100001902723700001702742700002802759700002302787700002102810856015302831 2009 eng d a0146-040400aMultimodal Automated Glaucoma Detection Combining the Glaucoma Probability Score and the Glaucoma Risk Index0 aMultimodal Automated Glaucoma Detection Combining the Glaucoma P c2009 a3240 v503 aPurpose:Fundus camera and Heidelberg Retina Tomograph (HRT) arecommonly used for reliable glaucoma diagnosis. Quantitative glaucoma scores, however, do not utilize both image content simultaneously. We propose the combination of topography and fundus image based indices for automated glaucoma detection which outperforms their sole application of either. Methods:The probabilistic values of topography based Glaucoma Probability Score (GPS) and our fundus image based Glaucoma Risk Index (GRI) are assembled to a two-dimensional feature space. In contrast to established methods the subsequent application of a probabilistic nu-Support Vector Machine classifier (nu = 0.5, kernel: radial basis function) uses both the topographic and the textural information to determine a final glaucoma probability. Instances labeled with a final probability greater than 0.5 are considered glaucomatous.For the evaluations in a 10-fold cross- validation setup, we took a sample set (mean age: 55.4 ± 10.9 years) of papilla images of 149 glaucomatous patients (FDT test time 67.4 ± 35.6 s) and 246 normals from the Erlangen Glaucoma Registry. The gold standard diagnosis was given by a glaucoma specialist based on an elaborate ophthalmological examination with ophthalmoscopy, visual field, IOP, FDT, and HRT II. The GPS was calculated by HRT device while papilla centered color fundus images (Kowa non-myd, FOV 22°) were used to calculate the GRI. Results:The classification of the GRI resulted in an area under ROC curve (AUC) of 0.81 with an F-measure of 0.71 for glaucomatous cases and 0.83 for normals. The GPS achieved an AUC of 0.86 while the F-measure for glaucoma was 0.74 (F-measure for healthy was 0.84).The combination of both indices clearly increased the AUC by 4% up to 0.9 compared to the sole application of the GPS. The F-measure for glaucomatous images was improved up to 0.76 (F-measure for healthy images was 0.86). Conclusions:The proposed combination of the topography based GPS and the fundus image based GRI shows superior performance compared to either index alone.Both indices utilize complementary information about the glaucoma disease. Consequently, this multimodal combined application of both indices is promising to reach a more reliable automated glaucoma detection performance. The approach can be used in large screening applications where an automated tool is essential to support the experts in finding glaucomatous eyes.
1 aBock, Rudriger1 aMeier, Jörg1 aNyúl, László, Gábor1 aHornegger, Joachim1 aMichelson, Georg uhttps://www.inf.u-szeged.hu/publication/multimodal-automated-glaucoma-detection-combining-the-glaucoma-probability-score-and-the-glaucoma-risk-index00396nas a2200121 4500008004100000245004600041210004600087260001400133300000700147490001400154100002000168856008600188 2009 eng d00aNeutron tomography with prior information0 aNeutron tomography with prior information cJuly 2009 a380 vAbstracts1 aBalázs, Péter uhttps://www.inf.u-szeged.hu/publication/neutron-tomography-with-prior-information01317nas a2200157 4500008004100000020002300041245004400064210004400108260003300152300001600185520081900201100001901020700001901039700001701058856008401075 2009 eng d a978-1-4244-5653-6 00aNonlinear registration of binary shapes0 aNonlinear registration of binary shapes aCairo, EgyptbIEEEcNov 2009 a1101 - 11043 aA novel approach is proposed to estimate the parameters of a diffeomorphism that aligns two binary images. Classical approaches usually define a cost function based on a similarity metric and then find the solution via optimization. Herein, we trace back the problem to the solution of a system of non-linear equations which directly provides the parameters of the aligning transformation. The proposed method works without any time consuming optimization step or established correspondences. The advantage of our algorithm is that it is easy to implement, less sensitive to the strength of the deformation, and robust against segmentation errors. The efficiency of the proposed approach has been demonstrated on a large synthetic dataset as well as in the context of an industrial application. ©2009 IEEE.
1 aNemeth, Jozsef1 aDomokos, Csaba1 aKato, Zoltan uhttps://www.inf.u-szeged.hu/publication/nonlinear-registration-of-binary-shapes01658nas a2200205 4500008004100000245007100041210006900112260003500181300001400216520096100230100002001191700001801211700001901229700002401248700001701272700002101289700001101310700002001321856011101341 2009 eng d00aObject subsampling strategies to improve computational performance0 aObject subsampling strategies to improve computational performan aSalzburgbIEEE PresscSep 2009 a448 - 4533 aWe investigate object simplification methods based on Centroidal Voronoi Tesselation (CVT) that share the possibility of great speed-ups in various scenarios. We propose Constrained CVT to sample points from the object boundary and the Region-based CVT to be able to subsample lower dimensional objects, as well. Moreover we introduce custom weight functions based on object properties. Thus, wecan be more specific on what are the important parts of the subsampled object. We also list several novel applications corresponding to the theoretical achivements presented. The advantages of applying the subsampling strategies are presented for registration, human detection, and the segmentation of the retinal vascular system, respectively. Quantitative results are shown to check the deterioration of the accuracy with the level of subsampling, and the computational gain. We also make comparisons with other naive (e.g. random) subsampling methods.
1 aHajdú, András1 aVeres, Péter1 aTanacs, Attila1 aHarangozó, Rorland1 aZinterhof, P1 aLončarić, Sven1 aUhl, A1 aCarini, Alberto uhttps://www.inf.u-szeged.hu/publication/object-subsampling-strategies-to-improve-computational-performance01114nas a2200181 4500008004100000020002200041245005500063210005100118260005600169300001400225520052000239100001900759700002000778700002300798700002200821700002300843856006600866 2009 eng d a978-3-642-10208-000aAn order-independent sequential thinning algorithm0 aorderindependent sequential thinning algorithm aPlaya del Carmen, MexicobSpringer VerlagcNov 2009 a162 - 1753 aThinning 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.
1 aKardos, Péter1 aNémeth, Gábor1 aPalágyi, Kálmán1 aWiederhold, Petra1 aBarneva, Reneta, P uhttp://link.springer.com/chapter/10.1007/978-3-642-10210-3_1300419nas a2200145 4500008004100000020001400041245003300055210003300088260001200121300000800133490000800141100002800149700002300177856007300200 2009 eng d a0166-218X00aPreface to the Special Issue0 aPreface to the Special Issue c2009/// a4370 v1571 aNyúl, László, Gábor1 aPalágyi, Kálmán uhttps://www.inf.u-szeged.hu/publication/preface-to-the-special-issue00574nas a2200121 4500008004100000245010200041210006900143260003300212100002000245700002500265700002000290856014200310 2009 eng d00aReconstruction of binary images with disjoint components from horizontal and vertical projections0 aReconstruction of binary images with disjoint components from ho aBudapestbAkaprintcJan 20091 aBalázs, Péter1 aChetverikov, Dmitrij1 aSziranyi, Tamas uhttps://www.inf.u-szeged.hu/publication/reconstruction-of-binary-images-with-disjoint-components-from-horizontal-and-vertical-projections01307nas a2200157 4500008004100000020002200041245009700063210006900160260008200229300001400311520062200325100002000947700002200967700002300989856013701012 2009 eng d a978-3-642-10208-000aReconstruction of canonical hv-convex discrete sets from horizontal and vertical projections0 aReconstruction of canonical hvconvex discrete sets from horizont aBerlin; Heidelberg; New York; London; Paris; TokyobSpringer VerlagcNov 2009 a280 - 2883 aThe problem of reconstructing some special hv-convex discretesets from their two orthogonal projections is considered. In general, the problem is known to be NP-hard, but it is solvable in polynomial time if the discrete set to be reconstructed is also 8-connected. In this paper, we define an intermediate class - the class of hv-convex canonical discrete sets - and give a constructive proof that the above problem remains computationally tractable for this class, too. We also discuss some further theoretical consequences and present experimental results as well. © Springer-Verlag Berlin Heidelberg 2009.
1 aBalázs, Péter1 aWiederhold, Petra1 aBarneva, Reneta, P uhttps://www.inf.u-szeged.hu/publication/reconstruction-of-canonical-hv-convex-discrete-sets-from-horizontal-and-vertical-projections01494nas a2200205 4500008004100000245005100041210005100092260004500143300001400188520082800202100001901030700001901049700002101068700002101089700001701110700002401127700002601151700002001177856009101197 2009 eng d00aRecovering affine deformations of fuzzy shapes0 aRecovering affine deformations of fuzzy shapes aOslo, NorwaybSpringer-VerlagcJune 2009 a735 - 7443 aFuzzy sets and fuzzy techniques are attracting increasing attention nowadays in the field of image processing and analysis. It has been shown that the information preserved by using fuzzy representation based on area coverage may be successfully utilized to improve precision and accuracy of several shape descriptors; geometric moments of a shape are among them. We propose to extend an existing binary shape matching method to take advantage of fuzzy object representation. The result of a synthetic test show that fuzzy representation yields smaller registration errors in average. A segmentation method is also presented to generate fuzzy segmentations of real images. The applicability of the proposed methods is demonstrated on real X-ray images of hip replacement implants. © 2009 Springer Berlin Heidelberg.
1 aTanacs, Attila1 aDomokos, Csaba1 aSladoje, Nataša1 aLindblad, Joakim1 aKato, Zoltan1 aSalberg, Arnt-Borre1 aHardeberg, Jon, Yngve1 aJenssen, Robert uhttps://www.inf.u-szeged.hu/publication/recovering-affine-deformations-of-fuzzy-shapes01420nas a2200157 4500008004100000245005300041210005300094260001800147300001600165520092800181100001901109700001901128700001701147700000501164856009301169 2009 eng d00aRecovering planar homographies between 2D shapes0 aRecovering planar homographies between 2D shapes bIEEEc2009/// a2170 - 21763 aImages taken from different views of a planar object are related by planar homography. Recovering the parameters of such transformations is a fundamental problem in computer vision with various applications. This paper proposes a novel method to estimate the parameters of a homography that aligns two binary images. It is obtained by solving a system of nonlinear equations generated by integrating linearly independent functions over the domains determined by the shapes. The advantage of the proposed solution is that it is easy to implement, less sensitive to the strength of the deformation, works without established correspondences and robust against segmentation errors. The method has been tested on synthetic as well as on real images and its efficiency has been demonstrated in the context of two different applications: alignment of hip prosthesis X-ray images and matching of traffic signs. ©2009 IEEE.
1 aNemeth, Jozsef1 aDomokos, Csaba1 aKato, Zoltan1 a uhttps://www.inf.u-szeged.hu/publication/recovering-planar-homographies-between-2d-shapes01965nas a2200169 4500008004100000245006600041210006600107260003900173300002400212520136000236100002801596700001701624700001501641700001901656700001401675856010601689 2009 eng d00aRetinal image analysis for automated glaucoma risk evaluation0 aRetinal image analysis for automated glaucoma risk evaluation aBellingham; WashingtonbSPIEc2009 a74971C-1 - 74971C-93 aImages of the eye ground not only provide an insight toimportant parts of the visual system but also reflect the general state of health of the entire human body. Automatic retina image analysis is becoming an important screening tool for early detection of certain risks and diseases. Glaucoma is one of the most common causes of blindness and is becoming even more important considering the ageing society. Robust mass-screening may help to extend the symptom-free life of affected patients. Our research is focused on a novel automated classification system for glaucoma, based on image features from fundus photographs. Our new data-driven approach requires no manual assistance and does not depend on explicit structure segmentation and measurements. First, disease independent variations, such as nonuniform illumination, size differences, and blood vessels are eliminated from the images. Then, the extracted high-dimensional feature vectors are compressed via PCA and combined before classification with SVMs takes place. The technique achieves an accuracy of detecting glaucomatous retina fundus images comparable to that of human experts. The “vessel- free” images and intermediate output of the methods are novel representations of the data for the physicians that may provide new insight into and help to better understand glaucoma.
1 aNyúl, László, Gábor1 aLiu, Jianguo1 aDoi, Kunio1 aFenster, Aaron1 aChan, C S uhttps://www.inf.u-szeged.hu/publication/retinal-image-analysis-for-automated-glaucoma-risk-evaluation01804nas a2200145 4500008004100000245006400041210006300105260003700168300001200205490000600217520129000223100002401513700001701537856010401554 2009 eng d00aSemi-automatic bone fracture reduction in surgical planning0 aSemiautomatic bone fracture reduction in surgical planning aBerlin, GermanybSpringer Verlag aS98-S990 v43 aThe surgical intervention of complex bone fractures has to be planned very carefully, especially for such a complex region as the pelvic ring. The computer aided surgical planning is done before the actual surgery takes place and its main purpose is to gather more information about the dislocation of the bone fragments and to arrange the surgical implants to be inserted. With the help of finite element analysis even the biomechanical stability of the whole plan can be predicted. To create such a plan the following steps are performed. First, the CT dataset of the patient is segmented [1], which enables us to treat the different bones and broken fragments separately. Next the surface of this volumetric dataset is determined [2] and presented in a 3D environment. Since the fragments may have moved during the fracture, it is essential to move and rotate them back to their original anatomic position. Without this reduction, no implants can be inserted, since the final locations of the fragments are unknown. Previous solutions to the fracture reduction problem included moving the fragments with the mouse, or a special 3D haptic device. The former is not intuitive to use since the mouse is only 2D, and the later is expensive and still requires learning.
1 aErdőhelyi, Balázs1 aVarga, Endre uhttps://www.inf.u-szeged.hu/publication/semi-automatic-bone-fracture-reduction-in-surgical-planning00586nas a2200145 4500008004100000245008400041210007600125260003300201300001000234100001900244700001700263700002500280700002000305856011500325 2009 eng d00aSíkbeli alakzatok regisztrációja kovariáns függvények felhasználásával0 aSíkbeli alakzatok regisztrációja kovariáns függvények felhasznál aBudapestbAkaprintcJan 2009 a1 - 81 aDomokos, Csaba1 aKato, Zoltan1 aChetverikov, Dmitrij1 aSziranyi, Tamas uhttps://www.inf.u-szeged.hu/publication/sikbeli-alakzatok-regisztracioja-kovarians-fuggvenyek-felhasznalasaval00568nas a2200157 4500008004100000245006400041210006400105260003300169300001000202100001900212700001900231700001700250700002500267700002000292856009800312 2009 eng d00aSíkhomográfia paramétereinek becslése bináris képeken0 aSíkhomográfia paramétereinek becslése bináris képeken aBudapestbAkaprintcJan 2009 a1 - 81 aNemeth, Jozsef1 aDomokos, Csaba1 aKato, Zoltan1 aChetverikov, Dmitrij1 aSziranyi, Tamas uhttps://www.inf.u-szeged.hu/publication/sikhomografia-parametereinek-becslese-binaris-kepeken01168nas a2200121 4500008004100000245006500041210006500106260001200171520076400183100001800947700001700965856006400982 2009 eng d00aSupervised Color Image Segmentation in a Markovian Framework0 aSupervised Color Image Segmentation in a Markovian Framework c2009///3 aThis is the sample implementation of a Markov random field based color image segmentation algorithm described in the following paper: Zoltan Kato, Ting Chuen Pong, and John Chung Mong Lee. Color Image Segmentation and Parameter Estimation in a Markovian Framework. Pattern Recognition Letters, 22(3-4):309--321, March 2001. Note that the current demo program implements only a supervised version of the segmentation method described in the above paper (i.e. parameter values are learned interactively from representative regions selected by the user). Otherwise, the program implements exactly the color MRF model proposed in the paper. Images are automatically converted from RGB to the perceptually uniform CIE-L*u*v* color space before segmentation.
1 aGara, Mihály1 aKato, Zoltan uhttp://www.inf.u-szeged.hu/~kato/software/colormrfdemo.html00313nas a2200109 4500008004100000245002300041210002300064260001200087100001700099700002400116856006300140 2009 eng d00aVCP volar approach0 aVCP volar approach c2009///1 aVarga, Endre1 aErdőhelyi, Balázs uhttps://www.inf.u-szeged.hu/publication/vcp-volar-approach00533nam a2200121 4500008004100000245007000041210006700111260007200178100001900250700001900269700002100288856010200309 2009 eng d00aVI. Magyar Számítógépes Nyelvészeti Konferencia (MSZNY 2009)0 aVI Magyar Számítógépes Nyelvészeti Konferencia MSZNY 2009 aSzegedbSzegedi Tudományegyetem Informatikai Tanszékcsoportc20091 aTanacs, Attila1 aSzauter, Dóra1 aVincze, Veronika uhttps://www.inf.u-szeged.hu/publication/vi-magyar-szamitogepes-nyelveszeti-konferencia-mszny-200901265nas a2200145 4500008004100000020001400041245005100055210004800106260027600154300001400430490000800444520055300452100002301005856009101028 2008 eng d a0304-397500aA 3D fully parallel surface-thinning algorithm0 a3D fully parallel surfacethinning algorithm aAHUJA 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, bElseviercOct 2008 a119 - 1350 v4063 aThe 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.
1 aPalágyi, Kálmán uhttps://www.inf.u-szeged.hu/publication/a-3d-fully-parallel-surface-thinning-algorithm00496nas a2200157 4500008004100000020001400041245005500055210005300110260000900163300000600172490000800178100002400186700001600210700001900226856009300245 2008 eng d a0304-397500aAlgorithms, automata, complexity and games Preface0 aAlgorithms automata complexity and games Preface c2008 a10 v4061 aBatenburg, Joost, K1 aNagy, Antal1 aNivat, Maurice uhttps://www.inf.u-szeged.hu/publication/algorithms-automata-complexity-and-games-preface01554nas a2200145 4500008004100000020001400041245009800055210006900153260004800222300001400270490000700284520095900291100002001250856013801270 2008 eng d a0324-721X00aOn the ambiguity of reconstructing hv-convex binary matrices with decomposable configurations0 aambiguity of reconstructing hvconvex binary matrices with decomp aSzeged, HungarybUniversity of Szegedc2008 a367 - 3770 v183 aReconstructing binary matrices from their row, column, diagonal, and antidiagonal sums (also called projections) plays a central role in discrete tomography. One of the main difficulties in this task is that in certain cases the projections do not uniquely determine the binary matrix. This can yield an extremely large number of (sometimes very different) solutions. This ambiguity can be reduced by having some prior knowledge about the matrix to be reconstructed. The main challenge here is to find classes of binary matrices where ambiguity is drastically reduced or even completely eliminated. The goal of this paper is to study the class of $hv$-convex matrices which have decomposable configurations from the viewpoint of ambiguity. First, we give a negative result in the case of three projections. Then, we present a heuristic for the reconstruction using four projections and analyze its performance in quality and running time.
1 aBalázs, Péter uhttps://www.inf.u-szeged.hu/publication/on-the-ambiguity-of-reconstructing-hv-convex-binary-matrices-with-decomposable-configurations02693nas a2200193 4500008004100000020001400041245006300055210006300118260000900181300000900190490000700199520208200206100001902288700001702307700002802324700002302352700002102375856010302396 2008 eng d a0146-040400aAutomated Glaucoma Detection From Color Fundus Photographs0 aAutomated Glaucoma Detection From Color Fundus Photographs c2008 a18630 v493 aPurpose:The presentation of a novel fully automated system thatseparates glaucomatous from healthy cases based on digital fundus images. Methods:A pre-processing step eliminates certain disease independent variations such as illumination inhomogeneities, papilla size differences and vessel structures from the input images. In order to characterize glaucomatous changes, generic feature types (pixel intensities, frequency coefficients, histogram parameters, Gabor textures, spline coefficients) are extracted. In contrast to existing approaches, each feature vector is compressed by Principal Component Analysis. The classification of the transformed features is done by a state- of-the-art nu-Support Vector Machine.For the elaborate experimental evaluation of the proposed system architecture we took a large set of papilla-centered color fundus images of 100 glaucoma patients (FDT test time 67.25 ± 33.4 s) and 100 normals (overall mean age 57.0 ± 10.0 years) from the Erlangen Glaucoma Registry (Kowa non-myd, FOV 22,5°). The gold standard was given by an experienced ophthalmologist based on a complete ophthalmological examination with ophthalmoscopy, visual field, IOP, FDT, and HRT II. Results:Classification of compressed raw pixel intensities gained a success rate of 83% with a specificity of 0.72 and a sensitivity of 0.94 to detect glaucomatous cases. A success rate of 86% was achieved by using spline coefficients with a specificity of 0.78 and a sensitivity of 0.94 to detect glaucoma. The combination of both features slightly increased specificity to 0.82 (sensitivity = 0.92). The kappa statistic of 0.74 states a robust classification scheme. Conclusions:The proposed algorithm achieves a robust and competitive glaucoma detection rate. It is comparable to known methods applied to topographic papilla images and does not depend on segmentation-based measurements. For the first time, automated glaucoma detection is performed on color fundus images. Thus, fundus photography is an appropriate modality for computer-assisted glaucoma screening.
1 aBock, Rudriger1 aMeier, Jörg1 aNyúl, László, Gábor1 aHornegger, Joachim1 aMichelson, Georg uhttps://www.inf.u-szeged.hu/publication/automated-glaucoma-detection-from-color-fundus-photographs01516nas a2200157 4500008004100000020002200041245006500063210006500128260005200193300001400245520093500259100001901194700001701213700002301230856010501253 2008 eng d a978-3-540-69811-100aBinary image registration using covariant gaussian densities0 aBinary image registration using covariant gaussian densities aPóvoa de Varzim, PortugalbSpringercJune 2008 a455 - 4643 aWe consider the estimation of 2D affine transformations aligning a known binary shape and its distorted observation. The classical way to solve this registration problem is to find correspondences between the two images and then compute the transformation parameters from these landmarks. In this paper, we propose a novel approach where the exact transformation is obtained as a least-squares solution of a linear system. The basic idea is to fit a Gaussian density to the shapes which preserves the effect of the unknown transformation. It can also be regarded as a consistent coloring of the shapes yielding two rich functions defined over the two shapes to be matched. The advantage of the proposed solution is that it is fast, easy to implement, works without established correspondences and provides a unique and exact solution regardless of the magnitude of transformation. © 2008 Springer-Verlag Berlin Heidelberg.
1 aDomokos, Csaba1 aKato, Zoltan1 aCampilho, Aurélio uhttps://www.inf.u-szeged.hu/publication/binary-image-registration-using-covariant-gaussian-densities00711nas a2200181 4500008003900000245011200039210006900151260001200220300001200232100002200244700001700266700001900283700001800302700001600320700002600336700001900362856014800381 2008 d00aComparison Radiography and Tomography Possibilities of FRM-II (20 MW) and Budapest (10 MW) Research Reactor0 aComparison Radiography and Tomography Possibilities of FRMII 20 cOctober a18–271 aBalaskó, Márton1 aKuba, Attila1 aTanacs, Attila1 aKiss, Zoltán1 aNagy, Antal1 aSchillinger, Burkhard1 aArif, Muhammed uhttps://www.inf.u-szeged.hu/publication/comparison-radiography-and-tomography-possibilities-of-frm-ii-20-mw-and-budapest-10-mw-research-reactor01654nas a2200145 4500008004100000245010400041210006900145260004600214300001200260490000900272520104500281100002001326700001801346856014401364 2008 eng d00aDecision trees in binary tomography for supporting the reconstruction of hv-convex connected images0 aDecision trees in binary tomography for supporting the reconstru aJuan-les-Pins, FrancebSpringercOct 2008 a433-4430 v52593 aIn binary tomography, several algorithms are known for reconstructing binary images having some geometrical properties from their projections. In order to choose the appropriate reconstruction algorithm it is necessary to have a priori information of the image to be reconstructed. In this way we can improve the speed and reduce the ambiguity of the reconstruction. Our work is concerned with the problem of retrieving geometrical information from the projections themselves. We investigate whether it is possible to determine geometric features of binary images if only their projections are known. Most of the reconstruction algorithms based on geometrical information suppose $hv$-convexity or connectedness about the image to be reconstructed. We investigate those properties in detail, and also the task of separating 4- and 8-connected images. We suggest decision trees for the classification, and show some preliminary experimental results of applying them for the class of $hv$-convex and connected discrete sets.
1 aBalázs, Péter1 aGara, Mihály uhttps://www.inf.u-szeged.hu/publication/decision-trees-in-binary-tomography-for-supporting-the-reconstruction-of-hv-convex-connected-images00715nas a2200169 4500008004100000245010400041210006900145260005300214300000700267100001800274700002000292700002300312700002300335700002000358700002300378856014400401 2008 eng d00aDetermination of geometric features of binary images from their projections by using decision trees0 aDetermination of geometric features of binary images from their aSzeged, HungarybUniversity of SzegedcJuly 2008 a261 aGara, Mihály1 aBalázs, Péter1 aPalágyi, Kálmán1 aBánhelyi, Balázs1 aGergely, Tamás1 aMatievics, István uhttps://www.inf.u-szeged.hu/publication/determination-of-geometric-features-of-binary-images-from-their-projections-by-using-decision-trees01271nas a2200145 4500008004100000020001400041245010600055210006900161260003100230300001400261490000700275520067700282100002000959856014600979 2008 eng d a0218-654300aDiscrete tomographic reconstruction of binary images with disjoint components using shape information0 aDiscrete tomographic reconstruction of binary images with disjoi bWorld ScientificcDec 2008 a189 - 2070 v143 aWe present a general framework for reconstructing binary images with disjoint components from the horizontal and vertical projections. We develop a backtracking algorithm that works for binary images having components from an arbitrary class. Thus, a priori knowledge about the components of the image to be reconstructed can be incorporated into the reconstruction process. In addition, we show how to extend the algorithm to obtain a branch-and-bound scheme useful to reconstruct images satisfying some further properties (for example similarity to a model image) as much as possible. Experimental results are also presented.
1 aBalázs, Péter uhttps://www.inf.u-szeged.hu/publication/discrete-tomographic-reconstruction-of-binary-images-with-disjoint-components-using-shape-information02754nas a2200205 4500008004100000020001400041245012500055210006900180260001900249300000900268490000700277520197900284100001702263700001902280700001402299700002802313700002302341700002102364856016302385 2008 eng d a0146-040400aThe Erlanger Glaucoma Matrix - A Visualization Approach Towards Optimal Glaucomatous Optic Nerve Head Image Presentation0 aErlanger Glaucoma Matrix A Visualization Approach Towards Optima bArvocMay 2008 a18930 v493 aPurpose:Presentation of a two-dimensional visualization approachfor intuitive and reliable glaucoma diagnosis and for setting a current observation into a relationship with pre-diagnosed data. Methods:We present a new matrix visualization technique for digital optic nerve head images. The matrix is filled with 300 pre-diagnosed reference images which show different papilla sizes and varying stages of glaucoma disease. In matrix rows the samples range from healthy ones to advanced glaucoma cases. In matrix columns the papillas are ordered by the size of the optic nerve head. The approach generalizes such that the samples can be ordered by additional criteria, too, e. g. subjects' age or anamnestic risk factors. Furthermore arbitrary image modalities and image numbers can be incorporated. Results:The glaucoma classification of a single image is difficult even for experts. Our proposed visualization provides an intuitive way for neighborhood comparisons of optic nerve head images. It allows to evaluate an image in the context of given pre-diagnosed reference samples. By the two-dimensional presentation one can study disease-dependent changes separate from other variations. Glaucoma progression can be observed separated from size variations. Thus, it supports diagnosis even in problematic cases such as macropapillas. The trustworthiness of physicians' diagnosis can be improved. Conclusions:Our approach gives insights on glaucomatous optic nerve appearance in relation to varying papilla sizes. The novel visualization of a single image within the context of other images is considered as an important tool for learning and training medical glaucoma detection. This approach visualizes computer calculated risk estimations by presenting the result within context of given gold-standard images. In contrast to pure classification systems our method does not come up with a hard decision but explains the relationship to similar pre- diagnosed cases.
1 aMeier, Jörg1 aBock, Rudriger1 aForman, C1 aNyúl, László, Gábor1 aHornegger, Joachim1 aMichelson, Georg uhttps://www.inf.u-szeged.hu/publication/the-erlanger-glaucoma-matrix-a-visualization-approach-towards-optimal-glaucomatous-optic-nerve-head-image-presentation00562nas a2200181 4500008004100000020001400041245005400055210005400109260001900163300000900182490000700191100001700198700002000215700002400235700001300259700001400272856009400286 2008 eng d a1010-518200aFinite element analysis of mandible virtual model0 aFinite element analysis of mandible virtual model bElsevierc2008 aS2040 v361 aVarga, Endre1 aRaskó, Zoltán1 aErdőhelyi, Balázs1 aSeres, L1 aPiffko, J uhttps://www.inf.u-szeged.hu/publication/finite-element-analysis-of-mandible-virtual-model00573nas a2200133 4500008004100000020001400041245010600055210006900161260002300230300001200253490000800265100002000273856014600293 2008 eng d a0304-397500aA framework for generating some discrete sets with disjoint components by using uniform distributions0 aframework for generating some discrete sets with disjoint compon bElseviercOct 2008 a15 - 230 v4061 aBalázs, Péter uhttps://www.inf.u-szeged.hu/publication/a-framework-for-generating-some-discrete-sets-with-disjoint-components-by-using-uniform-distributions01184nas a2200193 4500008004100000020001400041245007700055210006900132260001300201300001400214490000700228520053400235100001900769700001800788700002800806700001700834700002000851856011900871 2008 eng d a0094-240500aGeometrical model-based segmentation of the organs of sight on CT images0 aGeometrical modelbased segmentation of the organs of sight on CT cFeb 2008 a735 - 7430 v353 aSegmentation of organs of sight such as the eyeballs, lenses,and optic nerves is a time consuming task for clinicians. The small size of the organs and the similar density of the surrounding tissues make the segmentation difficult. We developed a new algorithm to segment these organs with minimal user interaction. The algorithm needs only three seed points to fit an initial geometrical model to start an effective segmentation. The clinical evaluation shows that the output of our method is useful in clinical practice.
1 aBekes, György1 aMáté, Eörs1 aNyúl, László, Gábor1 aKuba, Attila1 aFidrich, Márta uhttps://www.inf.u-szeged.hu/publication/geometrical-model-based-segmentation-of-the-organs-of-sight-on-ct-images-000480nas a2200157 4500008004100000020001400041245004000055210003700095260003500132300001000167490000800177100002400185700001600209700001900225856007800244 2008 eng d a0304-397500aIn Memoriam Attila Kuba (1953-2006)0 aIn Memoriam Attila Kuba 19532006 aKUBA A, PUBLICATION LISTc2008 a2 - 70 v4061 aBatenburg, Joost, K1 aNagy, Antal1 aNivat, Maurice uhttps://www.inf.u-szeged.hu/publication/in-memoriam-attila-kuba-1953-200601602nas a2200229 4500008004100000245006200041210006000103260005800163520086900221100002001090700002401110700001801134700001701152700001801169700001601187700002801203700002301231700001901254700001901273700002001292856006001312 2008 eng d00aA képfeldolgozás kutatása a Szegedi Tudományegyetemen0 aképfeldolgozás kutatása a Szegedi Tudományegyetemen aDebrecenbDebreceni Egyetem Informatikai Karc2008///3 aA 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.
1 aBalázs, Péter1 aErdőhelyi, Balázs1 aKatona, Endre1 aKato, Zoltan1 aMáté, Eörs1 aNagy, Antal1 aNyúl, László, Gábor1 aPalágyi, Kálmán1 aTanacs, Attila1 aPethő, Attila1 aHerdon, Miklós uhttp://www.agr.unideb.hu/if2008/kiadvany/papers/E62.pdf01528nas a2200205 4500008004100000245010500041210006900146260004900215300001400264520073300278100001701011700001901028700002801047700002301075700002101098700001601119700002201135700002001157856014501177 2008 eng d00aNovel Visualization Approach of an Automated Image Based Glaucoma Risk Index for Intuitive Diagnosis0 aNovel Visualization Approach of an Automated Image Based Glaucom aBrnobBrno University of Technologyc2008/// a205 - 2093 aGlaucoma is one of the most common causes for blindnessworldwide. Screening is adequate to detect glaucoma at an early stage. Although it is supported by computer assisted tools no further information from former clinical studies is incorporated. We devised a novel visualization tool that presents additional comparative image data for the diagnosis process. Automated computation of a glaucoma risk index on color fundus photographs is used to initially position an undiagnosed image in reference data. The index achieves a competitive glaucoma detection rate. The combination of the automated risk index and the new visualization technique is an important tool towards a faster and more reliable diagnosis of glaucoma.
1 aMeier, Jörg1 aBock, Rudriger1 aNyúl, László, Gábor1 aHornegger, Joachim1 aMichelson, Georg1 aJan, Jiří1 aKonzuplik, Jiří1 aProvazník, Ivo uhttps://www.inf.u-szeged.hu/publication/novel-visualization-approach-of-an-automated-image-based-glaucoma-risk-index-for-intuitive-diagnosis01430nas a2200169 4500008004100000020002200041245004500063210003700108260004800145300001400193520087500207100002001082700002501102700002301127700002501150856008501175 2008 eng d a978-3-540-78274-200aOn the number of hv-convex discrete sets0 anumber of hvconvex discrete sets aBuffalo, NY, USAbSpringer VerlagcApr 2008 a112 - 1233 aOne of the basic problems in discrete tomography is thereconstruction of discrete sets from few projections. Assuming that the set to be reconstructed fulfills some geometrical properties is a commonly used technique to reduce the number of possibly many different solutions of the same reconstruction problem. The class of hv-convex discrete sets and its subclasses have a well-developed theory. Several reconstruction algorithms as well as some complexity results are known for those classes. The key to achieve polynomial-time reconstruction of an hv- convex discrete set is to have the additional assumption that the set is connected as well. This paper collects several statistics on hv-convex discrete sets, which are of great importance in the analysis of algorithms for reconstructing such kind of discrete sets. © 2008 Springer-Verlag Berlin Heidelberg.
1 aBalázs, Péter1 aBrimkov, Valentin, E1 aBarneva, Reneta, P1 aHauptman, Herbert, A uhttps://www.inf.u-szeged.hu/publication/on-the-number-of-hv-convex-discrete-sets01341nas a2200169 4500008004100000020002300041022001500064245006600079210006600145260004100211300001400252520074100266100001901007700001701026700002201043856010601065 2008 eng d a978-1-4244-1483-3 a1520-6149 00aParametric estimation of affine deformations of binary images0 aParametric estimation of affine deformations of binary images aLas Vegas, NV, USAbIEEEcMarch 2008 a889 - 8923 aWe consider the problem of planar object registration on binary images where the aligning transformation is restricted to the group of affine transformations. Previous approaches usually require established correspondences or the solution of nonlinear optimization problems. Herein we show that it is possible to formulate the problem as the solution of a system of up to third order polynomial equations. These equations are constructed in a simple way using some basic geometric information of binary images. It does not need established correspondences nor the solution of complex optimization problems. The resulting algorithm is fast and provides a direct solution regardless of the magnitude of transformation. ©2008 IEEE.
1 aDomokos, Csaba1 aKato, Zoltan1 aFrancos, Joseph M uhttps://www.inf.u-szeged.hu/publication/parametric-estimation-of-affine-deformations-of-binary-images01560nas a2200289 4500008004100000020002200041022001400063245008600077210006900163260005000232300001600282520059600298100002000894700001800914700001900932700001900951700001900970700002100989700001901010700001801029700002101047700001601068700001701084700002501101700001801126856012601144 2008 eng d a978-3-540-89645-6 a0302-974300aReconstruction of binary images with few disjoint components from two projections0 aReconstruction of binary images with few disjoint components fro aLas Vegas, NV, USAbSpringer VerlagcDec 2008 a1147 - 11563 aWe present a general framework for reconstructing binary imageswith few disjoint components from the horizontal and vertical projections. We develop a backtracking algorithm that works for binary images having components from an arbitrary class. Thus, a priori information about the components of the image to be reconstructed can be incorporated into the reconstruction process. In addition, we can keep control over the number of components which can increase the speed and accuracy of the reconstruction. Experimental results are also presented. © 2008 Springer Berlin Heidelberg.
1 aBalázs, Péter1 aBebis, George1 aBoyle, Richard1 aParvin, Bahram1 aKoracin, Darko1 aRemagnino, Paolo1 aPorikli, Fatih1 aPeters, Jörg1 aKlosowski, James1 aArns, Laura1 aChun, Yu, Ka1 aRhyne, Theresa-Marie1 aMonroe, Laura uhttps://www.inf.u-szeged.hu/publication/reconstruction-of-binary-images-with-few-disjoint-components-from-two-projections00493nas a2200133 4500008004100000020001400041245006700055210006700122260002500189300001400214490000700228100001700235856010700252 2008 eng d a0262-885600aSegmentation of color images via reversible jump MCMC sampling0 aSegmentation of color images via reversible jump MCMC sampling bElseviercMarch 2008 a361 - 3710 v261 aKato, Zoltan uhttps://www.inf.u-szeged.hu/publication/segmentation-of-color-images-via-reversible-jump-mcmc-sampling01308nas a2200217 4500008004100000020002200041022001400063245006100077210006100138260004900199300001400248520057800262100002000840700002300860700002100883700002000904700002500924700001900949700002100968856010100989 2008 eng d a978-3-540-79546-9 a0302-974300aSkeletonization based on metrical neighborhood sequences0 aSkeletonization based on metrical neighborhood sequences aSantorini, GreecebSpringer VerlagcMay 2008 a333 - 3423 aSkeleton 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.
1 aFazekas, Attila1 aPalágyi, Kálmán1 aKovács, György1 aNémeth, Gábor1 aGasteratos, Antonios1 aVincze, Markus1 aTsotsos, John, K uhttps://www.inf.u-szeged.hu/publication/skeletonization-based-on-metrical-neighborhood-sequences00718nas a2200181 4500008003900000245011500039210006900154260001200223300001400235100002200249700002100271700001800292700001900310700001600329700001700345700001900362856015500381 2008 d00aStudy of the Inner Structure of a Damaged Control Rod by Neutron and X-ray Radiography and Discrete Tomography0 aStudy of the Inner Structure of a Damaged Control Rod by Neutron cOctober a294–3031 aBalaskó, Márton1 aSváb, Erzsébet1 aKiss, Zoltán1 aTanacs, Attila1 aNagy, Antal1 aKuba, Attila1 aArif, Muhammed uhttps://www.inf.u-szeged.hu/publication/study-of-the-inner-structure-of-a-damaged-control-rod-by-neutron-and-x-ray-radiography-and-discrete-tomography00670nas a2200181 4500008004100000245007300041210006900114260003800183490001800221100002000239700001700259700001800276700001800294700001700312700002800329700001800357856011300375 2008 eng d00aSystems and methods for segmenting an organ in a plurality of images0 aSystems and methods for segmenting an organ in a plurality of im aAmerikai Egyesült Államokc20080 vUS200408582411 aFidrich, Márta1 aMakay, Géza1 aMáté, Eörs1 aBalogh, Emese1 aKuba, Attila1 aNyúl, László, Gábor1 aKanyó, Judit uhttps://www.inf.u-szeged.hu/publication/systems-and-methods-for-segmenting-an-organ-in-a-plurality-of-images01901nas a2200229 4500008004100000245007400041210006900115260003400184300001400218520110100232100002001333700001801353700002901371700002301400700002801423700002301451700002001474700001901494700002201513700002201535856011401557 2008 eng d00aTechniques of Virtual Dissection of the Colon Based on Spiral CT Data0 aTechniques of Virtual Dissection of the Colon Based on Spiral CT aBerlinbSpringer-Verlagc2008 a257 - 2683 aColorectal 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).
1 aSorantin, Erich1 aBalogh, Emese1 aBartroli, Anna, Vilanova1 aPalágyi, Kálmán1 aNyúl, László, Gábor1 aLindbichler, Franz1 aRuppert, Andrea1 aNeri, Emanuele1 aCaramella, Davide1 aBartolozzi, Carlo uhttps://www.inf.u-szeged.hu/publication/techniques-of-virtual-dissection-of-the-colon-based-on-spiral-ct-data00299nas a2200097 4500008004100000245003300041210003300074260000900107300001200116856007300128 2008 eng d00aTheoretical Computer Science0 aTheoretical Computer Science c2008 a1 - 170 uhttps://www.inf.u-szeged.hu/publication/theoretical-computer-science00388nas a2200109 4500008004100000245004800041210004800089260001200137100001700149700002400166856008800190 2008 eng d00aVirtual Planning Tool for Surgical Planning0 aVirtual Planning Tool for Surgical Planning c2008///1 aVarga, Endre1 aErdőhelyi, Balázs uhttps://www.inf.u-szeged.hu/publication/virtual-planning-tool-for-surgical-planning01505nas a2200193 4500008004100000020001400041245006400055210006300119260001400182300001400196490000600210520089000216100001901106700002801125700001801153700001701171700002001188856010301208 2007 eng d a1861-641000a3D segmentation of liver, kidneys and spleen from CT images0 a3D segmentation of liver kidneys and spleen from CT images cJune 2007 aS45 - S470 v23 aThe clinicians often need to segment the abdominal organs forradiotherapy planning. Manual segmentation of these organs is very time-consuming, therefore automated methods are desired. We developed a semi-automatic segmentation method to outline liver, spleen and kidneys. It works on CT images without contrast intake that are acquired with a routine clinical protocol. From an initial surface around a user defined seed point, the segmentation of the organ is obtained by an active surface algorithm. Pre- and post-processing steps are used to adapt the general method for specific organs. The evaluation results show that the accuracy of our method is about 90%, which can be further improved with little manual editing, and that the precision is slightly higher than that of manual contouring. Our method is accurate, precise and fast enough to use in the clinical practice.
1 aBekes, György1 aNyúl, László, Gábor1 aMáté, Eörs1 aKuba, Attila1 aFidrich, Márta uhttps://www.inf.u-szeged.hu/publication/3d-segmentation-of-liver-kidneys-and-spleen-from-ct-images00980nas a2200181 4500008004100000020002200041022001400063245004800077210004400125260004700169300001400216520039400230100002300624700002500647700001900672700001900691856008800710 2007 eng d a978-3-540-74271-5 a0302-974300aA 3-subiteration surface-thinning algorithm0 a3subiteration surfacethinning algorithm aVienna, AustriabSpringer VerlagcAug 2007 a628 - 6353 aThinning 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.
1 aPalágyi, Kálmán1 aKropatsch, Walter, G1 aKampel, Martin1 aHanbury, Allan uhttps://www.inf.u-szeged.hu/publication/a-3-subiteration-surface-thinning-algorithm01691nam a2200121 4500008004100000245005700041210005700098260002100155520125600176100002301432700001701455856009701472 2007 eng d00aAdvances in Discrete Tomography and Its Applications0 aAdvances in Discrete Tomography and Its Applications bBirkhauserc20073 aAdvances in Discrete Tomography and Its Applications is a unified presentation of new methods, algorithms, and select applications that are the foundations of multidimensional image reconstruction by discrete tomographic methods. The self-contained chapters, written by leading mathematicians, engineers, and computer scientists, present cutting-edge research and results in the field. Three main areas are covered: foundations, algorithms, and practical applications. Following an introduction that reports the recent literature of the field, the book explores various mathematical and computational problems of discrete tomography including new applications. Topics and Features: * introduction to discrete point X-rays * uniqueness and additivity in discrete tomography * network flow algorithms for discrete tomography * convex programming and variational methods * applications to electron microscopy, materials science, nondestructive testing, and diagnostic medicine Professionals, researchers, practitioners, and students in mathematics, computer imaging, biomedical imaging, computer science, and image processing will find the book to be a useful guide and reference to state-of-the-art research, methods, and applications.
1 aHerman, Gábor, T.1 aKuba, Attila uhttps://www.inf.u-szeged.hu/publication/advances-in-discrete-tomography-and-its-applications00602nas a2200157 4500008004100000245006000041210006000101260007300161300001400234100002300248700001900271700001800290700002000308700002000328856009600348 2007 eng d00aAlakreprezentáció szférikus harmonikus sorfejtéssel0 aAlakreprezentáció szférikus harmonikus sorfejtéssel aDebrecenbKépfeldolgozók és Alakfelismerők TársaságacJan 2007 a275 - 2821 aPalágyi, Kálmán1 aPintér, Csaba1 aMáté, Eörs1 aFazekas, Attila1 aHajdú, András uhttps://www.inf.u-szeged.hu/publication/alakreprezentacio-szferikus-harmonikus-sorfejtessel01809nas a2200289 4500008004100000245008600041210006900127260007000196300001400266490000600280520081400286100001901100700001701119700002801136700002201164700002101186700002301207700002301230700001901253700002101272700002301293700001801316700002201334700001801356700001901374856012601393 2007 eng d00aAppearance-based Approach to Extract an Age-related Biomarker from Retinal Images0 aAppearancebased Approach to Extract an Agerelated Biomarker from aErlangenbFriedrich-Alexander University Erlangen-Nurembergc2007 a127 - 1310 v13 aWe present an appearance-based method that extracts a new age-related biomarker from retina images. The Principal Component Analysis is applied on intensity values of the illumination corrected green channel of fundus images. The algorithm does not use segmentation, is robust and shows a high range of reliability. It identified an age-related feature with a strong influence of the temporal parapapillary area and the optic nerve head. The feature correlates with chronological age of the participants and is significantly influenced by the appearance of cardiovascular risk factors such as smoking and hypertension, and thus it can be designated a biomarker. We extract and validate a medical parameter from retina images applying a purely data-driven approach without using any prior knowledge.
1 aBock, Rudriger1 aMeier, Jörg1 aNyúl, László, Gábor1 aWärntges, Simone1 aMichelson, Georg1 aHornegger, Joachim1 aHornegger, Joachim1 aMayr, Ernst, W1 aSchookin, Sergey1 aFeußner, Hubertus1 aNavab, Nassir1 aGulyaev, Yuri, V.1 aHöller, Kurt1 aGanzha, Victor uhttps://www.inf.u-szeged.hu/publication/appearance-based-approach-to-extract-an-age-related-biomarker-from-retinal-images00487nas a2200097 4500008004100000245008600041210006900127260004800196100002000244856012500264 2007 eng d00aBinary Tomography Using Geometrical Priors: Uniqueness and Reconstruction Results0 aBinary Tomography Using Geometrical Priors Uniqueness and Recons aSzeged, HungarybUniversity of Szegedc20071 aBalázs, Péter uhttps://www.inf.u-szeged.hu/publication/binary-tomography-using-geometrical-priors-uniqueness-and-reconstruction-results02149nas a2200229 4500008004100000020002200041022001400063245007500077210006900152260004200221300001400263520135500277100001901632700001701651700002101668700002801689700002301717700002301740700002301763700001801786856011501804 2007 eng d a978-3-540-74933-2 a0302-974300aClassifying Glaucoma with Image-based Features from Fundus Photographs0 aClassifying Glaucoma with Imagebased Features from Fundus Photog aHeidelbergbSpringer VerlagcSep 2007 a355 - 3643 aGlaucoma is one of the most common causes of blindness and it isbecoming even more important considering the ageing society. Because healing of died retinal nerve fibers is not possible early detection and prevention is essential. Robust, automated mass-screening will help to extend the symptom-free life of affected patients. We devised a novel, automated, appearance based glaucoma classification system that does not depend on segmentation based measurements. Our purely data-driven approach is applicable in large-scale screening examinations. It applies a standard pattern recognition pipeline with a 2-stage classification step. Several types of image-based features were analyzed and are combined to capture glaucomatous structures. Certain disease independent variations such as illumination inhomogeneities, size differences, and vessel structures are eliminated in the preprocessing phase. The “vessel-free” images and intermediate results of the methods are novel representations of the data for the physicians that may provide new insight into and help to better understand glaucoma. Our system achieves 86 % success rate on a data set containing a mixture of 200 real images of healthy and glaucomatous eyes. The performance of the system is comparable to human medical experts in detecting glaucomatous retina fundus images.
1 aBock, Rudriger1 aMeier, Jörg1 aMichelson, Georg1 aNyúl, László, Gábor1 aHornegger, Joachim1 aHamprecht, Fred, A1 aSchnorr, Christoph1 aJähne, Bernd uhttps://www.inf.u-szeged.hu/publication/classifying-glaucoma-with-image-based-features-from-fundus-photographs01460nas a2200145 4500008004100000020001400041245009200055210006900147260003100216300001200247490000700259520089800266100001801164856013201182 2007 eng d a1365-881600aContour line thinning and multigrid generation of raster-based digital elevation models0 aContour line thinning and multigrid generation of rasterbased di bTaylor & FranciscJan 2007 a71 - 820 v213 aThin plate spline interpolation is a widely used approach to generate a digital elevation model (DEM) from contour lines and scattered data. In practice, contour maps are scanned and vectorized, and after resampling in the target grid resolution, interpolation is performed. In this paper we demonstrate the limited accuracy of this process, and propose a high‐resolution processing method (without vectorization) that ensures maximum utilization of information in the source data. First, we discuss the mathematical background of thin plate spline interpolation, and explain the multigrid relaxation principle used to speed up convergence. After, we will show why fine tuning is necessary, especially when contour lines and elevation points are processed at the same time. Finally, our own contour thinning method that produces a significant reduction of elevation bias is described.
1 aKatona, Endre uhttps://www.inf.u-szeged.hu/publication/contour-line-thinning-and-multigrid-generation-of-raster-based-digital-elevation-models01509nas a2200157 4500008004100000020002200041245008700063210006900150260003900219300001400258520089400272100002001166700002101186700001701207856012701224 2007 eng d a978-0-8176-3614-200aDecomposition Algorithms for Reconstructing Discrete Sets with Disjoint Components0 aDecomposition Algorithms for Reconstructing Discrete Sets with D aCambridgebBirkhauser Bostonc2007 a153 - 1733 aThe reconstruction of discrete sets from their projections is a frequently studied field in discrete tomography with applications in electron microscopy, image processing, radiology, and so on. Several efficient reconstruction algorithms have been developed for certain classes of discrete sets having some good geometrical properties. On the other hand, it has been shown that the reconstruction under certain circumstances can be very time-consuming, even NP-hard. In this chapter we show how prior information that the set to be reconstructed consists of several components can be exploited in order to facilitate the reconstruction. We present some general techniques to decompose a discrete set into components knowing only its projections and thus reduce the reconstruction of a general discrete set to the reconstruction of single components, which is usually a simpler task.
1 aBalázs, Péter1 aHerman, Gábor T1 aKuba, Attila uhttps://www.inf.u-szeged.hu/publication/decomposition-algorithms-for-reconstructing-discrete-sets-with-disjoint-components01193nas a2200145 4500008004100000020001400041245008500055210006900140260002300209300001600232490000700248520064700255100002000902856012500922 2007 eng d a0262-885600aA decomposition technique for reconstructing discrete sets from four projections0 adecomposition technique for reconstructing discrete sets from fo bElseviercOct 2007 a1609 - 16190 v253 aThe reconstruction of discrete sets from four projections is in general an NP-hard problem. In this paper we study the class of decomposable discrete sets and give an efficient reconstruction algorithm for this class using four projections. It is also shown that an arbitrary discrete set which is Q-convex along the horizontal and vertical directions and consists of several components is decomposable. As a consequence of decomposability we get that in a subclass of hv-convex discrete sets the reconstruction from four projections can also be solved in polynomial time. Possible extensions of our method are also discussed.
1 aBalázs, Péter uhttps://www.inf.u-szeged.hu/publication/a-decomposition-technique-for-reconstructing-discrete-sets-from-four-projections01832nas a2200241 4500008004100000020002200041245006000063210005900123260002100182300001400203520108200217100002101299700001801320700001801338700001701356700001601373700001701389700002601406700002101432700002101453700001701474856009901491 2007 eng d a978-0-8176-3614-200aDiscrete Tomography Methods for Nondestructive Testing.0 aDiscrete Tomography Methods for Nondestructive Testing bBirkhauserc2007 a303 - 3323 aThe industrial nondestructive testing (NDT) of objects seems to be an ideal application of discrete tomography. In many cases, the objects consist of known materials, and a lot of a priori information is available (e.g., the description of an ideal object, which is similar to the actual one under investigation). One of the frequently used methods in NDT is to take projection images of the objects by some transmitting ray (e.g., X- or neutron-ray) and reconstruct the cross sections. But it can happen that only a few number of projections can be collected, because of long and/or expensive data acquisition, or the projections can be collected only from a limited range of directions. The chapter describes two DT reconstruction methods used in NDT experiments, shows the results of a DT procedure applied in the reconstruction of oblong objects having projections only from a limited range of angles, and, finally, suggests a few further possible NDT applications of DT.
1 aBaumann, Joachim1 aKiss, Zoltán1 aKrimmel, Sven1 aKuba, Attila1 aNagy, Antal1 aRodek, Lajos1 aSchillinger, Burkhard1 aStephan, Juergen1 aHerman, Gábor T1 aKuba, Attila uhttps://www.inf.u-szeged.hu/publication/discrete-tomography-methods-for-nondestructive-testing01874nas a2200229 4500008004100000020002200041022001400063245009100077210006900168260005000237300001400287520104100301100001701342700001901359700002101378700002801399700002301427700002501450700001901475700001901494856013101513 2007 eng d a978-3-540-74271-5 a0302-974300aEffects of Preprocessing Eye Fundus Images on Appearance Based Glaucoma Classification0 aEffects of Preprocessing Eye Fundus Images on Appearance Based G aBerlin; HeidelbergbSpringer VerlagcAug 2007 a165 - 1723 aEarly detection of glaucoma is essential for preventing one ofthe most common causes of blindness. Our research is focused on a novel automated classification system based on image features from fundus photographs which does not depend on structure segmentation or prior expert knowledge. Our new data driven approach that needs no manual assistance achieves an accuracy of detecting glaucomatous retina fundus images compareable to human experts. In this paper, we study image preprocessing methods to provide better input for more reliable automated glaucoma detection. We reduce disease independent variations without removing information that discriminates between images of healthy and glaucomatous eyes. In particular, nonuniform illumination is corrected, blood vessels are inpainted and the region of interest is normalized before feature extraction and subsequent classification. The effect of these steps was evaluated using principal component analysis for dimension reduction and support vector machine as classifier.
1 aMeier, Jörg1 aBock, Rudriger1 aMichelson, Georg1 aNyúl, László, Gábor1 aHornegger, Joachim1 aKropatsch, Walter, G1 aKampel, Martin1 aHanbury, Allan uhttps://www.inf.u-szeged.hu/publication/effects-of-preprocessing-eye-fundus-images-on-appearance-based-glaucoma-classification00530nas a2200133 4500008004100000245005500041210005500096260007300151300001400224100002300238700002000261700002000281856009500301 2007 eng d00aEfficient Implementation of 3D Thinning Algorithms0 aEfficient Implementation of 3D Thinning Algorithms aDebrecenbKépfeldolgozók és Alakfelismerők TársaságacJan 2007 a266 - 2741 aPalágyi, Kálmán1 aFazekas, Attila1 aHajdú, András uhttps://www.inf.u-szeged.hu/publication/efficient-implementation-of-3d-thinning-algorithms01398nas a2200229 4500008004100000020002200041245003400063210003300097260003900130300001400169520074500183100002000928700002000948700001700968700001600985700002001001700001801021700001801039700002101057700001701078856007301095 2007 eng d a978-0-8176-3614-200aEmission discrete tomography.0 aEmission discrete tomography aCambridgebBirkhauser Bostonc2007 a333 - 3663 aThree problems of emission discrete tomography (EDT) are presented. The first problem is the reconstruction of measurable plane sets from two absorbed projections. It is shown that Lorentz theorems can be generalized to this case. The second is the reconstruction of binary matrices from their absorbed row and columns sums if the absorption coefficient is μ0 = log((1+v/5)/2). It is proved that the reconstruction in this case can be done in polynomial time. Finally, a possible application of EDT in single photon emission computed tomography (SPECT) is presented: Dynamic structures are reconstructed after factor analysis.
1 aBarcucci, Elena1 aFrosini, Andrea1 aKuba, Attila1 aNagy, Antal1 aRinaldi, Simone1 aSamal, Martin1 aZopf, Steffen1 aHerman, Gábor T1 aKuba, Attila uhttps://www.inf.u-szeged.hu/publication/emission-discrete-tomography02490nas a2200193 4500008004100000020001400041245009500055210006900150260000900219300000900228490000700237520180400244100002102048700002202069700001902091700002802110700002302138856013502161 2007 eng d a0146-040400aExtraction of an Age-Related Biomarker From Retinal Images Using Appearance Based Approach0 aExtraction of an AgeRelated Biomarker From Retinal Images Using c2007 a21670 v483 aPurpose:To develop an appropriate algorithm from retina imagesusing an appearance-based version of the Principal Component Analysis and to test the age-related biomarker’s significance for patients at cardiovascular risk. Methods:Sixty-five men (age, 44.2 ± 11.4 years) and 60 women (age, 48.8 ± 12.6 years) without cardiovascular risk factors and without pathologic eye diagnosis were acquired during a clinical non-experimental cross-sectional survey and represented the control group. Forty-four hypertensive men (age, 45.5 ± 9.4 years; hypertensive for 5.9 ± 6.7 years) and 26 hypertensive women (age, 51.2 ± 7.3 years; hypertensive for 7.9 ± 7.1 years) as well as 57 male smokers (age, 41.8 ± 8.5 years; smoking for 20.6 ± 9.8 years; 15.3 ± 8.6 cigarettes per day) and 60 female smokers (age, 43.2 ± 9.5 years; smoking for 20.1 ± 10.7 years; 13.5 ± 8.1 cigarettes per day) were matched for age and sex to the respective number of control subjects. Results:The reliability of the algorithm was 0.958. The retinal biomarker correlated with age (men, -0.284, p = 0.017; women, -0.374, p = 0.001). Smokers showed a lower biomarker value (male, -0.16 ± 1.29; female, -0.12 ± 0.11) than age-matched control subjects (male, 0.72 ± 0.92, p < 0.001; female, 0.24 ± 0.98, p = 0.048). Hypertension had a similar influence to the biomarker in men (0.10 ± 0.84), but not in women (-0.46 ± 1.23) as compared to age-matched controls (male, 0.57 ± 0.95, p = 0.01; female, 0.06 ± 0.99, p = 0.09). Conclusions:The algorithm of the appearance-based version of the Principal Component Analysis identified an age-related image feature dependent on light intensity with a strong influence to the temporal parapapillary area. It may be used to identify patients at cardiovascular risk.
1 aMichelson, Georg1 aWärntges, Simone1 aBock, Rudriger1 aNyúl, László, Gábor1 aHornegger, Joachim uhttps://www.inf.u-szeged.hu/publication/extraction-of-an-age-related-biomarker-from-retinal-images-using-appearance-based-approach00590nas a2200157 4500008004100000245007700041210006900118260004600187300001200233100001700245700001900262700002800281700002100309700001500330856008700345 2007 eng d00aEye Fundus Image Processing System for Automated Glaucoma Classification0 aEye Fundus Image Processing System for Automated Glaucoma Classi aIlmenaubTechnische UniversitatcSep 2007 a81 - 841 aMeier, Jörg1 aBock, Rudriger1 aNyúl, László, Gábor1 aMichelson, Georg1 aScharff, P uhttp://www.db-thueringen.de/servlets/DerivateServlet/Derivate-12272/IWK_2007_2.pdf00519nas a2200109 4500008004100000245007600041210006900117260008200186490000800268100001900276856011400295 2007 eng d00aThe 'Gas of Circles' Model and its Application to Tree Crown Extraction0 aGas of Circles Model and its Application to Tree Crown Extractio bUniversity of Nice - Sophia Antipolis and University of SzegedcDecember 20070 vPhD1 aHorvath, Peter uhttps://www.inf.u-szeged.hu/publication/the-gas-of-circles-model-and-its-application-to-tree-crown-extraction00590nas a2200145 4500008003900000245008600039210006900125260002500194100001900219700001600238700002000254700002300274700002300297856012400320 2007 d00aA 'gas of Circles' Phase Field Model and its Application to Tree Crown Extraction0 agas of Circles Phase Field Model and its Application to Tree Cro aPoznan, Polandc20071 aHorvath, Peter1 aJermyn, Ian1 aDomanski, Marek1 aStasinski, Ryszard1 aBartkowiak, Maciej uhttps://www.inf.u-szeged.hu/publication/a-gas-of-circles-phase-field-model-and-its-application-to-tree-crown-extraction01791nas a2200169 4500008004100000020002200041022001400063245007000077210006900147260004900216300001400265520115400279100002001433700002801453700003001481856011001511 2007 eng d a978-3-540-73039-2 a0302-974300aGeneration and empirical investigation of hv-Convex discrete sets0 aGeneration and empirical investigation of hvConvex discrete sets aAalborg, DenmarkbSpringer VerlagcJune 2007 a344 - 3533 aOne of the basic problems in discrete tomography is thereconstruction of discrete sets from few projections. Assuming that the set to be reconstructed fulfils some geometrical properties is a commonly used technique to reduce the number of possibly many different solutions of the same reconstruction problem. Since the reconstruction from two projections in the class of so-called hv-convex sets is NP-hard this class is suitable to test the efficiency of newly developed reconstruction algorithms. However, until now no method was known to generate sets of this class from uniform random distribution and thus only ad hoc comparison of several reconstruction techniques was possible. In this paper we first describe a method to generate some special hv-convex discrete sets from uniform random distribution. Moreover, we show that the developed generation technique can easily be adapted to other classes of discrete sets, even for the whole class of hv- convexes. Several statistics are also presented which are of great importance in the analysis of algorithms for reconstructing hv-convex sets. © Springer-Verlag Berlin Heidelberg 2007.
1 aBalázs, Péter1 aErsbøll, Bjarne, Kjær1 aPedersen, Kim, Steenstrup uhttps://www.inf.u-szeged.hu/publication/generation-and-empirical-investigation-of-hv-convex-discrete-sets00715nas a2200169 4500008004100000245009900041210007600140260007300216300001400289100001900303700001600322700001700338700002100355700002000376700002000396856012900416 2007 eng d00aKör alakú objektumok szegmentálása magasabb rendű aktív kontúr modellek segítségével0 aKör alakú objektumok szegmentálása magasabb rendű aktív kontúr m aDebrecenbKépfeldolgozók és Alakfelismerők TársaságacJan 2007 a133 - 1401 aHorvath, Peter1 aJermyn, Ian1 aKato, Zoltan1 aZerubia, Josiane1 aFazekas, Attila1 aHajdú, András uhttps://www.inf.u-szeged.hu/publication/kor-alaku-objektumok-szegmentalasa-magasabb-rendu-aktiv-kontur-modellek-segitsegevel00416nas a2200097 4500008004100000245007100041210006900112260000900181100001700190856011100207 2007 eng d00aMarkovian Image Models and their Application in Image Segmentation0 aMarkovian Image Models and their Application in Image Segmentati c20071 aKato, Zoltan uhttps://www.inf.u-szeged.hu/publication/markovian-image-models-and-their-application-in-image-segmentation00586nas a2200145 4500008004100000022001700041245009200058210006900150250002600219260000900245100001900254700001800273700001700291856013200308 2007 eng d a#2007000204600aMethod and system for automatically transforming CT studies to a common reference frame0 aMethod and system for automatically transforming CT studies to a aUS Patent Application c20071 aTanacs, Attila1 aMáté, Eörs1 aKuba, Attila uhttps://www.inf.u-szeged.hu/publication/method-and-system-for-automatically-transforming-ct-studies-to-a-common-reference-frame00653nas a2200157 4500008003900000245010900039210006900148260002900217300001200246490000900258100001900267700002200286700001700308700002100325856014900346 2007 d00aA Multispectral Data Model for Higher-Order Active Contours and its Application to Tree Crown Extraction0 aMultispectral Data Model for HigherOrder Active Contours and its aDelft, Netherlandsc2007 a200-2110 v46781 aHorvath, Peter1 aPhilips, Wilfried1 aPopescu, Dan1 aScheunders, Paul uhttps://www.inf.u-szeged.hu/publication/a-multispectral-data-model-for-higher-order-active-contours-and-its-application-to-tree-crown-extraction00652nas a2200169 4500008003900000245009500039210006900134260002600203300001200229490000900241100001900250700001600269700002600285700001900311700001900330856013300349 2007 d00aA New Phase Field Model of a 'gas of Circles' for Tree Crown Extraction from Aerial Images0 aNew Phase Field Model of a gas of Circles for Tree Crown Extract aVienna, Austriac2007 a702-7090 v46731 aHorvath, Peter1 aJermyn, Ian1 aKropatsch, Walter, G.1 aKampel, Martin1 aHanbury, Allan uhttps://www.inf.u-szeged.hu/publication/a-new-phase-field-model-of-a-gas-of-circles-for-tree-crown-extraction-from-aerial-images00663nas a2200157 4500008004100000245008500041210006900126260007300195300001400268100001900282700001700301700002200318700002000340700002000360856012500380 2007 eng d00aParametric Estimation of Two-Dimensional Affine Transformations of Binary Images0 aParametric Estimation of TwoDimensional Affine Transformations o aDebrecenbKépfeldolgozók és Alakfelismerők TársaságacJan 2007 a257 - 2651 aDomokos, Csaba1 aKato, Zoltan1 aFrancos, Joseph M1 aFazekas, Attila1 aHajdú, András uhttps://www.inf.u-szeged.hu/publication/parametric-estimation-of-two-dimensional-affine-transformations-of-binary-images01745nas a2200181 4500008004100000020002300041245007900064210006900143260003700212300001400249520109300263100002001356700001401376700001601390700001701406700002101423856011901444 2007 eng d a978-953-184-116-0 00aReconstructing some hv-convex binary images from three or four projections0 aReconstructing some hvconvex binary images from three or four pr aIstanbul, TurkeybIEEEcSep 2007 a136 - 1403 aThe reconstruction of binary images from their projections is animportant problem in discrete tomography. The main challenge in this task is that in certain cases the projections do not uniquely determine the binary image. This can yield an extremely large number of (sometimes very different) solutions. Moreover, under certain circumstances the reconstruction becomes NP-hard. A commonly used technique to reduce ambiguity and to avoid intractability is to suppose that the image to be reconstructed arises from a certain class of images having some geometrical properties. This paper studies the reconstruction problem in the class of hv-convex images having their components in so-called decomposable configurations. First, we give a negative result showing that there can be exponentially many images of the above class having the same three projections. Then, we present a heuristic that uses four projections to reconstruct an hv-convex image with decomposable configuration. We also analyze the performance of our heuristic from the viewpoints of accuracy and running time.
1 aBalázs, Péter1 aPetrou, M1 aSaramaki, T1 aErcil, Aytul1 aLončarić, Sven uhttps://www.inf.u-szeged.hu/publication/reconstructing-some-hv-convex-binary-images-from-three-or-four-projections00533nas a2200145 4500008004100000245005600041210005600097260003000153100001900183700001700202700002800219700002100247700002300268856009600291 2007 eng d00aRetina Image Analysis System for Glaucoma Detection0 aRetina Image Analysis System for Glaucoma Detection aAachen, GermanycSep 20071 aBock, Rudriger1 aMeier, Jörg1 aNyúl, László, Gábor1 aMichelson, Georg1 aHornegger, Joachim uhttps://www.inf.u-szeged.hu/publication/retina-image-analysis-system-for-glaucoma-detection01085nas a2200181 4500008004100000020002200041022001400063245007500077210006900152260005100221300001400272520041500286100002300701700002300724700002300747700001800770856011500788 2007 eng d a978-3-540-74933-2 a0302-974300aA subiteration-based surface-thinning algorithm with a period of three0 asubiterationbased surfacethinning algorithm with a period of thr aHeidelberg, GermanybSpringer VerlagcSep 2007 a294 - 3033 aThinning 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.
1 aPalágyi, Kálmán1 aHamprecht, Fred, A1 aSchnorr, Christoph1 aJähne, Bernd uhttps://www.inf.u-szeged.hu/publication/a-subiteration-based-surface-thinning-algorithm-with-a-period-of-three01277nas a2200157 4500008004100000245005700041210005700098260003000155300001400185490000600199520075900205100002400964700001700988700001701005856009701022 2007 eng d00aSurgical Planning Tool with Biomechanical Simulation0 aSurgical Planning Tool with Biomechanical Simulation aBerlin, GermanybSpringer aS262-S2630 v23 aThe fixation of fractured bones often needs a very careful decision making. The operation has to be designed very carefully. A computer assisted system can help the surgeon in the planning phase to increase surgical accuracy. This paper introduces a software tool to plan a surgical intervention and to calculate the biomechanical stability of the plan. The proposed system provides 3D movement and rotation of the bone fragments and the insertion of fixation screws and plates. Finite element analysis is used to calculate mechanical stability of the surgical plan. Using these results the surgeon is able to see the week points of the fixation before the surgery. He can even try several surgical plans to pick the most promising one.
1 aErdőhelyi, Balázs1 aVarga, Endre1 aKuba, Attila uhttps://www.inf.u-szeged.hu/publication/surgical-planning-tool-with-biomechanical-simulation00523nas a2200133 4500008004100000245007500041210006900116260001200185100001900197700002000216700001700236700002100253856011500274 2007 eng d00aA Three-layer MRF model for Object Motion Detection in Airborne Images0 aThreelayer MRF model for Object Motion Detection in Airborne Ima c2007///1 aBenedek, Csaba1 aSziranyi, Tamas1 aKato, Zoltan1 aZerubia, Josiane uhttps://www.inf.u-szeged.hu/publication/a-three-layer-mrf-model-for-object-motion-detection-in-airborne-images00509nas a2200133 4500008004100000245005000041210004900091260007300140300001200213100002000225700002000245700002000265856009000285 2007 eng d00aUniform generation of hv-convex discrete sets0 aUniform generation of hvconvex discrete sets aDebrecenbKépfeldolgozók és Alakfelismerők TársaságacJan 2007 a63 - 701 aBalázs, Péter1 aFazekas, Attila1 aHajdú, András uhttps://www.inf.u-szeged.hu/publication/uniform-generation-of-hv-convex-discrete-sets00394nam a2200109 4500008004100000245005600041210005500097260004300152100001900195700001900214856005100233 2007 eng d00aV. Magyar Számítógépes Nyelvészeti Konferencia0 aV Magyar Számítógépes Nyelvészeti Konferencia aSzegedbSzegedi Tudományegyetemc20071 aTanacs, Attila1 aCsendes, Dóra uhttp://nektar.oszk.hu/hu/manifestation/280037302106nas a2200253 4500008004100000020002200041022001400063245004500077210004500122260005100167300001400218520131100232100002001543700002801563700002001591700001801611700002301629700002201652700002801674700001901702700002401721700002201745856008501767 2007 eng d a978-3-540-71090-5 a1431-472X00aWhole Body MRI Intensity Standardization0 aWhole Body MRI Intensity Standardization aMünchen, GermanybSpringer-VerlagcMarch 2007 a459 - 4633 aA major problem of segmentation of magnetic resonance images isthat intensities are not standardized like in computed tomography. This article deals with the correction of inter volume intensity differences that lead to a missing anatomical meaning of the observed gray values. We present a method for MRI intensity standardization of whole body MRI scans. The approach is based on the alignment of a learned reference and the current histogram. Each of these histograms is at least 2-d and represents two or more MRI sequences (e.g., T1- and T2-weighted images). From the matching a non-linear correction function is gained which describes a mapping between the intensity spaces and consequently adapts the image statistics to a known standard. As the proposed intensity standardization is based on the statistics of the data sets only, it is independent from spatial coherences or prior segmentations of the reference and newly acquired images. Furthermore, it is not designed for a particular application, body region or acquisition protocol. The method was evaluated on whole body MRI scans containing data sets acquired by T1/FL2D and T2/TIRM sequences. In order to demonstrate the applicability, examples from noisy and pathological image series acquired on a whole body MRI scanner are given.
1 aJäger, Florian1 aNyúl, László, Gábor1 aFrericks, Bernd1 aWacker, Frank1 aHornegger, Joachim1 aHorsch, Alexander1 aDeserno, Thomas, Martin1 aHandels, Heinz1 aMeinzer, Hans-Peter1 aTolxdorff, Thomas uhttps://www.inf.u-szeged.hu/publication/whole-body-mri-intensity-standardization00710nas a2200193 4500008004100000245007800041210006900119260001400188300000700202490003300209100002000242700001900262700002700281700001900308700002300327700001700350700003100367856011800398 2006 eng d00aOn the ambiguity of reconstructing decomposable hv-convex binary matrices0 aambiguity of reconstructing decomposable hvconvex binary matrice cJune 2006 a170 vVolume of Extenden Abstracts1 aBalázs, Péter1 aCsendes, Tibor1 aSzabó, Péter, Gábor1 aSebő, Mariann1 aBánhelyi, Balázs1 aJász, Judit1 aNagyné Hecskó, Gabriella uhttps://www.inf.u-szeged.hu/publication/on-the-ambiguity-of-reconstructing-decomposable-hv-convex-binary-matrices00484nas a2200145 4500008004100000245005300041210005200094260001200146100001700158700002000175700002400195700001700219700001200236856009000248 2006 eng d00aAz arc- állcsontok biomechanikai tulajdonságai0 aAz arc állcsontok biomechanikai tulajdonságai c2006///1 aVarga, Endre1 aRaskó, Zoltán1 aErdőhelyi, Balázs1 aKuba, Attila1 aNagy, K uhttps://www.inf.u-szeged.hu/publication/az-arc-allcsontok-biomechanikai-tulajdonsagai00740nas a2200193 4500008004100000245008700041210006900128260004600197300001400243100001800257700001600275700002000291700002300311700001700334700001700351700002800368700002300396856012700419 2006 eng d00aA benchmark evaluation of large-scale optimization approaches to binary tomography0 abenchmark evaluation of largescale optimization approaches to bi aBerlin; HeidelbergbSpringer-Verlagc2006 a146 - 1561 aWeber, Stefan1 aNagy, Antal1 aSchulle, Thomas1 aSchnorr, Christoph1 aKuba, Attila1 aKuba, Attila1 aNyúl, László, Gábor1 aPalágyi, Kálmán uhttps://www.inf.u-szeged.hu/publication/a-benchmark-evaluation-of-large-scale-optimization-approaches-to-binary-tomography00384nas a2200121 4500008004100000245003700041210003700078260001200115100001700127700002400144700001700168856007700185 2006 eng d00aComputer Aided Surgical Planning0 aComputer Aided Surgical Planning c2006///1 aVarga, Endre1 aErdőhelyi, Balázs1 aKuba, Attila uhttps://www.inf.u-szeged.hu/publication/computer-aided-surgical-planning01025nas a2200157 4500008004100000245004300041210004300084260002600127300000800153490000900161520057500170100001700745700002800762700002300790856005400813 2006 eng d00aDiscrete Geometry for Computer Imagery0 aDiscrete Geometry for Computer Imagery bSpringer-Verlagc2006 a6880 v42453 aThis 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.
1 aKuba, Attila1 aNyúl, László, Gábor1 aPalágyi, Kálmán uhttp://www.springerlink.com/content/t38633812l42/00826nas a2200241 4500008004100000020001400041245011400055210006900169260000900238300000800247490000700255100001300262700002200275700001800297700001500315700001500330700001500345700001500360700001800375700001600393700002200409856015300431 2006 eng d a1619-707000aEvaluation of the relationship between the metabolic status, the gastric emptying and the diabetic neuropathy0 aEvaluation of the relationship between the metabolic status the c2006 aS870 v331 aPapos, M1 aVárkonyi, Tamás1 aBörcsök, É1 aTakács, R1 aLengyel, C1 aLázár, M1 aKempler, P1 aMáté, Eörs1 aLonovics, J1 aPávics, László uhttps://www.inf.u-szeged.hu/publication/evaluation-of-the-relationship-between-the-metabolic-status-the-gastric-emptying-and-the-diabetic-neuropathy01532nas a2200169 4500008004100000245005900041210005600100260001800156300001400174520098900188100001901177700001601196700001701212700002101229700001301250856009901263 2006 eng d00aA higher-order active contour model for tree detection0 ahigherorder active contour model for tree detection bIEEEc2006/// a130 - 1333 aWe present a model of a 'gas of circles', the ensemble of regions in the image domain consisting of an unknown number of circles with approximately fixed radius and short range repulsive interactions, and apply it to the extraction of tree crowns from aerial images. The method uses the recently introduced 'higher order active contours' (HOACs), which incorporate long-range interactions between contour points, and thereby include prior geometric information without using a template shape. This makes them ideal when looking for multiple instances of an entity in an image. We study an existing HOAC model for networks, and show via a stability calculation that circles stable to perturbations are possible for constrained parameter sets. Combining this prior energy with a data term, we show results on aerial imagery that demonstrate the effectiveness of the method and the need for prior geometric knowledge. The model has many other potential applications. © 2006 IEEE.
1 aHorvath, Peter1 aJermyn, Ian1 aKato, Zoltan1 aZerubia, Josiane1 aTang, YY uhttps://www.inf.u-szeged.hu/publication/a-higher-order-active-contour-model-for-tree-detection01535nas a2200169 4500008003900000245005900039210005600098260003300154300001400187490000600201520098600207100001901193700001601212700001701228700002101245856009901266 2006 d00aA Higher-Order Active Contour Model for Tree Detection0 aHigherOrder Active Contour Model for Tree Detection aHong Kong, ChinabIAPRc2006 a130–1330 v23 aWe present a model of a 'gas of circles', the ensemble of regions in the image domain consisting of an unknown number of circles with approximately fixed radius and short range repulsive interactions, and apply it to the extraction of tree crowns from aerial images. The method uses the recently introduced 'higher order active contours' (HOACs), which incorporate long-range interactions between contour points, and thereby include prior geometric information without using a template shape. This makes them ideal when looking for multiple instances of an entity in an image. We study an existing HOAC model for networks, and show via a stability calculation that circles stable to perturbations are possible for constrained parameter sets. Combining this prior energy with a data term, we show results on aerial imagery that demonstrate the effectiveness of the method and the need for prior geometric knowledge. The model has many other potential applications.
1 aHorvath, Peter1 aJermyn, Ian1 aKato, Zoltan1 aZerubia, Josiane uhttps://www.inf.u-szeged.hu/publication/a-higher-order-active-contour-model-for-tree-detection00583nas a2200133 4500008004100000245010700041210006900148260001200217100001900229700001600248700001700264700002100281856014700302 2006 eng d00aA Higher-Order Active Contour Model of a `Gas of Circles' and its Application to Tree Crown Extraction0 aHigherOrder Active Contour Model of a Gas of Circles and its App c2006///1 aHorvath, Peter1 aJermyn, Ian1 aKato, Zoltan1 aZerubia, Josiane uhttps://www.inf.u-szeged.hu/publication/a-higher-order-active-contour-model-of-a-gas-of-circles-and-its-application-to-tree-crown-extraction-001950nas a2200157 4500008004100000245008100041210006900122260004200191300001200233490000700245520136800252100001801620700001701638700001701655856012001672 2006 eng d00a Image reconstruction and correction methods in neutron and X-ray tomography0 aImage reconstruction and correction methods in neutron and Xray aSzeged, HungarybUniversity of Szeged a557-5870 v173 aNeutron and X-ray tomography are imaging techniques for getting information about the interior of objects in a non-destructive way. They reconstruct cross-sections from projection images of the object being investigated. Due to the properties of the image acquisition system, the projection images are distorted by several artifacts, and these reduce the quality of the reconstruction. In order to eliminate these harmful effects the projection images should be corrected before reconstruction. Taking projections is usually an expensive and time consuming procedure. One of our main goals has been to try to minimize the number of projections - for example, by exploiting more a priori information. A possible way of reducing the number of projections is by the application of discrete tomographic methods. In this case a special class of objects can be reconstructed, consisting of only a few homogenous materials that can be characterized by known discrete absorption values. To this end we have implemented two reconstruction methods. One is able to reconstruct objects consisting of cylinders and spheres made of homogeneous materials only. The other method is a general one in the sense that it can be used for reconstructing any shape. Simulations on phantoms and physical measurements were carried out and the results are presented here.
1 aKiss, Zoltán1 aRodek, Lajos1 aKuba, Attila uhttps://www.inf.u-szeged.hu/publication/image-reconstruction-and-correction-methods-in-neutron-and-x-ray-tomography00722nas a2200169 4500008004100000245011200041210006900153260005900222300001400281100001900295700001600314700001700330700002100347700001600368700001800384856015000402 2006 eng d00aAn Improved `Gas of Circles' Higher-Order Active Contour Model and its Application to Tree Crown Extraction0 aImproved Gas of Circles HigherOrder Active Contour Model and its aBerlin; Heidelberg; New YorkbSpringer Verlagc2006/// a152 - 1611 aHorvath, Peter1 aJermyn, Ian1 aKato, Zoltan1 aZerubia, Josiane1 aKalra, Prem1 aPeleg, Shmuel uhttps://www.inf.u-szeged.hu/publication/an-improved-gas-of-circles-higher-order-active-contour-model-and-its-application-to-tree-crown-extraction00537nas a2200145 4500008004100000020001400041245007700055210006900132260001200201300001600213490000700229100001700236700002100253856011700274 2006 eng d a0262-885600aA Markov random field image segmentation model for color textured images0 aMarkov random field image segmentation model for color textured c2006/// a1103 - 11140 v241 aKato, Zoltan1 aPong, Ting Chuen uhttps://www.inf.u-szeged.hu/publication/a-markov-random-field-image-segmentation-model-for-color-textured-images00650nas a2200169 4500008004100000020001400041245010200055210006900157260001200226300001400238490000700252100001700259700002200276700002400298700001700322856014100339 2006 eng d a0324-721X00aMedEdit: A Computer Assisted Image Processing and Navigation System for Orthopedic Trauma Surgery0 aMedEdit A Computer Assisted Image Processing and Navigation Syst c2006/// a589 - 6030 v171 aVarga, Endre1 aOllé, Krisztián1 aErdőhelyi, Balázs1 aKuba, Attila uhttps://www.inf.u-szeged.hu/publication/mededit-a-computer-assisted-image-processing-and-navigation-system-for-orthopedic-trauma-surgery00554nas a2200133 4500008004100000245008900041210007200130260001200202100001700214700002400231700002200255700001700277856012600294 2006 eng d00aMedEdit Orvosi Képfeldolgozó rendszer használata a mindennapi orvosi gyakorlatban0 aMedEdit Orvosi Képfeldolgozó rendszer használata a mindennapi or c2006///1 aVarga, Endre1 aErdőhelyi, Balázs1 aOllé, Krisztián1 aKuba, Attila uhttps://www.inf.u-szeged.hu/publication/mededit-orvosi-kepfeldolgozo-rendszer-hasznalata-a-mindennapi-orvosi-gyakorlatban00545nas a2200157 4500008004100000245009300041210006900134260003000203300002000233100001900253700002000272700001700292700002100309700000500330856005200335 2006 eng d00aA multi-layer MRF model for object-motion detection in unregistered airborne image-pairs0 amultilayer MRF model for objectmotion detection in unregistered aPiscatawaybIEEEc2006/// aVI-141 - VI-1441 aBenedek, Csaba1 aSziranyi, Tamas1 aKato, Zoltan1 aZerubia, Josiane1 a uhttp://www.icip2007.org/Papers/AcceptedList.asp00539nas a2200157 4500008004100000245005800041210005500099260002900154300001400183100001700197700002100214700001900235700001500254700001400269856009800283 2006 eng d00aA multi-layer MRF model for video object segmentation0 amultilayer MRF model for video object segmentation bSpringer Verlagc2006/// a953 - 9621 aKato, Zoltan1 aPong, Ting Chuen1 aNarayanan, P J1 aNayar, S K1 aShum, H Y uhttps://www.inf.u-szeged.hu/publication/a-multi-layer-mrf-model-for-video-object-segmentation00439nas a2200133 4500008004100000245004500041210004500086260001200131100001700143700002400160700002200184700001700206856008200223 2006 eng d00aMűtéti tervek biomechanikai analízise0 aMűtéti tervek biomechanikai analízise c2006///1 aVarga, Endre1 aErdőhelyi, Balázs1 aOllé, Krisztián1 aKuba, Attila uhttps://www.inf.u-szeged.hu/publication/muteti-tervek-biomechanikai-analizise00729nas a2200181 4500008004100000245009300041210006900134260004500203300001400248100002000262700002100282700002800303700002300331700002300354700002100377700001800398856013100416 2006 eng d00aNew advances for imaging laryngo / trachealstenosis by post processing of spiral-CT data0 aNew advances for imaging laryngo trachealstenosis by post proces aWien; New YorkbSpringer-Verlagc2006/// a297 - 3081 aSorantin, Erich1 aMohadjer, Darius1 aNyúl, László, Gábor1 aPalágyi, Kálmán1 aLindbichler, Franz1 aGeiger, Bernhard1 aHruby, Walter uhttps://www.inf.u-szeged.hu/publication/new-advances-for-imaging-laryngo-trachealstenosis-by-post-processing-of-spiral-ct-data01169nas a2200157 4500008004100000245009000041210006900131260004900200300001200249520053200261100002000793700001700813700002800830700002300858856013000881 2006 eng d00aThe number of line-convex directed polyominoes having the same orthogonal projections0 anumber of lineconvex directed polyominoes having the same orthog aBerlin, HeidelbergbSpringer-Verlagc2006/// a77 - 853 aThe 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.
1 aBalázs, Péter1 aKuba, Attila1 aNyúl, László, Gábor1 aPalágyi, Kálmán uhttps://www.inf.u-szeged.hu/publication/the-number-of-line-convex-directed-polyominoes-having-the-same-orthogonal-projections00542nas a2200145 4500008004100000020001400041245008500055210006900140260000900209300001400218490000700232100001600239700001700255856012400272 2006 eng d a1330-113600aParameter settings for reconstructing binary matrices from fan-beam projections.0 aParameter settings for reconstructing binary matrices from fanbe c2006 a100 - 1100 v141 aNagy, Antal1 aKuba, Attila uhttps://www.inf.u-szeged.hu/publication/parameter-settings-for-reconstructing-binary-matrices-from-fan-beam-projections01893nas a2200181 4500008004100000020001400041245006200055210006200117260026900179300001400448490000700462520105800469100002301527700002101550700002101571700001701592856010201609 2006 eng d a0010-482500aQuantitative analysis of pulmonary airway tree structures0 aQuantitative analysis of pulmonary airway tree structures aANTIGA 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, c2006/// a974 - 9960 v363 aA 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.1 aPalágyi, Kálmán1 aTschirren, Juerg1 aHoffman, Eric, A1 aSonka, Milan uhttps://www.inf.u-szeged.hu/publication/quantitative-analysis-of-pulmonary-airway-tree-structures02140nas a2200217 4500008004100000020001400041245010700055210006900162260000900231300001200240490000600252520136300258100002301621700002601644700001901670700002401689700002001713700002301733700002101756856014501777 2006 eng d a1538-472100aRobotically assisted prostate brachytherapy with transrectal ultrasound guidance - Phantom experiments0 aRobotically assisted prostate brachytherapy with transrectal ult c2006 a14 - 260 v53 aPURPOSE: To report the preliminary experimental results obtained with a robot-assisted transrectal ultrasound (TRUS)-guided prostate brachytherapy system. METHODS AND MATERIALS: The system consists of a TRUS unit, a spatially coregistered needle insertion robot, and an FDA-approved treatment planning and image-registered implant system. The robot receives each entry/target coordinate pair of the implant plan, inserts a preloaded needle, and then the seeds are deposited. The needles/sources are tracked in TRUS, thus allowing the plan to be updated as the procedure progresses. RESULTS: The first insertion attempt was recorded for each needle, without adjustment. All clinically relevant locations were reached in a prostate phantom. Nonparallel and parallel needle trajectories were demonstrated. Based on TRUS, the average transverse placement error was 2 mm (worst case 2.5 mm, 80% less than 2 mm), and the average sagittal error was 2.5 mm (worst case 5.0 mm, 70% less than 2.5 mm). CONCLUSIONS: The concept and technical viability of robot-assisted brachytherapy were demonstrated in phantoms. The kinematically decoupled robotic assistant device is inherently safe. Overall performance was promising, but further optimization is necessary to prove the possibility of improved dosimetry. © 2006 American Brachytherapy Society. All rights reserved.1 aFichtinger, Gábor1 aBurdette, Everette, C1 aTanacs, Attila1 aPatriciu, Alexandru1 aMazilu, Dumitru1 aWhitcomb, Louis, L1 aStoianovici, Dan uhttps://www.inf.u-szeged.hu/publication/robotically-assisted-prostate-brachytherapy-with-transrectal-ultrasound-guidance-phantom-experiments00420nas a2200121 4500008004100000245004900041210004900090260001200139100001700151700002400168700001700192856008900209 2006 eng d00aSurgical Planning and Biomechanical Analysis0 aSurgical Planning and Biomechanical Analysis c2006///1 aVarga, Endre1 aErdőhelyi, Balázs1 aKuba, Attila uhttps://www.inf.u-szeged.hu/publication/surgical-planning-and-biomechanical-analysis00555nas a2200145 4500008004100000245006800041210006500109260002500174300001400199100002300213700002500236700002100261700001900282856010800301 2005 eng d00aA 2-Subfield 3D Thinning Algorithm for Extracting Medial Curves0 a2Subfield 3D Thinning Algorithm for Extracting Medial Curves aViennabOCGc2005/// a135 - 1421 aPalágyi, Kálmán1 aChetverikov, Dmitrij1 aCzúni, László1 aVincze, Markus uhttps://www.inf.u-szeged.hu/publication/a-2-subfield-3d-thinning-algorithm-for-extracting-medial-curves00849nas a2200157 4500008004100000020001400041245009600055210006900151260025600220300001400476490000900490100001900499700001800518700001700536856013800553 2005 eng d a0302-974300aApplication of automatic image registration in a segmentation framework of pelvic CT images0 aApplication of automatic image registration in a segmentation fr aMAINTZ JBA, 1998, MED IMAGE ANAL, V2, P1PEKAR V, 2004, INT J RADIAT ONCOL, V60, P973, DOI
10.1016/j.ijrobp.2004.06.004
TANACS A, 2003, ACTA CYBERNET, V16, P327
WEST J, 1999, IEEE T MED IMAGING, V18, P144
ZHAN YQ, 2004, IEEE INT S BIOM IM I
c2005 a628 - 6350 v36911 aTanacs, Attila1 aMáté, Eörs1 aKuba, Attila uhttps://www.inf.u-szeged.hu/publication/application-of-automatic-image-registration-in-a-segmentation-framework-of-pelvic-ct-images-000484nas a2200169 4500008004100000020001400041245003900055210003900094260000900133300001400142490000700156100001700163700002100180700001800201700001600219856007900235 2005 eng d a1571-065300aDiscrete Reconstruction Techniques0 aDiscrete Reconstruction Techniques c2005 a385 - 3980 v201 aKuba, Attila1 aRuskó, László1 aKiss, Zoltán1 aNagy, Antal uhttps://www.inf.u-szeged.hu/publication/discrete-reconstruction-techniques00690nas a2200193 4500008004100000020001400041245009600055210006900151260000900220300001400229490000700243100001800250700002100268700001800289700001700307700001600324700002100340856013500361 2005 eng d a1571-065300aDiscrete tomography for reconstruction from limited view angles in non-destructive testing.0 aDiscrete tomography for reconstruction from limited view angles c2005 a455 - 4740 v201 aKrimmel, Sven1 aBaumann, Joachim1 aKiss, Zoltán1 aKuba, Attila1 aNagy, Antal1 aStephan, Juergen uhttps://www.inf.u-szeged.hu/publication/discrete-tomography-for-reconstruction-from-limited-view-angles-in-non-destructive-testing00572nas a2200193 4500008004100000020001400041245004700055210004700102260000900149300001400158490000800172100001700180700001700197700001800214700002100232700002200253700001600275856008700291 2005 eng d a0168-900200aDiscrete tomography in neutron radiography0 aDiscrete tomography in neutron radiography c2005 a376 - 3820 v5421 aKuba, Attila1 aRodek, Lajos1 aKiss, Zoltán1 aRuskó, László1 aBalaskó, Márton1 aNagy, Antal uhttps://www.inf.u-szeged.hu/publication/discrete-tomography-in-neutron-radiography02165nas a2200217 4500008004100000020001400041245012400055210006900179260000900248300001400257490000700271520136000278100002401638700002001662700002001682700001901702700002301721700001901744700002201763856016201785 2005 eng d a0165-032700aDopamine transporter availability in medication free and in bupropion treated depression: a 99mTc-TRODAT-1 SPECT study.0 aDopamine transporter availability in medication free and in bupr c2005 a115 - 1230 v893 aBACKGROUND: Bupropion is thought to exert its antidepressive effect by blocking the dopamine transporter (DAT). The purpose of this study was to evaluate the DAT activity in depressed patients by means of 99mTc-TRODAT-1 SPECT in relation to the efficacy of bupropion treatment. METHODS: In 12 healthy controls and 16 depressed patients the baseline DAT activity was examined. Nine of the 16 patients went through an additional second SPECT investigation, after 4 weeks of bupropion treatment. RESULTS: In the depressed patients, the baseline DAT striatum-occipital ratio (SOR) (1.04+/-.36, mean+/-SD) was not significantly different from that in the control group (1.12+/-.33) (p>.05). Correlation was found between baseline SOR and HAM-D score change (r=-.745, p=.02) of the bupropion treated patients. The average DAT occupancy due to the bupropion treatment was 20.84+/-27.7%. No significant correlation between the therapeutical effectiveness and the occupancy was observed. LIMITATIONS: One of the limiting factors of our study has been the lack of drug monitoring. CONCLUSIONS: In good agreement with other PET studies, we found 20.84% DAT occupancy during bupropion treatment. The lack of correlation between the efficacy of therapy and occupancy of DAT may raise the question as to whether other mechanisms are involved in the effect of bupropion.1 aÁrgyelán, Miklós1 aSzabó, Zoltán1 aKanyó, Balázs1 aTanacs, Attila1 aKovács, Zsuzsanna1 aJanka, Zoltán1 aPávics, László uhttps://www.inf.u-szeged.hu/publication/dopamine-transporter-availability-in-medication-free-and-in-bupropion-treated-depression-a-99mtc-trodat-1-spect-study01876nas a2200193 4500008004100000020001400041245005800055210005800113260026900171300001600440490000700456520101600463100002101479700002301500700002301523700002101546700001701567856009801584 2005 eng d a0278-006200aMatching and anatomical labeling of human airway tree0 aMatching and anatomical labeling of human airway tree aBALLARD 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, LEc2005/// a1540 - 15470 v243 aMatching 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.1 aTschirren, Juerg1 aMcLennan, Geoffrey1 aPalágyi, Kálmán1 aHoffman, Eric, A1 aSonka, Milan uhttps://www.inf.u-szeged.hu/publication/matching-and-anatomical-labeling-of-human-airway-tree00671nas a2200145 4500008004100000245013500041210007400176260001200250100001700262700002400279700002200303700002000325700001700345856016300362 2005 eng d00aMedence- és Acetabulum-törések Baleseti Mechanizmusainak Animálása MedEdit ® Orvosi Képfeldolgozó Rendszer Segítségével0 aMedence és Acetabulumtörések Baleseti Mechanizmusainak Animálása c2005///1 aVarga, Endre1 aErdőhelyi, Balázs1 aOllé, Krisztián1 aHalmai, Csongor1 aKuba, Attila uhttps://www.inf.u-szeged.hu/publication/medence-es-acetabulum-toresek-baleseti-mechanizmusainak-animalasa-mededit-r-orvosi-kepfeldolgozo-rendszer-segitsegevel01710nas a2200229 4500008004100000245008400041210006900125260002500194300001400219520092000233100002801153700001801181700001801199700001701217700001801234700002001252700001701272700002501289700002101314700001901335856012601354 2005 eng d00aMethod for Automatically Segmenting the Spinal Cord and Canal from 3D CT Images0 aMethod for Automatically Segmenting the Spinal Cord and Canal fr aViennabOCGc2005/// a311 - 3183 aWe present two approaches for automatically segmenting thespinal cord/canal from native CT images of the thorax region
containing the spine. Different strategies are included to
handle images where only part of the spinal column is visible.
The algorithms require one seed point given on a slice located
in the middle region of the spine, and the rest is automatic.
The spatial extent of the spinal cord/canal is determined
automatically using anatomical information for segmenting the
spinal canal while active contours are applied if the spinal
cord is to be segmented. Both methods work in 2D and use
propagated information from neighboring slices. They are also
very rapid in execution, that means an efficient, user-friendly
workflow. The methods were evaluated by radiologists and were
found to be useful and met the accuracy and repeatability
requirements for the particular task.
1 aNyúl, László, Gábor1 aKanyó, Judit1 aMáté, Eörs1 aMakay, Géza1 aBalogh, Emese1 aFidrich, Márta1 aKuba, Attila1 aChetverikov, Dmitrij1 aCzúni, László1 aVincze, Markus uhttps://www.inf.u-szeged.hu/publication/method-for-automatically-segmenting-the-spinal-cord-and-canal-from-3d-ct-images-000767nas a2200205 4500008004100000245008400041210006900125260004600194300001400240100002800254700001800282700001800300700001700318700001800335700002000353700001700373700002300390700002200413856012600435 2005 eng d00aMethod for automatically segmenting the spinal cord and canal from 3D CT images0 aMethod for automatically segmenting the spinal cord and canal fr aBerlin; HeidelbergbSpringer-Verlagc2005 a456 - 4631 aNyúl, László, Gábor1 aKanyó, Judit1 aMáté, Eörs1 aMakay, Géza1 aBalogh, Emese1 aFidrich, Márta1 aKuba, Attila1 aGagalowitz, André1 aPhilips, Wilfried uhttps://www.inf.u-szeged.hu/publication/method-for-automatically-segmenting-the-spinal-cord-and-canal-from-3d-ct-images-100900nas a2200145 4500008004100000245005000041210004900091260002900140300001200169490008300181520036200264100002100626700001700647856009000664 2005 eng d00aMulti-resolution method for binary tomography0 aMultiresolution method for binary tomography aNew York City, USAc2005 a299-3110 vProceedings of the Workshop on Discrete Tomography and its Applications (WDTA)3 aMulti-resolution and region-growing strategies have been successfully used in several fields of image processing. In this paper we investigate how these two strategies can be applied for binary tomography. We included these strategies into a reconstruction method using simulated annealing and tested these new methods on different images.
1 aRuskó, László1 aKuba, Attila uhttps://www.inf.u-szeged.hu/publication/multi-resolution-method-for-binary-tomography00710nas a2200193 4500008004100000020001400041245010800055210006900163260000900232300001200241490000800253100002200261700001700283700001600300700001800316700001700334700002100351856014400372 2005 eng d a0168-900200aNeutron-, gamma- and X-ray three-dimensional computed tomography at the Budapest research reactor site.0 aNeutron gamma and Xray threedimensional computed tomography at t c2005 a22 - 270 v5421 aBalaskó, Márton1 aKuba, Attila1 aNagy, Antal1 aKiss, Zoltán1 aRodek, Lajos1 aRuskó, László uhttps://www.inf.u-szeged.hu/publication/neutron-gamma-and-x-ray-three-dimensional-computed-tomography-at-the-budapest-research-reactor-site00661nas a2200193 4500008004100000020001400041245008200055210006900137260000900206300001400215490000800229100002200237700002100259700001700280700001800297700001700315700001600332856011900348 2005 eng d a0168-900200aPipe corrosion and deposit study using neutron- and gamma- radiation sources.0 aPipe corrosion and deposit study using neutron and gamma radiati c2005 a302 - 3080 v5421 aBalaskó, Márton1 aSváb, Erzsébet1 aKuba, Attila1 aKiss, Zoltán1 aRodek, Lajos1 aNagy, Antal uhttps://www.inf.u-szeged.hu/publication/pipe-corrosion-and-deposit-study-using-neutron-and-gamma-radiation-sources01692nas a2200169 4500008004100000245006600041210006600107260001500173300001200188490000700200520113700207100001601344700002101360700001701381700001801398856010601416 2005 eng d00aPreliminary studies of discrete tomography in neutron imaging0 aPreliminary studies of discrete tomography in neutron imaging bIEEEc2005 a380-3850 v523 aDiscrete tomography (DT) is a new technique to reconstruct discrete images from their projections (like neutron images). The reconstruction methods in DT are different from the conventional ones, because the created images may contain only a few numbers of given discrete values. One of the main reasons to apply DT is that hopefully we need only a few numbers of projections. In many applications we have a situation where we know the material components of the object to be studied, that is, we know the discrete values of the image to be reconstructed. Using discreteness and some a priori information we can apply several DT methods in neutron imaging. Most of the DT reconstruction methods are reducing the problem to an optimization task. We tried two such methods on software and physical phantoms. In these experiments we investigated the effects of the following parameters: number of projections, noise levels, and complexity of the object to be reconstructed. We also developed a software system, called DIRECT, for testing different DT methods, to compare them and to present the reconstructed objects.
1 aKuba, Atila1 aRuskó, László1 aRodek, Lajos1 aKiss, Zoltán uhttps://www.inf.u-szeged.hu/publication/preliminary-studies-of-discrete-tomography-in-neutron-imaging00533nas a2200121 4500008004100000245007600041210006900117260002400186490004500210100002300255700001700278856011600295 2005 eng d00aProceedings of the Workshop on Discrete Tomography and its Applications0 aProceedings of the Workshop on Discrete Tomography and its Appli bElseviercJuly 20050 vElectronic Notes in Discrete Mathematics1 aHerman, Gábor, T.1 aKuba, Attila uhttps://www.inf.u-szeged.hu/publication/proceedings-of-the-workshop-on-discrete-tomography-and-its-applications00567nas a2200157 4500008004100000020001400041245007800055210006900133260001200202300001400214490000800228100002000236700001800256700001700274856011800291 2005 eng d a0166-218X00aReconstruction of 8-connected but not 4-connected hv-convex discrete sets0 aReconstruction of 8connected but not 4connected hvconvex discret c2005/// a149 - 1680 v1471 aBalázs, Péter1 aBalogh, Emese1 aKuba, Attila uhttps://www.inf.u-szeged.hu/publication/reconstruction-of-8-connected-but-not-4-connected-hv-convex-discrete-sets00496nas a2200145 4500008004100000020001400041245006500055210006300120260000900183300001400192490000700206100001600213700001700229856010400246 2005 eng d a0324-721X00aReconstruction of binary matrices from fan-beam projections.0 aReconstruction of binary matrices from fanbeam projections c2005 a359 - 3850 v171 aNagy, Antal1 aKuba, Attila uhttps://www.inf.u-szeged.hu/publication/reconstruction-of-binary-matrices-from-fan-beam-projections01135nas a2200157 4500008004100000245007100041210006900112260008100181300001400262520050800276100002000784700001700804700002300821700002200844856011100866 2005 eng d00aReconstruction of decomposable discrete sets from four projections0 aReconstruction of decomposable discrete sets from four projectio aBerlin; Heidelberg; New York; London; Paris; TokyobSpringer Verlagc2005/// a104 - 1143 aIn this paper we introduce the class of decomposable discretesets and give a polynomial algorithm for reconstructing discrete sets of this class from four projections. It is also shown that the class of decomposable discrete sets is more general than the class S′8 of hv-convex 8-but not 4-connected discrete sets which was studied in [3]. As a consequence we also get that the reconstruction from four projections in S′8can be solved in O(mn) time. © Springer-Verlag Berlin Heidelberg 2005.
1 aBalázs, Péter1 aAndres, Eric1 aDamiand, Guillaume1 aLienhardt, Pascal uhttps://www.inf.u-szeged.hu/publication/reconstruction-of-decomposable-discrete-sets-from-four-projections00514nas a2200133 4500008004100000020001400041245008200055210006900137260001200206300001400218490000700232100002000239856012100259 2005 eng d a1571-065300aReconstruction of discrete sets from four projections: strong decomposability0 aReconstruction of discrete sets from four projections strong dec c2005/// a329 - 3450 v201 aBalázs, Péter uhttps://www.inf.u-szeged.hu/publication/reconstruction-of-discrete-sets-from-four-projections-strong-decomposability00550nas a2200157 4500008004100000020001400041245007400055210006900129260000900198300001400207490000700221100001600228700001700244700001800261856011300279 2005 eng d a1571-065300aReconstruction of factor structures using discrete tomography method.0 aReconstruction of factor structures using discrete tomography me c2005 a519 - 5340 v201 aNagy, Antal1 aKuba, Attila1 aSamal, Martin uhttps://www.inf.u-szeged.hu/publication/reconstruction-of-factor-structures-using-discrete-tomography-method00697nas a2200181 4500008004100000020001400041245011600055210006900171260000900240300001400249490000700263100001800270700001700288700001600305700001700321700002200338856015500360 2005 eng d a1571-065300aReconstruction of pixel-based and geometric objects by discrete tomography. Simulation and physical experiments0 aReconstruction of pixelbased and geometric objects by discrete t c2005 a475 - 4910 v201 aKiss, Zoltán1 aRodek, Lajos1 aNagy, Antal1 aKuba, Attila1 aBalaskó, Márton uhttps://www.inf.u-szeged.hu/publication/reconstruction-of-pixel-based-and-geometric-objects-by-discrete-tomography-simulation-and-physical-experiments00628nas a2200193 4500008004100000245005100041210005100092260002500143300001400168100001900182700002300201700001600224700002100240700001700261700002500278700002100303700001900324856009100343 2005 eng d00aShape Moments for Region Based Active Contours0 aShape Moments for Region Based Active Contours aViennabOCGc2005/// a187 - 1941 aHorvath, Peter1 aBhattacharya, Avik1 aJermyn, Ian1 aZerubia, Josiane1 aKato, Zoltan1 aChetverikov, Dmitrij1 aCzúni, László1 aVincze, Markus uhttps://www.inf.u-szeged.hu/publication/shape-moments-for-region-based-active-contours01443nas a2200145 4500008004100000245008300041210006900124260000900193300001200202490000800214520091600222100001701138700001901155856012301174 2005 eng d00aA sufficient condition for non-uniqueness in binary tomography with absorption0 asufficient condition for nonuniqueness in binary tomography with c2005 a335-3570 v3463 aA new kind of discrete tomography problem is introduced: the reconstruction of discrete sets from their absorbed projections. A special case of this problem is discussed, namely, the uniqueness of the binary matrices with respect to their absorbed row and column sums when the absorption coefficient is n=log((1+5^0.5)/2). It is proved that if a binary matrix contains a special structure of 0s and 1s, called alternatively corner-connected component, then this binary matrix is non-unique with respect to its absorbed row and column sums. Since it has been proved in another paper [A. Kuba, M. Nivat, Reconstruction of discrete sets with absorption, Linear Algebra Appl. 339 (2001) 171194] that this condition is also necessary, the existence of alternatively corner-connected component in a binary matrix gives a characterization of the non-uniqueness in this case of absorbed projections.
1 aKuba, Attila1 aNivat, Maurice uhttps://www.inf.u-szeged.hu/publication/a-sufficient-condition-for-non-uniqueness-in-binary-tomography-with-absorption01500nas a2200121 4500008004100000245006100041210006100102260001200163520110700175100002001282700001701302856005901319 2005 eng d00aSupervised Image Segmentation Using Markov Random Fields0 aSupervised Image Segmentation Using Markov Random Fields c2005///3 aThis is the sample implementation of a Markov random field based image segmentation algorithm described in the following papers: Mark Berthod, Zoltan Kato, Shan Yu, and Josiane Zerubia. Bayesian Image Classification Using Markov Random Fields. Image and Vision Computing, 14:285--295, 1996. Keyword(s): Bayesian image classification, Markov random fields, Optimisation.
Zoltan Kato, Josiane Zerubia, and Mark Berthod. Satellite Image Classification Using a Modified Metropolis Dynamics. In Proceedings of International Conference on Acoustics, Speech and Signal Processing, volume 3, San-Francisco, California, USA, pages 573-576, March 1992. IEEE.
Zoltan Kato. Modélisations markoviennes multirésolutions en vision par ordinateur. Application a` la segmentation d'images SPOT. PhD Thesis, INRIA, Sophia Antipolis, France, December 1994. Note: Available in French (follow the URL link) and English. Keyword(s): computer vision, early vision, Markovian model, multiscale model, hierarchical model, parallel combinatorial optimization algorithm, multi-temperature annealing, parameter estimation.
1 aGradwohl, Csaba1 aKato, Zoltan uhttp://www.inf.u-szeged.hu/~kato/software/mrfdemo.html03433nas a2200193 4500008004100000245012500041210006900166260004100235300001200276520262600288100002002914700002102934700002302955700002802978700002303006700002103029700002603050856016303076 2005 eng d00aTechniques in 3D Assessment of Tracheal-Stenosis by the Mean of Spiral Computed Tomography (S-CT) and Their Applications0 aTechniques in 3D Assessment of TrachealStenosis by the Mean of S aSingaporebWorld Scientificc2005/// a61 - 803 aEndotracheal 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.
1 aSorantin, Erich1 aMohadjer, Darius1 aLindbichler, Franz1 aNyúl, László, Gábor1 aPalágyi, Kálmán1 aGeiger, Bernhard1 aLeondes, Cornelius, T uhttps://www.inf.u-szeged.hu/publication/techniques-in-3d-assessment-of-tracheal-stenosis-by-the-mean-of-spiral-computed-tomography-s-ct-and-their-applications00570nas a2200157 4500008004100000245006300041210006300104260002500167300001400192100001700206700002100223700002500244700002100269700001900290856010300309 2005 eng d00aVideo Object Segmentation Using a Multicue Markovian Model0 aVideo Object Segmentation Using a Multicue Markovian Model aViennabOCGc2005/// a111 - 1181 aKato, Zoltan1 aPong, Ting Chuen1 aChetverikov, Dmitrij1 aCzúni, László1 aVincze, Markus uhttps://www.inf.u-szeged.hu/publication/video-object-segmentation-using-a-multicue-markovian-model00861nas a2200169 4500008004100000020001400041245007700055210006900132260026900201300001400470490000900484100002300493700002100516700002100537700001700558856011600575 2004 eng d a0302-974300aAssessment of intrathoracic airway trees: Methods and in vivo validation0 aAssessment of intrathoracic airway trees Methods and in vivo val aBLAND 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
MADDAc2004/// a341 - 3520 v31171 aPalágyi, Kálmán1 aTschirren, Juerg1 aHoffman, Eric, A1 aSonka, Milan uhttps://www.inf.u-szeged.hu/publication/assessment-of-intrathoracic-airway-trees-methods-and-in-vivo-validation00490nas a2200121 4500008004100000245007000041210006900111260002900180300001400209100001900223700001700242856010900259 2004 eng d00aColor, Texture and Motion Segmentation Using Gradient Vector Flow0 aColor Texture and Motion Segmentation Using Gradient Vector Flow aMiskolctapolcacJan 2004 a131 - 1371 aHorvath, Peter1 aKato, Zoltan uhttps://www.inf.u-szeged.hu/publication/color-texture-and-motion-segmentation-using-gradient-vector-flow00534nas a2200133 4500008004100000245007400041210006900115260002900184300001400213100001700227700002100244700002100265856011400286 2004 eng d00aColor textured image segmentation using a multi-layer Markovian model0 aColor textured image segmentation using a multilayer Markovian m aMiskolctapolcacJan 2004 a152 - 1581 aKato, Zoltan1 aPong, Ting Chuen1 aQiang, Song, Guo uhttps://www.inf.u-szeged.hu/publication/color-textured-image-segmentation-using-a-multi-layer-markovian-model00578nas a2200145 4500008004100000245008800041210006900129260001200198100001700210700002400227700002200251700001700273700001700290856012500307 2004 eng d00aComparision of Pennig Ex.Fix. and palmar plating with FEA, in radius (A3) fractures0 aComparision of Pennig ExFix and palmar plating with FEA in radiu c2004///1 aVarga, Endre1 aErdőhelyi, Balázs1 aOllé, Krisztián1 aKuba, Attila1 aSimonka, J A uhttps://www.inf.u-szeged.hu/publication/comparision-of-pennig-exfix-and-palmar-plating-with-fea-in-radius-a3-fractures-000640nas a2200181 4500008004100000020001400041245008800055210006900143260001200212300000800224490000600232100001700238700002400255700002200279700001700301700001700318856012300335 2004 eng d a1217-323100aComparision of Pennig Ex.Fix. and palmar plating with FEA, in radius (A3) fractures0 aComparision of Pennig ExFix and palmar plating with FEA in radiu c2004/// a2240 v41 aVarga, Endre1 aErdőhelyi, Balázs1 aOllé, Krisztián1 aKuba, Attila1 aSimonka, J A uhttps://www.inf.u-szeged.hu/publication/comparision-of-pennig-exfix-and-palmar-plating-with-fea-in-radius-a3-fractures00592nas a2200157 4500008004100000245008100041210006900122260001200191100001700203700002400220700002200244700001500266700001700281700001700298856011900315 2004 eng d00aComparision of Synthes Hybrid Ex.Fix. and double plating in tibial fractures0 aComparision of Synthes Hybrid ExFix and double plating in tibial c2004///1 aVarga, Endre1 aErdőhelyi, Balázs1 aOllé, Krisztián1 aBalogh, Zs1 aKuba, Attila1 aSimonka, J A uhttps://www.inf.u-szeged.hu/publication/comparision-of-synthes-hybrid-exfix-and-double-plating-in-tibial-fractures00624nas a2200157 4500008004100000245009100041210006900132260001200201100001700213700002200230700002400252700001900276700002300295700001700318856013100335 2004 eng d00aComputer Assisted Image Processing and Navigation System for Orthopedic-Trauma Surgery0 aComputer Assisted Image Processing and Navigation System for Ort c2004///1 aVarga, Endre1 aOllé, Krisztián1 aErdőhelyi, Balázs1 aBekes, György1 aMaróti, Krisztina1 aKuba, Attila uhttps://www.inf.u-szeged.hu/publication/computer-assisted-image-processing-and-navigation-system-for-orthopedic-trauma-surgery00671nas a2200205 4500008004100000020001400041245006700055210006500122260000900187300000900196490000700205100002400212700002000236700002000256700001900276700002300295700001900318700002200337856010600359 2004 eng d a1619-707000aEffects of bupropion in depression: a 99mTc-TRODAT SPECT study0 aEffects of bupropion in depression a 99mTcTRODAT SPECT study c2004 aS2280 v311 aÁrgyelán, Miklós1 aSzabó, Zoltán1 aKanyó, Balázs1 aTanacs, Attila1 aKovács, Zsuzsanna1 aJanka, Zoltán1 aPávics, László uhttps://www.inf.u-szeged.hu/publication/effects-of-bupropion-in-depression-a-99mtc-trodat-spect-study00473nas a2200121 4500008004100000245007700041210006900118260000900187300001200196490000700208100001900215856011700234 2004 eng d00aImage registration methods based on interactively identified point pairs0 aImage registration methods based on interactively identified poi c2004 a237-2600 v211 aTanacs, Attila uhttps://www.inf.u-szeged.hu/publication/image-registration-methods-based-on-interactively-identified-point-pairs00472nas a2200133 4500008004100000020001400041245006700055210006700122260000900189300001400198490000700212100001900219856010000238 2004 eng d a0133-339900aKijelölt pontpárokon alapuló képregisztrációs módszerek0 aKijelölt pontpárokon alapuló képregisztrációs módszerek c2004 a237 - 2600 v211 aTanacs, Attila uhttps://www.inf.u-szeged.hu/publication/kijelolt-pontparokon-alapulo-kepregisztracios-modszerek00519nas a2200145 4500008004100000245004000041210003900081260007500120300001400195100002300209700002000232700002200252700002200274856007700296 2004 eng d00aLégutak vizsgálata 3D CT-képeken0 aLégutak vizsgálata 3D CTképeken aMiskolcbNeumann János Számítógép-tudományi TársaságcJan 2004 a232 - 2361 aPalágyi, Kálmán1 aGácsi, Zoltán1 aBarkóczy, Péter1 aSárközi, Gábor uhttps://www.inf.u-szeged.hu/publication/legutak-vizsgalata-3d-ct-kepeken02458nas a2200265 4500008004100000245007500041210006900116260027500185300001600460520132700476100002301803700001701826700002101843700002101864700002401885700002201909700002301931700002001954700002301974700001901997700001702016700002702033700001702060856011502077 2004 eng d00aLiver segment approximation in CT data for surgical resection planning0 aLiver segment approximation in CT data for surgical resection pl aBellingham; 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., LimitbSPIEc2004/// a1435 - 14463 aSurgical 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.1 aBeichel, Reinhardt1 aPock, Thomas1 aJanko, Christian1 aZotter, Roman, B1 aReitinger, Bernhard1 aBornik, Alexander1 aPalágyi, Kálmán1 aSorantin, Erich1 aWerkgartner, Georg1 aBischof, Horst1 aSonka, Milan1 aFitzpatrick, J Michael1 aSonka, Milan uhttps://www.inf.u-szeged.hu/publication/liver-segment-approximation-in-ct-data-for-surgical-resection-planning00595nas a2200145 4500008004100000245009400041210006900135260001200204100001700216700002200233700002400255700002000279700001700299856013300316 2004 eng d00aMedEdit: A Computer Assisted Planning and Simulation System for Orthopedic-Trauma Surgery0 aMedEdit A Computer Assisted Planning and Simulation System for O c2004///1 aVarga, Endre1 aOllé, Krisztián1 aErdőhelyi, Balázs1 aHalmai, Csongor1 aKuba, Attila uhttps://www.inf.u-szeged.hu/publication/mededit-a-computer-assisted-planning-and-simulation-system-for-orthopedic-trauma-surgery00589nas a2200157 4500008004100000245007900041210006900120260001200189100001700201700002400218700002200242700001500264700001700279700001700296856011800313 2004 eng d00aMedEdit: A Computer Assisted Planning system for Orthopedic-Trauma Surgery0 aMedEdit A Computer Assisted Planning system for OrthopedicTrauma c2004///1 aVarga, Endre1 aErdőhelyi, Balázs1 aOllé, Krisztián1 aBalogh, Zs1 aKuba, Attila1 aSimonka, J A uhttps://www.inf.u-szeged.hu/publication/mededit-a-computer-assisted-planning-system-for-orthopedic-trauma-surgery00551nas a2200145 4500008004100000245007300041210007300114260001200187100001700199700002200216700002400238700002000262700001700282856010600299 2004 eng d00aMedEdit műtéti tervezést segítő orvosi képfeldolgozó rendszer0 aMedEdit műtéti tervezést segítő orvosi képfeldolgozó rendszer c2004///1 aVarga, Endre1 aOllé, Krisztián1 aErdőhelyi, Balázs1 aHalmai, Csongor1 aKuba, Attila uhttps://www.inf.u-szeged.hu/publication/mededit-muteti-tervezest-segito-orvosi-kepfeldolgozo-rendszer00587nas a2200157 4500008004100000245007500041210007300116260001200189100001700201700002400218700002200242700002300264700001900287700001700306856010600323 2004 eng d00aMedEdit. Orvosi Képfeldolgozó és Műtéti Tervező/Elemző Rendszer0 aMedEdit Orvosi Képfeldolgozó és Műtéti TervezőElemző Rendszer c2004///1 aVarga, Endre1 aErdőhelyi, Balázs1 aOllé, Krisztián1 aMaróti, Krisztina1 aBekes, György1 aKuba, Attila uhttps://www.inf.u-szeged.hu/publication/mededit-orvosi-kepfeldolgozo-es-muteti-tervezoelemzo-rendszer00593nas a2200157 4500008004100000245007700041210007500118260001200193100001700205700002200222700002400244700002300268700001900291700001700310856010800327 2004 eng d00aMedEditÉ Orvosi képfeldolgozó, tervező/elemző és tervező rendszer0 aMedEditÉ Orvosi képfeldolgozó tervezőelemző és tervező rendszer c2004///1 aVarga, Endre1 aOllé, Krisztián1 aErdőhelyi, Balázs1 aMaróti, Krisztina1 aBekes, György1 aKuba, Attila uhttps://www.inf.u-szeged.hu/publication/mededite-orvosi-kepfeldolgozo-tervezoelemzo-es-tervezo-rendszer00525nas a2200157 4500008004100000245005200041210005200093260001200145100001700157700002200174700002400196700002300220700001900243700001700262856008800279 2004 eng d00aMedEditÉ Orvosi tervező és okatási rendszer0 aMedEditÉ Orvosi tervező és okatási rendszer c2004///1 aVarga, Endre1 aOllé, Krisztián1 aErdőhelyi, Balázs1 aMaróti, Krisztina1 aBekes, György1 aKuba, Attila uhttps://www.inf.u-szeged.hu/publication/mededite-orvosi-tervezo-es-okatasi-rendszer02032nas a2200169 4500008004100000245011800041210006900159260004200228300001600270520130800286100001601594700002201610700002801632700002701660700001701687856015801704 2004 eng d00aMultiple Sclerosis lesion quantification in MR images by using vectorial scale-based relative fuzzy connectedness0 aMultiple Sclerosis lesion quantification in MR images by using v aBellingham; WashingtonbSPIEc2004/// a1764 - 17733 aThis paper presents a methodology for segmenting PD- andT2-weighted brain magnetic resonance (MR) images of
multiplesclerosis (MS) patients into white matter (WM), gray
matter (GM),cerebrospinal fluid (CSF), and MS lesions. For a
given vectorialimage (with PD- and T2-weighted components) to be
segmented, weperform first intensity inhomogeneity correction
andstandardization prior to segmentation. Absolute
fuzzyconnectedness and certain morphological operations are
utilized togenerate the brain intracranial mask. The optimum
thresholdingmethod is applied to the product image (the image in
which voxelvalues represent T2 value x PD value) to
automaticallyrecognize potential MS lesion sites. Then, the
recently developedtechnique -- vectorial scale-based relative
fuzzy connectedness --is utilized to segment all voxels within
the brain intracranialmask into WM, GM, CSF, and MS lesion
regions. The number ofsegmented lesions and the volume of each
lesion are finally outputas well as the volume of other tissue
regions. The method has beentested on 10 clinical brain MRI data
sets of MS patients. Anaccuracy of better than 96% has been
achieved. The preliminaryresults indicate that its performance
is better than that of thek-nearest neighbors (kNN) method.
1 aZhuge, Ying1 aUdupa, Jayaram, K1 aNyúl, László, Gábor1 aFitzpatrick, J Michael1 aSonka, Milan uhttps://www.inf.u-szeged.hu/publication/multiple-sclerosis-lesion-quantification-in-mr-images-by-using-vectorial-scale-based-relative-fuzzy-connectedness00647nas a2200145 4500008004100000245012200041210007700163260001200240100001700252700002400269700002200293700002000315700001700335856014900352 2004 eng d00aMűtéti tervek előkészítése véges elemes analízishez a MedEdit orvosi képfeldolgozó rendszer segítségével0 aMűtéti tervek előkészítése véges elemes analízishez a MedEdit or c2004///1 aVarga, Endre1 aErdőhelyi, Balázs1 aOllé, Krisztián1 aHalmai, Csongor1 aKuba, Attila uhttps://www.inf.u-szeged.hu/publication/muteti-tervek-elokeszitese-veges-elemes-analizishez-a-mededit-orvosi-kepfeldolgozo-rendszer-segitsegevel00483nas a2200121 4500008004100000245006700041210006700108260002900175300001400204100001900218700001700237856010700254 2004 eng d00aOptical Flow Computation Using an Energy Minimization Approach0 aOptical Flow Computation Using an Energy Minimization Approach aMiskolctapolcacJan 2004 a125 - 1301 aHorvath, Peter1 aKato, Zoltan uhttps://www.inf.u-szeged.hu/publication/optical-flow-computation-using-an-energy-minimization-approach00560nas a2200133 4500008004100000245009200041210006900133260001200202100001700214700002400231700002200255700001700277856013200294 2004 eng d00aPreparing Surgical Operation Plans for Finite Element Analysis Using the MedEdit System0 aPreparing Surgical Operation Plans for Finite Element Analysis U c2004///1 aVarga, Endre1 aErdőhelyi, Balázs1 aOllé, Krisztián1 aKuba, Attila uhttps://www.inf.u-szeged.hu/publication/preparing-surgical-operation-plans-for-finite-element-analysis-using-the-mededit-system00738nas a2200205 4500008004100000245007800041210006900119260001400188300000700202490003300209100002000242700001700262700001900279700002700298700001900325700002300344700001700367700003100384856011700415 2004 eng d00aReconstruction of discrete sets from four projections: Decomposable cases0 aReconstruction of discrete sets from four projections Decomposab cJuly 2004 a220 vVolume of Extended Abstracts1 aBalázs, Péter1 aKuba, Attila1 aCsendes, Tibor1 aSzabó, Péter, Gábor1 aSebő, Mariann1 aBánhelyi, Balázs1 aJász, Judit1 aNagyné Hecskó, Gabriella uhttps://www.inf.u-szeged.hu/publication/reconstruction-of-discrete-sets-from-four-projections-decomposable-cases00564nas a2200157 4500008004100000020001400041245008000055210006900135260000900204300001400213490000800227100001700235700001600252700001800268856012000286 2004 eng d a0166-218X00aReconstruction of hv-convex binary matrices from their absorbed projections0 aReconstruction of hvconvex binary matrices from their absorbed p c2004 a137 - 1480 v1391 aKuba, Attila1 aNagy, Antal1 aBalogh, Emese uhttps://www.inf.u-szeged.hu/publication/reconstruction-of-hv-convex-binary-matrices-from-their-absorbed-projections00557nas a2200145 4500008004100000245014700041210006900188260001800257300001200275100001700287700001900304700001800323700001500341856005500356 2004 eng d00aReversible Jump Markov Chain Monte Carlo for Unsupervised MRF Color Image SegmentationProceedings of Brithish Machine Vision Conference (BMVC)0 aReversible Jump Markov Chain Monte Carlo for Unsupervised MRF Co bBMVAc2004.09 a37 - 461 aKato, Zoltan1 aHoppe, Andreas1 aBarman, Sarah1 aEllis, Tim uhttp://www.bmva.org/bmvc/2004/papers/paper_223.pdf00504nas a2200109 4500008004100000245009100041210006900132260003100201300001400232100001700246856013100263 2004 eng d00aReversible Jump Markov Chain Monte Carlo for Unsupervised MRF Color Image Segmentation0 aReversible Jump Markov Chain Monte Carlo for Unsupervised MRF Co aMiskolctapolcac2004.01.28 a144 - 1511 aKato, Zoltan uhttps://www.inf.u-szeged.hu/publication/reversible-jump-markov-chain-monte-carlo-for-unsupervised-mrf-color-image-segmentation02509nas a2200265 4500008004100000245007700041210007700118260007500195300001400270520158400284100001601868700001801884700002801902700001701930700001801947700002301965700001801988700001702006700002802023700001902051700002002070700002202090700002202112856010902134 2004 eng d00aSzámítógépes képfeldolgozás oktatása a Szegedi Tudományegyetemen0 aSzámítógépes képfeldolgozás oktatása a Szegedi Tudományegyetemen aMiskolcbNeumann János Számítógép-tudományi TársaságcJan 2004 a191 - 1963 aAz 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.
1 aNagy, Antal1 aBalogh, Emese1 aDudásné Nagy, Mariann1 aKuba, Attila1 aMáté, Eörs1 aPalágyi, Kálmán1 aKatona, Endre1 aKato, Zoltan1 aNyúl, László, Gábor1 aTanacs, Attila1 aGácsi, Zoltán1 aBarkóczy, Péter1 aSárközi, Gábor uhttps://www.inf.u-szeged.hu/publication/szamitogepes-kepfeldolgozas-oktatasa-a-szegedi-tudomanyegyetemen02328nas a2200241 4500008004100000020001400041245012200055210006900177260001200246300001600258490000700274520144300281100002001724700002001744700002401764700002301788700002801811700002201839700002301861700002301884700001801907856016101925 2003 eng d a0033-832X00a3D cross section of the laryngotracheal tract. A new method for visualization and quantification of tracheal stenoses0 a3D cross section of the laryngotracheal tract A new method for v c2003/// a1056 - 10680 v433 aPURPOSE: 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.
1 aSorantin, Erich1 aHalmai, Csongor1 aErdőhelyi, Balázs1 aPalágyi, Kálmán1 aNyúl, László, Gábor1 aOllé, Krisztián1 aLindbichler, Franz1 aFriedrich, Gerhard1 aKiesler, Karl uhttps://www.inf.u-szeged.hu/publication/3d-cross-section-of-the-laryngotracheal-tract-a-new-method-for-visualization-and-quantification-of-tracheal-stenoses02330nas a2200241 4500008004100000020001400041245012200055210006900177260001200246300001600258490000700274520144300281100002001724700002001744700002401764700002301788700002801811700002201839700002301861700002301884700001801907856016301925 2003 eng d a0033-832X00a3D cross section of the laryngotracheal tract. A new method for visualization and quantification of tracheal stenoses0 a3D cross section of the laryngotracheal tract A new method for v c2003/// a1056 - 10680 v433 aPURPOSE: 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.
1 aSorantin, Erich1 aHalmai, Csongor1 aErdőhelyi, Balázs1 aPalágyi, Kálmán1 aNyúl, László, Gábor1 aOllé, Krisztián1 aLindbichler, Franz1 aFriedrich, Gerhard1 aKiesler, Karl uhttps://www.inf.u-szeged.hu/publication/3d-cross-section-of-the-laryngotracheal-tract-a-new-method-for-visualization-and-quantification-of-tracheal-stenoses-002541nas a2200253 4500008004100000022001400041245013200055210007100187260002600258300001400284490000700298520172500305100002102030700002102051700002402072700002302096700002802119700002302147700001502170700002002185700001802205700001602223856004802239 2003 eng d a0033-832X00a3D-Querschnittsprofil des Laryngotrachealtrakts—Eine neue Methode zur Visualisierung und Quantifizierung von Trachealstenosen0 a3DQuerschnittsprofil des Laryngotrachealtrakts—Eine neue Methode bSpringer-Verlagc2003 a1056-10680 v433 aPurpose
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.
1 aSorantin, Erich.1 aHalmai, Csongor.1 aErdőhelyi, Balázs1 aPalágyi, Kálmán1 aNyúl, László, Gábor1 aOllé, Krisztián.1 aGeiger, B.1 aLindbichler, F.1 aFriedrich, G.1 aKiesler, K. uhttp://dx.doi.org/10.1007/s00117-003-0990-802300nas a2200193 4500008004100000020001400041245010800055210006900163260001200232300001400244490000700258520159100265100001601856700002201872700001801894700002801912700001901940856014701959 2003 eng d a0895-611100a3DVIEWNIX-AVS: a software package for the separate visualization of arteries and veins in CE-MRA images0 a3DVIEWNIXAVS a software package for the separate visualization o c2003/// a351 - 3620 v273 aOur earlier study developed a computerized method, based onfuzzy connected object delineation principles and algorithms,
for artery and vein separation in contrast enhanced Magnetic
Resonance Angiography (CE-MRA) images. This paper reports its
current development-a software package-for routine clinical use.
The software package, termed 3DVIEWNIX-AVS, consists of the
following major operational parts: (1) converting data from
DICOM3 to 3DVIEWNIX format, (2) previewing slices and creating
VOI and MIP Shell, (3) segmenting vessel, (4) separating artery
and vein, (5) shell rendering vascular structures and creating
animations.This package has been applied to EPIX Medical Inc's
CE-MRA data (AngioMark MS-325). One hundred and thirty-five
original CE-MRA data sets (of 52 patients) from 6 hospitals have
been processed. In all case studies, unified parameter settings
produce correct artery-vein separation. The current package is
running on a Pentium PC under Linux and the total computation
time per study is about 3 min.The strengths of this software
package are (1) minimal user interaction, (2) minimal anatomic
knowledge requirements on human vascular system, (3) clinically
required speed, (4) free entry to any operational stages, (5)
reproducible, reliable, high quality of results, and (6) cost
effective computer implementation. To date, it seems to be the
only software package (using an image processing approach)
available for artery and vein separation of the human vascular
system for routine use in a clinical setting.
1 aLei, Tianhu1 aUdupa, Jayaram, K1 aOdhner, Dewei1 aNyúl, László, Gábor1 aSaha, Punam, K uhttps://www.inf.u-szeged.hu/publication/3dviewnix-avs-a-software-package-for-the-separate-visualization-of-arteries-and-veins-in-ce-mra-images01319nas a2200277 4500008004100000020001400041245016100055210006900216260026900285300001600554490000700570100002100577700002500598700001700623700002000640700001700660700001600677700001800693700001900711700002200730700002100752700002300773700002100796700002300817856020100840 2003 eng d a1076-633200aCharacterization of the interstitial lung diseases via density-based and texture-based analysis of computed tomography images of lung structure and function0 aCharacterization of the interstitial lung diseases via densityba aBAE 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
COXSONc2003/// a1104 - 11180 v101 aHoffman, Eric, A1 aReinhardt, Joseph, M1 aSonka, Milan1 aSimon, Brett, A1 aGuo, Junfeng1 aSaba, Osama1 aChon, Deokiee1 aSamrah, Shaher1 aShikata, Hidenori1 aTschirren, Juerg1 aPalágyi, Kálmán1 aBeck, Kenneth, C1 aMcLennan, Geoffrey uhttps://www.inf.u-szeged.hu/publication/characterization-of-the-interstitial-lung-diseases-via-density-based-and-texture-based-analysis-of-computed-tomography-images-of-lung-structure-and-function00417nas a2200133 4500008004100000245004300041210004300084260001200127300001400139490000700153100002300160700001700183856008300200 2003 eng d00aDiscrete tomography in medical imaging0 aDiscrete tomography in medical imaging cOctober a1612-16260 v911 aHerman, Gábor, T.1 aKuba, Attila uhttps://www.inf.u-szeged.hu/publication/discrete-tomography-in-medical-imaging01309nas a2200157 4500008004100000020001400041245010100055210006900156260000900225300001400234490000700248520071900255100001900974700001700993856014101010 2003 eng d a0324-721X00aEvaluation of a fully automatic medical image registration algorithm based on mutual information0 aEvaluation of a fully automatic medical image registration algor c2003 a327 - 3360 v163 aRegistration is a fundamental task in image processing. Its purpose is to find a geometrical transformation that relates the points of an image to their corresponding points of another image. Many registration algorithms have been proposed in the past decade. We present a fast, fully automatic algorithm that is capable of solving rigid-body registration of 3D images of the human brain where the images are taken by different imaging devices. We joined the Retrospective Registration Evaluation Project conducted by Vanderbilt University, USA. The evaluations of our results show that our method has the potential to produce satisfactory results, but visual inspection is necessary to guard against large errors.1 aTanacs, Attila1 aKuba, Attila uhttps://www.inf.u-szeged.hu/publication/evaluation-of-a-fully-automatic-medical-image-registration-algorithm-based-on-mutual-information00734nas a2200169 4500008004100000245009600041210006900137260008100206300001400287100002000301700001800321700001700339700002100356700003100377700002000408856013600428 2003 eng d00aA fast algorithm for reconstructing hv-convex 8-connected but not 4-connected discrete sets0 afast algorithm for reconstructing hvconvex 8connected but not 4c aBerlin; Heidelberg; New York; London; Paris; TokyobSpringer Verlagc2003/// a388 - 3971 aBalázs, Péter1 aBalogh, Emese1 aKuba, Attila1 aNyström, Ingela1 aSanniti di Baja, Gabriella1 aSvensson, Stina uhttps://www.inf.u-szeged.hu/publication/a-fast-algorithm-for-reconstructing-hv-convex-8-connected-but-not-4-connected-discrete-sets02157nas a2200169 4500008004100000020001400041245008100055210006900136260001200205300001400217490000700231520155900238100002801797700002201825700001901847856012101866 2003 eng d a0278-006200aIncorporating a measure of local scale in voxel-based 3-D image registration0 aIncorporating a measure of local scale in voxelbased 3D image re c2003/// a228 - 2370 v223 aWe present a new class of approaches for rigid-body registrationand their evaluation in studying multiple sclerosis (MS) via
multiprotocol magnetic resonance imaging (MRI). Three pairs of
rigid-body registration algorithms were implemented, using
cross-correlation and mutual information (MI), operating on
original gray-level images, and utilizing the intermediate
images resulting from our new scale-based method. In the scale
image, every voxel has the local "scale" value assigned to it,
defined as the radius of the largest ball centered at the voxel
with homogeneous intensities. Three-dimensional image data of
the head were acquired from ten MS patients for each of six MRI
protocols. Images in some of the protocols were acquired in
registration. The registered pairs were used as ground truth.
Accuracy and consistency of the six registration methods were
measured within and between protocols for known amounts of
misregistrations. Our analysis indicates that there is no "best"
method. For medium misregistration, the method using MI, for
small add large misregistration the method using normalized
cross-correlation performs best. For high-resolution data the
correlation method and for low-resolution data the MI method,
both using the original gray-level images, are the most
consistent. We have previously demonstrated the use of local
scale information in fuzzy connectedness segmentation and image
filtering. Scale may also have potential for image registration
as suggested by this work.
1 aNyúl, László, Gábor1 aUdupa, Jayaram, K1 aSaha, Punam, K uhttps://www.inf.u-szeged.hu/publication/incorporating-a-measure-of-local-scale-in-voxel-based-3-d-image-registration00483nas a2200121 4500008004100000245005800041210005800099260003800157490001800195100002800213700002200241856009800263 2003 eng d00aMethod for standardizing the MR image intensity scale0 aMethod for standardizing the MR image intensity scale aAmerikai Egyesült Államokc20030 vUS199904477811 aNyúl, László, Gábor1 aUdupa, Jayaram, K uhttps://www.inf.u-szeged.hu/publication/method-for-standardizing-the-mr-image-intensity-scale00615nas a2200169 4500008004100000245006700041210006500108260004600173300001400219100001600233700001700249700001900266700001500285700002000300700001800320856010700338 2003 eng d00aNon-Photorealistic Rendering and Content-Based Image Retrieval0 aNonPhotorealistic Rendering and ContentBased Image Retrieval aNew YorkbIEEE Computer Soc. Pr.c2003/// a153 - 1621 aJi, Xiaowen1 aKato, Zoltan1 aHuang, Zhiyong1 aRokne, Jon1 aKlein, Reinhard1 aWang, Wenping uhttps://www.inf.u-szeged.hu/publication/non-photorealistic-rendering-and-content-based-image-retrieval00753nas a2200193 4500008004100000020001400041245012600055210006900181260000900250300000800259490000700267100002300274700002100297700001800318700001900336700002300355700001800378856016300396 2003 eng d a1076-633200aPo-topic IV-05: Prostate biopsy and local therapy inside conventional closed mri with robotic assistance - animal studies0 aPotopic IV05 Prostate biopsy and local therapy inside convention c2003 a9550 v101 aFichtinger, Gábor1 aSusil, Robert, C1 aKrieger, Axel1 aTanacs, Attila1 aWhitcomb, Louis, L1 aAtalar, Ergin uhttps://www.inf.u-szeged.hu/publication/po-topic-iv-05-prostate-biopsy-and-local-therapy-inside-conventional-closed-mri-with-robotic-assistance-animal-studies00857nas a2200157 4500008004100000245008000041210006900121260028600190300001400476100002300490700002100513700001700534700001400551700001500565856011900580 2003 eng d00aQuantitative analysis of intrathoracic airway trees: Methods and validation0 aQuantitative analysis of intrathoracic airway trees Methods and aBerlin; 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, VbSpringer Verlagc2003/// a222 - 2331 aPalágyi, Kálmán1 aTschirren, Juerg1 aSonka, Milan1 aTaylor, C1 aNoble, J A uhttps://www.inf.u-szeged.hu/publication/quantitative-analysis-of-intrathoracic-airway-trees-methods-and-validation00600nas a2200157 4500008004100000245007100041210006900112260009400181300001400275100002300289700002100312700001700333700001700350700002700367856004800394 2003 eng d00aQuantitative analysis of three-dimensional tubular tree structures0 aQuantitative analysis of threedimensional tubular tree structure aBellingham; WashingtonbSPIE - The International Society for Optical Engineeringc2003/// a277 - 2871 aPalágyi, Kálmán1 aTschirren, Juerg1 aSonka, Milan1 aSonka, Milan1 aFitzpatrick, J Michael uhttp://spie.org/x648.html?product_id=45926801839nas a2200217 4500008004100000020001400041245006800055210006600123260000900189300001400198490000800212520115200220100002101372700001801393700002001411700001901431700002301450700002301473700001801496856010701514 2003 eng d a0033-841900aSystem for MR image-guided prostate interventions: Canine study0 aSystem for MR imageguided prostate interventions Canine study c2003 a886 - 8940 v2283 aThe purpose of this study was to demonstrate the use of a transrectal system that enables precise magnetic resonance (MR) image guidance and monitoring of prostate interventions. The system used a closed-bore 1.5-T MR imaging unit and enables one to take advantage of the higher signal-to-noise ratio achieved with traditional magnet designs, which is crucial for accurate targeting and monitoring of prostate interventions. In the first of the four canine studies, reliable needle placement, with all needles placed within 2 mm of the desired target site, was achieved. In two other studies, MR imaging was used to monitor distribution of injected contrast agent solution (gadopentetate dimeglumine mixed with trypan blue dye) in and around the prostate, thereby confirming that solution had been delivered to the desired tissue and also detecting faulty injections. In the final study, accurate placement and MR imaging of brachytherapy seeds in the prostate were demonstrated. The described system provides a flexible platform for a variety of minimally invasive MR image-guided therapeutic and diagnostic prostate interventions. © RSNA, 2003.1 aSusil, Robert, C1 aKrieger, Axel1 aDerbyshire, A J1 aTanacs, Attila1 aWhitcomb, Louis, L1 aFichtinger, Gábor1 aAtalar, Ergin uhttps://www.inf.u-szeged.hu/publication/system-for-mr-image-guided-prostate-interventions-canine-study01362nas a2200157 4500008004100000245008500041210006900126260001800195300001400213520078800227100001701015700002101032700002101053700000501074856012501079 2003 eng d00aUnsupervised segmentation of color textured images using a multi-layer MRF model0 aUnsupervised segmentation of color textured images using a multi bIEEEc2003/// a961 - 9643 aHerein, we propose a novel multi-layer Markov random field (MRF) image segmentation model which aims at combining color and texture features: Each feature is associated to a so called feature layer, where an MRF model is defined using only the corresponding feature. A special layer is assigned to the combined MRF model. This layer interacts with each feature layer and provides the segmentation based on the combination of different features. The model is quite generic and isn't restricted to a particular texture feature. Herein we will test the algorithm using Gabor and MRSAR texture features. Furthermore, the algorithm automatically estimates the number of classes at each layer (there can be different classes at different layers) and the associated model parameters.
1 aKato, Zoltan1 aPong, Ting Chuen1 aQiang, Song, Guo1 a uhttps://www.inf.u-szeged.hu/publication/unsupervised-segmentation-of-color-textured-images-using-a-multi-layer-mrf-model00759nas a2200133 4500008004100000020001400041245007400055210006900129260026900198300001400467490000700481100002300488856011400511 2002 eng d a0167-865500aA 3-subiteration 3D thinning algorithm for extracting medial surfaces0 a3subiteration 3D thinning algorithm for extracting medial surfac aBERTRAND 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, LECc2002/// a663 - 6750 v231 aPalágyi, Kálmán uhttps://www.inf.u-szeged.hu/publication/a-3-subiteration-3d-thinning-algorithm-for-extracting-medial-surfaces00625nas a2200169 4500008004100000245008400041210006900125260000900194300001200203100002200215700002200237700001800259700001900277700001800296700001700314856012400331 2002 eng d00aComposition of Radiography Pictures of Whole Helicopter Rotor Blades in Hungary0 aComposition of Radiography Pictures of Whole Helicopter Rotor Bl c2002 a637-6421 aBalaskó, Márton1 aBalaskó, Zoltán1 aBalogh, Emese1 aTanacs, Attila1 aKatona, Endre1 aKuba, Attila uhttps://www.inf.u-szeged.hu/publication/composition-of-radiography-pictures-of-whole-helicopter-rotor-blades-in-hungary00645nas a2200169 4500008004100000245007700041210006900118260005900187300001400246100001700260700001600277700002000293700001900313700002100332700000500353856011700358 2002 eng d00aContent-based image retrieval using stochastic paintbrush transformation0 aContentbased image retrieval using stochastic paintbrush transfo aAix-en-ProvencebIEEE Computer Society PresscSep 2002 a944 - 9471 aKato, Zoltan1 aJi, Xiaowen1 aSziranyi, Tamas1 aTóth, Zoltán1 aCzúni, László1 a uhttps://www.inf.u-szeged.hu/publication/content-based-image-retrieval-using-stochastic-paintbrush-transformation00771nas a2200205 4500008004100000245009400041210007800135260003100213300001400244100002200258700001600280700002000296700002800316700001700344700002200361700001700383700001800400700002300418856012400441 2002 eng d00aDigitális képtároló és képtovábbító rendszer (PACS) a Szegedi Tudományegyetemen0 aDigitális képtároló és képtovábbító rendszer PACS a Szegedi Tudo aSzegedbNJSZT-KÉPAFc2002 a132 - 1391 aAlmási, László1 aNagy, Antal1 aAlexin, Zoltán1 aNyúl, László, Gábor1 aKuba, Attila1 aCsernay, László1 aKuba, Attila1 aMáté, Eörs1 aPalágyi, Kálmán uhttps://www.inf.u-szeged.hu/publication/digitalis-keptarolo-es-keptovabbito-rendszer-pacs-a-szegedi-tudomanyegyetemen-000772nas a2200205 4500008004100000245009400041210007800135260003400213300001400247100002200261700001600283700002000299700002800319700001700347700002200364700001700386700001800403700002300421856012200444 2002 eng d00aDigitális képtároló és képtovábbító rendszer (PACS) a Szegedi Tudományegyetemen0 aDigitális képtároló és képtovábbító rendszer PACS a Szegedi Tudo aSzegedbNJSZT-KÉPAFc2002/// a132 - 1391 aAlmási, László1 aNagy, Antal1 aAlexin, Zoltán1 aNyúl, László, Gábor1 aKuba, Attila1 aCsernay, László1 aKuba, Attila1 aMáté, Eörs1 aPalágyi, Kálmán uhttps://www.inf.u-szeged.hu/publication/digitalis-keptarolo-es-keptovabbito-rendszer-pacs-a-szegedi-tudomanyegyetemen00790nas a2200217 4500008004100000245009600041210006900137260001400206300000700220490003300227100002000260700001800280700001700298700001900315700002200334700001900356700002700375700001300402700001900415856013800434 2002 eng d00aA fast algorithm for reconstructing hv-convex 8-connected but not 4-connected discrete sets0 afast algorithm for reconstructing hvconvex 8connected but not 4c cJuly 2002 a190 vVolume of Extended Abstracts1 aBalázs, Péter1 aBalogh, Emese1 aKuba, Attila1 aCsendes, Tibor1 aSchrettner, Lajos1 aSebő, Mariann1 aSzabó, Péter, Gábor1 aTóth, B1 aVinkó, Tamás uhttps://www.inf.u-szeged.hu/publication/a-fast-algorithm-for-reconstructing-hv-convex-8-connected-but-not-4-connected-discrete-sets-002495nas a2200169 4500008004100000020001400041245006400055210006300119260001200182300001400194490000700208520193000215100002802145700002602173700002202199856010402221 2002 eng d a1524-070300aFuzzy-connected 3D image segmentation at interactive speeds0 aFuzzyconnected 3D image segmentation at interactive speeds c2002/// a259 - 2810 v643 aImage segmentation techniques using fuzzy connectednessprinciples hake shown their effectiveness in segmenting a
variety of objects in several large applications in recent
years. However, one problem with these algorithms has been their
excessive computational requirements. In an attempt to
substantially speed them up. in the present paper, we study
systematically a host of 18 'optimal' graph search algorithms.
Extensive testing of these algorithms on a variety of 3D medical
images taken from large ongoing applications demonstrates that a
20 1000-fold improvement over current speeds is achievable with
a combination of algorithms and last modern PCs. Utilizing
efficient algorithms and careful selection of implementations
can speed up the computation of fuzzy connectedness values by a
factor of 16 29 (on the same hardware), as compared to the
implementation previously used in our applications utilizing
fuzzy object segmentation. The optimality of an algorithm
depends on the input data as well as on the choice of the fuzzy
affinity relation. The running time is reduced considerably (by
a factor up to 34 for brain MR and even more for bone CT), when
the algorithms make use of predetermined thresholds for the
fuzz), objects. The reliable recognition (assisted by human
operators) and the accurate, efficient. and sophisticated
delineation (automatically performed by the computer) can be
effectively incorporated into a single interactive process. If
images having intensities kith tissue-Specific meaning (such Lis
CT or standardized MR images) are utilized. most of the
parameters for the segmentation method can be fixed once for
all. all, intermediate data (feature and fuzzy affinity values
for the hole scene) can be computed before the user interaction
is needed and the user can be provided kith more information at
the little of interaction.
1 aNyúl, László, Gábor1 aFalcao, Alexandre, X.1 aUdupa, Jayaram, K uhttps://www.inf.u-szeged.hu/publication/fuzzy-connected-3d-image-segmentation-at-interactive-speeds00468nam a2200121 4500008004100000245006000041210005900101260003400160100001700194700001800211700002300229856009400252 2002 eng d00aKépfeldolgozók és Alakfelismerők III. Konfereciája0 aKépfeldolgozók és Alakfelismerők III Konfereciája aSzegedbNJSZT-KÉPAFc2002///1 aKuba, Attila1 aMáté, Eörs1 aPalágyi, Kálmán uhttps://www.inf.u-szeged.hu/publication/kepfeldolgozok-es-alakfelismerok-iii-konfereciaja00599nas a2200157 4500008004100000020001400041245009200055210006900147260001200216300001400228490000700242100002100249700002200270700001700292856013200309 2002 eng d a1155-433900aMarkov random fields in image processing application to remote sensing and astrophysics0 aMarkov random fields in image processing application to remote s c2002/// a117 - 1360 v121 aZerubia, Josiane1 aJalobeanu, André1 aKato, Zoltan uhttps://www.inf.u-szeged.hu/publication/markov-random-fields-in-image-processing-application-to-remote-sensing-and-astrophysics00544nas a2200133 4500008004100000245008700041210006900128300001500197490000700212100002900219700001800248700001700266856012700283 2002 eng d00aMathematical generation of normal data for evaluating myocardial perfusion studies0 aMathematical generation of normal data for evaluating myocardial a1358- 13650 v211 aDudásné-Nagy, Marianna1 aMáté, Eörs1 aKári, Béla uhttps://www.inf.u-szeged.hu/publication/mathematical-generation-of-normal-data-for-evaluating-myocardial-perfusion-studies01402nas a2200169 4500008004100000020001400041245008700055210006900142260000900211300001600220490000700236520079900243100002801042700001801070700001701088856012701105 2002 eng d a0278-006200aMathematical generation of normal data for evaluating myocardial perfusion studies0 aMathematical generation of normal data for evaluating myocardial c2002 a1358 - 13650 v213 aIn this paper, we present a new mathematical method that synthesizes normal data sets for quantification of regional myocardium perfusion. In clinical practice, regional myocardial perfusion is often measured with a gamma camera and quantified via circumferential profile analysis. Normal reference profile data is used to increase the accuracy of the clinical interpretations. Our goal is to create reference data from an existing set of archived studies. An iterative mathematical method, based on two statistical hypotheses, was used to generate the study set instead of collecting normal examinations from a healthy population. Clinical validation is based on interpretations by six independent observers. Results of evaluation with synthesized normal data and its validation are presented.1 aDudásné Nagy, Mariann1 aMáté, Eörs1 aKári, Béla uhttps://www.inf.u-szeged.hu/publication/mathematical-generation-of-normal-data-for-evaluating-myocardial-perfusion-studies01410nas a2200469 4500008004100000020001400041245013000055210006900185260001200254300000800266490000700274100001500281700001900296700002000315700001600335700001800351700001500369700001500384700001500399700001500414700001800429700001400447700001500461700001800476700001400494700001600508700001300524700001300537700001200550700001600562700001400578700002100592700001700613700002300630700002900653700002800682700001500710700001500725700001800740700001500758856016700773 2002 eng d a0938-799400aMedical Image Processing, Surgical Planning, Image-Guided Therapy and Robotic Applications: Recent Developments for Radiology0 aMedical Image Processing Surgical Planning ImageGuided Therapy a c2002/// a5040 v121 aBale, R, J1 aBirkfellner, W1 aSorantin, Erich1 aStaedele, H1 aKettenbach, J1 aRecheis, W1 aVoegele, M1 aSweeney, R1 aKovács, P1 aWegenkittl, R1 aBodner, G1 aJaschke, W1 azur Nedden, D1 aEisner, E1 aKronreig, G1 aFurst, M1 aHanel, R1 aFigl, M1 aBergmann, H1 aHanson, D1 aRuskó, László1 aRodek, Lajos1 aPalágyi, Kálmán1 aBartroli, Anna, Vilanova1 aNyúl, László, Gábor1 aJacob, A L1 aBaumann, B1 aBalogh, Emese1 aMessmer, P uhttps://www.inf.u-szeged.hu/publication/medical-image-processing-surgical-planning-image-guided-therapy-and-robotic-applications-recent-developments-for-radiology01410nas a2200181 4500008004100000245007400041210006900115260003500184300001400219520076700233100001701000700002101017700002101038700001901059700001801078700001901096856011301115 2002 eng d00aMulticue MRF image segmentation: Combining texture and color features0 aMulticue MRF image segmentation Combining texture and color feat bIEEE Computer Societyc2002/// a660 - 6633 aHerein, we propose a new Markov random field (MRF) image segmentation model which aims at combining color and texture features. The model has a multi-layer structure: Each feature has its own layer, called feature layer, where an MRF model is defined using only the corresponding feature. A special layer is assigned to the combined MRF model. This layer interacts with each feature layer and provides the segmentation based on the combination of different features. The uniqueness of our algorithm is that it provides both color only and texture only segmentations as well as a segmentation based on combined color and texture features. The number of classes on feature layers is given by the user but it is estimated on the combined layer. © 2002 IEEE.
1 aKato, Zoltan1 aPong, Ting Chuen1 aQiang, Song, Guo1 aKatsuri, Ranga1 aLaurendeau, D1 aSuen, Ching, Y uhttps://www.inf.u-szeged.hu/publication/multicue-mrf-image-segmentation-combining-texture-and-color-features00434nas a2200097 4500008004100000245007500041210006900116260000900185100002800194856011400222 2002 eng d00aNovel MR Image Analysis Strategies: Applications in Multiple Sclerosis0 aNovel MR Image Analysis Strategies Applications in Multiple Scle c20021 aNyúl, László, Gábor uhttps://www.inf.u-szeged.hu/publication/novel-mr-image-analysis-strategies-applications-in-multiple-sclerosis01925nas a2200157 4500008004100000245005700041210005400098260004200152300001600194520136600210100002801576700002201604700001701626700002701643856009701670 2002 eng d00aA protocol-independent brain MRI segmentation method0 aprotocolindependent brain MRI segmentation method aBellingham; WashingtonbSPIEc2002/// a1588 - 15993 aWe present a segmentation method that combines the robust,accurate, and efficient techniques of fuzzy connectedness with
standardized MRI intensities and fast algorithms. The result is
a general segmentation framework that more efficiently utilizes
the user input (for recognition) and the power of computer (for
delineation). This same method has been applied to segment brain
tissues from a variety of MRI protocols. Images were corrected
for inhomogeneity and standardized to yield tissue-specific
intensity values. All parameters for the fuzzy affinity
relations were fixed for a specific input protocol. Scale-based
fuzzy affinity was used to better capture fine structures. Brain
tissues were segmented as 3D fuzzy-connected objects by using
relative fuzzy connectedness. The user can specify seed points
in about a minute and tracking the 3D fuzzy-connected objects
takes about 20 seconds per object. All other computations were
performed before any user interaction took place. Segmentation
of brain tissues as 3D fuzzy-connected objects from MRI data is
feasible at interactive speeds. Utilizing the robust fuzzy
connectedness principles and fast algorithms, it is possible to
interactively select fuzzy affinity, seed point, and threshold
parameters and perform efficient, precise, and accurate
segmentations.
1 aNyúl, László, Gábor1 aUdupa, Jayaram, K1 aSonka, Milan1 aFitzpatrick, J Michael uhttps://www.inf.u-szeged.hu/publication/a-protocol-independent-brain-mri-segmentation-method01243nas a2200145 4500008004100000245006500041210006500106260000900171300001200180490000800192520075700200100001700957700001800974856010500992 2002 eng d00aReconstruction of convex 2D discrete sets in polynomial time0 aReconstruction of convex 2D discrete sets in polynomial time cJune a223-2420 v2833 aThe reconstruction problem is considered in those classes of discrete sets where the reconstruction can be performed from two projections in polynomial time. The reconstruction algorithms and complexity results are summarized in the case of hv-convex sets, hv-convex 8-connected sets, hv-convex polyominoes, and directed h-convex sets. As new results some properties of the feet and spines of the hv-convex 8-connected sets are proven and it is shown that the spine of such a set can be determined from the projections in linear time. Two algorithms are given to reconstruct hv-convex 8-connected sets. Finally, it is shown that the directed h-convex sets are uniquely reconstructible with respect to their row and column sum vectors.
1 aKuba, Attila1 aBalogh, Emese uhttps://www.inf.u-szeged.hu/publication/reconstruction-of-convex-2d-discrete-sets-in-polynomial-time00762nas a2200181 4500008004100000020001400041245014000055210006900195260001200264300001200276490000900288100002100297700002300318700002500341700002100366700001700387856017600404 2002 eng d a0302-974300aSegmentation, skeletonization, and branchpoint matching - A fully automated quantitative evaluation of human intrathoratic airway trees0 aSegmentation skeletonization and branchpoint matching A fully au c2002/// a12 - 190 v24891 aTschirren, Juerg1 aPalágyi, Kálmán1 aReinhardt, Joseph, M1 aHoffman, Eric, A1 aSonka, Milan uhttps://www.inf.u-szeged.hu/publication/segmentation-skeletonization-and-branchpoint-matching-a-fully-automated-quantitative-evaluation-of-human-intrathoratic-airway-trees00486nas a2200145 4500008004100000245004500041210004200086260003400128300001200162100002300174700001700197700001800214700002300232856008500255 2002 eng d00aA sequential 3D curve-thinning algorithm0 asequential 3D curvethinning algorithm aSzegedbNJSZT-KÉPAFc2002/// a42 - 511 aPalágyi, Kálmán1 aKuba, Attila1 aMáté, Eörs1 aPalágyi, Kálmán uhttps://www.inf.u-szeged.hu/publication/a-sequential-3d-curve-thinning-algorithm02304nas a2200253 4500008004100000020001400041245007800055210006900133260001200202300001400214490000700228520147500235100002001710700002001730700002401750700002301774700002801797700002201825700002101847700002301868700002301891700001801914856011801932 2002 eng d a0278-006200aSpiral-CT-based assessment of tracheal stenoses using 3-D-skeletonization0 aSpiralCTbased assessment of tracheal stenoses using 3Dskeletoniz c2002/// a263 - 2730 v213 aPURPOSE: 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.
1 aSorantin, Erich1 aHalmai, Csongor1 aErdőhelyi, Balázs1 aPalágyi, Kálmán1 aNyúl, László, Gábor1 aOllé, Krisztián1 aGeiger, Bernhard1 aLindbichler, Franz1 aFriedrich, Gerhard1 aKiesler, Karl uhttps://www.inf.u-szeged.hu/publication/spiral-ct-based-assessment-of-tracheal-stenoses-using-3-d-skeletonization02227nas a2200241 4500008004100000020001400041245009600055210006900151260000900220300001200229490000600241520140600247100002301653700002601676700002401702700001901726700002001745700002301765700001801788700002201806700002101828856013601849 2002 eng d a1076-633200aSystem for robotically assisted prostate biopsy and therapy with intraoperative CT guidance0 aSystem for robotically assisted prostate biopsy and therapy with c2002 a60 - 740 v93 aRationale and Objectives. The purpose of this study was to assess the work-in-progress prototype of an image-guided, robotic system for accurate and consistent placement of transperineal needles into the prostate with intraoperative image guidance inside the gantry of a computed tomographic (CT) scanner. Materials and Methods. The coach-mounted system consists of a seven-degrees-of-freedom, passive mounting arm; a remote-center-of-motion robot; and a motorized, radiolucent needle-insertion device to deliver 17-18-gauge implant and biopsy needles into the prostate with the transperineal route. The robot is registered to the image space with a stereotactic adapter. The surgeon plans and controls the intervention in the CT scanner room with a desktop computer that receives DICOM images from the CT scanner. The complete system fits in a carry-on suitcase, does not need calibration, and does not utilize vendor-specific features of the CT scanner. Results. In open air, the average accuracy was better than 1 mm at a 5-8-cm depth. In various phantoms, the average orientation error was 1.3°, and the average distance between the needle tip and the target was 2 mm. Conclusion. Results of preliminary experiments indicate that this robotic system may be suitable for transperineal needle placement into the prostate and shows potential in a variety of other percutaneous clinical applications.1 aFichtinger, Gábor1 aDeWeese, Theodore, L.1 aPatriciu, Alexandru1 aTanacs, Attila1 aMazilu, Dumitru1 aAnderson, James, H1 aMasamune, Ken1 aTaylor, Russel, H1 aStoianovici, Dan uhttps://www.inf.u-szeged.hu/publication/system-for-robotically-assisted-prostate-biopsy-and-therapy-with-intraoperative-ct-guidance02066nas a2200229 4500008004100000245007700041210007700118260004100195300001400236520126900250100001601519700001801535700002801553700001701581700001801598700002801616700002301644700001901667700001901686700002001705856011101725 2002 eng d00aSzámítógépes képfeldolgozás oktatása a Szegedi Tudományegyetemen0 aSzámítógépes képfeldolgozás oktatása a Szegedi Tudományegyetemen aDebrecenbDebreceni Egyetemc2002/// a750 - 7573 aA 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.
1 aNagy, Antal1 aBalogh, Emese1 aDudásné Nagy, Mariann1 aKuba, Attila1 aMáté, Eörs1 aNyúl, László, Gábor1 aPalágyi, Kálmán1 aTanacs, Attila1 aArató, Péter1 aHerdon, Miklós uhttps://www.inf.u-szeged.hu/publication/szamitogepes-kepfeldolgozas-oktatasa-a-szegedi-tudomanyegyetemen-000524nas a2200157 4500008004100000245004500041210004500086260003400131300001200165100002800177700002200205700001700227700001800244700002300262856008100285 2002 eng d00aTöbbdimenziós MRI képek feldolgozása0 aTöbbdimenziós MRI képek feldolgozása aSzegedbNJSZT-KÉPAFc2002/// a96 - 971 aNyúl, László, Gábor1 aUdupa, Jayaram, K1 aKuba, Attila1 aMáté, Eörs1 aPalágyi, Kálmán uhttps://www.inf.u-szeged.hu/publication/tobbdimenzios-mri-kepek-feldolgozasa01481nas a2200205 4500008004100000245011200041210006900153260003300222300001200255520069800267100002300965700001800988700002101006700001901027700002301046700001801069700002001087700001701107856015101124 2002 eng d00aTransrectal prostate biopsy inside closed MRI scanner with remote actuation, under real-time image guidance0 aTransrectal prostate biopsy inside closed MRI scanner with remot aTokyobSpringer Verlagc2002 a91 - 983 aWe present the proof-of-concept prototype of a prostate biopsyrobot to be used inside a conventional high-field MRI scanner. A
three degree-of-freedom (DOF) mechanical device translates and
rotates inside the rectum and enters a needle into the body, and
steers the needle to a target point pre-selected by the user.
The device is guided by real-time images from the scanner.
Networked computers process the medical images and enable the
clinician to control the motion of the mechanical device that is
operated remotely from outside the imager. The system is also
applicable to localized prostate therapy and also demonstrates
potential in other intra-cavitary procedures.
1 aFichtinger, Gábor1 aKrieger, Axel1 aSusil, Robert, C1 aTanacs, Attila1 aWhitcomb, Louis, L1 aAtalar, Ergin1 aDohi, Takeyoshi1 aKikinis, Ron uhttps://www.inf.u-szeged.hu/publication/transrectal-prostate-biopsy-inside-closed-mri-scanner-with-remote-actuation-under-real-time-image-guidance02292nas a2200217 4500008004100000020001400041245014800055210006900203260001200272300001400284490000700298520142100305100002001726700002301746700001801769700002901787700002301816700002801839700002101867856018601888 2002 eng d a1682-863100aVirtual dissection and automated polyp detection of the colon based on spiral CT - Techniques and preliminary experience on a cadaveric phantom0 aVirtual dissection and automated polyp detection of the colon ba c2002/// a143 - 1490 v343 aBackground: 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.
1 aSorantin, Erich1 aWerkgartner, Georg1 aBalogh, Emese1 aBartroli, Anna, Vilanova1 aPalágyi, Kálmán1 aNyúl, László, Gábor1 aRuskó, László uhttps://www.inf.u-szeged.hu/publication/virtual-dissection-and-automated-polyp-detection-of-the-colon-based-on-spiral-ct-techniques-and-preliminary-experience-on-a-cadaveric-phantom00597nas a2200193 4500008004100000245003600041210003600077260003400113300001400147100001800161700002000179700002800199700002300227700001700250700001700267700001800284700002300302856007800325 2002 eng d00aVirtual Dissection of the Colon0 aVirtual Dissection of the Colon aSzegedbNJSZT-KÉPAFc2002/// a109 - 1171 aBalogh, Emese1 aSorantin, Erich1 aNyúl, László, Gábor1 aPalágyi, Kálmán1 aKuba, Attila1 aKuba, Attila1 aMáté, Eörs1 aPalágyi, Kálmán uhttps://www.inf.u-szeged.hu/publication/virtual-dissection-of-the-colon-000685nas a2200217 4500008004100000245003600041210003600077260003900113300001400152100002000166700001800186700002900204700002300233700002800256700002100284700001900305700002300324700002200347700002200369856007600391 2002 eng d00aVirtual Dissection of the Colon0 aVirtual Dissection of the Colon aNew YorkbSpringer-Verlagc2002/// a197 - 2091 aSorantin, Erich1 aBalogh, Emese1 aBartroli, Anna, Vilanova1 aPalágyi, Kálmán1 aNyúl, László, Gábor1 aLončarić, Sven1 aSubasic, Marco1 aKovacevic, Domagoj1 aCaramella, Davide1 aBartolozzi, Carlo uhttps://www.inf.u-szeged.hu/publication/virtual-dissection-of-the-colon01428nas a2200205 4500008004100000245010800041210006900149260004200218300001400260520063500274100001800909700002000927700002800947700002300975700001700998700002301015700001801038700001901056856014701075 2002 eng d00aVirtual dissection of the colon: technique and first experiments with artificial and cadaveric phantoms0 aVirtual dissection of the colon technique and first experiments aBellingham; WashingtonbSPIEc2002/// a713 - 7213 aVirtual 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.
1 aBalogh, Emese1 aSorantin, Erich1 aNyúl, László, Gábor1 aPalágyi, Kálmán1 aKuba, Attila1 aWerkgartner, Georg1 aSpuller, Ekke1 aMun, Seong, Ki uhttps://www.inf.u-szeged.hu/publication/virtual-dissection-of-the-colon-technique-and-first-experiments-with-artificial-and-cadaveric-phantoms00957nas a2200133 4500008004100000245003800041210003600079260003300115300001200148490000700160520055500167100002300722856007800745 2001 eng d00aA 3D parallel shrinking algorithm0 a3D parallel shrinking algorithm aSzegedbUniversity of Szeged a201-2110 v153 aShrinking 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.
1 aPalágyi, Kálmán uhttps://www.inf.u-szeged.hu/publication/a-3d-parallel-shrinking-algorithm00394nas a2200133 4500008004100000020001400041245003800055210003600093260000900129300001400138490000700152100002300159856007800182 2001 eng d a0324-721X00aA 3D parallel shrinking algorithm0 a3D parallel shrinking algorithm c2001 a201 - 2110 v151 aPalágyi, Kálmán uhttps://www.inf.u-szeged.hu/publication/a-3d-parallel-shrinking-algorithm00575nas a2200169 4500008004100000020001400041245006700055210006600122260000900188300001400197490000700211100001900218700002000237700002300257700001700280856010800297 2001 eng d a0324-721X00aAffine matching of two sets of points in arbitrary dimensions.0 aAffine matching of two sets of points in arbitrary dimensions c2001 a101 - 1060 v151 aTanacs, Attila1 aCzédli, Gábor1 aPalágyi, Kálmán1 aKuba, Attila uhttps://www.inf.u-szeged.hu/publication/affine-matching-of-two-sets-of-points-in-arbitrary-dimensions-000670nas a2200193 4500008004100000245006400041210006400105260003500169300001600204100002300220700001300243700001900256700001900275700001300294700002200307700002100329700002200350856010400372 2001 eng d00aApproximate Volumetric Reconstruction from Projected Images0 aApproximate Volumetric Reconstruction from Projected Images aUtrechtbSpringer Verlagc2001 a1376 - 13781 aFichtinger, Gábor1 aXu, Seng1 aTanacs, Attila1 aMurphy, Kieran1 aMyers, L1 aWilliams, Jeffrey1 aNiessen, Wiro, J1 aViergever, Max, A uhttps://www.inf.u-szeged.hu/publication/approximate-volumetric-reconstruction-from-projected-images01972nas a2200205 4500008004100000020001400041245012400055210006900179260001200248300001400260490000800274520119200282100001401474700002401488700002201512700001901534700002801553700002201581856016301603 2001 eng d a0033-841900aBrain atrophy in relapsing-remitting multiple sclerosis: Fractional volumetric analysis of gray matter and white matter0 aBrain atrophy in relapsingremitting multiple sclerosis Fractiona c2001/// a606 - 6100 v2203 aPURPOSE: To determine the fractional brain tissue volume changesin the gray matter and white matter of patients with relapsing-
remitting multiple sclerosis (MS) and to correlate these
measurements with clinical disability and total lesion load.
MATERIALS AND METHODS: Thirty patients with relapsing-remitting
MS and 25 healthy control subjects underwent magnetic resonance
imaging. Fractional brain tissue volumes (tissue volume relative
to total intracranial volume) were obtained from the total
segmented gray matter and white matter in each group and were
analyzed. RESULTS: The fractional volume of white matter versus
that of gray matter was significantly lower (-6.4%) in patients
with MS (P <.0001) than in control subjects. Neither gray matter
nor white matter fractional volume measurements correlated with
clinical disability in the patients with MS. CONCLUSION: Loss of
brain parenchymal volume in patients with relapsing-remitting MS
is predominantly confined to white matter. Analysis of
fractional brain tissue volumes provides additional information
useful in characterizing MS and may have potential in evaluating
treatment strategies.
1 aGe, Yiyue1 aGrossman, Robert, J1 aUdupa, Jayaram, K1 aBabb, James, S1 aNyúl, László, Gábor1 aKolson, Dennis, L uhttps://www.inf.u-szeged.hu/publication/brain-atrophy-in-relapsing-remitting-multiple-sclerosis-fractional-volumetric-analysis-of-gray-matter-and-white-matter00977nas a2200169 4500008004100000020001400041245007900055210006900134260001200203300001400215490000700229520039100236100001700627700002100644700002300665856011900688 2001 eng d a0167-865500aColor image segmentation and parameter estimation in a markovian framework0 aColor image segmentation and parameter estimation in a markovian c2001/// a309 - 3210 v223 aAn unsupervised color image segmentation algorithm is presented, using a Markov random field (MRF) pixel classification model. We propose a new method to estimate initial mean vectors effectively even if the histogram does not have clearly distinguishable peaks. The only parameter supplied by the user is the number of classes. © 2001 Elsevier Science B.V. All rights reserved.
1 aKato, Zoltan1 aPong, Ting Chuen1 aLee, Chung-Mong, J uhttps://www.inf.u-szeged.hu/publication/color-image-segmentation-and-parameter-estimation-in-a-markovian-framework00560nas a2200157 4500008004100000245007200041210006900113260001300182300001000195490000800205100001800213700001700231700001900248700002300267856011200290 2001 eng d00aComparison of algorithms for reconstructing hv-convex discrete sets0 aComparison of algorithms for reconstructing hvconvex discrete se cDecember a23-350 v3391 aBalogh, Emese1 aKuba, Attila1 aDevenyi, Csaba1 aDel Lungo, Alberto uhttps://www.inf.u-szeged.hu/publication/comparison-of-algorithms-for-reconstructing-hv-convex-discrete-sets00594nas a2200133 4500008004100000245009300041210006900134260004900203300001400252100001700266700002100283700002300304856013300327 2001 eng d00aA Markov Random Field Image Segmentation Model Using Combined Color and Texture Features0 aMarkov Random Field Image Segmentation Model Using Combined Colo aBerlin; HeidelbergbSpringer Verlagc2001/// a547 - 5541 aKato, Zoltan1 aPong, Ting Chuen1 aSkarbek, Wladyslaw uhttps://www.inf.u-szeged.hu/publication/a-markov-random-field-image-segmentation-model-using-combined-color-and-texture-features02389nas a2200181 4500008004100000020001400041245009800055210006900153260001200222300001600234490000600250520172700256100002201983700002802005700001402033700002402047856013602071 2001 eng d a1076-633200aMultiprotocol MR image segmentation in multiple sclerosis: Experience with over 1,000 studies0 aMultiprotocol MR image segmentation in multiple sclerosis Experi c2001/// a1116 - 11260 v83 aRATIONALE AND OBJECTIVES: Multiple sclerosis (MS) is an acquireddisease of the central nervous system. Several clinical measures
are commonly used to express the severity of the disease,
including the Expanded Disability Status Scale and the
ambulation index. These measures are subjective and may be
difficult to reproduce. The aim of this research is to
investigate the possibility of developing more objective
measures derived from MR imaging. MATERIALS AND METHODS: Various
magnetic resonance (MR) imaging protocols are being investigated
for the study of MS. Seeking to replace the Expanded Disability
Status Scale and ambulation index with an objective means to
assess the natural course of the disease and its response to
therapy, the authors have developed multiprotocol MR image
segmentation methods based on fuzzy connectedness to quantify
both macrosopic features of the disease (lesions, gray matter,
white matter, cerebrospinal fluid, and brain parenchyma) and the
microscopic appearance of diseased white matter. Over 1,000
studies have been processed to date. RESULTS: By far the
strongest correlations with the clinical measures were
demonstrated by the magnetization transfer ratio histogram
parameters obtained for the various segmented tissue regions.
These findings emphasize the importance of considering the
microscopic and diffuse nature of the disease in the individual
tissue regions. Brain parenchymal volume also demonstrated a
strong correlation with clinical measures, which suggests that
brain atrophy is an important disease indicator. CONCLUSION:
Fuzzy connectedness is a viable, highly reproducible
segmentation method for studying MS.
1 aUdupa, Jayaram, K1 aNyúl, László, Gábor1 aGe, Yiyue1 aGrossman, Robert, J uhttps://www.inf.u-szeged.hu/publication/multiprotocol-mr-image-segmentation-in-multiple-sclerosis-experience-with-over-1000-studies01941nas a2200169 4500008004100000245009400041210006900135300001000204490000800214520132000222100001901542700002201561700001901583700001701602700001901619856013301638 2001 eng d00aReconstruction of 4- and 8-connected convex discrete sets from row and column projections0 aReconstruction of 4 and 8connected convex discrete sets from row a37-570 v3393 aIn this paper we examine the problem of reconstructing a discrete two-dimensional set from its two orthogonal projection (H,V) when the set satisfies some convexity conditions. We show that the algorithm of the paper [Int. J. Imaging Systems and Technol. 9 (1998) 69] is a good heuristic algorithm but it does not solve the problem for all (H,V) instances. We propose a modification of this algorithm solving the problem for all (H,V) instances, by starting to build the ``spine''. The complexity of our reconstruction algorithm is O(mnˇlog(mn)ˇmin{m2,n2}) in the worst case. However, according to our experimental results, in 99% of the studied cases the algorithm is able to reconstruct a solution without using the newly introduced operation. In such cases the upper bound of the complexity of the algorithm is O(mnˇlog(mn)). A systematic comparison of this algorithm was done and the results show that this algorithm has the better average complexity than other published algorithms. The way of comparison and the results are given in a separate paper [Linear Algebra Appl. (submitted)]. Finally we prove that the problem can be solved in polynomial time also in a class of discrete sets which is larger than the class of convex polyominoes, namely, in the class of 8-connected convex sets.
1 aBrunetti, Sara1 aDelLungo, Alberto1 aDelRistoro, F.1 aKuba, Attila1 aNivat, Maurice uhttps://www.inf.u-szeged.hu/publication/reconstruction-of-4-and-8-connected-convex-discrete-sets-from-row-and-column-projections01052nas a2200133 4500008004100000245005200041210005200093300001200145490000800157520061700165100001700782700001900799856010000818 2001 eng d00aReconstruction of discrete sets with absorption0 aReconstruction of discrete sets with absorption a171-1940 v3393 aThe uniqueness problem is considered when binary matrices are to be reconstructed from their absorbed row and column sums. Let the absorption coefficient n be selected such that en = (1+5^0.5)/2. Then it is proved that if a binary matrix is non-uniquely determined, then it contains a special pattern of 0s and 1s called composition of alternatively corner-connected components. In a previous paper [Discrete Appl. Math. (submitted)] we proved that this condition is also sufficient, i.e., the existence of such a pattern in the binary matrix is necessary and sufficient for its non-uniqueness.
1 aKuba, Attila1 aNivat, Maurice uhttp://www.sciencedirect.com/science/article/B6V0R-44CHW26-C/2/e4cd2b3dc91dbb828db15e331a6230cc00630nas a2200205 4500008004100000020001400041245006800055210006600123260001200189300001400201490000900215100002300224700002000247700001800267700001700285700002000302700002400322700002100346856005700367 2001 eng d a0302-974300aA sequential 3D thinning algorithm and its medical applications0 asequential 3D thinning algorithm and its medical applications c2001/// a409 - 4150 v20821 aPalágyi, Kálmán1 aSorantin, Erich1 aBalogh, Emese1 aKuba, Attila1 aHalmai, Csongor1 aErdőhelyi, Balázs1 aHausegger, Klaus uhttp://www.springerlink.com/content/py49qu0e434n0n1602003nas a2200169 4500008004100000245006200041210006100103260004200164300001600206520140000222100002801622700002201650700001901672700001701691700002301708856010201731 2001 eng d00aTask-specific comparison of 3D image registration methods0 aTaskspecific comparison of 3D image registration methods aBellingham; WashingtonbSPIEc2001/// a1588 - 15983 aWe present a new class of approaches for rigid-body registrationand their evaluation in studying Multiple Sclerosis via multi
protocol MRI. Two pairs of rigid-body registration algorithms
were implemented, using cross- correlation and mutual
information, operating on original gray-level images and on the
intermediate images resulting from our new scale-based method.
In the scale image, every voxel has the local scale value
assigned to it, defined as the radius of the largest sphere
centered at the voxel with homogeneous intensities. 3D data of
the head were acquired from 10 MS patients using 6 MRI
protocols. Images in some of the protocols have been acquired in
registration. The co-registered pairs were used as ground truth.
Accuracy and consistency of the 4 registration methods were
measured within and between protocols for known amounts of
misregistrations. Our analysis indicates that there is no best
method. For medium and large misregistration, methods using
mutual information, for small misregistration, and for the
consistency tests, correlation methods using the original gray-
level images give the best results. We have previously
demonstrated the use of local scale information in fuzzy
connectedness segmentation and image filtering. Scale may also
have considerable potential for image registration as suggested
by this work.
1 aNyúl, László, Gábor1 aUdupa, Jayaram, K1 aSaha, Punam, K1 aSonka, Milan1 aHanson, Kenneth, M uhttps://www.inf.u-szeged.hu/publication/task-specific-comparison-of-3d-image-registration-methods01121nas a2200193 4500008004100000245007900041210006900120260004200189300001400231520040900245100002000654700001800674700002900692700002300721700002800744700002100772700001800793856011600811 2001 eng d00aVirtual Dissection of the Colon Based on Helical CT Data - Can It Be Done?0 aVirtual Dissection of the Colon Based on Helical CT Data Can It aZagrebbUniversity of Zagrebc2001/// a224 - 2293 aColorectal 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.
1 aSorantin, Erich1 aBalogh, Emese1 aBartroli, Anna, Vilanova1 aPalágyi, Kálmán1 aNyúl, László, Gábor1 aLončarić, Sven1 aBabic, Hrvoje uhttps://www.inf.u-szeged.hu/publication/virtual-dissection-of-the-colon-based-on-helical-ct-data-can-it-be-done00730nas a2200133 4500008004100000020001400041245006300055210006000118260026900178300001400447490000900461100002300470856010300493 2000 eng d a0302-974300aA 3D 3-subiteration thinning algorithm for medial surfaces0 a3D 3subiteration thinning algorithm for medial surfaces aBERTRAND 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 PATTERNc2000/// a406 - 4180 v19531 aPalágyi, Kálmán uhttps://www.inf.u-szeged.hu/publication/a-3d-3-subiteration-thinning-algorithm-for-medial-surfaces00710nas a2200181 4500008004100000245009500041210008100136260002900217300001300246100002300259700002000282700002000302700002400322700002500346700001700371700002000388856012000408 2000 eng d00a3D vékonyítás és alkalmazása vérerek és légutak átmérőjének meghatározására0 a3D vékonyítás és alkalmazása vérerek és légutak átmérőjének megh aNoszvajbNJSZTcJan 2000 a95 - 1001 aPalágyi, Kálmán1 aSorantin, Erich1 aHalmai, Csongor1 aErdőhelyi, Balázs1 aMartonossy, László1 aKuba, Attila1 aSziranyi, Tamas uhttps://www.inf.u-szeged.hu/publication/3d-vekonyitas-es-alkalmazasa-vererek-es-legutak-atmerojenek-meghatarozasara00700nas a2200157 4500008004100000245012600041210006900167260001200236100001400248700002400262700002200286700001900308700002800327700002200355856016500377 2000 eng d00aBrain Atrophy in Relapsing-Remitting Multiple Sclerosis: A Fractional Volumetric Analysis of Gray Matter and White Matter0 aBrain Atrophy in RelapsingRemitting Multiple Sclerosis A Fractio c2000///1 aGe, Yiyue1 aGrossman, Robert, J1 aUdupa, Jayaram, K1 aBabb, James, S1 aNyúl, László, Gábor1 aKolson, Dennis, L uhttps://www.inf.u-szeged.hu/publication/brain-atrophy-in-relapsing-remitting-multiple-sclerosis-a-fractional-volumetric-analysis-of-gray-matter-and-white-matter01886nas a2200157 4500008004100000245006400041210006300105260004200168300001400210520129900224100002801523700002601551700002201577700002301599856010601622 2000 eng d00aFuzzy-connected 3D image segmentation at interactive speeds0 aFuzzyconnected 3D image segmentation at interactive speeds aBellingham; WashingtonbSPIEc2000/// a212 - 2233 aImage segmentation techniques using fuzzy connectednessprinciples have shown their effectiveness in segmenting a
variety of objects in several large applications in recent
years. However, one problem with these algorithms has been their
excessive computational requirements. In an attempt to
substantially speed them up, in the present paper, we study
systematically a host of 18 algorithms under two categories --
label correcting and label setting. Extensive testing of these
algorithms on a variety of 3D medical images taken from large
ongoing applications demonstrates that a 20 - 360 fold
improvement over current speeds is achievable with a combination
of algorithms and fast modern PCs. The reliable recognition
(assisted by human operators) and the accurate, efficient, and
sophisticated delineation (automatically performed by the
computer) can be effectively incorporated into a single
interactive process. If images having intensities with tissue
specific meaning (such as CT or standardized MR images) are
utilized, all parameters for the segmentation method can be
fixed once for all, all intermediate data can be computed before
the user interaction is needed, and the user can be provided
with more information at the time of interaction.
1 aNyúl, László, Gábor1 aFalcao, Alexandre, X.1 aUdupa, Jayaram, K1 aHanson, Kenneth, M uhttps://www.inf.u-szeged.hu/publication/fuzzy-connected-3d-image-segmentation-at-interactive-speeds-000601nas a2200181 4500008004100000020001400041245010400055210006900159260001200228300001400240490000600254100002000260700002100280700002100301700002100322700001700343856005900360 2000 eng d a1077-201400aImage segmentation using Markov random field model in fully parallel cellular network architectures0 aImage segmentation using Markov random field model in fully para c2000/// a195 - 2110 v61 aSziranyi, Tamas1 aZerubia, Josiane1 aCzúni, László1 aGeldreich, David1 aKato, Zoltan uhttp://www.sztaki.hu/~sziranyi/Papers/Sziranyi_MRF.pdf00730nas a2200181 4500008004100000245010700041210006900148260001200217100001400229700002400243700002200267700001900289700002800308700002200336700002000358700002300378856014700401 2000 eng d00aMagnetization Transfer Ratio Histogram Analysis of Normal Appearing Gray Matter and White Matter in MS0 aMagnetization Transfer Ratio Histogram Analysis of Normal Appear c2000///1 aGe, Yiyue1 aGrossman, Robert, J1 aUdupa, Jayaram, K1 aBabb, James, S1 aNyúl, László, Gábor1 aKolson, Dennis, L1 aMannon, Lois, J1 aMcGowan, Joseph, C uhttps://www.inf.u-szeged.hu/publication/magnetization-transfer-ratio-histogram-analysis-of-normal-appearing-gray-matter-and-white-matter-in-ms00887nas a2200157 4500008004100000020001400041245004400055210004400099260001200143300001400155490000700169520041900176100002800595700002200623856008400645 2000 eng d a1052-514900aMR image analysis in multiple sclerosis0 aMR image analysis in multiple sclerosis c2000/// a799 - 8150 v103 aMR imaging is the ubiquitous imaging modality used for studyingmultiple sclerosis (MS). A variety of MR imaging protocols,
including T2, spin density, T1-weighted, with and without
gadolinium, and magnetization transfer imaging, have been used
in studying MS. This article provides an overview of the
techniques recently developed for quantifying the extent of MS
through the application of MR imaging.
1 aNyúl, László, Gábor1 aUdupa, Jayaram, K uhttps://www.inf.u-szeged.hu/publication/mr-image-analysis-in-multiple-sclerosis00387nas a2200109 4500008004100000245004400041210004400085260001200129100002800141700002200169856008600191 2000 eng d00aMR Image Analysis in Multiple Sclerosis0 aMR Image Analysis in Multiple Sclerosis c2000///1 aNyúl, László, Gábor1 aUdupa, Jayaram, K uhttps://www.inf.u-szeged.hu/publication/mr-image-analysis-in-multiple-sclerosis-002265nas a2200253 4500008004100000020001400041245010900055210006900164260001200233300001400245490000800259520138100267100002201648700002401670700002201694700002201716700002801738700001701766700001601783700002101799700002001820700002301840856014801863 2000 eng d a0033-841900aMultiple sclerosis: Magnetization transfer histogram analysis of segmented normal-appearing white matter0 aMultiple sclerosis Magnetization transfer histogram analysis of c2000/// a351 - 3550 v2163 aPURPOSE: To investigate and characterize the global distributionof magnetization transfer (MT) ratio values of normal-appearing
white matter (NAWM) in patients with relapsing-remitting
multiple sclerosis (MS) and test the hypothesis that the MT
histogram for NAWM reflects disease progression. MATERIALS AND
METHODS: Conventional and MT magnetic resonance (MR) images were
obtained in 23 patients and 25 healthy volunteers. Clinical
tests for comparison with the MT histogram parameters included
the Extended Disability Status Scale and the ambulation index.
Lesion load calculated with T2-weighted MR images and whole-
brain and white matter volumes were measured. RESULTS: The
location of the MT histogram peak and the mean MT ratio for NAWM
were significantly lower in patients with MS than in control
subjects. In longitudinal studies, the histogram peak location
and mean MT ratio shifted in the direction of normal values as
the duration of disease increased. A mean of 26.5% of the volume
of new lesions identified on the later studies were demonstrated
to have originated in NAWM corresponding to "lost" pixels on the
histogram. CONCLUSION: MT histogram analysis of NAWM, including
longitudinal analysis, may provide new prognostic information
regarding lesion formation and increase understanding of the
course of the disease.
1 aCatalaa, Isabelle1 aGrossman, Robert, J1 aKolson, Dennis, L1 aUdupa, Jayaram, K1 aNyúl, László, Gábor1 aWei, Lougang1 aZhang, Xuan1 aPolansky, Marcia1 aMannon, Lois, J1 aMcGowan, Joseph, C uhttps://www.inf.u-szeged.hu/publication/multiple-sclerosis-magnetization-transfer-histogram-analysis-of-segmented-normal-appearing-white-matter02104nas a2200169 4500008004100000245009700041210006900138260004200207300001600249520142000265100002201685700002801707700001401735700002401749700002301773856013801796 2000 eng d00aMultiprotocol MR image segmentation in multiple sclerosis: experience with over 1000 studies0 aMultiprotocol MR image segmentation in multiple sclerosis experi aBellingham; WashingtonbSPIEc2000/// a1017 - 10273 aMultiple Sclerosis (MS) is an acquired disease of the centralnervous system. Subjective cognitive and ambulatory test scores
on a scale called EDSS are currently utilized to assess the
disease severity. Various MRI protocols are being investigated
to study the disease based on how it manifests itself in the
images. In an attempt to eventually replace EDSS by an objective
measure to assess the natural course of the disease and its
response to therapy, we have developed image segmentation
methods based on fuzzy connectedness to quantify various objects
in multiprotocol MRI. These include the macroscopic objects such
as lesions, the gray matter (GM), white matter (WM),
cerebrospinal fluid (CSF), and brain parenchyma as well as the
microscopic aspects of the diseased WM. Over 1000 studies have
been processed to date. By far the strongest correlations with
the clinical measures were demonstrated by the Magnetization
Transfer Ratio (MTR) histogram parameters obtained for the
various segmented tissue regions emphasizing the importance of
considering the microscopic/diffused nature of the disease in
the individual tissue regions. Brain parenchymal volume also
demonstrated a strong correlation with the clinical measures
indicating that brain atrophy is an important indicator of the
disease. Fuzzy connectedness is a viable segmentation method for
studying MS.
1 aUdupa, Jayaram, K1 aNyúl, László, Gábor1 aGe, Yiyue1 aGrossman, Robert, J1 aHanson, Kenneth, M uhttps://www.inf.u-szeged.hu/publication/multiprotocol-mr-image-segmentation-in-multiple-sclerosis-experience-with-over-1000-studies-000766nas a2200181 4500008004100000245009400041210006900135260008100204300001400285100002000299700002000319700002400339700002500363700002300388700002100411700001800432856013400450 2000 eng d00aNew advances for imaging of laryngotracheal stenosis by post processing of spiral-CT data0 aNew advances for imaging of laryngotracheal stenosis by post pro aBerlin; Heidelberg; New York; London; Paris; TokyobSpringer-Verlagc2000/// a275 - 2851 aSorantin, Erich1 aHalmai, Csongor1 aErdőhelyi, Balázs1 aMartonossy, László1 aPalágyi, Kálmán1 aGeiger, Bernhard1 aHruby, Walter uhttps://www.inf.u-szeged.hu/publication/new-advances-for-imaging-of-laryngotracheal-stenosis-by-post-processing-of-spiral-ct-data01692nas a2200169 4500008004100000020001400041245005800055210005800113260001200171300001400183490000700197520115400204100002801358700002201386700001601408856009801424 2000 eng d a0278-006200aNew variants of a method of MRI scale standardization0 aNew variants of a method of MRI scale standardization c2000/// a143 - 1500 v193 aOne of the major drawbacks of magnetic resonance imaging (MRI)has been the lack of a standard and quantifiable interpretation
of image intensities. Unlike in other modalities, such as X-ray
computerized tomography, MR images taken for the same patient on
the same scanner at different times may appear different from
each other due to a variety of scanner-dependent variations and,
therefore, the absolute intensity values do not have a fixed
meaning. We have devised a two-step method wherein all images
(independent of patients and the specific brand of the MR
scanner used) can be transformed in such a way that for the same
protocol and body region, in the transformed images similar
intensities will have similar tissue meaning. Standardized
images can be displayed with fixed windows without the need of
per-case adjustment. More importantly, extraction of
quantitative information about healthy organs or about
abnormalities can be considerably simplified. This paper
introduces and compares new variants of this standardizing
method that can help to overcome some of the problems with the
original method.
1 aNyúl, László, Gábor1 aUdupa, Jayaram, K1 aZhang, Xuan uhttps://www.inf.u-szeged.hu/publication/new-variants-of-a-method-of-mri-scale-standardization01875nas a2200193 4500008004100000020001400041245009600055210006900151260001200220300001400232490000700246520118700253100001401440700002201454700002801476700001701504700002401521856013601545 2000 eng d a1053-180700aNumerical tissue characterization in MS via standardization of the MR image intensity scale0 aNumerical tissue characterization in MS via standardization of t c2000/// a715 - 7210 v123 aImage intensity standardization is a recently developedpostprocessing method that is capable of correcting the signal
intensity variations in MR images. We evaluated signal intensity
of healthy and diseased tissues in 10 multiple sclerosis (MS)
patients based on standardized dual fast spin-echo MR images
using a numerical postprocessing technique. The main idea of
this technique is to deform the volume image histogram of each
study to match a standard histogram and to utilize the resulting
transformation to map the image intensities into standard scale.
Upon standardization, the coefficients of variation of signal
intensities for each segmented tissue (gray matter, white
matter, lesion plaques, and diffuse abnormal white matter) in
all patients were significantly smaller (2.3-9.2 times) than in
the original images, and the same tissues from different
patients looked alike, with similar intensity characteristics.
Numerical tissue characterizability of different tissues in MS
achieved by standardization offers a fixed tissue-specific
meaning for the numerical values and can significantly
facilitate image segmentation and analysis.
1 aGe, Yiyue1 aUdupa, Jayaram, K1 aNyúl, László, Gábor1 aWei, Lougang1 aGrossman, Robert, J uhttps://www.inf.u-szeged.hu/publication/numerical-tissue-characterization-in-ms-via-standardization-of-the-mr-image-intensity-scale00638nas a2200157 4500008004100000245009600041210006900137260002300206300000800229100001400237700002200251700002800273700001700301700002400318856013800342 2000 eng d00aNumerical Tissue Characterization in MS via Standardization of the MR Image Intensity Scale0 aNumerical Tissue Characterization in MS via Standardization of t aBerkeleycApr 2000 a5791 aGe, Yiyue1 aUdupa, Jayaram, K1 aNyúl, László, Gábor1 aWei, Lougang1 aGrossman, Robert, J uhttps://www.inf.u-szeged.hu/publication/numerical-tissue-characterization-in-ms-via-standardization-of-the-mr-image-intensity-scale-000517nas a2200169 4500008004100000020001400041245005200055210005100107260000900158300001400167490000900181100001900190700002000209700002300229700001700252856007800269 2000 eng d a0302-974300aPoint-based registration assuming affine motion0 aPointbased registration assuming affine motion c2000 a329 - 3380 v18881 aTanacs, Attila1 aCzédli, Gábor1 aPalágyi, Kálmán1 aKuba, Attila uhttp://www.inf.u-szeged.hu/ipcg/publications/papers/Tanacs_2000_AFPAC.pdf00595nas a2200145 4500008004100000245006800041210006800109260005500177300000700232490003300239100002800272700002200300700001900322856010800341 2000 eng d00aStandardizing the MR Image Intensity Scale and Its Applications0 aStandardizing the MR Image Intensity Scale and Its Applications aSzegedbJózsef Attila TudományegyetemcJuly 2000 a750 vVolume of extended abstracts1 aNyúl, László, Gábor1 aUdupa, Jayaram, K1 aCsendes, Tibor uhttps://www.inf.u-szeged.hu/publication/standardizing-the-mr-image-intensity-scale-and-its-applications01818nas a2200145 4500008004100000245010000041210006900141260004200210300001400252520119800266100002801464700002201492700001901514856013901533 2000 eng d00aStandardizing the MR image intensity scales: making MR intensities have tissue-specific meaning0 aStandardizing the MR image intensity scales making MR intensitie aBellingham; WashingtonbSPIEc2000/// a496 - 5043 aOne of the major drawbacks of Magnetic Resonance Imaging (MRI)has been the lack of a standard and quantifiable interpretation
of image intensities. Unlike in other modalities such as x-ray
computerized tomography, MR images taken for the same patient on
the same scanner at different times may appear different from
each other due to a variety of scanner-dependent variations, and
therefore, the absolute intensity values do not have a fixed
meaning. We have devised a two-step method wherein all images
can be transformed in such a way that for the same protocol and
body region, in the transformed images similar intensities will
have similar tissue meaning. Standardized images can be
displayed with fixed windows without the need of per case
adjustment. More importantly, extraction of quantitative
information with fixed windows without the need of per case
adjustment. More importantly, extraction of quantitative
information about healthy organs or about abnormalities can be
considerably simplified. This paper introduces and compares new
variants of this standardizing method that can help to overcome
some of the problems with the original method.
1 aNyúl, László, Gábor1 aUdupa, Jayaram, K1 aMun, Seong, Ki uhttps://www.inf.u-szeged.hu/publication/standardizing-the-mr-image-intensity-scales-making-mr-intensities-have-tissue-specific-meaning01085nas a2200181 4500008004100000245009000041210007700131260001300208300000800221520042600229100001600655700002000671700002800691700002500719700001700744700002000761856012200781 2000 eng d00aA Szegedi Tudományegyetem orvosi képarchiváló és továbbító szoftver rendszere0 aSzegedi Tudományegyetem orvosi képarchiváló és továbbító szoftve cJan 2000 a1153 aA Szegedi Tudományegyetem orvosi képarchiváló és -továbbítórendszer (SZOTE-PACS) szoftverének a fejlesztését ismertetjük előadásunkban. A célunk egy olyan számítógépes hálózati alkalmazás elkészítése volt, amely nemcsak a klinikai vizsgálatok képeinek átvitelével és tárolásával kapcsolatos feladatokat látja el, de támogatja az oktatási és konzultációs tevékenységeket is.
1 aNagy, Antal1 aAlexin, Zoltán1 aNyúl, László, Gábor1 aMartonossy, László1 aKuba, Attila1 aSziranyi, Tamas uhttps://www.inf.u-szeged.hu/publication/a-szegedi-tudomanyegyetem-orvosi-keparchivalo-es-tovabbito-szoftver-rendszere01087nas a2200181 4500008004100000245009000041210007700131260001300208300000800221520042600229100001600655700002000671700002800691700002500719700001700744700002000761856012400781 2000 eng d00aA Szegedi Tudományegyetem orvosi képarchiváló és továbbító szoftver rendszere0 aSzegedi Tudományegyetem orvosi képarchiváló és továbbító szoftve cJan 2000 a1153 aA Szegedi Tudományegyetem orvosi képarchiváló és -továbbítórendszer (SZOTE-PACS) szoftverének a fejlesztését ismertetjük előadásunkban. A célunk egy olyan számítógépes hálózati alkalmazás elkészítése volt, amely nemcsak a klinikai vizsgálatok képeinek átvitelével és tárolásával kapcsolatos feladatokat látja el, de támogatja az oktatási és konzultációs tevékenységeket is.
1 aNagy, Antal1 aAlexin, Zoltán1 aNyúl, László, Gábor1 aMartonossy, László1 aKuba, Attila1 aSziranyi, Tamas uhttps://www.inf.u-szeged.hu/publication/a-szegedi-tudomanyegyetem-orvosi-keparchivalo-es-tovabbito-szoftver-rendszere-000725nas a2200181 4500008004100000245011300041210006900154260002300223300000900246100001400255700002400269700002200293700001900315700002800334700002300362700000500385856015300390 2000 eng d00aTissue Characterization in Relapsing-remitting and Secondary-progressive MS via Magnetization Transfer Ratio0 aTissue Characterization in Relapsingremitting and Secondaryprogr aBerkeleycApr 2000 a11891 aGe, Yiyue1 aGrossman, Robert, J1 aUdupa, Jayaram, K1 aBabb, James, S1 aNyúl, László, Gábor1 aMcGowan, Joseph, C1 a uhttps://www.inf.u-szeged.hu/publication/tissue-characterization-in-relapsing-remitting-and-secondary-progressive-ms-via-magnetization-transfer-ratio00572nas a2200169 4500008004100000020001400041245006500055210006500120260001200185300001400197490000600211100002300217700002000240700002000260700001700280856010500297 1999 eng d a1428-639400a3D thinning and its applications to medical image processing0 a3D thinning and its applications to medical image processing c1999/// a397 - 4080 v31 aPalágyi, Kálmán1 aSorantin, Erich1 aHalmai, Csongor1 aKuba, Attila uhttps://www.inf.u-szeged.hu/publication/3d-thinning-and-its-applications-to-medical-image-processing01840nas a2200157 4500008004100000245005500041210005500096260004200151300001400193520129400207100002801501700002201529700001901551700001701570856009501587 1999 eng d00aApproach to standardizing MR image intensity scale0 aApproach to standardizing MR image intensity scale aBellingham; WashingtonbSPIEc1999/// a595 - 6033 aDespite the many advantages of MR images, they lack a standardimage intensity scale. MR image intensity ranges and the meaning
of intensity values vary even for the same protocol (P) and the
same body region (D). This causes many difficulties in image
display and analysis. We propose a two-step method for
standardizing the intensity scale in such a way that for the
same P and D, similar intensities will have similar meanings. In
the first step, the parameters of the standardizing
transformation are 'learned' from an image set. In the second
step, for each MR study, these parameters are used to map their
histogram into the standardized histogram. The method was tested
quantitatively on 90 whole brain FSE T2, PD and T1 studies of MS
patients and qualitatively on several other SE PD, T2 and SPGR
studies of the grain and foot. Measurements using mean squared
difference showed that the standardized image intensities have
statistically significantly more consistent range and meaning
than the originals. Fixed windows can be established for
standardized imags and used for display without the need of per
case adjustment. Preliminary results also indicate that the
method facilitates improving the degree of automation of image
segmentation.
1 aNyúl, László, Gábor1 aUdupa, Jayaram, K1 aMun, Seong, Ki1 aKim, Yongmin uhttps://www.inf.u-szeged.hu/publication/approach-to-standardizing-mr-image-intensity-scale00447nas a2200097 4500008004100000245008500041210006900126260001200195100001700207856012500224 1999 eng d00aBayesian Color Image Segmentation Using Reversible Jump Markov Chain Monte Carlo0 aBayesian Color Image Segmentation Using Reversible Jump Markov C c1999///1 aKato, Zoltan uhttps://www.inf.u-szeged.hu/publication/bayesian-color-image-segmentation-using-reversible-jump-markov-chain-monte-carlo00491nas a2200097 4500008004100000245008500041210006900126260005600195100001700251856012500268 1999 eng d00aBayesian Color Image Segmentation Using Reversible Jump Markov Chain Monte Carlo0 aBayesian Color Image Segmentation Using Reversible Jump Markov C aAmsterdam, The NetherlandsbERCIM/CWIcJanuary 19991 aKato, Zoltan uhttps://www.inf.u-szeged.hu/publication/bayesian-color-image-segmentation-using-reversible-jump-markov-chain-monte-carlo00723nas a2200145 4500008004100000020001400041245005000055210005000105260026900155300001400424490000900438100002300447700001700470856009000487 1999 eng d a0302-974300aDirectional 3D thinning using 8 subiterations0 aDirectional 3D thinning using 8 subiterations aBERTRAND 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-GRc1999/// a325 - 3360 v15681 aPalágyi, Kálmán1 aKuba, Attila uhttps://www.inf.u-szeged.hu/publication/directional-3d-thinning-using-8-subiterations00456nam a2200109 4500008004100000245006700041210006400108260003000172100002300202700001700225856010400242 1999 eng d00aDiscrete Tomography: Foundations, Algorithms, and Applications0 aDiscrete Tomography Foundations Algorithms and Applications bBirkhausercDecember 19991 aHerman, Gábor, T.1 aKuba, Attila uhttps://www.inf.u-szeged.hu/publication/discrete-tomography-foundations-algorithms-and-applications00486nas a2200121 4500008004100000245006500041210006500106260001200171100002800183700002600211700002200237856010500259 1999 eng d00aFuzzy Connected 3D Object Segmentation at Interactive Speeds0 aFuzzy Connected 3D Object Segmentation at Interactive Speeds c1999///1 aNyúl, László, Gábor1 aFalcao, Alexandre, X.1 aUdupa, Jayaram, K uhttps://www.inf.u-szeged.hu/publication/fuzzy-connected-3d-object-segmentation-at-interactive-speeds01557nas a2200193 4500008004100000245009100041210006900132260004400201300001400245520082300259100002501082700001601107700002801123700002001151700001701171700001801188700002601206856013101232 1999 eng d00aImage Compression in SZOTE-PACS (Picture Archiving and Communication System) in Szeged0 aImage Compression in SZOTEPACS Picture Archiving and Communicati aZagrebbUniversity of ZagrebcJune 1999 a305 - 3103 aSZOTE-PACS is a joint software development between the JózsefAttila University and the Albert Szent-Györgyi Medical University of Szeged for archiving and transferring medical studies. The system is able to collect medical studies from different imaging modalities and store them studies in common standard DICOM format in a central oracle database. There is an end user application that allows searching for specific studies in the central database. The archived medical images can be presented and processed at the viewing stations. Due to the limited storage space available, efforts have been made to utilized image compression techniques in order to increase the amount of image data that can be stored in the archive. The achieved results and some of the problems related to this task will be presented.
1 aMartonossy, László1 aNagy, Antal1 aNyúl, László, Gábor1 aAlexin, Zoltán1 aKuba, Attila1 aKalpic, Damir1 aDobrić, Vesna, Hljuz uhttps://www.inf.u-szeged.hu/publication/image-compression-in-szote-pacs-picture-archiving-and-communication-system-in-szeged-001555nas a2200193 4500008004100000245009100041210006900132260004400201300001400245520082300259100002501082700001601107700002801123700002001151700001701171700001801188700002601206856012901232 1999 eng d00aImage Compression in SZOTE-PACS (Picture Archiving and Communication System) in Szeged0 aImage Compression in SZOTEPACS Picture Archiving and Communicati aZagrebbUniversity of ZagrebcJune 1999 a305 - 3103 aSZOTE-PACS is a joint software development between the JózsefAttila University and the Albert Szent-Györgyi Medical University of Szeged for archiving and transferring medical studies. The system is able to collect medical studies from different imaging modalities and store them studies in common standard DICOM format in a central oracle database. There is an end user application that allows searching for specific studies in the central database. The archived medical images can be presented and processed at the viewing stations. Due to the limited storage space available, efforts have been made to utilized image compression techniques in order to increase the amount of image data that can be stored in the archive. The achieved results and some of the problems related to this task will be presented.
1 aMartonossy, László1 aNagy, Antal1 aNyúl, László, Gábor1 aAlexin, Zoltán1 aKuba, Attila1 aKalpic, Damir1 aDobrić, Vesna, Hljuz uhttps://www.inf.u-szeged.hu/publication/image-compression-in-szote-pacs-picture-archiving-and-communication-system-in-szeged00408nas a2200121 4500008004100000245004800041210004500089260001500134300001200149100001800161700001900179856008800198 1999 eng d00aAn Interpretation System for Cadastral Maps0 aInterpretation System for Cadastral Maps bIEEEc1999 a792-7971 aKatona, Endre1 aHudra, György uhttps://www.inf.u-szeged.hu/publication/an-interpretation-system-for-cadastral-maps00808nas a2200205 4500008004100000245011200041210006900153260001200222100002200234700002400256700002200280700002800302700002200330700001700352700001600369700002100385700002000406700002300426856015300449 1999 eng d00aMagnetization Transfer Histogram Analysis of Segmented Normal- Appearing White Matter in Multiple Sclerosis0 aMagnetization Transfer Histogram Analysis of Segmented Normal Ap c1999///1 aCatalaa, Isabelle1 aGrossman, Robert, J1 aUdupa, Jayaram, K1 aNyúl, László, Gábor1 aKolson, Dennis, L1 aWei, Lougang1 aZhang, Xuan1 aPolansky, Marcia1 aMannon, Lois, J1 aMcGowan, Joseph, C uhttps://www.inf.u-szeged.hu/publication/magnetization-transfer-histogram-analysis-of-segmented-normal-appearing-white-matter-in-multiple-sclerosis-000832nas a2200205 4500008004100000245011100041210006900152260002300221300000800244100002200252700002400274700002200298700002800320700001700348700002200365700002100387700002300408700004400431856015100475 1999 eng d00aMagnetization Transfer Histogram Analysis of Segmented Normal-Appearing White Matter in Multiple Sclerosis0 aMagnetization Transfer Histogram Analysis of Segmented NormalApp aBerkeleycMay 1999 a9571 aCatalaa, Isabelle1 aGrossman, Robert, J1 aKolson, Dennis, L1 aNyúl, László, Gábor1 aWei, Lougang1 aUdupa, Jayaram, K1 aPolansky, Marcia1 aMcGowan, Joseph, C1 a*Medicine], *[International, Society fo uhttps://www.inf.u-szeged.hu/publication/magnetization-transfer-histogram-analysis-of-segmented-normal-appearing-white-matter-in-multiple-sclerosis01346nas a2200157 4500008004100000020001400041245005600055210005600111260001200167300001400179490000900193520084000202100002801042700002201070856009601092 1999 eng d a0302-974300aNew variants of a method of MRI scale normalization0 aNew variants of a method of MRI scale normalization c1999/// a490 - 4950 v16133 aOne of the major drawbacks of Magnetic Resonance Imaging (MRI)has been the lack of a standard and quantifiable interpretation
of image intensities. This causes many difficulties in image
display and analysis. We have devised a two-step method wherein
all images can be transformed in such a way that for the same
protocol and body region, in the transformed images similar
intensities will have similar tissue meaning. Normalized images
can be displayed with fixed windows without the need of per case
adjustment. More importantly, extraction of quantitative
information about healthy organs or about abnormities, such as
tumors, can considerably be simplified. This paper introduces
and compares new variants of this normalization method that can
help to overcome some of the problems with the original method.
1 aNyúl, László, Gábor1 aUdupa, Jayaram, K uhttps://www.inf.u-szeged.hu/publication/new-variants-of-a-method-of-mri-scale-normalization00457nas a2200121 4500008004100000245005800041210005800099260001200157100002800169700002200197700001600219856010000235 1999 eng d00aNew Variants of a Method of MRI Scale Standardization0 aNew Variants of a Method of MRI Scale Standardization c1999///1 aNyúl, László, Gábor1 aUdupa, Jayaram, K1 aZhang, Xuan uhttps://www.inf.u-szeged.hu/publication/new-variants-of-a-method-of-mri-scale-standardization-000607nas a2200145 4500008004100000245009600041210006900137260001200206100001400218700002200232700002800254700001700282700002400299856013800323 1999 eng d00aNumerical Tissue Characterization in MS via Standardization of the MR Image Intensity Scale0 aNumerical Tissue Characterization in MS via Standardization of t c1999///1 aGe, Yiyue1 aUdupa, Jayaram, K1 aNyúl, László, Gábor1 aWei, Lougang1 aGrossman, Robert, J uhttps://www.inf.u-szeged.hu/publication/numerical-tissue-characterization-in-ms-via-standardization-of-the-mr-image-intensity-scale-100715nas a2200145 4500008004100000020001400041245005300055210005000108260026900158300001400427490000700441100002300448700001700471856008100488 1999 eng d a1077-316900aA parallel 3D 12-subiteration thinning algorithm0 aparallel 3D 12subiteration thinning algorithm aBERTRAND 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 COc1999/// a199 - 2210 v611 aPalágyi, Kálmán1 aKuba, Attila uhttp://www.inf.u-szeged.hu/ipcg/publications/papers/PalagyiKuba_GMIP1999.pdf00402nas a2200109 4500008004100000245005000041210004700091260001200138100002800150700002200178856009200200 1999 eng d00aOn Standardizing the MR Image Intensity Scale0 aStandardizing the MR Image Intensity Scale c1999///1 aNyúl, László, Gábor1 aUdupa, Jayaram, K uhttps://www.inf.u-szeged.hu/publication/on-standardizing-the-mr-image-intensity-scale-001715nas a2200157 4500008004100000020001400041245005000055210004700105260001200152300001600164490000700180520123000187100002801417700002201445856009001467 1999 eng d a0740-319400aOn standardizing the MR image intensity scale0 astandardizing the MR image intensity scale c1999/// a1072 - 10810 v423 aThe lack of a standard image intensity scale in MRI causes manydifficulties in image display and analysis. A two-step
postprocessing method is proposed for standardizing the
intensity scale in such a way that for the same MR protocol and
body region, similar intensities will have similar tissue
meaning. In the first step, the parameters of the standardizing
transformation are "learned" from a set of images. In the second
step, for each MR study these parameters are used to map their
histogram into the standardized histogram. The method was tested
quantitatively on 90 whole-brain studies of multiple sclerosis
patients for several protocols and qualitatively for several
other protocols and body regions. Measurements using mean
squared difference showed that the standardized image
intensities have statistically significantly (P < 0.01) more
consistent range and meaning than the originals. Fixed gray
level windows can be established for the standardized images and
used for display without the need of per case adjustment.
Preliminary results also indicate that the method facilitates
improving the degree of automation of image segmentation. Magn
Reson Med 42:1072-1081, 1999.
1 aNyúl, László, Gábor1 aUdupa, Jayaram, K uhttps://www.inf.u-szeged.hu/publication/on-standardizing-the-mr-image-intensity-scale00717nas a2200181 4500008004100000245009200041210006900133260005800202300001400260100001900274700002300293700001700316700001400333700001500347700001700362700002200379856013400401 1999 eng d00aTarget registration error of point-based methods assuming rigid-body and linear motions0 aTarget registration error of pointbased methods assuming rigidbo aLjubljanabSlovenian Society of InformaticscAug 1999 a223 - 2331 aTanacs, Attila1 aPalágyi, Kálmán1 aKuba, Attila1 aPernus, F1 aKovacic, S1 aStiehl, H, S1 aViergever, Max, A uhttps://www.inf.u-szeged.hu/publication/target-registration-error-of-point-based-methods-assuming-rigid-body-and-linear-motions-001804nas a2200169 4500008004100000020001400041245007000055210006900125260001200194300001400206490000700220520124100227100001701468700002101485700001801506856011001524 1999 eng d a0031-320300aUnsupervised parallel image classification using Markovian models0 aUnsupervised parallel image classification using Markovian model c1999/// a591 - 6040 v323 aThis paper deals with the problem of unsupervised classification of images modeled by Markov random fields (MRF). If the model parameters are known then we have various methods to solve the segmentation problem (simulated annealing (SA), iterated conditional modes (ICM), etc). However, when the parameters are unknown, the problem becomes more difficult. One has to estimate the hidden label field parameters only from the observed image. Herein, we are interested in parameter estimation methods related to monogrid and hierarchical MRF models. The basic idea is similar to the expectation-maximization (EM) algorithm: we recursively look at the maximum a posteriori (MAP) estimate of the label field given the estimated parameters, then we look at the maximum likelihood (ML) estimate of the parameters given a tentative labeling obtained at the previous step. The only parameter supposed to be known is the number of classes, all the other parameters are estimated. The proposed algorithms have been implemented on a Connection Machine CM200. Comparative experiments have been performed on both noisy synthetic data and real images. © 1999 Pattern Recognition Society. Published by Elsevier Science Ltd. All rights reserved.
1 aKato, Zoltan1 aZerubia, Josiane1 aBerthod, Mark uhttps://www.inf.u-szeged.hu/publication/unsupervised-parallel-image-classification-using-markovian-models00781nas a2200145 4500008004100000020001400041245007100055210006800126260026900194300001400463490000700477100002300484700001700507856011100524 1998 eng d a0167-865500aA 3D 6-subiteration thinning algorithm for extracting medial lines0 a3D 6subiteration thinning algorithm for extracting medial lines aBERTRAND 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 Mc1998/// a613 - 6270 v191 aPalágyi, Kálmán1 aKuba, Attila uhttps://www.inf.u-szeged.hu/publication/a-3d-6-subiteration-thinning-algorithm-for-extracting-medial-lines01501nas a2200205 4500008004100000020001400041245006800055210006600123260001200189300001400201490000700215520084000222100002001062700001801082700002101100700001701121700002801138700002101166856010801187 1998 eng d a0895-611100aA comparison of lossless compression methods for medical images0 acomparison of lossless compression methods for medical images c1998/// a323 - 3390 v223 aIn this work, lossless grayscale image compression methods arecompared on a medical image database. The database contains 10
different types of images with bit rates varying from 8 to 16
bits per pixel. The total number of test images was about 3000,
originating from 125 different patient studies. Methods used for
compressing the images include seven methods designed for
grayscale images and 18 ordinary general-purpose compression
programs. Furthermore, four compressed image file formats were
used. The results show that the compression ratios strongly
depend on the type of the image. The best methods turned out to
be TMW, CALIC and JPEG-LS. The analysis step in TMW is very
time-consuming. CALIC gives high compression ratios in a
reasonable time, whereas JPEG-LS is nearly as effective and very
fast.
1 aKivijarvi, Juha1 aOjala, Tamás1 aKaukoranta, Timo1 aKuba, Attila1 aNyúl, László, Gábor1 aNevalainen, Olli uhttps://www.inf.u-szeged.hu/publication/a-comparison-of-lossless-compression-methods-for-medical-images00627nas a2200157 4500008004100000245009100041210006900132260001200201100002000213700001800233700002100251700001700272700002800289700002100317856013100338 1998 eng d00aThe Comparison of Lossless Compression Methods in the Case of a Medical Image Database0 aComparison of Lossless Compression Methods in the Case of a Medi c1998///1 aKivijarvi, Juha1 aOjala, Tamás1 aKaukoranta, Timo1 aKuba, Attila1 aNyúl, László, Gábor1 aNevalainen, Olli uhttps://www.inf.u-szeged.hu/publication/the-comparison-of-lossless-compression-methods-in-the-case-of-a-medical-image-database02128nas a2200193 4500008004100000245005500041210005500096260005500151300000700206520148200213100002201695700001701717700001701734700002001751700001601771700002801787700002201815856009701837 1998 eng d00aExperience with the SZOTE PACS Starting Operations0 aExperience with the SZOTE PACS Starting Operations aBudapestbMagyar Radiológus TársaságcJune 1998 a683 aIntroduction: During the last four years a Picture Archiving andCommunication System (PACS) has been developed in the University mainly for educational purposes. The original intention was to use the system as a non-stop routine PACS, so the images of the modalities of the system should be available to the workstations connected to the University network at the different clinics. Material and method: Two CTs, one MR, one ultrasound, three fluoroscopy devices, two SPECTs, two gamma cameras and one X-ray film scanner have been connected to the computer network at SZOTE. One Silicon Graphics Challenge DM central image server collects the images and related data. The picture archiving and communication is DICOM conform. An ORACLE data management system facilitates the data retrieval. Step by step testing of the operation of the system began with the transport, conversion and archiving of images of two CTs, one MR and one SPECT: Results: The daily archiving of about 5000 images on 80-100 patients gradually demonstrated the slight incompatibility of DICOM or Interfile of the image modalities or converter stations and the minor shortcomings of the software. Three educational cabinets have been installed, in which the practical teaching of radiology has been performed since 1996. Discussion/conclusion: Full automatization is necessary for handling such huge amount of images. For this the PACS and RIS/HIS connection was needed which was successed as well.
1 aAlmási, László1 aSóti, Zsolt1 aKuba, Attila1 aAlexin, Zoltán1 aNagy, Antal1 aNyúl, László, Gábor1 aCsernay, László uhttps://www.inf.u-szeged.hu/publication/experience-with-the-szote-pacs-starting-operations-202128nas a2200193 4500008004100000245005500041210005500096260005500151300000700206520148200213100002201695700001701717700001701734700002001751700001601771700002801787700002201815856009701837 1998 eng d00aExperience with the SZOTE PACS Starting Operations0 aExperience with the SZOTE PACS Starting Operations aBudapestbMagyar Radiológus TársaságcJune 1998 a683 aIntroduction: During the last four years a Picture Archiving andCommunication System (PACS) has been developed in the University mainly for educational purposes. The original intention was to use the system as a non-stop routine PACS, so the images of the modalities of the system should be available to the workstations connected to the University network at the different clinics. Material and method: Two CTs, one MR, one ultrasound, three fluoroscopy devices, two SPECTs, two gamma cameras and one X-ray film scanner have been connected to the computer network at SZOTE. One Silicon Graphics Challenge DM central image server collects the images and related data. The picture archiving and communication is DICOM conform. An ORACLE data management system facilitates the data retrieval. Step by step testing of the operation of the system began with the transport, conversion and archiving of images of two CTs, one MR and one SPECT: Results: The daily archiving of about 5000 images on 80-100 patients gradually demonstrated the slight incompatibility of DICOM or Interfile of the image modalities or converter stations and the minor shortcomings of the software. Three educational cabinets have been installed, in which the practical teaching of radiology has been performed since 1996. Discussion/conclusion: Full automatization is necessary for handling such huge amount of images. For this the PACS and RIS/HIS connection was needed which was successed as well.
1 aAlmási, László1 aSóti, Zsolt1 aKuba, Attila1 aAlexin, Zoltán1 aNagy, Antal1 aNyúl, László, Gábor1 aCsernay, László uhttps://www.inf.u-szeged.hu/publication/experience-with-the-szote-pacs-starting-operations-000676nas a2200205 4500008004100000245005500041210005400096260002400150300001200174100002200186700001700208700001700225700002000242700001600262700002800278700002200306700002200328700002500350856009500375 1998 eng d00aExperience with the SZOTE-PACS Starting Operations0 aExperience with the SZOTEPACS Starting Operations aBarcelonacOct 1998 a43 - 441 aAlmási, László1 aSóti, Zsolt1 aKuba, Attila1 aAlexin, Zoltán1 aNagy, Antal1 aNyúl, László, Gábor1 aCsernay, László1 aPiqueras, Joaquim1 aCarreno, Joan-Carles uhttps://www.inf.u-szeged.hu/publication/experience-with-the-szote-pacs-starting-operations00678nas a2200205 4500008004100000245005500041210005400096260002400150300001200174100002200186700001700208700001700225700002000242700001600262700002800278700002200306700002200328700002500350856009700375 1998 eng d00aExperience with the SZOTE-PACS Starting Operations0 aExperience with the SZOTEPACS Starting Operations aBarcelonacOct 1998 a43 - 441 aAlmási, László1 aSóti, Zsolt1 aKuba, Attila1 aAlexin, Zoltán1 aNagy, Antal1 aNyúl, László, Gábor1 aCsernay, László1 aPiqueras, Joaquim1 aCarreno, Joan-Carles uhttps://www.inf.u-szeged.hu/publication/experience-with-the-szote-pacs-starting-operations-100473nas a2200145 4500008004100000020001400041245005400055210005200109260001200161300001400173490000600187100002300193700001700216856009400233 1998 eng d a1330-113600aA hybrid thinning algorithm for 3D medical images0 ahybrid thinning algorithm for 3D medical images c1998/// a149 - 1640 v61 aPalágyi, Kálmán1 aKuba, Attila uhttps://www.inf.u-szeged.hu/publication/a-hybrid-thinning-algorithm-for-3d-medical-images01969nas a2200193 4500008004100000245004100041210004000082260005500122300000700177520136600184100001701550700002201567700001701589700002001606700001601626700002801642700002201670856008301692 1998 eng d00aImage Presentation in the SZOTE-PACS0 aImage Presentation in the SZOTEPACS aBudapestbMagyar Radiológus TársaságcJune 1998 a563 aThe SZOTE Picture Archiving and Communication System (SZOTEPACS) is used for: - teaching graduate and postgraduate students - picture archiving for scientific purposes - archiving and consulting data from radiological and nuclear medicine examinations In order to implement these tasks, archiving is not enough; it is also necessary to display images in various clinics and departments. On the basis of the cost/benefit principle, after an appropriate selection, Silicon Graphics workstations (Indy Modeler R5000PC microprocessor, 32 MB RM, 1 GB disc, 17”/8 bit color monitor) and Albacom Activa Standard computers (Intel Pentium 200 Mhz CPU, 32 MB EDO RAM, 2.1 GB disc, 17” GoldStar 78i color monitor) were implemented into the system. The problem of a relatively easy and fast search in the PACS image database is solved, if access is granted. The images are transferred to the workstations (viewing stations) in DICOM 3.0 format. The images processing program OSIRIS is suitable for the processing of images in DICOM format. The resolution of the viewing station display is: Silicon Graphics 1280 x 1024 x 8 bit; Albacom 1600 x 1200 x 8 bit. For the matrix specified above, the 256 grey scale is suitable for display of the chosen images in good quality, consultation with clinicians, and the comparison of control examinations with previous ones.
1 aSóti, Zsolt1 aAlmási, László1 aKuba, Attila1 aAlexin, Zoltán1 aNagy, Antal1 aNyúl, László, Gábor1 aCsernay, László uhttps://www.inf.u-szeged.hu/publication/image-presentation-in-the-szote-pacs-001967nas a2200193 4500008004100000245004100041210004000082260005500122300000700177520136600184100001701550700002201567700001701589700002001606700001601626700002801642700002201670856008101692 1998 eng d00aImage Presentation in the SZOTE-PACS0 aImage Presentation in the SZOTEPACS aBudapestbMagyar Radiológus TársaságcJune 1998 a563 aThe SZOTE Picture Archiving and Communication System (SZOTEPACS) is used for: - teaching graduate and postgraduate students - picture archiving for scientific purposes - archiving and consulting data from radiological and nuclear medicine examinations In order to implement these tasks, archiving is not enough; it is also necessary to display images in various clinics and departments. On the basis of the cost/benefit principle, after an appropriate selection, Silicon Graphics workstations (Indy Modeler R5000PC microprocessor, 32 MB RM, 1 GB disc, 17”/8 bit color monitor) and Albacom Activa Standard computers (Intel Pentium 200 Mhz CPU, 32 MB EDO RAM, 2.1 GB disc, 17” GoldStar 78i color monitor) were implemented into the system. The problem of a relatively easy and fast search in the PACS image database is solved, if access is granted. The images are transferred to the workstations (viewing stations) in DICOM 3.0 format. The images processing program OSIRIS is suitable for the processing of images in DICOM format. The resolution of the viewing station display is: Silicon Graphics 1280 x 1024 x 8 bit; Albacom 1600 x 1200 x 8 bit. For the matrix specified above, the 256 grey scale is suitable for display of the chosen images in good quality, consultation with clinicians, and the comparison of control examinations with previous ones.
1 aSóti, Zsolt1 aAlmási, László1 aKuba, Attila1 aAlexin, Zoltán1 aNagy, Antal1 aNyúl, László, Gábor1 aCsernay, László uhttps://www.inf.u-szeged.hu/publication/image-presentation-in-the-szote-pacs00626nas a2200193 4500008004100000245004500041210004400086260002700130300001200157100002500169700002800194700001600222700001700238700002100255700002200276700002200298700002500320856008700345 1998 eng d00aLossless Image Compression in SZOTE-PACS0 aLossless Image Compression in SZOTEPACS aBarcelonab*cOct 1998 a95 - 981 aMartonossy, László1 aNyúl, László, Gábor1 aNagy, Antal1 aKuba, Attila1 aNevalainen, Olli1 aCsernay, László1 aPiqueras, Joaquim1 aCarreno, Joan-Carles uhttps://www.inf.u-szeged.hu/publication/lossless-image-compression-in-szote-pacs-000624nas a2200193 4500008004100000245004500041210004400086260002700130300001200157100002500169700002800194700001600222700001700238700002100255700002200276700002200298700002500320856008500345 1998 eng d00aLossless Image Compression in SZOTE-PACS0 aLossless Image Compression in SZOTEPACS aBarcelonab*cOct 1998 a95 - 981 aMartonossy, László1 aNyúl, László, Gábor1 aNagy, Antal1 aKuba, Attila1 aNevalainen, Olli1 aCsernay, László1 aPiqueras, Joaquim1 aCarreno, Joan-Carles uhttps://www.inf.u-szeged.hu/publication/lossless-image-compression-in-szote-pacs00597nas a2200157 4500008004100000020001400041245009200055210006900147260001200216300001400228490000600242100001900248700002300267700001700290856013200307 1998 eng d a1230-053500aMedical image registration based on interactively identified anatomical landmark points0 aMedical image registration based on interactively identified ana c1998/// a151 - 1580 v71 aTanacs, Attila1 aPalágyi, Kálmán1 aKuba, Attila uhttps://www.inf.u-szeged.hu/publication/medical-image-registration-based-on-interactively-identified-anatomical-landmark-points00596nas a2200157 4500008004100000020001400041245009200055210006900147260000900216300001400225490000600239100001900245700002300264700001700287856013400304 1998 eng d a1230-053500aMedical image registration based on interactively identified anatomical landmark points0 aMedical image registration based on interactively identified ana c1998 a151 - 1580 v71 aTanacs, Attila1 aPalágyi, Kálmán1 aKuba, Attila uhttps://www.inf.u-szeged.hu/publication/medical-image-registration-based-on-interactively-identified-anatomical-landmark-points-000627nas a2200157 4500008004100000245007700041210006900118260004900187300001400236100001700250700002100267700002600288700001700314700002100331856011700352 1998 eng d00aMotion Compensated Color Video Classification Using Markov Random Fields0 aMotion Compensated Color Video Classification Using Markov Rando aBerlin; HeidelbergbSpringer Verlagc1998/// a738 - 7451 aKato, Zoltan1 aPong, Ting Chuen1 aLee, John, Chung Mong1 aChin, Roland1 aPong, Ting Chuen uhttps://www.inf.u-szeged.hu/publication/motion-compensated-color-video-classification-using-markov-random-fields00551nas a2200157 4500008004100000245004400041210004300085260007600128300001200204100001900216700002300235700001700258700002100275700001800296856007900314 1998 eng d00aPont alapú regisztráció, képfúzió0 aPont alapú regisztráció képfúzió aBudapestbNeumann János Számítógép-tudományi TársaságcNov 1998 a67 - 701 aTanacs, Attila1 aPalágyi, Kálmán1 aKuba, Attila1 aKozmann, György1 aSzakolczai, K uhttps://www.inf.u-szeged.hu/publication/pont-alapu-regisztracio-kepfuzio-000549nas a2200157 4500008004100000245004400041210004300085260007600128300001200204100001900216700002300235700001700258700002100275700001800296856007700314 1998 eng d00aPont alapú regisztráció, képfúzió0 aPont alapú regisztráció képfúzió aBudapestbNeumann János Számítógép-tudományi TársaságcNov 1998 a67 - 701 aTanacs, Attila1 aPalágyi, Kálmán1 aKuba, Attila1 aKozmann, György1 aSzakolczai, K uhttps://www.inf.u-szeged.hu/publication/pont-alapu-regisztracio-kepfuzio00563nas a2200145 4500008004100000245005900041210005900100260005500159300000700214490003300221100001600254700002800270700002000298856009900318 1998 eng d00aSoftware Development of Medical Image Archiving System0 aSoftware Development of Medical Image Archiving System aSzegedbJózsef Attila TudományegyetemcJuly 1998 a790 vVolume of Extended Abstracts1 aNagy, Antal1 aNyúl, László, Gábor1 aAlexin, Zoltán uhttps://www.inf.u-szeged.hu/publication/software-development-of-medical-image-archiving-system00565nas a2200145 4500008004100000245005900041210005900100260005500159300000700214490003300221100001600254700002800270700002000298856010100318 1998 eng d00aSoftware Development of Medical Image Archiving System0 aSoftware Development of Medical Image Archiving System aSzegedbJózsef Attila TudományegyetemcJuly 1998 a790 vVolume of Extended Abstracts1 aNagy, Antal1 aNyúl, László, Gábor1 aAlexin, Zoltán uhttps://www.inf.u-szeged.hu/publication/software-development-of-medical-image-archiving-system-001892nas a2200169 4500008004100000245010800041210006900149260005500218300000700273520118900280100001601469700002801485700002001513700001701533700002201550856015001572 1998 eng d00aThe Software of the Digital Picture Archiving and Communication System Based on DICOM Standard at SZOTE0 aSoftware of the Digital Picture Archiving and Communication Syst aBudapestbMagyar Radiológus TársaságcJune 1998 a553 aSZOTE-PACS has been developed since 1995. The aim was to collectdigital images produced by existing and new medical imaging modalities which are placed in different buildings. After collection the images are transmitted and built in to a central database. From the images database the PACS users are able to query study data and images easily. The software system consists of three main type of clients: the admitting, the server and the viewing subsystems taking into account the local circumstances. The images produced by the modalities go to the admitting stations. The studies that are not in DICOM format (Interfile, ACR-NEMA 2.0) are converted to DICOM. All studies are sent to the PACSW server in DICOM format. The images are managed by an Oracle Database Se3rver on the PACWS server. The end users are able to query the data by SQL at the viewing stations. The SZOTE-PACS system provides an efficient PACS for physicians, medical doctors and students. It can be used for making educational material, scientific work and diagnosis as well. The completed parts, the process of the working and the plan of the future development of this software system will be presented.
1 aNagy, Antal1 aNyúl, László, Gábor1 aAlexin, Zoltán1 aKuba, Attila1 aCsernay, László uhttps://www.inf.u-szeged.hu/publication/the-software-of-the-digital-picture-archiving-and-communication-system-based-on-dicom-standard-at-szote-001890nas a2200169 4500008004100000245010800041210006900149260005500218300000700273520118900280100001601469700002801485700002001513700001701533700002201550856014801572 1998 eng d00aThe Software of the Digital Picture Archiving and Communication System Based on DICOM Standard at SZOTE0 aSoftware of the Digital Picture Archiving and Communication Syst aBudapestbMagyar Radiológus TársaságcJune 1998 a553 aSZOTE-PACS has been developed since 1995. The aim was to collectdigital images produced by existing and new medical imaging modalities which are placed in different buildings. After collection the images are transmitted and built in to a central database. From the images database the PACS users are able to query study data and images easily. The software system consists of three main type of clients: the admitting, the server and the viewing subsystems taking into account the local circumstances. The images produced by the modalities go to the admitting stations. The studies that are not in DICOM format (Interfile, ACR-NEMA 2.0) are converted to DICOM. All studies are sent to the PACSW server in DICOM format. The images are managed by an Oracle Database Se3rver on the PACWS server. The end users are able to query the data by SQL at the viewing stations. The SZOTE-PACS system provides an efficient PACS for physicians, medical doctors and students. It can be used for making educational material, scientific work and diagnosis as well. The completed parts, the process of the working and the plan of the future development of this software system will be presented.
1 aNagy, Antal1 aNyúl, László, Gábor1 aAlexin, Zoltán1 aKuba, Attila1 aCsernay, László uhttps://www.inf.u-szeged.hu/publication/the-software-of-the-digital-picture-archiving-and-communication-system-based-on-dicom-standard-at-szote01328nas a2200181 4500008004100000245008400041210006900125260004400194300001400238520064300252100001600895700002800911700002000939700001700959700001800976700002600994856012601020 1998 eng d00aThe Software System of the Picture Archiving and Communication System in Szeged0 aSoftware System of the Picture Archiving and Communication Syste aZagrebbUniversity of ZagrebcJune 1998 a183 - 1873 aSZOTE-PACS is a joint software development for archiving andtransferring medical studies of the József Attila University and the Albert Szent-Györgyi Medical University of Szeged. The system is able to collect medical studies from different imaging modalities and store those studies in common standardised DICOM format in a central Oracle database. There is an end user application that can search for specific studies in the central database. The archived medical images can be presented and processed at the viewing stations. SZOTE-PACS also supports the creation and presentation of educational material for medical students.
1 aNagy, Antal1 aNyúl, László, Gábor1 aAlexin, Zoltán1 aKuba, Attila1 aKalpic, Damir1 aDobrić, Vesna, Hljuz uhttps://www.inf.u-szeged.hu/publication/the-software-system-of-the-picture-archiving-and-communication-system-in-szeged-001327nas a2200181 4500008004100000245008400041210006900125260004500194300001400239520064300253100001600896700002800912700002000940700001700960700001800977700002600995856012401021 1998 eng d00aThe Software System of the Picture Archiving and Communication System in Szeged0 aSoftware System of the Picture Archiving and Communication Syste aZagrebbUniversity of Zagrebc1998.06.16 a183 - 1873 aSZOTE-PACS is a joint software development for archiving andtransferring medical studies of the József Attila University and the Albert Szent-Györgyi Medical University of Szeged. The system is able to collect medical studies from different imaging modalities and store those studies in common standardised DICOM format in a central Oracle database. There is an end user application that can search for specific studies in the central database. The archived medical images can be presented and processed at the viewing stations. SZOTE-PACS also supports the creation and presentation of educational material for medical students.
1 aNagy, Antal1 aNyúl, László, Gábor1 aAlexin, Zoltán1 aKuba, Attila1 aKalpic, Damir1 aDobrić, Vesna, Hljuz uhttps://www.inf.u-szeged.hu/publication/the-software-system-of-the-picture-archiving-and-communication-system-in-szeged01866nas a2200157 4500008004100000020001400041245005000055210004700105260001200152300001400164490000800178520138000186100002801566700002201594856009201616 1998 eng d a0033-841900aOn Standardizing the MR Image Intensity Scale0 aStandardizing the MR Image Intensity Scale c1998/// a581 - 5820 v2093 aPURPOSE: MR image intensities have varying ranges and meaningeven for the same protocol (P) and body region (D). This causes
many difficulties in image display and analysis. This exhibit
describes a method of standardizing the intensity scale, so that
for the same P and D, similar intensities will have similar
meaning.
MATERIALS AND METHODS: In the TRAINING phase (done only once for
a given P and D), the parameters of the standardizing
transformation are "learnt" from an image set. In the MAPPING
phase, done for each MR study, these parameters are utilized to
determine the mapping needed to deform its histogram into the
standardized histogram. The method was tested quantitatively on
90 brain FSE T2, PD and T1 studies of MS patients and
qualitatively on an additional 15 SE PD, T1 and SPGR studies of
the brain and foot.
RESULTS: As measured by mean squared difference, standardized
images have statistically significantly (p<0.01) more consistent
range and meaning than those without. Fixed windows that do not
require per study adjustment can be established for the
standardized images.
CONCLUSIONS: Standardizing MR intensity scales to overcome the
difficulties due to widely varying intensity meaning is feasible
by protocol and body region. This can be implemented in a PACS
via DICOM value of interest look up tables.
1 aNyúl, László, Gábor1 aUdupa, Jayaram, K uhttps://www.inf.u-szeged.hu/publication/on-standardizing-the-mr-image-intensity-scale-101915nas a2200205 4500008004100000245003200041210003100073260005500104300000700159520130700166100002201473700002201495700001701517700002001534700002001554700001601574700002801590700001701618856007401635 1998 eng d00aStructure of the SZOTE-PACS0 aStructure of the SZOTEPACS aBudapestbMagyar Radiológus TársaságcJune 1998 a673 aIntroduction: The progress in computer techniques has resultedin the digital archivation and transport of images of radiology and nuclear medicine without loss of information. The images and image series produced by various image modalities are converted to a uniform image format, which provides their interconnectivity and interoperability. The image transport is very important at hospitals comprising pavilion systems. Material and method: Through the computer network of the SZOTE Picture Archiving and Communication System (SZOTE PACS) serves the radiology education with the aid of computer displays. Result: ATM network devices allow the fast transfer of images. Silicon Graphics and PC viewing stations provide fast image processing and presentation. Use of the DICOM standards in SZOTE PACS permits the development of teleradiology services. Discussion: The hardware structure and the parameters of the system will be presented in detail. The PACS is connected to the Radiology Information System of the Department of Radiology and the Department of Nuclear Medicine. Conclusion: This makes automatic image archiving possible. The system is user-friendly: it can be handled with minimum computer knowledge. A group has been established at the University to perform the PACS management.
1 aCsernay, László1 aAlmási, László1 aSóti, Zsolt1 aJánosi, János1 aAlexin, Zoltán1 aNagy, Antal1 aNyúl, László, Gábor1 aKuba, Attila uhttps://www.inf.u-szeged.hu/publication/structure-of-the-szote-pacs-001913nas a2200205 4500008004100000245003200041210003100073260005500104300000700159520130700166100002201473700002201495700001701517700002001534700002001554700001601574700002801590700001701618856007201635 1998 eng d00aStructure of the SZOTE-PACS0 aStructure of the SZOTEPACS aBudapestbMagyar Radiológus TársaságcJune 1998 a673 aIntroduction: The progress in computer techniques has resultedin the digital archivation and transport of images of radiology and nuclear medicine without loss of information. The images and image series produced by various image modalities are converted to a uniform image format, which provides their interconnectivity and interoperability. The image transport is very important at hospitals comprising pavilion systems. Material and method: Through the computer network of the SZOTE Picture Archiving and Communication System (SZOTE PACS) serves the radiology education with the aid of computer displays. Result: ATM network devices allow the fast transfer of images. Silicon Graphics and PC viewing stations provide fast image processing and presentation. Use of the DICOM standards in SZOTE PACS permits the development of teleradiology services. Discussion: The hardware structure and the parameters of the system will be presented in detail. The PACS is connected to the Radiology Information System of the Department of Radiology and the Department of Nuclear Medicine. Conclusion: This makes automatic image archiving possible. The system is user-friendly: it can be handled with minimum computer knowledge. A group has been established at the University to perform the PACS management.
1 aCsernay, László1 aAlmási, László1 aSóti, Zsolt1 aJánosi, János1 aAlexin, Zoltán1 aNagy, Antal1 aNyúl, László, Gábor1 aKuba, Attila uhttps://www.inf.u-szeged.hu/publication/structure-of-the-szote-pacs01278nas a2200157 4500008004100000245005600041210005400097260003100151300001200182520074600194100001600940700002800956700002100984700001801005856009701023 1998 eng d00aTapasztalatok a DICOM szabvánnyal a SZOTE-PACS-ban0 aTapasztalatok a DICOM szabvánnyal a SZOTEPACSban aVeszprémbNJSZTcNov 1998 a71 - 733 a1995-ben, amikor a SZOTE-PACS fejlesztése elkezdődött, a DICOMszabványt választottuk, mint közös file formátumot a vizsgálati képek átvitelére. Ebben a cikkben a DICOM-mal kapcsolatos problémáinkat és a megoldásokat fogjuk ismertetni. Tapasztalataink szerint a problémák nagy része a szabványnak a szoftver-gyártók által hibás vagy hiányos megvalósításával magyarázható. Kis változtatások után az adatátvitel különböző rendszerek és modalitások között általában sikeres volt. A szabványt ellenőrző általunk fejlesztett eszközök nagyban segítették a munkánkat ebben. Külön kitérünk a rendszerben használt automatikus műveletek ismertetésére és ezek továbbfejlesztésére.
1 aNagy, Antal1 aNyúl, László, Gábor1 aKozmann, György1 aSzakolczai, K uhttps://www.inf.u-szeged.hu/publication/tapasztalatok-a-dicom-szabvannyal-a-szote-pacs-ban-001276nas a2200157 4500008004100000245005600041210005400097260003100151300001200182520074600194100001600940700002800956700002100984700001801005856009501023 1998 eng d00aTapasztalatok a DICOM szabvánnyal a SZOTE-PACS-ban0 aTapasztalatok a DICOM szabvánnyal a SZOTEPACSban aVeszprémbNJSZTcNov 1998 a71 - 733 a1995-ben, amikor a SZOTE-PACS fejlesztése elkezdődött, a DICOMszabványt választottuk, mint közös file formátumot a vizsgálati képek átvitelére. Ebben a cikkben a DICOM-mal kapcsolatos problémáinkat és a megoldásokat fogjuk ismertetni. Tapasztalataink szerint a problémák nagy része a szabványnak a szoftver-gyártók által hibás vagy hiányos megvalósításával magyarázható. Kis változtatások után az adatátvitel különböző rendszerek és modalitások között általában sikeres volt. A szabványt ellenőrző általunk fejlesztett eszközök nagyban segítették a munkánkat ebben. Külön kitérünk a rendszerben használt automatikus műveletek ismertetésére és ezek továbbfejlesztésére.
1 aNagy, Antal1 aNyúl, László, Gábor1 aKozmann, György1 aSzakolczai, K uhttps://www.inf.u-szeged.hu/publication/tapasztalatok-a-dicom-szabvannyal-a-szote-pacs-ban00537nas a2200145 4500008004100000245004900041210004900090260007600139300001200215100002300227700001700250700002100267700001800288856008500306 1998 eng d00aVékonyító algoritmusok 3D orvosi képekre0 aVékonyító algoritmusok 3D orvosi képekre aBudapestbNeumann János Számítógép-tudományi TársaságcNov 1998 a63 - 661 aPalágyi, Kálmán1 aKuba, Attila1 aKozmann, György1 aSzakolczai, K uhttps://www.inf.u-szeged.hu/publication/vekonyito-algoritmusok-3d-orvosi-kepekre01288nas a2200181 4500008004100000245015700041210007900198260009600277300001400373520042000387100001900807700001700826700002800843700001600871700002000887700001900907856018000926 1997 eng d00aAdatvédelem és jogosultság a SZOTE képarchiváló és továbbító rendszerébenMagyar Képfeldolgozók és Alakfelismerők Országos Konferenciája0 aAdatvédelem és jogosultság a SZOTE képarchiváló és továbbító ren aKeszthelybPannon Agrártudományi Egyetem Georgikon Mezőgazdaságtudományi KarcOct 1997 a186 - 1883 aEgy tervet ismertetünk, amellyel orvosi képarchiváló- éstovábbító rendszerek adatvédelme és jogosultsága biztosítható nyilvános számítógépes hálózatok esetén is. A védelem azon alapszik, hogy a hálózatba küldött üzeneteket a DICOM protokoll megfelelő szintjén küdoljuk. A jogosultság ellenőrzését pedig egy új, a DICOM protokollba beépített parancs-pár teszi lehetővé.
1 aBánfi, Gábor1 aKuba, Attila1 aNyúl, László, Gábor1 aNagy, Antal1 aSziranyi, Tamas1 aBerke, József uhttps://www.inf.u-szeged.hu/publication/adatvedelem-es-jogosultsag-a-szote-keparchivalo-es-tovabbito-rendszerebenmagyar-kepfeldolgozok-es-alakfelismerok-orszagos-konferenciaja01158nas a2200181 4500008004100000245008900041210007900130260009600209300001400305520042000319100001900739700001700758700002800775700001600803700002000819700001900839856011800858 1997 eng d00aAdatvédelem és jogosultság a SZOTE képarchiváló és továbbító rendszerében0 aAdatvédelem és jogosultság a SZOTE képarchiváló és továbbító ren aKeszthelybPannon Agrártudományi Egyetem Georgikon Mezőgazdaságtudományi KarcOct 1997 a186 - 1883 aEgy tervet ismertetünk, amellyel orvosi képarchiváló- éstovábbító rendszerek adatvédelme és jogosultsága biztosítható nyilvános számítógépes hálózatok esetén is. A védelem azon alapszik, hogy a hálózatba küldött üzeneteket a DICOM protokoll megfelelő szintjén küdoljuk. A jogosultság ellenőrzését pedig egy új, a DICOM protokollba beépített parancs-pár teszi lehetővé.
1 aBánfi, Gábor1 aKuba, Attila1 aNyúl, László, Gábor1 aNagy, Antal1 aSziranyi, Tamas1 aBerke, József uhttps://www.inf.u-szeged.hu/publication/adatvedelem-es-jogosultsag-a-szote-keparchivalo-es-tovabbito-rendszereben00555nas a2200145 4500008004100000245004800041210004500089260009600134300001200230100002300242700001700265700002000282700001900302856008800321 1997 eng d00aAn algorithm for thinning 3D medical images0 aalgorithm for thinning 3D medical images aKeszthelybPannon Agrártudományi Egyetem Georgikon Mezőgazdaságtudományi KarcOct 1997 a64 - 711 aPalágyi, Kálmán1 aKuba, Attila1 aSziranyi, Tamas1 aBerke, József uhttps://www.inf.u-szeged.hu/publication/an-algorithm-for-thinning-3d-medical-images00598nas a2200157 4500008004100000245012600041210006900167260001200236300001200248100001700260700002100277700002600298700002000324700002700344856006900371 1997 eng d00aColor Image Classification and Parameter Estimation in a Markovian FrameworkProceedings of Workshop on 3D Computer Vision0 aColor Image Classification and Parameter Estimation in a Markovi c1997.05 a75 - 791 aKato, Zoltan1 aPong, Ting Chuen1 aLee, John, Chung Mong1 aTsui, Hung, Tat1 aChung, Chi, Kit Ronald uhttp://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.128.156000639nas a2200157 4500008004100000245010500041210006900146260001200215300001000227100002000237700002100257700002100278700002100299700001700320856014400337 1997 eng d00aImage segmentation using Markov random field model in fully parallel cellular network architectures.0 aImage segmentation using Markov random field model in fully para c1997/// a - 171 aSziranyi, Tamas1 aZerubia, Josiane1 aCzúni, László1 aGeldreich, David1 aKato, Zoltan uhttps://www.inf.u-szeged.hu/publication/image-segmentation-using-markov-random-field-model-in-fully-parallel-cellular-network-architectures00554nas a2200145 4500008004100000245007300041210006900114260001200183100002000195700002100215700002100236700002100257700001700278856011300295 1997 eng d00aMarkov Random Field Image Segmentation using Cellular Neural Network0 aMarkov Random Field Image Segmentation using Cellular Neural Net c1997///1 aSziranyi, Tamas1 aZerubia, Josiane1 aCzúni, László1 aGeldreich, David1 aKato, Zoltan uhttps://www.inf.u-szeged.hu/publication/markov-random-field-image-segmentation-using-cellular-neural-network02023nas a2200181 4500008004100000020001400041245008200055210007800137260001200215300000600227490000700233520140800240100002001648700001701668700002801685700001601713856011201729 1997 eng d a0025-028700aModuláris DICOM-alapú kép-archiváló és -továbbító rendszer a SZOTE-n0 aModuláris DICOMalapú képarchiváló és továbbító rendszer a SZOTEn c1997/// a60 v713 aTöbbéves fejlesztési munka eredményeként elkészült a SZOTE kép-archiváló és -továbbító rendszere, a SZOTE-PACS (Picture
Archiving and Communication Systems - PACS). Olyan rendszert
készítettünk, amely csaknem valamennyi modalitásról képes
vizsgálatokat begyűjteni, azokat szabványos DICOm formára
átkonvertálni, a központi szerverre átküldeni, ott archiválni és
a különböző megjelenítő és feldolgozó állomásokról igényelt
vizsgálatokat az Archívumból kiadni. A SZOTE-PACS többféle
számítógépes platformon (UNIX, PC, Amiga) képes működni.
Egységes grafikus felhasználói felület segíti a felhasználók
munkáját. A moduláris felépítés lehetővé teszi, hogy a különféle
alrendszerek onállóan végezzenek el feladatokat (pl. adatgyűjtés
és -konverzió, archiválás, feldolgozás és megjelenítés). Az
Archívumban való keresést Oracle adatbáziskezelő segíti.
Ugyancsak az Oracle segítségével oldottuk meg az Archívum
adatvédelmét azáltal, hogy csak a megfelelő jogosultsággal
rendelkező felhasználók férhetnek hozzá az Archívum számukra
engedélyezett részéhez. A SZOTE-PACS támogatja a demonstrációs
(oktatási, kutatási) anyagok készítését azáltal, hogy a
vizsgálatok (képek, szövegek, numerikus adatok) HTML formátumú
kivitelét is lehetővé teszi.
1 aAlexin, Zoltán1 aKuba, Attila1 aNyúl, László, Gábor1 aNagy, Antal uhttps://www.inf.u-szeged.hu/publication/modularis-dicom-alapu-kep-archivalo-es-tovabbito-rendszer-a-szote-n02022nas a2200181 4500008004100000020001400041245008200055210007800137260000900215300000600224490000700230520140800237100002001645700001701665700002801682700001601710856011401726 1997 eng d a0025-028700aModuláris DICOM-alapú kép-archiváló és -továbbító rendszer a SZOTE-n0 aModuláris DICOMalapú képarchiváló és továbbító rendszer a SZOTEn c1997 a60 v713 aTöbbéves fejlesztési munka eredményeként elkészült a SZOTE kép-archiváló és -továbbító rendszere, a SZOTE-PACS (Picture
Archiving and Communication Systems - PACS). Olyan rendszert
készítettünk, amely csaknem valamennyi modalitásról képes
vizsgálatokat begyűjteni, azokat szabványos DICOm formára
átkonvertálni, a központi szerverre átküldeni, ott archiválni és
a különböző megjelenítő és feldolgozó állomásokról igényelt
vizsgálatokat az Archívumból kiadni. A SZOTE-PACS többféle
számítógépes platformon (UNIX, PC, Amiga) képes működni.
Egységes grafikus felhasználói felület segíti a felhasználók
munkáját. A moduláris felépítés lehetővé teszi, hogy a különféle
alrendszerek onállóan végezzenek el feladatokat (pl. adatgyűjtés
és -konverzió, archiválás, feldolgozás és megjelenítés). Az
Archívumban való keresést Oracle adatbáziskezelő segíti.
Ugyancsak az Oracle segítségével oldottuk meg az Archívum
adatvédelmét azáltal, hogy csak a megfelelő jogosultsággal
rendelkező felhasználók férhetnek hozzá az Archívum számukra
engedélyezett részéhez. A SZOTE-PACS támogatja a demonstrációs
(oktatási, kutatási) anyagok készítését azáltal, hogy a
vizsgálatok (képek, szövegek, numerikus adatok) HTML formátumú
kivitelét is lehetővé teszi.
1 aAlexin, Zoltán1 aKuba, Attila1 aNyúl, László, Gábor1 aNagy, Antal uhttps://www.inf.u-szeged.hu/publication/modularis-dicom-alapu-kep-archivalo-es-tovabbito-rendszer-a-szote-n-000573nas a2200121 4500008004100000245010000041210006900141260001200210100001700222700002100239700002600260856016500286 1997 eng d00aMotion Compensated Color Image Classification and Parameter Estimation in a Markovian Framework0 aMotion Compensated Color Image Classification and Parameter Esti c1997///1 aKato, Zoltan1 aPong, Ting Chuen1 aLee, John, Chung Mong uhttp://biblioteca.universia.net/html_bura/ficha/params/title/motion-compensated-color-image-classification-and-parameter-estimation-in-markovian/id/5664082.html00741nas a2200181 4500008004100000245008100041210006900122260009600191300001200287100002000299700002100319700002100340700001700361700002100378700002000399700001900419856012100438 1997 eng d00aMRF based image segmentation with fully parallel cellular nonlinear networks0 aMRF based image segmentation with fully parallel cellular nonlin aKeszthelybPannon Agrártudományi Egyetem Georgikon Mezőgazdaságtudományi KarcOct 1997 a43 - 501 aSziranyi, Tamas1 aZerubia, Josiane1 aGeldreich, David1 aKato, Zoltan1 aCzúni, László1 aSziranyi, Tamas1 aBerke, József uhttps://www.inf.u-szeged.hu/publication/mrf-based-image-segmentation-with-fully-parallel-cellular-nonlinear-networks01477nas a2200205 4500008004100000245006300041210006300104260009800167300001400265520073200279100001701011700002001028700002801048700001601076700002201092700002201114700002001136700001901156856009601175 1997 eng d00aOrvosi képarchiváló és továbbító rendszer szoftvere0 aOrvosi képarchiváló és továbbító rendszer szoftvere aKeszthelybPannon Agrártudományi Egyetem Georgikon Mezőgazdaságtudományi Karc1997.10.09 a189 - 1933 aAz ismertetendő képarchiváló és -továbbító rendszer a szegediOrvostudományi Egyetem számára készült. A fejlesztés fő célja az volt, hogy egy olyan rendszert állítsunk elő, amely összegyájti a különböző képfelvevő berendezések (pl. CT, MR, NM, SPECT, US) által előállított beteg vizsgálatokat. A SZOTE-PACS a vizsgálatokat DICOM szabvány szerint archiválja Oracle adatbázis kezelő rendszerrel. Ezeket a vizsgálatokat a felhasználók lekérhetik az archívumból egy könnyen használható grafikus felülettel rendelkező programmal. Az adatbázisban tárolt képeket és egyéb információkat fel lehet használni oktatási anyag készítéséhez az orvostanhallgatók számára.
1 aKuba, Attila1 aAlexin, Zoltán1 aNyúl, László, Gábor1 aNagy, Antal1 aCsernay, László1 aAlmási, László1 aSziranyi, Tamas1 aBerke, József uhttps://www.inf.u-szeged.hu/publication/orvosi-keparchivalo-es-tovabbito-rendszer-szoftvere01479nas a2200205 4500008004100000245006300041210006300104260009800167300001400265520073200279100001701011700002001028700002801048700001601076700002201092700002201114700002001136700001901156856009801175 1997 eng d00aOrvosi képarchiváló és továbbító rendszer szoftvere0 aOrvosi képarchiváló és továbbító rendszer szoftvere aKeszthelybPannon Agrártudományi Egyetem Georgikon Mezőgazdaságtudományi Karc1997.10.09 a189 - 1933 aAz ismertetendő képarchiváló és -továbbító rendszer a szegediOrvostudományi Egyetem számára készült. A fejlesztés fő célja az volt, hogy egy olyan rendszert állítsunk elő, amely összegyájti a különböző képfelvevő berendezések (pl. CT, MR, NM, SPECT, US) által előállított beteg vizsgálatokat. A SZOTE-PACS a vizsgálatokat DICOM szabvány szerint archiválja Oracle adatbázis kezelő rendszerrel. Ezeket a vizsgálatokat a felhasználók lekérhetik az archívumból egy könnyen használható grafikus felülettel rendelkező programmal. Az adatbázisban tárolt képeket és egyéb információkat fel lehet használni oktatási anyag készítéséhez az orvostanhallgatók számára.
1 aKuba, Attila1 aAlexin, Zoltán1 aNyúl, László, Gábor1 aNagy, Antal1 aCsernay, László1 aAlmási, László1 aSziranyi, Tamas1 aBerke, József uhttps://www.inf.u-szeged.hu/publication/orvosi-keparchivalo-es-tovabbito-rendszer-szoftvere-000685nas a2200157 4500008004100000245008600041210007500127260009600202300001000298100001900308700002300327700001700350700002000367700001900387856012100406 1997 eng d00aOrvosi képek regisztrációja interaktívan kijelölt anatómiai pontok alapján0 aOrvosi képek regisztrációja interaktívan kijelölt anatómiai pont aKeszthelybPannon Agrártudományi Egyetem Georgikon Mezőgazdaságtudományi KarcOct 1997 a1 - 81 aTanacs, Attila1 aPalágyi, Kálmán1 aKuba, Attila1 aSziranyi, Tamas1 aBerke, József uhttps://www.inf.u-szeged.hu/publication/orvosi-kepek-regisztracioja-interaktivan-kijelolt-anatomiai-pontok-alapjan-000683nas a2200157 4500008004100000245008600041210007500127260009600202300001000298100001900308700002300327700001700350700002000367700001900387856011900406 1997 eng d00aOrvosi képek regisztrációja interaktívan kijelölt anatómiai pontok alapján0 aOrvosi képek regisztrációja interaktívan kijelölt anatómiai pont aKeszthelybPannon Agrártudományi Egyetem Georgikon Mezőgazdaságtudományi KarcOct 1997 a1 - 81 aTanacs, Attila1 aPalágyi, Kálmán1 aKuba, Attila1 aSziranyi, Tamas1 aBerke, József uhttps://www.inf.u-szeged.hu/publication/orvosi-kepek-regisztracioja-interaktivan-kijelolt-anatomiai-pontok-alapjan00605nas a2200157 4500008004100000245007700041210006900118260003000187300001400217100002300231700001700254700001900271700002300290700001700313856011700330 1997 eng d00aA parallel 12-subiteration 3D thinning algorithm to extract medial lines0 aparallel 12subiteration 3D thinning algorithm to extract medial aBerlinbSpringerc1997/// a400 - 4071 aPalágyi, Kálmán1 aKuba, Attila1 aSommer, Gerald1 aDaniilidis, Kostas1 aPauli, Josef uhttps://www.inf.u-szeged.hu/publication/a-parallel-12-subiteration-3d-thinning-algorithm-to-extract-medial-lines01589nas a2200193 4500008004100000245006400041210006200105260002200167300001200189520094400201100001601145700002801161700001701189700002001206700002201226700002201248700002201270856010301292 1997 eng d00aProblems and Solutions: One Year Experience with SZOTE-PACS0 aProblems and Solutions One Year Experience with SZOTEPACS aPisab*cSep 1997 a39 - 423 aIn 1995 when the development of the SZOTE-PACS (PACS of theAlbert Szent-Györgyi Medical University) begun, we chose DICOM as the common file format and a possible file transfer protocol for our PACS. Now, we present the problems and our solutions connected with the application of the DICOM standard. According to our experiences the problems can be explained as the misinterpretation of the complex, complicated and extensive standard. After some minor adjustments the exchange of study data between different systems, vendors, and even modalities was generally successful. Diagnostic tools for testing DICOM files coming from different modalities are a help to the adjustments. In the second part we present the automatic procedures built into SZOTE-PACS: automatic data-conversion, -edition (including existing RIS data and predefined study parameters), lossless image data compression, checking and transmission to the Archive.
1 aNagy, Antal1 aNyúl, László, Gábor1 aKuba, Attila1 aAlexin, Zoltán1 aAlmási, László1 aBartolozzi, Carlo1 aCaramella, Davide uhttps://www.inf.u-szeged.hu/publication/problems-and-solutions-one-year-experience-with-szote-pacs01598nas a2200193 4500008004100000245006400041210006200105260002900167300001200196520094400208100001601152700002801168700001701196700002001213700002201233700002201255700002201277856010501299 1997 eng d00aProblems and Solutions: One Year Experience with SZOTE-PACS0 aProblems and Solutions One Year Experience with SZOTEPACS aPisa, Italyb*cSep 1997 a39 - 423 aIn 1995 when the development of the SZOTE-PACS (PACS of theAlbert Szent-Györgyi Medical University) begun, we chose DICOM as the common file format and a possible file transfer protocol for our PACS. Now, we present the problems and our solutions connected with the application of the DICOM standard. According to our experiences the problems can be explained as the misinterpretation of the complex, complicated and extensive standard. After some minor adjustments the exchange of study data between different systems, vendors, and even modalities was generally successful. Diagnostic tools for testing DICOM files coming from different modalities are a help to the adjustments. In the second part we present the automatic procedures built into SZOTE-PACS: automatic data-conversion, -edition (including existing RIS data and predefined study parameters), lossless image data compression, checking and transmission to the Archive.
1 aNagy, Antal1 aNyúl, László, Gábor1 aKuba, Attila1 aAlexin, Zoltán1 aAlmási, László1 aBartolozzi, Carlo1 aCaramella, Davide uhttps://www.inf.u-szeged.hu/publication/problems-and-solutions-one-year-experience-with-szote-pacs-000814nas a2200145 4500008004100000245007200041210006900113260028600182300001400468100002300482700001700505700001800522700001600540856011200556 1997 eng d00aA thinning algorithm to extract medial lines from 3D medical images0 athinning algorithm to extract medial lines from 3D medical image aBerlin; 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, 1996bSpringer Verlagc1997/// a411 - 4161 aPalágyi, Kálmán1 aKuba, Attila1 aDuncan, James1 aGindi, Gene uhttps://www.inf.u-szeged.hu/publication/a-thinning-algorithm-to-extract-medial-lines-from-3d-medical-images02227nas a2200181 4500008004100000020001400041245006100055210006100116260001200177300001400189490000700203520166500210100001801875700001701893700001301910700002101923856010101944 1996 eng d a0262-885600aBayesian image classification using Markov random fields0 aBayesian image classification using Markov random fields c1996/// a285 - 2950 v143 aIn this paper, we present three optimisation techniques, Deterministic Pseudo-Annealing (DPA), Game Strategy Approach (GSA), and Modified Metropolis Dynamics (MMD), in order to carry out image classification using a Markov random field model. For the first approach (DPA), the a posteriori probability of a tentative labelling is generalised to a continuous labelling. The merit function thus defined has the same maxima under constraints yielding probability vectors. Changing these constraints convexifies the merit function. The algorithm solves this unambiguous maximisation problem, and then tracks down the solution while the original constraints are restored yielding a good, even if suboptimal, solution to the original labelling assignment problem. In the second method (GSA), the maximisation problem of the a posteriori probability of the labelling is solved by an optimisation algorithm based on game theory. A non-cooperative n-person game with pure strategies is designed such that the set of Nash equilibrium points of the game is identical to the set of local maxima of the a posteriori probability of the labelling. The algorithm converges to a Nash equilibrium. The third method (MMD) is a modified version of the Metropolis algorithm: at each iteration the new state is chosen randomly, but the decision to accept it is purely deterministic. This is also a suboptimal technique but it is much faster than stochastic relaxation. These three methods have been implemented on a Connection Machine CM2. Experimental results are compared to those obtained by the Metropolis algorithm, the Gibbs sampler and ICM (Iterated Conditional Mode).
1 aBerthod, Mark1 aKato, Zoltan1 aYu, Shan1 aZerubia, Josiane uhttps://www.inf.u-szeged.hu/publication/bayesian-image-classification-using-markov-random-fields00615nas a2200157 4500008004100000245007000041210006900111260004200180300001400222100002000236700002100256700002100277700001700298700003200315856011000347 1996 eng d00aCellular Neural Network in Markov Random Field Image Segmentation0 aCellular Neural Network in Markov Random Field Image Segmentatio aNew YorkbWiley - IEEE Pressc1996/// a139 - 1441 aSziranyi, Tamas1 aZerubia, Josiane1 aGeldreich, David1 aKato, Zoltan1 a*Society, *IEEE, Circuits & uhttps://www.inf.u-szeged.hu/publication/cellular-neural-network-in-markov-random-field-image-segmentation01278nas a2200217 4500008004100000245005800041210005800099260001300157300001200170520059300182100001700775700002000792700001600812700002800828700002300856700001800879700002200897700002200919700002100941856009800962 1996 eng d00aDICOM Based PACS and Its Application in the Education0 aDICOM Based PACS and Its Application in the Education cOct 1996 a46 - 493 aSZOTE-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.
1 aKuba, Attila1 aAlexin, Zoltán1 aNagy, Antal1 aNyúl, László, Gábor1 aPalágyi, Kálmán1 aNagy, Mariann1 aAlmási, László1 aCsernay, László1 aOrphanoudakis, S uhttps://www.inf.u-szeged.hu/publication/dicom-based-pacs-and-its-application-in-the-education01280nas a2200217 4500008004100000245005800041210005800099260001300157300001200170520059300182100001700775700002000792700001600812700002800828700002300856700001800879700002200897700002200919700002100941856010000962 1996 eng d00aDICOM Based PACS and Its Application in the Education0 aDICOM Based PACS and Its Application in the Education cOct 1996 a46 - 493 aSZOTE-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.
1 aKuba, Attila1 aAlexin, Zoltán1 aNagy, Antal1 aNyúl, László, Gábor1 aPalágyi, Kálmán1 aNagy, Mariann1 aAlmási, László1 aCsernay, László1 aOrphanoudakis, S uhttps://www.inf.u-szeged.hu/publication/dicom-based-pacs-and-its-application-in-the-education-002698nas a2200145 4500008004100000245005700041210005500098260003000153300001400183520219900197100002802396700001602424700002102440856009102461 1996 eng d00aA DICOM szabvány megvalósítása és alkalmazásai0 aDICOM szabvány megvalósítása és alkalmazásai aBudapestbNJSZTcNov 1996 a177 - 1803 aA DICOM (Digital Imaging and COmmunication in Medicine) azorvosi vizsgálatok képeinek (CT, NM, MR, SPECT stb.) és egyéb adatainak tárolását és a számítógépes hálózaton keresztül történő átvitelét leíró új szabvány, amely ma már általánosan elfogadottá vált a gyártók és a felhasználók körében egyaránt. Ez a szabvány meghatározza a különféle információs objektumok (képek, vizsgálati és beteg adatok stb.) tárolási formátumát, az azokhoz kapcsolódó máveleteket (létrehozás, törlés stb.) és a hálózati kommunikáció módját is. Az új szabvány megalkotásának célja az volt, hogy egységes kapcsolódási lehetőséget biztosítson a különféle orvosi képalkotó berendezések számára. A DICOM szabványnak megfelelő modalitások és számítógépek a TCP/IP kommunikációs protokol szerint (pl. az Interneten keresztül) képesek vizsgálati adatokat továbbítani egymásnak. Több mint két éve folyó fejlesztési munkánk célja egy olyan DICOM programcsomag kifejlesztése volt, amely a szabvány elterjedéséhez nyújt segítséget. Így például szükség van olyan konverziós programokra, amelyek biztosítják a régi, elterjedt formátumban (interfile, ACR-NEMA) megadott vizsgálatok átalakítását egységesen DICOM formátumra. Hasonlóképpek fontos a DICOM formátumú objektumok beolvasása, módosítása, listázása és kiírása. Az alapvető feladatok elvégzésére készítettünk egy szubrutin gyűjteményt. Erre építve írtunk konverziós programokat, különböző segédprogramokat és felhasználó-barát, grafikus felülettel rendelkező szerkesztő programokat. Az összes komponenes működik PC-s és UNIX-os platformon egyaránt. A moduláris felépítésnek és a szabvány-leírások speciális tárolásának köszönhetően a programok könnyen igazíthatók lesznek a DICOM későbbi módosításaihoz, bővítéseihez. Az elvégzett tesztek azt mutatják, hogy az általunk előállított DICOM objektumok megfelelnek a szabványnak. Az eddig elkészült programok a fejlesztés alatt lévő SZOTE-PACS-ben és a MicroSegams rendszerben kerültek felhasználásra.
1 aNyúl, László, Gábor1 aNagy, Antal1 aKozmann, György uhttps://www.inf.u-szeged.hu/publication/a-dicom-szabvany-megvalositasa-es-alkalmazasai02610nas a2200241 4500008004100000245005700041210005700098260005200155300000900207520183900216100001702055700002202072700001402094700002002108700001602128700002802144700002202172700001502194700002202209700002402231700001602255856009702271 1996 eng d00aEducational PACS at the Medical University in Szeged0 aEducational PACS at the Medical University in Szeged aAmsterdambElsevier Science Publishersc1996/// a10273 aThis paper describes the Picture Archiving and CommunicationSystem (PACS) developed for the Medical University of Szeged.
The main aims of the development were to provide a tool to
collect studies from different format and to use the archived
information in the education and in the clinical routine. The
system is able to collect studies from CT, MR, NM, US, SPECT
modalities, from X-film scanners and from any station
communicating according to DICOM storage- query/retrieve service
class. The data are automatically converted from Interfile 3.3,
ACR-NEMA 2.0 or TIFF formats into DICOM 3.0 format and stored in
the data-server of the system. The study headers can be edited
by graphic editor programs. The PACS can collect information
also from the Radiology Information System (RIS) of the
Department. In order to have an effective database management
the users may use Oracle to retrieve, present or modify data.
The Oracle system stores the whole header information but does
not contain the image data itself. The clients can reach the
database using capabilities and it can be used to avoid
unauthorized connections. Our DICOM server gives the studies to
the processing stations (PC-s, UNIX workstations or X-
terminals). Here the user can retrieve, process and present
studies, furthermore, as a special aim, they can edit text and
images into HTML format to create graduate and post-graduate
educational material. Then this educational material can be
stored also in the system/CD-ROMs and can be used in the
training of medical students. Our PACS system is modular,
flexible and based on a 4th generation functional programming
language Tcl/Tk. This language has Oracle connection and
graphical interfaces. In this way the same source code can be
used by each client.
1 aKuba, Attila1 aCsernay, László1 aKardos, L1 aAlexin, Zoltán1 aNagy, Antal1 aNyúl, László, Gábor1 aAlmási, László1 aLemke, U H1 aInamura, Kiyonari1 aVannier, Michael, W1 aFarman, G A uhttps://www.inf.u-szeged.hu/publication/educational-pacs-at-the-medical-university-in-szeged02007nas a2200169 4500008004100000020001400041245011000055210006900165260001200234300001200246490000700258520136600265100001701631700001801648700002101666856015001687 1996 eng d a1077-316900aA Hierarchical Markov Random Field Model and Multitemperature Annealing for Parallel Image Classification0 aHierarchical Markov Random Field Model and Multitemperature Anne c1996/// a18 - 370 v583 aIn this paper, we are interested in massively parallel multiscale relaxation algorithms applied to image classification. It is well known that multigrid methods can improve significantly the convergence rate and the quality of the final results of iterative relaxation techniques. First, we present a classical multiscale model which consists of a label pyramid and a whole observation field. The potential functions of coarser grids are derived by simple computations. The optimization problem is first solved at the higher scale by a parallel relaxation algorithm; then the next lower scale is initialized by a projection of the result. Second, we propose a hierarchical Markov random field model based on this classical model. We introduce new interactions between neighbor levels in the pyramid. It can also be seen as a way to incorporate cliques with far apart sites for a reasonable price. This model results in a relaxation algorithm with a new annealing scheme: the multitemperature annealing (MTA) scheme, which consists of associating higher temperatures to higher levels, in order to be less sensitive to local minima at coarser grids. The convergence to the global optimum is proved by a generalization of the annealing theorem of S. Geman and D. Geman (IEEE Trans. Pattern Anal. Mach. Intell. 6, 1984, 721-741). © 1996 Academic Press, Inc.
1 aKato, Zoltan1 aBerthod, Mark1 aZerubia, Josiane uhttps://www.inf.u-szeged.hu/publication/a-hierarchical-markov-random-field-model-and-multitemperature-annealing-for-parallel-image-classification01305nas a2200193 4500008004100000245008700041210007800128260003800206300001600244520059000260100001700850700002000867700001600887700002800903700002200931700002000953700002000973856011800993 1996 eng d00aKép-archiváló és továbbító rendszer szoftverének fejlesztése (SZOTE-PACS)0 aKéparchiváló és továbbító rendszer szoftverének fejlesztése SZOT aDebrecenbDebreceni Egyetemc1996 a1186 - 11923 aThe Picture Archiving and Communication System developed for theMedical University of Szeged (called SZOTE-PACS) is described.
The main aim of the development was to provide a system that
collects patient studies from different radiology imaging
modalities (e.g., CT, MR, NM). SZOTE-PACS archives the studies
in a standard format (DICOM 3.0) with Oracle database system and
the user can retrieve them by an easy-to-use graphic interface.
The images and other information stored in the database can be
used to edit educational material for medical university
students.
1 aKuba, Attila1 aAlexin, Zoltán1 aNagy, Antal1 aNyúl, László, Gábor1 aCsernay, László1 aBakonyi, Péter1 aHerdon, Miklós uhttps://www.inf.u-szeged.hu/publication/kep-archivalo-es-tovabbito-rendszer-szoftverenek-fejlesztese-szote-pacs-001306nas a2200193 4500008004100000245008700041210007800128260004100206300001600247520059000263100001700853700002000870700001600890700002800906700002200934700002000956700002000976856011600996 1996 eng d00aKép-archiváló és továbbító rendszer szoftverének fejlesztése (SZOTE-PACS)0 aKéparchiváló és továbbító rendszer szoftverének fejlesztése SZOT aDebrecenbDebreceni Egyetemc1996/// a1186 - 11923 aThe Picture Archiving and Communication System developed for theMedical University of Szeged (called SZOTE-PACS) is described.
The main aim of the development was to provide a system that
collects patient studies from different radiology imaging
modalities (e.g., CT, MR, NM). SZOTE-PACS archives the studies
in a standard format (DICOM 3.0) with Oracle database system and
the user can retrieve them by an easy-to-use graphic interface.
The images and other information stored in the database can be
used to edit educational material for medical university
students.
1 aKuba, Attila1 aAlexin, Zoltán1 aNagy, Antal1 aNyúl, László, Gábor1 aCsernay, László1 aBakonyi, Péter1 aHerdon, Miklós uhttps://www.inf.u-szeged.hu/publication/kep-archivalo-es-tovabbito-rendszer-szoftverenek-fejlesztese-szote-pacs00512nas a2200145 4500008004100000245005400041210005400095260003100149300001200180100002300192700002200215700001400237700002100251856009400272 1996 eng d00aMedical image registration based on fuzzy objects0 aMedical image registration based on fuzzy objects aBudapestbKFKIc1996.08.29 a44 - 481 aPalágyi, Kálmán1 aUdupa, Jayaram, K1 aTarnay, K1 aFazekas, Zoltán uhttps://www.inf.u-szeged.hu/publication/medical-image-registration-based-on-fuzzy-objects00545nas a2200193 4500008004100000020001400041245003800055210003500093260000900128300001200137490000700149100002200156700001700178700002800195700001600223700002200239700001400261856007600275 1996 eng d a0025-028700aMicsoda és mire jó a DICOM-3.0?0 aMicsoda és mire jó a DICOM30 c1996 a67 - 720 v701 aCsernay, László1 aKuba, Attila1 aNyúl, László, Gábor1 aNagy, Antal1 aAlmási, László1 aKardos, L uhttps://www.inf.u-szeged.hu/publication/micsoda-es-mire-jo-a-dicom-30-000546nas a2200193 4500008004100000020001400041245003800055210003500093260001200128300001200140490000700152100002200159700001700181700002800198700001600226700002200242700001400264856007400278 1996 eng d a0025-028700aMicsoda és mire jó a DICOM-3.0?0 aMicsoda és mire jó a DICOM30 c1996/// a67 - 720 v701 aCsernay, László1 aKuba, Attila1 aNyúl, László, Gábor1 aNagy, Antal1 aAlmási, László1 aKardos, L uhttps://www.inf.u-szeged.hu/publication/micsoda-es-mire-jo-a-dicom-3002474nas a2200241 4500008004100000245014700041210007300188260003200261300001400293490009900307520145700406100002201863700001701885700002201902700001501924700001501939700001701954700001601971700002801987700002002015700002102035856017602056 1996 eng d00aOrvosi információs rendszerek a Szent-Györgyi Albert Orvostudományi Egyetemen: RIS, HIS és PACS. Információcsere a rendszerek között.0 aOrvosi információs rendszerek a SzentGyörgyi Albert Orvostudomán aBudapestbNJSZTc1996.11.14 a184 - 1860 vA számítástechnika orvosi és biológiai alkalmazásai: A XX. Neumann Kollokvium Kiadványa3 aRadiológiával kapcsolatos szöveges és képi információkatEgyetemünkön több autonóm információs rendszer kezel. Ilyen az egészségügyi szolgáltatásokkal összefüggő adminisztratív és klinikai információk szervezésére szolgáló kórházi információs rendszer (HIS), a radiológiai szolgáltatásokat kezelő információs rendszer (RIS) és a digitális képtovábbító, képtároló és visszakereső rendszer (PACS). A rendszerek közötti információcsere sarkalatos probléma. A RIS- ből információt kell átvenni a PCS-ba. A HIS rendeléseinek számítógépes kezelése szükségessé teszi a RIS-hez történő kapcsolat kialakítását. A RIS és a PACS között egy ut. SQL gateway biztosítja az információcserét. A gateway program figyeli a UNIX alapú képszerverről szövegfájlban jövő szabványos SQL kéréseket, továbbítja a RIS Novell szervere felé és a lekérdezés eredményét visszaküldi. A RIS és HIS közötti gateway program az AS400 és RIS szerver között tartja a kapcsolatot, az információcsere DBF fájlok segítségével folyik. Végleges megoldást csak a szabványosítás hozhat. Az általunk fejlesztett PACS már DICOM konform, dolgozunk a RIS DICOM konformmá tételén. Mivel a DICOm tartalmazza a képalkotó berendezések, a PACS és a HIS/RIS kapcsolatot leíró szabványt, alkalmazása lehetővé teszi a rendszerek közötti közvetlen információcserét.
1 aAlmási, László1 aSóti, Zsolt1 aCsernay, László1 aPavelka, Z1 aKelemen, A1 aKuba, Attila1 aNagy, Antal1 aNyúl, László, Gábor1 aAlexin, Zoltán1 aKozmann, György uhttps://www.inf.u-szeged.hu/publication/orvosi-informacios-rendszerek-a-szent-gyorgyi-albert-orvostudomanyi-egyetemen-ris-his-es-pacs-informaciocsere-a-rendszerek-kozott-002359nas a2200229 4500008004100000245014700041210007300188260003000261300001400291520145700305100002201762700001701784700002201801700001501823700001501838700001701853700001601870700002801886700002001914700002101934856017401955 1996 eng d00aOrvosi információs rendszerek a Szent-Györgyi Albert Orvostudományi Egyetemen: RIS, HIS és PACS. Információcsere a rendszerek között.0 aOrvosi információs rendszerek a SzentGyörgyi Albert Orvostudomán aBudapestbNJSZTcNov 1996 a184 - 1863 aRadiológiával kapcsolatos szöveges és képi információkatEgyetemünkön több autonóm információs rendszer kezel. Ilyen az egészségügyi szolgáltatásokkal összefüggő adminisztratív és klinikai információk szervezésére szolgáló kórházi információs rendszer (HIS), a radiológiai szolgáltatásokat kezelő információs rendszer (RIS) és a digitális képtovábbító, képtároló és visszakereső rendszer (PACS). A rendszerek közötti információcsere sarkalatos probléma. A RIS- ből információt kell átvenni a PCS-ba. A HIS rendeléseinek számítógépes kezelése szükségessé teszi a RIS-hez történő kapcsolat kialakítását. A RIS és a PACS között egy ut. SQL gateway biztosítja az információcserét. A gateway program figyeli a UNIX alapú képszerverről szövegfájlban jövő szabványos SQL kéréseket, továbbítja a RIS Novell szervere felé és a lekérdezés eredményét visszaküldi. A RIS és HIS közötti gateway program az AS400 és RIS szerver között tartja a kapcsolatot, az információcsere DBF fájlok segítségével folyik. Végleges megoldást csak a szabványosítás hozhat. Az általunk fejlesztett PACS már DICOM konform, dolgozunk a RIS DICOM konformmá tételén. Mivel a DICOm tartalmazza a képalkotó berendezések, a PACS és a HIS/RIS kapcsolatot leíró szabványt, alkalmazása lehetővé teszi a rendszerek közötti közvetlen információcserét.
1 aAlmási, László1 aSóti, Zsolt1 aCsernay, László1 aPavelka, Z1 aKelemen, A1 aKuba, Attila1 aNagy, Antal1 aNyúl, László, Gábor1 aAlexin, Zoltán1 aKozmann, György uhttps://www.inf.u-szeged.hu/publication/orvosi-informacios-rendszerek-a-szent-gyorgyi-albert-orvostudomanyi-egyetemen-ris-his-es-pacs-informaciocsere-a-rendszerek-kozott00510nas a2200133 4500008004100000245006300041210006300104260003000167300001400197100002300211700002200234700002100256856009900277 1996 eng d00aOrvosi képek fuzzy objektumokon alapuló regisztrációja0 aOrvosi képek fuzzy objektumokon alapuló regisztrációja aBudapestbNJSZTcNov 1996 a107 - 1101 aPalágyi, Kálmán1 aUdupa, Jayaram, K1 aKozmann, György uhttps://www.inf.u-szeged.hu/publication/orvosi-kepek-fuzzy-objektumokon-alapulo-regisztracioja02773nas a2200217 4500008004100000245012100041210007200162260003100234300001400265520192700279100001702206700002002223700002802243700001602271700002302287700002802310700002202338700002202360700002102382856015202403 1996 eng d00aSZOTE-PACS: A Szent-Györgyi Albert Orvostudományi Egyetem képarchiváló és továbbító rendszerének szoftvere0 aSZOTEPACS A SzentGyörgyi Albert Orvostudományi Egyetem képarchiv aVeszprémbNJSZTcNov 1996 a173 - 1763 aA 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.
1 aKuba, Attila1 aAlexin, Zoltán1 aNyúl, László, Gábor1 aNagy, Antal1 aPalágyi, Kálmán1 aDudásné Nagy, Mariann1 aCsernay, László1 aAlmási, László1 aKozmann, György uhttps://www.inf.u-szeged.hu/publication/szote-pacs-a-szent-gyorgyi-albert-orvostudomanyi-egyetem-keparchivalo-es-tovabbito-rendszerenek-szoftvere-002771nas a2200217 4500008004100000245012100041210007200162260003100234300001400265520192700279100001702206700002002223700002802243700001602271700002302287700002802310700002202338700002202360700002102382856015002403 1996 eng d00aSZOTE-PACS: A Szent-Györgyi Albert Orvostudományi Egyetem képarchiváló és továbbító rendszerének szoftvere0 aSZOTEPACS A SzentGyörgyi Albert Orvostudományi Egyetem képarchiv aVeszprémbNJSZTcNov 1996 a173 - 1763 aA 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.
1 aKuba, Attila1 aAlexin, Zoltán1 aNyúl, László, Gábor1 aNagy, Antal1 aPalágyi, Kálmán1 aDudásné Nagy, Mariann1 aCsernay, László1 aAlmási, László1 aKozmann, György uhttps://www.inf.u-szeged.hu/publication/szote-pacs-a-szent-gyorgyi-albert-orvostudomanyi-egyetem-keparchivalo-es-tovabbito-rendszerenek-szoftvere01510nas a2200205 4500008004100000245006500041210006300106260004100169300001400210520081800224100001701042700002001059700002301079700001601102700002801118700001901146700002001165700002001185856009901205 1996 eng d00aA többdimenziós képfeldolgozás programjai és oktatásuk0 atöbbdimenziós képfeldolgozás programjai és oktatásuk aDebrecenbDebreceni Egyetemc1996/// a649 - 6563 aNowdays, 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.
1 aKuba, Attila1 aFazekas, Attila1 aPalágyi, Kálmán1 aNagy, Antal1 aNyúl, László, Gábor1 aPethő, Attila1 aBakonyi, Péter1 aHerdon, Miklós uhttps://www.inf.u-szeged.hu/publication/a-tobbdimenzios-kepfeldolgozas-programjai-es-oktatasuk01509nas a2200205 4500008004100000245006500041210006300106260003800169300001400207520081800221100001701039700002001056700002301076700001601099700002801115700001901143700002001162700002001182856010101202 1996 eng d00aA többdimenziós képfeldolgozás programjai és oktatásuk0 atöbbdimenziós képfeldolgozás programjai és oktatásuk aDebrecenbDebreceni Egyetemc1996 a649 - 6563 aNowdays, 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.
1 aKuba, Attila1 aFazekas, Attila1 aPalágyi, Kálmán1 aNagy, Antal1 aNyúl, László, Gábor1 aPethő, Attila1 aBakonyi, Péter1 aHerdon, Miklós uhttps://www.inf.u-szeged.hu/publication/a-tobbdimenzios-kepfeldolgozas-programjai-es-oktatasuk-001101nas a2200169 4500008004100000020001400041245005300055210005200108260001200160300001600172490000600188520058900194100001800783700001700801700002100818856009200839 1995 eng d a1057-714900aDPA: a deterministic approach to the MAP problem0 aDPA a deterministic approach to the MAP problem c1995/// a1312 - 13140 v43 aDeterministic pseudo-annealing (DPA) is a new deterministic optimization method for finding the maximum a posteriori (MAP) labeling in a Markov random field, in which the probability of a tentative labeling is extended to a merit function on continuous labelings. This function is made convex by changing its definition domain. This unambiguous maximization problem is solved, and the solution is followed down to the original domain, yielding a good, if suboptimal, solution to the original labeling assignment problem. The performance of DPA is analyzed on randomly weighted graphs.1 aBerthod, Marc1 aKato, Zoltan1 aZerubia, Josiane uhttps://www.inf.u-szeged.hu/publication/dpa-a-deterministic-approach-to-the-map-problem00451nas a2200133 4500008004100000245005300041210005100094260000900145300001000154100002000164700001600184700002800200856008900228 1995 eng d00aKépfeldolgozó oktatási segédprogram (PicKit)0 aKépfeldolgozó oktatási segédprogram PicKit c1995 a - 461 aMolnár, Péter1 aNagy, Antal1 aNyúl, László, Gábor uhttps://www.inf.u-szeged.hu/publication/kepfeldolgozo-oktatasi-segedprogram-pickit-200454nas a2200133 4500008004100000245005300041210005100094260001200145300001000157100002000167700001600187700002800203856008900231 1995 eng d00aKépfeldolgozó oktatási segédprogram (PicKit)0 aKépfeldolgozó oktatási segédprogram PicKit c1995/// a - 461 aMolnár, Péter1 aNagy, Antal1 aNyúl, László, Gábor uhttps://www.inf.u-szeged.hu/publication/kepfeldolgozo-oktatasi-segedprogram-pickit-001885nas a2200193 4500008004100000245003600041210003600077260003400113300000700147520132200154100001701476700002301493700002801516700001601544700002201560700001601582700001501598856007801613 1995 eng d00aPresentation of 3D SPECT images0 aPresentation of 3D SPECT images aSmolenice, SlovakiacMay 1995 a823 aThe 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.
1 aKuba, Attila1 aPalágyi, Kálmán1 aNyúl, László, Gábor1 aNagy, Antal1 aCsernay, László1 aBajla, Ivan1 aKarovic, K uhttps://www.inf.u-szeged.hu/publication/presentation-of-3d-spect-images-001883nas a2200193 4500008004100000245003600041210003600077260003400113300000700147520132200154100001701476700002301493700002801516700001601544700002201560700001601582700001501598856007601613 1995 eng d00aPresentation of 3D SPECT images0 aPresentation of 3D SPECT images aSmolenice, SlovakiacMay 1995 a823 aThe 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.
1 aKuba, Attila1 aPalágyi, Kálmán1 aNyúl, László, Gábor1 aNagy, Antal1 aCsernay, László1 aBajla, Ivan1 aKarovic, K uhttps://www.inf.u-szeged.hu/publication/presentation-of-3d-spect-images00524nas a2200145 4500008004100000245004500041210004500086260006300131300001600194100001800210700002300228700001900251700002300270856008500293 1995 eng d00aSignature verification using neuron nets0 aSignature verification using neuron nets aRiver EdgebWorld Sci. Publishing, River Edge, NJc1995/// a1115 - 11221 aKatona, Endre1 aPalágyi, Kálmán1 aTóth, Nándor1 aBorgefors, Gunilla uhttps://www.inf.u-szeged.hu/publication/signature-verification-using-neuron-nets01852nas a2200145 4500008004100000245005700041210005300098260002000151520136300171100002801534700001601562700001701578700002201595856008901617 1995 eng d00aA SZOTE kép-archiváló és -továbbító rendszere0 aSZOTE képarchiváló és továbbító rendszere aEgercJune 19953 aA Szent-Györgyi Albert Orvostudományi Egyetem és a József AttilaTudományegyetem közös FEFA pályázatot nyert 1994-95-ben az Orvosegyetem oktatási célú kép-archiváló és -továbbító rendszerének (Picture Archiving and Communication System - PACS) és radiológiai információs rendszerének (Radiological Information System - RIS) a kialakítására. A rendszer hardware alapjait a már kialakított egyetemi számítógépes hálózat és a beszerzett illetve még beszerzés alatt álló komponensek (hálózati elemek, munkaállomások, scannerek, képmegjelenítők) biztosítják. Software terveink a következő részekből állnak: a) a különféle modalitásokról (pl. SPECT, CT, NM, MRI, ultrahang, scanner) származó vizsgálatokat begyűjtő és egységesen DICOM szabványú formátumra konvertáló alrendszer b) a vizsgálatokat a hálózaton keresztül az archívumba továbbító alrendszer c) a központi számítógépen működő archiválási alrendszer d) az archívumban tárolt vizsgálatokból oktatási anyagokat készítő (szerkesztő, válogató) és bemutató alrendszer e) és végül a rendszer üzemeltetését segítő karbantartási alrendszer. Előadásunkban ismertetjük a komplex rendszer software tervét, eddig elkészült részeit és az üzemeltetés során eddig szerzett tapasztalatokat.
1 aNyúl, László, Gábor1 aNagy, Antal1 aKuba, Attila1 aCsernay, László uhttps://www.inf.u-szeged.hu/publication/a-szote-kep-archivalo-es-tovabbito-rendszere01854nas a2200145 4500008004100000245005700041210005300098260002000151520136300171100002801534700001601562700001701578700002201595856009101617 1995 eng d00aA SZOTE kép-archiváló és -továbbító rendszere0 aSZOTE képarchiváló és továbbító rendszere aEgercJune 19953 aA Szent-Györgyi Albert Orvostudományi Egyetem és a József AttilaTudományegyetem közös FEFA pályázatot nyert 1994-95-ben az Orvosegyetem oktatási célú kép-archiváló és -továbbító rendszerének (Picture Archiving and Communication System - PACS) és radiológiai információs rendszerének (Radiological Information System - RIS) a kialakítására. A rendszer hardware alapjait a már kialakított egyetemi számítógépes hálózat és a beszerzett illetve még beszerzés alatt álló komponensek (hálózati elemek, munkaállomások, scannerek, képmegjelenítők) biztosítják. Software terveink a következő részekből állnak: a) a különféle modalitásokról (pl. SPECT, CT, NM, MRI, ultrahang, scanner) származó vizsgálatokat begyűjtő és egységesen DICOM szabványú formátumra konvertáló alrendszer b) a vizsgálatokat a hálózaton keresztül az archívumba továbbító alrendszer c) a központi számítógépen működő archiválási alrendszer d) az archívumban tárolt vizsgálatokból oktatási anyagokat készítő (szerkesztő, válogató) és bemutató alrendszer e) és végül a rendszer üzemeltetését segítő karbantartási alrendszer. Előadásunkban ismertetjük a komplex rendszer software tervét, eddig elkészült részeit és az üzemeltetés során eddig szerzett tapasztalatokat.
1 aNyúl, László, Gábor1 aNagy, Antal1 aKuba, Attila1 aCsernay, László uhttps://www.inf.u-szeged.hu/publication/a-szote-kep-archivalo-es-tovabbito-rendszere-001196nas a2200169 4500008004100000245004500041210004500086260003000131300001600161520065100177100001700828700002100845700001800866700002500884700003200909856008500941 1995 eng d00aUnsupervised adaptive image segmentation0 aUnsupervised adaptive image segmentation aPiscatawaybIEEEc1995/// a2399 - 24023 aThis paper deals with the problem of unsupervised Bayesian segmentation of images modeled by Markov Random Fields (MRF). If the model parameters are known then we have various methods to solve the segmentation problem (Simulated Annealing, ICM, etc...). However, when they are not known, the problem becomes more difficult. One has to estimate the hidden label field parameters from the available image only. Our approach consists of a recent iterative method of estimation, called Iterative Conditional Estimation (ICE), applied to a monogrid Markovian image segmentation model. The method has been tested on synthetic and real satellite images.1 aKato, Zoltan1 aZerubia, Josiane1 aBerthod, Marc1 aPieczynski, Wojciech1 a*Society, *IEEE, Signal Pro uhttps://www.inf.u-szeged.hu/publication/unsupervised-adaptive-image-segmentation01830nas a2200157 4500008004100000245008400041210006900125260003000194300001400224520122500238100001701463700002101480700001801501700002901519856012401548 1995 eng d00aUnsupervised parallel image classification using a hierarchical Markovian model0 aUnsupervised parallel image classification using a hierarchical aPiscatawaybIEEEc1995/// a169 - 1743 aThis paper deals with the problem of unsupervised classification of images modeled by Markov Random Fields (MRF). If the model parameters are known then we have various methods to solve the segmentation problem (simulated annealing, ICM, etc...). However, when they are not known, the problem becomes more difficult. One has to estimate the hidden label field parameters from the only observable image. Our approach consists of extending a recent iterative method of estimation, called Iterative Conditional Estimation (ICE) to a hierarchical markovian model. The idea resembles the Estimation-Maximization (EM) algorithm as we recursively look at the Maximum a Posteriori (MAP) estimate of the label field given the estimated parameters then we look at the Maximum Likelihood (ML) estimate of the parameters given a tentative labeling obtained at the previous step. We propose unsupervised image classification algorithms using a hierarchical model. The only parameter supposed to be known is the number of regions, all the other parameters are estimated. The presented algorithms have been implemented on a Connection Machine CM200. Comparative tests have been done on noisy synthetic and real images (remote sensing).1 aKato, Zoltan1 aZerubia, Josiane1 aBerthod, Marc1 a*Society, IEEE, Computer uhttps://www.inf.u-szeged.hu/publication/unsupervised-parallel-image-classification-using-a-hierarchical-markovian-model01593nas a2200265 4500008004100000020001400041245011700055210006900172260000900241300001400250490000700264520070500271100002200976700001700998700001701015700001701032700001401049700001701063700001301080700001801093700002001111700002201131700001801153856015601171 1994 eng d a0029-556600aEvaluation of cerebral vasoreactivity by SPECT and transcranial Doppler sonography using the acetazolamide test.0 aEvaluation of cerebral vasoreactivity by SPECT and transcranial c1994 a239 - 2430 v333 arCBF SPECT with 99mTc-HMPAO was performed prospectively in 29 patients (3 controls and 26 stroke patients) as well as TCD studies in 20 patients (3 controls and 17 stroke patients) before and after 1 g i.v. acetazolamide. The sensitivity of rCBF SPECT increased from 62% to 77% after acetazolamide provocation in stroke patients. In patients with a reversible neurological deficit, the sensitivity under resting conditions was 50% which increased to 71%, while in cases with a permanent deficit it increased from 75% to 83%. In the evaluation of the cerebrovascular reserve capacity the results of rCBF SPECT and TCD coincided in 91% of the hemispheres. The correlation was statistically significant.1 aPávics, László1 aGrünwald, F1 aBarzó, Pál1 aAmbrus, Edit1 aMenzel, C1 aSchomburg, A1 aBorda, L1 aMáté, Eörs1 aBodosi, Mihály1 aCsernay, László1 aBiersack, H J uhttps://www.inf.u-szeged.hu/publication/evaluation-of-cerebral-vasoreactivity-by-spect-and-transcranial-doppler-sonography-using-the-acetazolamide-test00451nas a2200133 4500008004100000245005300041210005100094260000900145300001000154100002000164700001600184700002800200856008900228 1994 eng d00aKépfeldolgozó oktatási segédprogram (PicKit)0 aKépfeldolgozó oktatási segédprogram PicKit c1994 a - 361 aMolnár, Péter1 aNagy, Antal1 aNyúl, László, Gábor uhttps://www.inf.u-szeged.hu/publication/kepfeldolgozo-oktatasi-segedprogram-pickit-300454nas a2200133 4500008004100000245005300041210005100094260001200145300001000157100002000167700001600187700002800203856008900231 1994 eng d00aKépfeldolgozó oktatási segédprogram (PicKit)0 aKépfeldolgozó oktatási segédprogram PicKit c1994/// a - 361 aMolnár, Péter1 aNagy, Antal1 aNyúl, László, Gábor uhttps://www.inf.u-szeged.hu/publication/kepfeldolgozo-oktatasi-segedprogram-pickit-100392nas a2200109 4500008004100000245005300041210005100094260001200145300001000157100002800167856008700195 1994 eng d00aKépfeldolgozó oktatási segédprogram (PicKit)0 aKépfeldolgozó oktatási segédprogram PicKit c1994/// a - 611 aNyúl, László, Gábor uhttps://www.inf.u-szeged.hu/publication/kepfeldolgozo-oktatasi-segedprogram-pickit00711nas a2200097 4500008004100000245022200041210006900263260000900332100001700341856025500358 1994 eng d00aMulti-scale Markovian Modelisation in Computer Vision with Applications to SPOT Image Segmentation : Modélisations markoviennes multirésolutions en vision par ordinateur. Application ŕ la segmentation d'images SPOT0 aMultiscale Markovian Modelisation in Computer Vision with Applic c19941 aKato, Zoltan uhttps://www.inf.u-szeged.hu/publication/multi-scale-markovian-modelisation-in-computer-vision-with-applications-to-spot-image-segmentation-modelisations-markoviennes-multiresolutions-en-vision-par-ordinateur-application-r-la-segmentation-dimages-spot00664nas a2200145 4500008004100000245011900041210006900160260003200229300001400261100002100275700001700296700001800313700002900331856015800360 1994 eng d00aMulti-Temperature Annealing: A New Approach for the Energy-Minimization of Hierarchical Markov Random Field Models0 aMultiTemperature Annealing A New Approach for the EnergyMinimiza aLos AlamitosbIEEEc1994/// a520 - 5221 aZerubia, Josiane1 aKato, Zoltan1 aBerthod, Mark1 a*Society, IEEE, Computer uhttps://www.inf.u-szeged.hu/publication/multi-temperature-annealing-a-new-approach-for-the-energy-minimization-of-hierarchical-markov-random-field-models00531nas a2200121 4500008004100000245009700041210007000138260001200208100001700220700002100237700001800258856013300276 1994 eng d00aSegmentation hiérarchique d'images sur CM200 (Hierarchical Image Segmentation on the CM200)0 aSegmentation hiérarchique dimages sur CM200 Hierarchical Image S c1994///1 aKato, Zoltan1 aZerubia, Josiane1 aBerthod, Mark uhttps://www.inf.u-szeged.hu/publication/segmentation-hierarchique-dimages-sur-cm200-hierarchical-image-segmentation-on-the-cm20000475nas a2200121 4500008004100000245014300041210007000184260001200254100001700266700002100283700001800304856003100322 1994 eng d00aSegmentation multirésolution d'images sur SUN version 1 du 26.05.1994 (Multiresolution Image Segmentation on SUN version 1 of 26.05.1994)0 aSegmentation multirésolution dimages sur SUN version 1 du 260519 c1994///1 aKato, Zoltan1 aZerubia, Josiane1 aBerthod, Mark uhttp://www.app.asso.fr/en/01558nas a2200181 4500008004100000245005600041210005600097260002700153300001400180520096900194100002801163700001601191700002301207700002001230700001701250700002001267856008901287 1994 eng d00aSzabványos képformák orvosi képek tárolására0 aSzabványos képformák orvosi képek tárolására aSzegedbSZOTEc1994/// a112 - 1163 aAz 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.
1 aNyúl, László, Gábor1 aNagy, Antal1 aPalágyi, Kálmán1 aTolnai, József1 aKuba, Attila1 aHantos, Zoltán uhttps://www.inf.u-szeged.hu/publication/szabvanyos-kepformak-orvosi-kepek-tarolasara01557nas a2200181 4500008004100000245005600041210005600097260002400153300001400177520096900191100002801160700001601188700002301204700002001227700001701247700002001264856009101284 1994 eng d00aSzabványos képformák orvosi képek tárolására0 aSzabványos képformák orvosi képek tárolására aSzegedbSZOTEc1994 a112 - 1163 aAz 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.
1 aNyúl, László, Gábor1 aNagy, Antal1 aPalágyi, Kálmán1 aTolnai, József1 aKuba, Attila1 aHantos, Zoltán uhttps://www.inf.u-szeged.hu/publication/szabvanyos-kepformak-orvosi-kepek-tarolasara-000695nas a2200193 4500008003900000245009700039210006900136260000900205300000800214490000700222100001900229700001900248700001800267700002000285700001700305700002000322700002200342856013700364 1993 d00aAssessment of myocardial function with gated SPECT before and after coronary by-pass surgery0 aAssessment of myocardial function with gated SPECT before and af c1993 a9180 v101 aMester, János1 aKósa, István1 aMáté, Eörs1 aMatievics, Vera1 aLupkovics, G1 aKovács, Gábor1 aCsernay, László uhttps://www.inf.u-szeged.hu/publication/assessment-of-myocardial-function-with-gated-spect-before-and-after-coronary-by-pass-surgery00605nas a2200157 4500008004100000245006100041210006100102260006700163300001400230100001700244700002100261700001800282700002600300700001800326856010300344 1993 eng d00aBayesian Image Classification Using Markov Random Fields0 aBayesian Image Classification Using Markov Random Fields aDordrecht; Boston; LondonbKluwer Academic Publishersc1993/// a375 - 3821 aKato, Zoltan1 aZerubia, Josiane1 aBerthod, Mark1 aMohammad-Djafari, Ali1 aDemoment, Guy uhttps://www.inf.u-szeged.hu/publication/bayesian-image-classification-using-markov-random-fields-000607nas a2200169 4500008004100000245008200041210006900123260000900192300000800201490000700209100002000216700001800236700002100254700002000275700002200295856012000317 1993 eng d00aEfficiency of the orthopan tomoscintigram (OPTS) in abnormalities of the jaws0 aEfficiency of the orthopan tomoscintigram OPTS in abnormalities c1993 a8980 v101 aRajtár, Mária1 aMáté, Eörs1 aFazekas, András1 aSzabó, György1 aCsernay, László uhttps://www.inf.u-szeged.hu/publication/efficiency-of-the-orthopan-tomoscintigram-opts-in-abnormalities-of-the-jaws00538nas a2200169 4500008004100000245005000041210004900091260001200140100001800152700002100170700001400191700001800205700001700223700001800240700002100258856008900279 1993 eng d00aExtraction d'information dans les images SPOT0 aExtraction dinformation dans les images SPOT c1993///1 aBerthod, Mark1 aGiraudon, Gerard1 aLiu, Shan1 aMangin, Frank1 aKato, Zoltan1 aUrago, Sabine1 aZerubia, Josiane uhttps://www.inf.u-szeged.hu/publication/extraction-dinformation-dans-les-images-spot00451nas a2200121 4500008004100000245011100041210006900152260001200221100001700233700001800250700002100268856004000289 1993 eng d00aA Hierarchical Markov Random Field Model and Multi-Temperature Annealing for Parallel Image Classification0 aHierarchical Markov Random Field Model and MultiTemperature Anne c1993///1 aKato, Zoltan1 aBerthod, Mark1 aZerubia, Josiane uhttp://hal.inria.fr/inria-00074736/00504nas a2200121 4500008004100000245007000041210006800111260003700179100001700216700001800233700002100251856011000272 1993 eng d00aA Hierarchical Markov Random Field Model for Image Classification0 aHierarchical Markov Random Field Model for Image Classification bIEEE Computer Soc. Pr.cSep 19931 aKato, Zoltan1 aBerthod, Mark1 aZerubia, Josiane uhttps://www.inf.u-szeged.hu/publication/a-hierarchical-markov-random-field-model-for-image-classification00659nas a2200133 4500008003900000245014000039210006900179100001900248700001900267700002000286700001800306700002200324856017900346 1993 d00aInvestigation of left ventricular wall motion by gated blood-pool SPECT, using three-dimensional display of Fourier phase and amplitude0 aInvestigation of left ventricular wall motion by gated bloodpool1 aMester, János1 aKósa, István1 aMatievics, Vera1 aMáté, Eörs1 aCsernay, László uhttps://www.inf.u-szeged.hu/publication/investigation-of-left-ventricular-wall-motion-by-gated-blood-pool-spect-using-three-dimensional-display-of-fourier-phase-and-amplitude00477nas a2200133 4500008004100000020001400041245006700055210006700122260001200189300001400201490000700215100002300222856009800245 1993 eng d a0133-339900aLokális párhuzamos eljárás bináris képek zajszűrésére0 aLokális párhuzamos eljárás bináris képek zajszűrésére c1993/// a373 - 3960 v171 aPalágyi, Kálmán uhttps://www.inf.u-szeged.hu/publication/lokalis-parhuzamos-eljaras-binaris-kepek-zajszuresere01564nas a2200169 4500008004100000245007600041210006900117260003200186300001400218520092900232100001701161700001801178700002101196700003301217700002801250856011601278 1993 eng d00aMultiscale Markov random field models for parallel image classification0 aMultiscale Markov random field models for parallel image classif aLos AlamitosbIEEEc1993/// a253 - 2573 aIn this paper, we are interested in multiscale Markov Random Field (MRF) models. It is well known that multigrid methods can improve significantly the convergence rate and the quality of the final results of iterative relaxation techniques. Herein, we propose a new hierarchical model, which consists of a label pyramid and a whole observation field. The parameters of the coarse grid can be derived by simple computation from the finest grid. In the label pyramid, we have introduced a new local interaction between two neighbor grids. This model gives a relaxation algorithm which can be run in parallel on the entire pyramid. On the other hand, the new model allows to propagate local interactions more efficiently giving estimates closer to the global optimum for deterministic as well as for stochastic relaxation schemes. It can also be seen as a way to incorporate cliques with far apart sites for a reasonable price.1 aKato, Zoltan1 aBerthod, Marc1 aZerubia, Josiane1 a*Analysis, *IEEE, Computer S1 a*Intelligence, *Machine uhttps://www.inf.u-szeged.hu/publication/multiscale-markov-random-field-models-for-parallel-image-classification01328nas a2200169 4500008004100000245007200041210006900113260002800182300001400210520069500224100001700919700001800936700002100954700003200975700003901007856011201046 1993 eng d00aParallel image classification using multiscale Markov random fields0 aParallel image classification using multiscale Markov random fie aNew YorkbIEEEc1993/// a137 - 1403 aIn this paper, we are interested in massively parallel multiscale relaxation algorithms applied to image classification. First, we present a classical multiscale model applied to supervised image classification. The model consists of a label pyramid and a whole observation field. The potential functions of the coarse grid are derived by simple computations. Then, we propose another scheme introducing a local interaction between two neighbor grids in the label pyramid. This is a way to incorporate cliques with far apart sites for a reasonable price. Finally we present the results on noisy synthetic data and on a SPOT image obtained by different relaxation methods using these models.1 aKato, Zoltan1 aBerthod, Marc1 aZerubia, Josiane1 a*Society, *IEEE, Signal Pro1 a*Engineers, *Institute, of Electri uhttps://www.inf.u-szeged.hu/publication/parallel-image-classification-using-multiscale-markov-random-fields00745nas a2200193 4500008004100000020001400041245012500055210006900180260000900249300001400258490000700272100001800279700001900297700002200316700001700338700001400355700001900369856016300388 1992 eng d a0161-550500a3-DIMENSIONAL PRESENTATION OF THE FOURIER AMPLITUDE AND PHASE - A FAST DISPLAY METHOD FOR GATED CARDIAC BLOOD-POOL SPECT0 a3DIMENSIONAL PRESENTATION OF THE FOURIER AMPLITUDE AND PHASE A F c1992 a458 - 4620 v331 aMáté, Eörs1 aMester, János1 aCsernay, László1 aKuba, Attila1 aMadani, S1 aMakay, Árpád uhttps://www.inf.u-szeged.hu/publication/3-dimensional-presentation-of-the-fourier-amplitude-and-phase-a-fast-display-method-for-gated-cardiac-blood-pool-spect00570nas a2200157 4500008004100000245007900041210006900120260000900189300001500198490000700213100001600220700001500236700001700251700002600268856011800294 1992 eng d00aCan Dynamic Krypton-81m Imaging Separate Regional Ventillation and Volume?0 aCan Dynamic Krypton81m Imaging Separate Regional Ventillation an c1992 a1935-1939 0 v331 aLythgoe, MF1 aDeavies, H1 aKuba, Attila1 aTóth-Abonyi, Mihály uhttps://www.inf.u-szeged.hu/publication/can-dynamic-krypton-81m-imaging-separate-regional-ventillation-and-volume00486nas a2200145 4500008004100000245005500041210005500096300001000151490000600161100001700167700001900184700001800203700002200221856009700243 1992 eng d00aData processing system for nuclear medicine images0 aData processing system for nuclear medicine images a51-610 v41 aKuba, Attila1 aMakay, Árpád1 aMáté, Eörs1 aCsernay, László uhttps://www.inf.u-szeged.hu/publication/data-processing-system-for-nuclear-medicine-images-000506nas a2200157 4500008004100000245005500041210005500096260000900151300001100160490000600171100001700177700001900194700001800213700002200231856009500253 1992 eng d00aData processing system for nuclear medicine images0 aData processing system for nuclear medicine images c1992 a51-61 0 v41 aKuba, Attila1 aMakay, Árpád1 aMáté, Eörs1 aCsernay, László uhttps://www.inf.u-szeged.hu/publication/data-processing-system-for-nuclear-medicine-images00811nas a2200181 4500008004100000245017100041210006900212260000900281300000800290490000700298100001900305700001800324700001800342700001700360700002000377700002200397856021000419 1992 eng d00aDocumentation of changes in regional myocardial function due to coronary bypass surgery by gated SPECT, using three-dimensional display of Fourier phase and amplitude0 aDocumentation of changes in regional myocardial function due to c1992 a3600 v131 aMester, János1 aKósa, Isván1 aMáté, Eörs1 aLupkovics, G1 aKovács, Gábor1 aCsernay, László uhttps://www.inf.u-szeged.hu/publication/documentation-of-changes-in-regional-myocardial-function-due-to-coronary-bypass-surgery-by-gated-spect-using-three-dimensional-display-of-fourier-phase-and-amplitude00441nas a2200121 4500008004100000245008400041210006900125260001200194100001700206700002100223700001800244856005700262 1992 eng d00aImage Classification Using Markov Random Fields with Two New Relaxation Methods0 aImage Classification Using Markov Random Fields with Two New Rel c1992///1 aKato, Zoltan1 aZerubia, Josiane1 aBerthod, Mark uhttp://hal.inria.fr/docs/00/07/49/54/PDF/RR-1606.pdf00508nas a2200109 4500008004100000245009900041210008200140260001200222300001000234100002800244856012600272 1992 eng d00aKülönböző tipusú számítógépes karakterkészletek összehasonlítása és konverziója0 aKülönböző tipusú számítógépes karakterkészletek összehasonlítása c1992/// a - 391 aNyúl, László, Gábor uhttps://www.inf.u-szeged.hu/publication/kulonbozo-tipusu-szamitogepes-karakterkeszletek-osszehasonlitasa-es-konverzioja-000506nas a2200109 4500008004100000245009900041210008200140260001200222300001000234100002800244856012400272 1992 eng d00aKülönböző tipusú számítógépes karakterkészletek összehasonlítása és konverziója0 aKülönböző tipusú számítógépes karakterkészletek összehasonlítása c1992/// a - 471 aNyúl, László, Gábor uhttps://www.inf.u-szeged.hu/publication/kulonbozo-tipusu-szamitogepes-karakterkeszletek-osszehasonlitasa-es-konverzioja00766nas a2200205 4500008004100000020001400041245012000055210006900175260001200244300000800256490000700264100002200271700001700293700001800310700001700328700001800345700001700363700002200380856015800402 1992 eng d a0340-699700aREST AND STRESS (ACETAZOLAMIDE) RCBF SPECT AND TRANSCRANIAL DOPPLER SONOGRAPHY STUDIES IN CEREBROVASCULAR DISORDERS0 aREST AND STRESS ACETAZOLAMIDE RCBF SPECT AND TRANSCRANIAL DOPPLE c1992/// a5940 v191 aPávics, László1 aBarzó, Pál1 aMáté, Eörs1 aAmbrus, Edit1 aKatona, Endre1 aMorvay, Zita1 aCsernay, László uhttps://www.inf.u-szeged.hu/publication/rest-and-stress-acetazolamide-rcbf-spect-and-transcranial-doppler-sonography-studies-in-cerebrovascular-disorders00535nas a2200133 4500008004100000245007200041210006900113260003700182300001400219100001700233700002100250700001800271856011200289 1992 eng d00aSatellite Image Classification Using a Modified Metropolis Dynamics0 aSatellite Image Classification Using a Modified Metropolis Dynam bIEEE Computer Soc. Pr.cMar 1992 a573 - 5761 aKato, Zoltan1 aZerubia, Josiane1 aBerthod, Mark uhttps://www.inf.u-szeged.hu/publication/satellite-image-classification-using-a-modified-metropolis-dynamics00724nas a2200181 4500008004100000245012800041210006900169260000900238300001200247490000700259100001800266700001900284700002200303700001700325700001400342700001900356856016700375 1992 eng d00aThree-dimensional presentation of the Fourier amplitude and phase: A fast display method for gated cardiac blood-pool SPECT0 aThreedimensional presentation of the Fourier amplitude and phase c1992 a458-4620 v331 aMáté, Eörs1 aMester, János1 aCsernay, László1 aKuba, Attila1 aMadani, S1 aMakay, Árpád uhttps://www.inf.u-szeged.hu/publication/three-dimensional-presentation-of-the-fourier-amplitude-and-phase-a-fast-display-method-for-gated-cardiac-blood-pool-spect00698nas a2200181 4500008004100000245011700041210006900158260000900227300000800236490000700244100001900251700001800270700002200288700001700310700001400327700001900341856015600360 1991 eng d00a3D presentation of the Fourier amplitude and phase. A new fast display method for gated cardiac blood pool SPECT0 a3D presentation of the Fourier amplitude and phase A new fast di c1991 a6930 v181 aMester, János1 aMáté, Eörs1 aCsernay, László1 aKuba, Attila1 aMadani, S1 aMakay, Árpád uhttps://www.inf.u-szeged.hu/publication/3d-presentation-of-the-fourier-amplitude-and-phase-a-new-fast-display-method-for-gated-cardiac-blood-pool-spect00429nas a2200133 4500008004100000245003900041210003900080260002900119300001200148100001900160700002300179700001400202856007900216 1991 eng d00aImage processing on cellprocessors0 aImage processing on cellprocessors aBudapestbNJSZTc1991/// a31 - 401 aKöles, Péter1 aPalágyi, Kálmán1 aGyorgy, A uhttps://www.inf.u-szeged.hu/publication/image-processing-on-cellprocessors00482nas a2200133 4500008004100000245005600041210005600097260002900153300001400182100001900196700002300215700001400238856009600252 1991 eng d00aNeural Network Implementation on Cellular Processor0 aNeural Network Implementation on Cellular Processor aBudapestbNJSZTc1991/// a129 - 1371 aTóth, Nándor1 aPalágyi, Kálmán1 aGyorgy, A uhttps://www.inf.u-szeged.hu/publication/neural-network-implementation-on-cellular-processor00538nas a2200157 4500008004100000245005400041210005400095260003700149300001400186100001500200700002300215700001200238700002000250700001600270856009400286 1990 eng d00aCellular program development for the M1 processor0 aCellular program development for the M1 processor aBerlinbAkademie Verlagc1990/// a315 - 3191 aTűzkő, T1 aPalágyi, Kálmán1 aWolf, G1 aLegendi, Tamás1 aSchendel, U uhttps://www.inf.u-szeged.hu/publication/cellular-program-development-for-the-m1-processor00764nas a2200133 4500008004100000020001400041245007600055210006900131260026900200300001400469490000800483100002300491856011600514 1989 eng d a0302-974300aSOLUTION OF DENSE SYSTEMS OF LINEAR-EQUATIONS USING CELLULAR PROCESSORS0 aSOLUTION OF DENSE SYSTEMS OF LINEAREQUATIONS USING CELLULAR PROC aBOYANCZYK 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,c1989/// a311 - 3160 v3421 aPalágyi, Kálmán uhttps://www.inf.u-szeged.hu/publication/solution-of-dense-systems-of-linear-equations-using-cellular-processors00718nas a2200133 4500008004100000020001400041245006500055210006200120260025700182300001400439490000800453100001800461856010500479 1989 eng d a0302-974300aA TRANSITIVE CLOSURE ALGORITHM FOR A 16-STATE CELL PROCESSOR0 aTRANSITIVE CLOSURE ALGORITHM FOR A 16STATE CELL PROCESSOR aAHO AV, 1975, DESIGN ANAL COMPUTERGUIBAS L, 1979, P C VER LARG SCAL IN, P509
KATONA E, 1984, EXAMPLES CELLULAR AL
KATONA E, 1988, 4TH P CELL M TU BRAU
ROBERT Y, 1986, LECTURE NOTES COMP S, V237, P149
ZSOTER A, 1986, 86 P PARC AK VERL BE, P66
c1989/// a285 - 2900 v3421 aKatona, Endre uhttps://www.inf.u-szeged.hu/publication/a-transitive-closure-algorithm-for-a-16-state-cell-processor00437nas a2200169 4500008004100000020001400041245002100055210002100076260001200097300001400109490000600123100002000129700001800149700001900167700002000186856006100206 1988 eng d a0167-819100aMEGACELL MACHINE0 aMEGACELL MACHINE c1988/// a195 - 1990 v81 aLegendi, Tamás1 aKatona, Endre1 aTóth, József1 aZsótér, Antal uhttps://www.inf.u-szeged.hu/publication/megacell-machine00552nas a2200157 4500008004100000245005000041210005000091260005700141300001400198100002300212700002000235700002200255700001500277700001200292856009000304 1987 eng d00aCellular algorithms for matrix multiplication0 aCellular algorithms for matrix multiplication aAmsterdambNorth-Holland Publishing Companyc1987/// a122 - 1291 aPalágyi, Kálmán1 aLegendi, Tamás1 aParkinson, Dennis1 aVollmar, R1 aWolf, G uhttps://www.inf.u-szeged.hu/publication/cellular-algorithms-for-matrix-multiplication00830nas a2200217 4500008004100000245014000041210006900181260000900250300001200259490000600271100001900277700001300296700001500309700001800324700001300342700001300355700002000368700002400388700002200412856017800434 1986 eng d00aDetection and localisation of ventricular preexcitation in Wolff-Parkinson-White syndrome (comparative study with body surface mapping)0 aDetection and localisation of ventricular preexcitation in Wolff cJuly a497-5040 v71 aMester, János1 aPreda, I1 aKozmann, G1 aMáté, Eörs1 aRegos, L1 aTóth, K1 aMarosi, György1 aAntalóczy, Zoltán1 aCsernay, László uhttps://www.inf.u-szeged.hu/publication/detection-and-localisation-of-ventricular-preexcitation-in-wolff-parkinson-white-syndrome-comparative-study-with-body-surface-mapping00858nas a2200229 4500008004100000020001400041245014000055210006900195260000900264300001400273490000600287100001900293700001300312700002100325700001800346700001300364700001300377700001400390700002400404700002200428856017800450 1986 eng d a0143-363600aDETECTION AND LOCALIZATION OF VENTRICULAR PREEXCITATION IN WOLFF-PARKINSON-WHITE SYNDROME (COMPARATIVE-STUDY WITH BODY-SURFACE MAPPING)0 aDETECTION AND LOCALIZATION OF VENTRICULAR PREEXCITATION IN WOLFF c1986 a497 - 5040 v71 aMester, János1 aPreda, I1 aKozmann, György1 aMáté, Eörs1 aRegos, L1 aTóth, K1 aMarosi, G1 aAntalóczy, Zoltán1 aCsernay, László uhttps://www.inf.u-szeged.hu/publication/detection-and-localization-of-ventricular-preexcitation-in-wolff-parkinson-white-syndrome-comparative-study-with-body-surface-mapping00438nas a2200133 4500008004100000020001400041245005500055210005100110260001200161300001400173490000600187100001800193856009300211 1986 eng d a0167-819100aA LATTICE MODEL FOR CELLULAR (SYSTOLIC) ALGORITHMS0 aLATTICE MODEL FOR CELLULAR SYSTOLIC ALGORITHMS c1986/// a251 - 2580 v31 aKatona, Endre uhttps://www.inf.u-szeged.hu/publication/a-lattice-model-for-cellular-systolic-algorithms00449nas a2200121 4500008004100000245006500041210006100106300001200167490000600179100001900185700001800204856010500222 1986 eng d00aThe probabilistic behaviour of the NFD bin packing algorithm0 aprobabilistic behaviour of the NFD bin packing algorithm a241-2450 v71 aCsirik, János1 aMáté, Eörs uhttps://www.inf.u-szeged.hu/publication/the-probabilistic-behaviour-of-the-nfd-bin-packing-algorithm01612nas a2200193 4500008004100000020001400041245010700055210006900162260000900231300001200240490000700252520090900259100002001168700002101188700002501209700001801234700002001252856014601272 1985 eng d a0378-734600aDetermination of the intervillous perfusion index in pregnancies with intrauterine growth retardation.0 aDetermination of the intervillous perfusion index in pregnancies c1985 a89 - 910 v193 aThe authors developed a new radioisotope technique to measure placental bloodflow for early detection of placental insufficiency. Using this method placental
perfusion has been measured in 20 healthy pregnant women and in 15 pregnancies
complicated with intrauterine growth retardation (IUGR). The T-maximum pictures
obtained made it possible to differentiate between the vascular and intervillous
phases of placental blood flow. The time period of intervillous phase calculated
as the percent of the whole placental T-maximum was given as the intervillous
perfusion index (IPI). It has been demonstrated that IPI is significantly longer
in IUGR pregnancies (67.0 +/- 14.6) than in the control group (31.6 +/- 10.7).
These data suggest that the first sign of placental insufficiency is the
prolongation of IPI, which is likely to precede the quantitative reduction of
placental perfusion.
1 aBódis, József1 aZámbó, Katalin1 aNemessányi, Zoltán1 aMáté, Eörs1 aCsaba, Imre, F. uhttps://www.inf.u-szeged.hu/publication/determination-of-the-intervillous-perfusion-index-in-pregnancies-with-intrauterine-growth-retardation00587nas a2200181 4500008004100000020001400041245006300055210006300118260000900181300001200190490000700202100001400209700002200223700001800245700002500263700001400288856010300302 1984 eng d a0303-817300aAUTOMATIC EVALUATION OF INVESTIGATIONS ON KIDNEY FUNCTIONS0 aAUTOMATIC EVALUATION OF INVESTIGATIONS ON KIDNEY FUNCTIONS c1984 a29 - 300 v111 aMester, L1 aAlmási, László1 aMáté, Eörs1 aNemessányi, Zoltán1 aRajtar, M uhttps://www.inf.u-szeged.hu/publication/automatic-evaluation-of-investigations-on-kidney-functions