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 aThe 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.pdf02230nas a2200193 4500008004100000245011600041210006900157260002900226300001000255490000800265520152700273100001301800700001501813700001401828700001501842700001401857700001601871856014901887 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 uhttp://www.inf.u-szeged.hu/en/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/2900653nas a2200169 4500008004100000022001400041245009800055210006900153260001900222300001200241490000700253100002000260700002000280700002000300700002300320856014000343 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 uhttp://www.inf.u-szeged.hu/en/publication/binary-image-reconstruction-from-a-small-number-of-projections-and-the-morphological-skeleton00708nas a2200217 4500008004100000245005900041210005900100260003400159300000900193100001900202700002000221700002000241700001900261700001700280700001700297700001900314700002200333700002000355700001400375856010100389 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 uhttp://www.inf.u-szeged.hu/en/publication/collaborative-mobile-3d-reconstruction-of-urban-scenes01431nas a2200157 4500008004100000245008400041210006900125260002900194300001200223490000600235520084300241100002701084700002001111700001601131856012601147 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 uhttp://www.inf.u-szeged.hu/en/publication/discrete-tomographic-reconstruction-via-adaptive-weighting-of-gradient-descents00734nas a2200193 4500008004100000020002200041245008600063210006900149260004000218300001000258490000900268100002300277700002000300700001900320700002300339700002500362700002500387856012800412 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 uhttp://www.inf.u-szeged.hu/en/publication/equivalent-sequential-and-parallel-subiteration-based-surface-thinning-algorithms02021nas a2200169 4500008004100000245006500041210006500106260002300171300001400194490000700208520145100215100001901666700002101685700002101706700001701727856010701744 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 uhttp://www.inf.u-szeged.hu/en/publication/estimation-of-linear-deformations-of-2d-and-3d-fuzzy-objects00538nas a2200133 4500008004100000245007000041210006900111260004800180300001200228490000700240100002000247700002300267856011400290 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 uhttp://www.inf.u-szeged.hu/en/publication/fast-recognition-of-natural-feature-identifiers-by-a-mobile-phone-000773nas a2200181 4500008003900000245010000039210007500139260008600214300001100300100002700311700002000338700001900358700001900377700002000396700001800416700002300434856013400457 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 uhttp://www.inf.u-szeged.hu/en/publication/idoskori-makula-degeneracio-kvantitativ-jellemzese-sd-oct-kepek-automatikus-elemzesevel00546nas a2200133 4500008004100000245007600041210006900117260004800186300001000234490000700244100002000251700002300271856011800294 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 uhttp://www.inf.u-szeged.hu/en/publication/improved-qr-code-localization-using-boosted-cascade-of-weak-classifiers00571nas a2200157 4500008004100000245006200041210006200103260004400165300001200209100002000221700002800241700001200269700001600281700001200297856010400309 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 uhttp://www.inf.u-szeged.hu/en/publication/localization-of-visual-codes-using-fuzzy-inference-system01339nas a2200169 4500008004100000245006900041210006700110260001300177300001200190490000800202520075900210100002000969700002100989700002501010700002301035856011101058 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 uhttp://www.inf.u-szeged.hu/en/publication/a-measure-of-directional-convexity-inspired-by-binary-tomography03358nas a2200277 4500008004100000245010600041210006900147260002400216300001400240490000700254520240400261100002202665700001902687700001902706700001802725700001902743700001902762700002202781700002002803700002502823700002302848700002002871700002002891700002102911856014802932 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 a### Objectives

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 uhttp://www.inf.u-szeged.hu/en/publication/periosteal-microcirculatory-reactions-in-a-zoledronate-induced-osteonecrosis-model-of-the-jaw-in-rats00522nas a2200121 4500008004100000245007500041210007500116260004000191300001200231100002000243700002800263856010900291 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 uhttp://www.inf.u-szeged.hu/en/publication/qr-kod-lokalizacio-kaszkadolt-gyenge-osztalyozok-hasznalataval01345nas a2200157 4500008004100000022001500041245006600056210006600122260002000188300000600208490000700214520082200221100001901043700001701062856010801079 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 uhttp://www.inf.u-szeged.hu/en/publication/realigning-2d-and-3d-object-fragments-without-correspondences00697nas a2200181 4500008003900000020002200039245007600061210006900137260006400206300001200270100002100282700002100303700001600324700001700340700001800357700002200375856011800397 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 uhttp://www.inf.u-szeged.hu/en/publication/semi-automatic-tumor-contouring-method-using-pet-and-mri-medical-images01067nas a2200133 4500008004100000245009600041210006900137260004000206300001200246520049700258100001900755700002300774856013600797 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 uhttp://www.inf.u-szeged.hu/en/publication/topology-preserving-reductions-and-additions-on-the-triangular-square-and-hexagonal-grids01483nas a2200205 4500008004500000020002200045245009700067210006900164260003600233300001200269520073500281100002301016700002001039700001901059700001601078700001401094700001401108700001601122856013901138 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 uhttp://www.inf.u-szeged.hu/en/publication/topology-preserving-equivalent-parallel-and-sequential-4-subiteration-2d-thinning-algorithms00730nas a2200205 4500008003900000020002200039245005600061210005600117260008600173300001000259100001900269700002300288700002300311700002000334700001800354700002100372700001900393700002000412856009200432 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 uhttp://www.inf.u-szeged.hu/en/publication/ujszulottek-monitorozasa-kepfolyam-elemzessel01179nas a2200145 4500008004100000245006100041210006000102260004000162300001200202520066300214100002000877700001900897700002300916856009400939 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 uhttp://www.inf.u-szeged.hu/en/publication/vekonyitas-a-vegpont-megorzes-felulvizsgalatava00623nas a2200145 4500008004100000245009400041210007900135260004000214300001200254100002000266700002800286700001900314700002000333856012400353 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ó uhttp://www.inf.u-szeged.hu/en/publication/vizualis-kodok-lokalizacioja-mely-egyeniranyitott-neuralis-halo-hasznalataval00541nas a2200121 4500008004100000245008400041210007700125260004000202300001200242100002000254700002800274856011700302 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 uhttp://www.inf.u-szeged.hu/en/publication/vonalkodok-es-termeszetes-vizualis-azonositok-felismerese-valos-idoben00722nas a2200205 4500008004100000245007200041210006900113260003200182300000800214100001900222700002100241700002500262700001700287700002700304700001400331700002100345700001600366700002000382856011400402 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 uhttp://www.inf.u-szeged.hu/en/publication/3d-reconstruction-of-planar-patches-seen-by-omnidirectional-cameras00617nas a2200169 4500008004100000245006700041210006600108260004600174300000900220100001900229700001500248700001700263700001600280700002400296700001900320856010800339 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 uhttp://www.inf.u-szeged.hu/en/publication/3d-reconstruction-of-planar-surface-patches-a-direct-solution00483nas a2200145 4500008003900000020002200039245004000061210004000101260004400141300001400185100001700199700001700216700002200233856008200255 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 uhttp://www.inf.u-szeged.hu/en/publication/affine-alignment-of-occluded-shapes02443nas a2200253 4500008004100000020001400041245013800055210006900193260000900262300001400271490000700285520152000292100002001812700002301832700002101855700002001876700001701896700002101913700001401934700002001948700002001968700002201988856017902010 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 uhttp://www.inf.u-szeged.hu/en/publication/application-of-dna-chip-scanning-technology-for-the-automatic-detection-of-chlamydia-trachomatis-and-chlamydia-pneumoniae-inclusions00464nas a2200121 4500008004100000245006700041210006700108300001000175490000700185100002000192700002800212856010200240 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 uhttp://www.inf.u-szeged.hu/en/publication/automatikus-azonositas-es-hitelesites-vizualis-kodokkal00462nas a2200121 4500008004100000245005600041210005600097260004200153300000700195100002000202700002000222856009800242 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 uhttp://www.inf.u-szeged.hu/en/publication/eliminating-switching-components-in-binary-matrices00530nas a2200145 4500008004100000245005100041210005100092260004600143300001300189100002300202700002300225700002400248700001900272856009300291 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 uhttp://www.inf.u-szeged.hu/en/publication/equivalent-2d-sequential-and-parallel-thinning00720nas a2200217 4500008004100000245006200041210006200103260003800165300000800203100001900211700002000230700001900250700001400269700001700283700002700300700001400327700002100341700001600362700002000378856010400398 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 uhttp://www.inf.u-szeged.hu/en/publication/establishing-correspondences-between-planar-image-patches01145nas a2200181 4500008004100000020002200041022001400063245008900077210006900166260004400235300001000279520046200289100002000751700002000771700002500791700001600816856013100832 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. uhttp://www.inf.u-szeged.hu/en/publication/fast-heuristics-for-eliminating-switching-components-in-binary-matrices-by-0-1-flips00539nas a2200121 4500008004100000245007000041210006900111260007000180300000700250100002000257700002800277856011200305 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 uhttp://www.inf.u-szeged.hu/en/publication/fast-recognition-of-natural-feature-identifiers-by-a-mobile-phone00835nas a2200253 4500008004100000022002200041245005600063210005500119260005200174300001200226100002000238700001800258700001700276700001600293700002000309700002800329700002300357700001900380700002700399700001900426700001800445700002400463856009400487 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é uhttp://www.inf.u-szeged.hu/en/publication/kepfeldolgozas-a-szegedi-informatikus-kepzesben01718nas a2200157 4500008004100000020001400041245007000055210006900125260000900194520115400203100002701357700002801384700001601412700002001428856011201448 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 aﬀected by noise and measurement errors. In general, the distorted and incomplete projection data holds insuﬃcient 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 uhttp://www.inf.u-szeged.hu/en/publication/local-and-global-uncertainty-in-binary-tomographic-reconstruction00702nas a2200181 4500008004100000245008600041210006900127260003100196100002000227700001900247700002000266700002800286700002000314700001900334700001900353700002000372856012800392 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 uhttp://www.inf.u-szeged.hu/en/publication/localization-of-visual-codes-in-the-dct-domain-using-deep-rectier-neural-networks00567nas a2200121 4500008003900000020002200039245009300061210007800154260004800232300001200280100002800292856012500320 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 uhttp://www.inf.u-szeged.hu/en/publication/orvosi-kepfeldolgozas-az-szte-kepfeldolgozas-es-szamitogepes-grafika-tanszeken01168nas a2200145 4500008004100000245006700041210006700108260005000175520059600225100002000821700002800841700001900869700002300888856011100911 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 uhttp://www.inf.u-szeged.hu/en/publication/qr-code-localization-using-boosted-cascade-of-weak-classifiers-000534nas a2200121 4500008004100000245006700041210006700108260007000175300001000245100002000255700002800275856010900303 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 uhttp://www.inf.u-szeged.hu/en/publication/qr-code-localization-using-boosted-cascade-of-weak-classifiers00653nas a2200193 4500008004100000245005200041210005200093260004400145100001900189700002000208700002000228700002800248700001900276700001800295700001700313700001600330700001900346856009400365 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 uhttp://www.inf.u-szeged.hu/en/publication/qr-code-localization-using-deep-neural-networks00600nas a2200121 4500008004100000245011800041210006900159260004200228300000700270100002100277700002000298856016000318 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 uhttp://www.inf.u-szeged.hu/en/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_1000587nas a2200157 4500008004100000020002200041245006700063210006500130260003500195300001200230100002000242700002100262700001900283700001900302856010800321 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 uhttp://www.inf.u-szeged.hu/en/publication/szte-nlp-clinical-text-analysis-with-named-entity-recognition00767nas a2200217 4500008004100000245007700041210006900118260003200187300001200219490000900231100002300240700002100263700002000284700002800304700002100332700002200353700001800375700001900393700001800412856011900430 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 uhttp://www.inf.u-szeged.hu/en/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/00670nas a2200157 4500008004100000245010600041210007600147260003800223300001400261100001900275700002100294700002100315700001700336700002100353856013800374 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ó uhttp://www.inf.u-szeged.hu/en/publication/2d-es-3d-binaris-objektumok-linearis-deformacio-becslesenek-numerikus-megoldasi-lehetosegei01098nas a2200157 4500008004100000020001400041245008400055210006900139260000900208300001200217490000700229520053200236100002000768700002800788856012400816 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 uhttp://www.inf.u-szeged.hu/en/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=45498800634nas a2200133 4500008004100000245011700041210006900158260003800227300001400265100002100279700002000300700002100320856015900341 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ó uhttp://www.inf.u-szeged.hu/en/publication/a-comparison-of-heuristics-for-reconstructing-hv-convex-binary-matrices-from-horizontal-and-vertical-projections00597nas a2200133 4500008004100000020001400041245012200055210006900177260000900246300001600255490000800271100002000279856016400299 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 uhttp://www.inf.u-szeged.hu/en/publication/complexity-results-for-reconstructing-binary-images-with-disjoint-components-from-horizontal-and-vertical-projections00435nas a2200133 4500008004100000020001400041245005100055210005100106260000900157300001000166490000700176100002300183856009500206 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 uhttp://www.inf.u-szeged.hu/en/publication/conference-of-phd-students-in-computer-science-001351nas a2200133 4500008004100000245007600041210006900117260003900186300001600225520082400241100001701065700001701082856011801099 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 uhttp://www.inf.u-szeged.hu/en/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_201421nas a2200181 4500008004100000020001400041245004900055210004900104260000900153300001400162490000800176520087500184100002401059700002801083700002001111700001701131856009101148 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 uhttp://www.inf.u-szeged.hu/en/publication/dynamic-angle-selection-in-binary-tomography01552nas a2200169 4500008004100000245007200041210006900113260005000182300001400232520091200246100002001158700002801178700002101206700002301227700001801250856011401268 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 uhttp://www.inf.u-szeged.hu/en/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.pdf01384nas a2200157 4500008004100000020001400041245010800055210006900163260000900232300001400241490000700255520077300262100002101035700002001056856015001076 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 uhttp://www.inf.u-szeged.hu/en/publication/an-empirical-study-of-reconstructing-hv-convex-binary-matrices-from-horizontal-and-vertical-projections01892nas a2200193 4500008004100000245010100041210006900142260002800211300001400239520116200253100001901415700001901434700001701453700002201470700002101492700002001513700002201533856014301555 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 uhttp://www.inf.u-szeged.hu/en/publication/evaluation-of-point-matching-methods-for-wide-baseline-stereo-correspondence-on-mobile-platforms00487nas a2200133 4500008004100000245005500041210005500096260003800151300001400189100001900203700001900222700002100241856009100262 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ó uhttp://www.inf.u-szeged.hu/en/publication/gepkocsi-felismeres-elolnezeti-kepek-alapjan00615nas a2200145 4500008004100000245009200041210007500133260003800208300001400246100002700260700002000287700001600307700002100323856012500344 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ó uhttp://www.inf.u-szeged.hu/en/publication/gradiens-modszerek-automatikus-sulyozasan-alapulo-diszkret-tomografiai-eljaras00453nas a2200109 4500008003900000245007400039210007400113300001200187100001800199700001900217856010700236 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ó uhttp://www.inf.u-szeged.hu/en/publication/haromszoghalok-nemlinearis-illesztese-megfeleltetesek-nelkul00549nas a2200133 4500008004100000245007100041210006900112260003800181300001400219100002000233700002800253700002100281856011300302 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ó uhttp://www.inf.u-szeged.hu/en/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.pdf01268nas a2200169 4500008004100000245005900041210005900100260004300159300001400202520067100216100002700887700002800914700001600942700002000958700001900978856010100997 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 uhttp://www.inf.u-szeged.hu/en/publication/local-uncertainty-in-binary-tomographic-reconstruction01093nas a2200157 4500008004100000245006000041210005800101260003900159300001400198520053100212100002000743700002800763700001900791700002300810856010200833 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 uhttp://www.inf.u-szeged.hu/en/publication/a-novel-method-for-barcode-localization-in-image-domain01453nas a2200133 4500008004100000245007100041210006900112260005200181300001200233520092000245100002301165700001801188856011301206 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 uhttp://www.inf.u-szeged.hu/en/publication/parallel-3d-12-subiteration-thinning-algorithms-based-on-isthmuses00456nas a2200133 4500008004100000245004100041210004100082260003800123300001400161100002000175700002300195700002100218856008300239 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ó uhttp://www.inf.u-szeged.hu/en/publication/parallel-thinning-based-on-isthmuses01137nas a2200157 4500008004100000020002300041245004500064210004500109260002900154300001400183520063300197100001900830700002300849700002000872856008700892 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 uhttp://www.inf.u-szeged.hu/en/publication/parallel-thinning-on-the-triangular-grid01712nas a2200169 4500008004100000245005300041210005200094260002900146300001200175520116500187100001701352700001701369700002001386700002001406700002101426856009501447 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 uhttp://www.inf.u-szeged.hu/en/publication/pose-estimation-of-ad-hoc-mobile-camera-networks00490nas a2200097 4500008004100000245008700041210006900128260004800197100002000245856012700265 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 uhttp://www.inf.u-szeged.hu/en/publication/prior-information-machine-learning-and-direction-dependency-in-binary-tomography00682nas a2200157 4500008004100000020002200041245009300063210006900156260005300225300001400278100002000292700002000312700002600332700003100358856013500389 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 uhttp://www.inf.u-szeged.hu/en/publication/reconstruction-and-enumeration-of-hv-convex-polyominoes-with-given-horizontal-projection00625nas a2200145 4500008004100000020001400041245012100055210006900176260000900245300001400254490000800268100002000276700002000296856016300316 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 uhttp://www.inf.u-szeged.hu/en/publication/the-reconstruction-of-polyominoes-from-horizontal-and-vertical-projections-and-morphological-skeleton-is-np-complete01779nas a2200205 4500008004100000020002200041245006700063210006700130260007800197300001200275520103100287100001901318700002001337700002501357700002201382700002201404700001701426700002101443856010901464 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 uhttp://www.inf.u-szeged.hu/en/publication/restoration-of-blurred-binary-images-using-discrete-tomography01252nas a2200157 4500008004100000020001400041245008300055210006900138260006500207300001300272490000700285520064000292100001900932700002000951856012300971 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 uhttp://www.inf.u-szeged.hu/en/publication/spectrum-skeletonization-a-new-method-for-acoustic-signal-feature-extraction01599nas a2200145 4500008004100000245008200041210006900123260004300192300001400235520102400249100001901273700002301292700001401315856012401329 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 uhttp://www.inf.u-szeged.hu/en/publication/sufficient-conditions-for-topology-preserving-additions-and-general-operators01866nas a2200181 4500008004100000245006400041210006200105260003300167300001400200520125000214100002001464700001701484700001601501700002401517700001901541700002001560856010401580 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 uhttp://www.inf.u-szeged.hu/en/publication/targetless-calibration-of-a-lidar-perspective-camera-pair01103nas a2200181 4500008004100000245007200041210006700113260002800180300001400208520046000222100001900682700002300701700002200724700002100746700002000767700002200787856011200809 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 uhttp://www.inf.u-szeged.hu/en/publication/on-topology-preservation-in-triangular-square-and-hexagonal-grids00515nas a2200133 4500008004100000245006100041210006100102260003800163300001400201100001900215700002300234700002100257856010300278 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ó uhttp://www.inf.u-szeged.hu/en/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#preview01213nas a2200145 4500008004100000020001400041245009400055210006900149260004300218300001200261490001300273520062800286100001700914856013600931 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 uhttp://www.inf.u-szeged.hu/en/publication/a-unifying-framework-for-correspondence-less-shape-alignment-and-its-medical-applications01723nas a2200181 4500008004100000245013300041210006900174260002800243300001400271520095600285100002001241700002001261700002201281700002101303700002001324700002201344856017501366 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 uhttp://www.inf.u-szeged.hu/en/publication/a-uniqueness-result-for-reconstructing-hv-convex-polyominoes-from-horizontal-and-vertical-projections-and-morphological-skeleton00586nas a2200133 4500008004100000245009100041210007800132260003800210300001400248100002000262700002800282700002100310856012100331 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ó uhttp://www.inf.u-szeged.hu/en/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_2902173nas a2200133 4500008004100000245005900041210005900100260006700159300000700226520166700233100001801900700002001918856010101938 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 uhttp://www.inf.u-szeged.hu/en/publication/artificial-intelligence-methods-in-discrete-tomography00556nas a2200121 4500008004100000245007700041210006900118260007000187300001000257100002000267700002800287856011900315 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 uhttp://www.inf.u-szeged.hu/en/publication/barcode-detection-with-uniform-partitioning-and-morphological-operations01223nas a2200181 4500008004100000245007800041210006900119260008200188300001400270520050400284100002000788700002000808700002300828700002300851700002500874700002200899856012000921 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 uhttp://www.inf.u-szeged.hu/en/publication/binary-image-reconstruction-from-two-projections-and-skeletal-information01190nas a2200157 4500008004100000245009700041210006900138260007600207300001400283520051000297100002000807700002400827700002300851700001900874856013900893 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 uhttp://www.inf.u-szeged.hu/en/publication/a-central-reconstruction-based-strategy-for-selecting-projection-angles-in-binary-tomography00606nas a2200121 4500008004100000245010700041210006900148260007000217300000700287100002100294700002000315856014900335 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 uhttp://www.inf.u-szeged.hu/en/publication/empirical-studies-of-reconstructing-hv-convex-binary-matrices-from-horizontal-and-vertical-projections01135nas a2200193 4500008004100000245008800041210006900129260005500198300001400253520037300267100002700640700002000667700001600687700002800703700002400731700002600755700003000781856013000811 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 uhttp://www.inf.u-szeged.hu/en/publication/an-energy-minimization-reconstruction-algorithm-for-multivalued-discrete-tomography00552nas a2200121 4500008004100000245007800041210006900119260007000188300000700258100002500265700002000290856012000310 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 uhttp://www.inf.u-szeged.hu/en/publication/extracting-geometrical-features-of-discrete-images-from-their-projections01375nas a2200193 4500008004100000020002200041245010000063210006900163260005500232300001200287520059000299100001900889700002300908700002800931700002400959700002600983700003001009856014201039 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 uhttp://www.inf.u-szeged.hu/en/publication/hexagonal-parallel-thinning-algorithms-based-on-sufficient-conditions-for-topology-preservation01574nas a2200181 4500008004100000245006900041210006900110260003400179300001400213520092800227100002001155700002801175700002101203700002001224700002001244700001701264856011101281 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 uhttp://www.inf.u-szeged.hu/en/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=73601368nas a2200181 4500008004100000245006900041210006900110260008200179300001400261520067500275100001800950700002500968700002000993700002001013700002301033700001901056856011101075 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 uhttp://www.inf.u-szeged.hu/en/publication/machine-learning-as-a-preprocessing-phase-in-discrete-tomography00619nam a2200121 4500008004100000245004700041210004700088260003800135520019700173100001700370700002100387856008900408 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 uhttp://www.inf.u-szeged.hu/en/publication/markov-random-fields-in-image-segmentation01981nas a2200193 4500008004100000020002300041245008200064210006900146260003500215300001600250520128600266100001801552700001701570700001601587700002201603700001701625700002101642856012401663 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 uhttp://www.inf.u-szeged.hu/en/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.pdf02237nas a2200193 4500008004100000020002300041245009400064210006900158260003400227300001400261520150600275100002001781700002801801700002101829700002001850700002001870700001701890856013601907 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 uhttp://www.inf.u-szeged.hu/en/publication/a-novel-method-for-accurate-and-efficient-barcode-detection-with-morphological-operations00610nas a2200133 4500008004100000245009200041210006900133260007000202300000700272100002700279700002000306700001600326856013400342 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 uhttp://www.inf.u-szeged.hu/en/publication/a-novel-optimization-based-reconstruction-algorithm-for-multivalued-discrete-tomography00583nas a2200133 4500008004100000245008700041210006900128260004800197300001200245100002700257700002000284700001600304856012900320 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 uhttp://www.inf.u-szeged.hu/en/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=641330502319nas a2200169 4500008004100000020002200041245009300063210006900156260007100225300001400296520160900310100002601919700001801945700001701963700003401980856013502014 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 a*Black 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 uhttp://www.inf.u-szeged.hu/en/publication/parametric-stochastic-modeling-for-color-image-segmentation-and-texture-characterization01182nas a2200181 4500008004100000245008800041210006900129260004700198300001400245520049500259100002500754700001600779700002000795700001400815700001600829700002500845856013000870 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 uhttp://www.inf.u-szeged.hu/en/publication/perimeter-estimation-of-some-discrete-sets-from-horizontal-and-vertical-projections01251nas a2200181 4500008004100000020002300041245005600064210005600120260003500176300001100211520065300222100001900875700001700894700002200911700001700933700002100950856009800971 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 uhttp://www.inf.u-szeged.hu/en/publication/simultaneous-affine-registration-of-multiple-shapes00554nas a2200133 4500008004100000245007500041210006900116260004800185300000700233100002000240700002000260700002300280856011700303 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 uhttp://www.inf.u-szeged.hu/en/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.pdf02353nas a2200253 4500008004100000020001400041245008300055210006900138260001300207300001600220490000700236520154200243100001801785700001701803700001901820700001801839700001901857700001901876700001801895700002101913700001701934700002401951856012401975 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 uhttp://www.inf.u-szeged.hu/en/publication/a-spline-based-non-linear-diffeomorphism-for-multimodal-prostate-registration01136nas a2200181 4500008004100000020002200041245006400063210006100127260004700188300001400235520048800249100001900737700002300756700002300779700002400802700002200826856010600848 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 uhttp://www.inf.u-szeged.hu/en/publication/on-topology-preservation-for-triangular-thinning-algorithms01193nas a2200181 4500008004100000020002200041245005600063210005600119260002600175300001400201520058900215100002300804700002000827700001900847700002400866700002300890856009800913 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 uhttp://www.inf.u-szeged.hu/en/publication/topology-preserving-parallel-3d-thinning-algorithms01361nas a2200145 4500008004100000020002200041245007200063210006900135260004900204300001400253520079400267100001701061700002301078856011401101 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 uhttp://www.inf.u-szeged.hu/en/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.pdf01312nas a2200181 4500008004100000020002300041245006600064210006500130260004000195300001400235520067200249100002000921700002300941700002100964700002200985700001501007856010801022 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. uhttp://www.inf.u-szeged.hu/en/publication/2d-parallel-thinning-algorithms-based-on-isthmus-preservation01307nas a2200169 4500008004100000020001400041245009600055210006900151260006500220300001400285490000700299520063100306100002000937700001900957700002300976856013800999 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 uhttp://www.inf.u-szeged.hu/en/publication/2d-parallel-thinning-and-shrinking-based-on-sufficient-conditions-for-topology-preservation00574nas a2200169 4500008004100000245005500041210005500096260002800151300001400179100001900193700002100212700002100233700001700254700001700271700002300288856009300311 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 uhttp://www.inf.u-szeged.hu/en/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.pdf00429nas a2200133 4500008004100000020001400041245005100055210005100106260000900157300000600166490000700172100002300179856009300202 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 uhttp://www.inf.u-szeged.hu/en/publication/conference-of-phd-students-in-computer-science01425nas a2200169 4500008004100000020001400041245007300055210006900128260001300197300001400210490000700224520084600231100002701077700002001104700001601124856011501140 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 uhttp://www.inf.u-szeged.hu/en/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.pdf01820nas a2200217 4500008004100000020002200041245008300063210006900146260004500215300001200260520102200272100002001294700001901314700002301333700002201356700002301378700002401401700002801425700002401453856012501477 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 uhttp://www.inf.u-szeged.hu/en/publication/a-family-of-topology-preserving-3d-parallel-6-subiteration-thinning-algorithms01276nas a2200205 4500008004100000020002300041245007300064210006900137260002900206300001400235520058300249100001900832700001700851700002000868700001900888700001400907700001900921700001500940856011500955 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 uhttp://www.inf.u-szeged.hu/en/publication/fast-linear-registration-of-3d-objects-segmented-from-medical-images00334nam a2200097 4500008004100000245003400041210003400075260003500109100001600144856007600160 2011 eng d00aFejlett Grafikai Algoritmusok0 aFejlett Grafikai Algoritmusok aBudapestbTypotex Kiadóc20111 aNagy, Antal uhttp://www.inf.u-szeged.hu/en/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.pdf00328nam a2200097 4500008004100000245003300041210003300074260002800107100002300135856007200158 2011 eng d00aKépfeldolgozás haladóknak0 aKépfeldolgozás haladóknak aBudapestbTypotexc20111 aPalágyi, Kálmán uhttp://www.inf.u-szeged.hu/en/publication/kepfeldolgozas-haladoknak00561nas a2200145 4500008004100000245007200041210007200113260002800185300001400213100002000227700002000247700001700267700002300284856010800307 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 uhttp://www.inf.u-szeged.hu/en/publication/medianszures-alkalmazasa-algebrai-rekonstrukcios-modszerekben00547nas a2200145 4500008004100000245007400041210006900115260003000184490000900214100001600223700001900239700002800258700001400286856010100300 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 uhttp://www.inf.u-szeged.hu/en/mippr-2011-multispectral-image-acquisition-processing-and-analysis02229nas a2200217 4500008004100000020002300041245007800064210006900142260003200211300001200243520148200255100001801737700001701755700001901772700001801791700001901809700001801828700002101846700002401867856012001891 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 uhttp://www.inf.u-szeged.hu/en/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.html01092nas a2200157 4500008004100000245006600041210006500107260004900172300001400221520051000235100001900745700002300764700002300787700001600810856010800826 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 uhttp://www.inf.u-szeged.hu/en/publication/order-independent-sequential-thinning-in-arbitrary-dimensions00554nas a2200133 4500008004100000245008200041210007600123260003500199300001300234100001900247700002100266700001900287856011400306 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 uhttp://www.inf.u-szeged.hu/en/publication/orvosi-kepfeldolgozas-orvosi-algoritmusok-taverzekeles-mikroszkopia00457nas a2200097 4500008004100000245007300041210006900114260004200183100001900225856011500244 2011 eng d00aParametric Estimation of Affine Deformations without Correspondences0 aParametric Estimation of Affine Deformations without Corresponde aSzeged, HungarybUniversity of Szeged1 aDomokos, Csaba uhttp://www.inf.u-szeged.hu/en/publication/parametric-estimation-of-affine-deformations-without-correspondences01792nas a2200169 4500008004100000020001400041245005700055210005700112260006500169300001400234490000700248520120500255100002701460700002001487700001601507856009901523 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 uhttp://www.inf.u-szeged.hu/en/publication/projection-selection-dependency-in-binary-tomography00862nas a2200133 4500008004100000245007200041210006900113260002500182300001100207490000700218520037000225100001900595856011400614 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 uhttp://www.inf.u-szeged.hu/en/publication/sufficient-conditions-for-order-independency-in-sequential-thinning00347nam a2200109 4500008004100000245002900041210002900070260003500099100001700134700002100151856006500172 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ó uhttp://www.inf.u-szeged.hu/en/publication/szamitogepes-latas00651nas a2200145 4500008004100000245009900041210007200140260005900212300001400271100002000285700002400305700001900329700002000348856013700368 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 uhttp://www.inf.u-szeged.hu/en/publication/tehetseggondozo-program-a-szegedi-tudomanyegyetem-informatikai-tanszekcsoport-bsc-szakjain01088nas a2200169 4500008004100000020001400041245008100055210006900136260001300205300001400218490000700232520049400239100002000733700001900753700002300772856012300795 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 uhttp://www.inf.u-szeged.hu/en/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.pdf01288nas a2200205 4500008004100000020002200041245007200063210006900135260004500204300001200249520054400261100001900805700002300824700002200847700002300869700002400892700002800916700002400944856011400968 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 uhttp://www.inf.u-szeged.hu/en/publication/on-topology-preservation-for-hexagonal-parallel-thinning-algorithms01131nas a2200157 4500008004100000020001400041245005300055210005300108260003800161300001200199490000700211520061700218100002000835700002300855856009500878 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 uhttp://www.inf.u-szeged.hu/en/publication/topology-preserving-parallel-thinning-algorithms00554nas a2200157 4500008004100000245005900041210005900100260002800159300001300187100002700200700002000227700001600247700001700263700002300280856009300303 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 uhttp://www.inf.u-szeged.hu/en/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/01395nas a2200193 4500008004100000020002200041022001400063245008000077210006900157260003800226300001400264520070300278100001900981700001701000700002301017700002001040700002001060856012101080 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 uhttp://www.inf.u-szeged.hu/en/publication/affine-puzzle-realigning-deformed-object-fragments-without-correspondences00437nas a2200109 4500008004100000245006500041210006300106260001200169100001700181700002400198856010500222 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 uhttp://www.inf.u-szeged.hu/en/publication/angular-stable-locking-system-milestone-in-im-nailing-asls00497nas a2200157 4500008004100000020001400041245005300055210005300108260000900161300001200170490000700182100001900189700002000208700002300228856008800251 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 uhttp://www.inf.u-szeged.hu/en/publication/bejarasfuggetlen-szekvencialis-vekonyitas00527nas a2200121 4500008004100000245008200041210006900123260004400192300000700236100001800243700002000261856012400281 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 uhttp://www.inf.u-szeged.hu/en/publication/binary-tomographic-reconstruction-with-an-object-based-evolutionary-algorithm01537nas a2200217 4500008004100000020002200041245007400063210006900137260004800206300001400254520074200268100002701010700002001037700001601057700002301073700002501096700002501121700002601146700003101172856011601203 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 uhttp://www.inf.u-szeged.hu/en/publication/direction-dependency-of-a-binary-tomographic-reconstruction-algorithm01142nas a2200157 4500008004100000245005200041210005200093260004100145300001400186520061200200100001900812700002100831700002100852700001700873856009400890 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 uhttp://www.inf.u-szeged.hu/en/publication/estimation-of-linear-deformations-of-3d-objects01931nas a2200193 4500008004100000020001400041245007900055210006900134260000900203300001400212490000700226520127600233100001901509700001701528700002801545700002301573700002101596856012001617 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 uhttp://www.inf.u-szeged.hu/en/publication/glaucoma-risk-index-automated-glaucoma-detection-from-color-fundus-images00464nas a2200097 4500008004100000245008900041210006900130260000900199100002800208856013000236 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 uhttp://www.inf.u-szeged.hu/en/publication/image-analysis-methods-for-medical-research-diagnostic-and-therapeutic-applications01695nas a2200289 4500008004100000020002200041245009900063210006900162260005400231300001400285520070400299100002001003700002001023700001801043700001901061700001901080700001901099700001801118700001901136700002201155700001701177700001901194700002101213700001501234700001601249856014001265 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 uhttp://www.inf.u-szeged.hu/en/publication/image-enhancement-by-median-filters-in-algebraic-reconstruction-methods-an-experimental-study01159nas a2200229 4500008004100000020002300041022001500064245006800079210006800147260003700215300001600252520040600268100001700674700001700691700001600708700001700724700001900741700002000760700002000780700001700800856011200817 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 uhttp://www.inf.u-szeged.hu/en/publication/live-cell-segmentation-in-fluorescence-microscopy-via-graph-cut-000642nas a2200169 4500008004100000245007000041210006900111260004100180300001400221100002000235700001800255700002500273700002000298700002300318700001900341856011200360 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 uhttp://www.inf.u-szeged.hu/en/publication/machine-learning-for-supporting-binary-tomographic-reconstruction00535nas a2200133 4500008004100000245006500041210006500106260005300171300000700224100002700231700002000258700001600278856010700294 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 uhttp://www.inf.u-szeged.hu/en/publication/object-rotation-effects-on-binary-tomographic-reconstruction00573nas a2200121 4500008004100000245009700041210006900138260005300207300000700260100002500267700002000292856013900312 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 uhttp://www.inf.u-szeged.hu/en/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.html00513nas a2200145 4500008004100000020001400041245006600055210006600121260001500187300001400202490000700216100001900223700001700242856010800259 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 uhttp://www.inf.u-szeged.hu/en/publication/parametric-estimation-of-affine-deformations-of-planar-shapes00685nas a2200193 4500008004100000245006000041210006000101260005000161300001400211100002700225700002000252700001600272700002500288700001400313700002200327700001700349700002100366856010400387 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 uhttp://www.inf.u-szeged.hu/en/publication/projection-selection-algorithms-for-discrete-tomography-000615nas a2200157 4500008004100000245007500041210006900116260005200185300000700237100002000244700001700264700002000281700002000301700002100321856011500342 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 uhttp://www.inf.u-szeged.hu/en/publication/sitis-2010-track-sit-editorial-message-signal-and-image-technologies01182nas a2200181 4500008004100000245005800041210005700099260005200156300001400208520057500222100002000797700001900817700002300836700001300859700001500872700001300887856010000900 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 uhttp://www.inf.u-szeged.hu/en/publication/topology-preserving-2-subfield-3d-thinning-algorithms01488nas a2200181 4500008004100000245007800041210006900119260005900188300001400247490000900261520081200270100002001082700001901102700002301121700002301144700001901167856012001186 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 uhttp://www.inf.u-szeged.hu/en/publication/topology-preserving-3d-thinning-algorithms-using-four-and-eight-subfields01335nas a2200217 4500008004100000245006400041210006400105260004400169300001400213490000900227520058400236100002000820700001900840700002300859700002300882700002400905700002500929700002600954700003100980856010601011 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 uhttp://www.inf.u-szeged.hu/en/publication/topology-preserving-parallel-smoothing-for-3d-binary-images01289nas a2200157 4500008004100000020002300041022001500064245006000079210005900139260003300198300001400231520074900245100001900994700001701013856010101030 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 uhttp://www.inf.u-szeged.hu/en/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.html00505nas a2200133 4500008004100000020001400041245007000055210006700125260002300192300001600215490000800231100002000239856011200259 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 uhttp://www.inf.u-szeged.hu/en/publication/a-benchmark-set-for-the-reconstruction-of-hv-convex-discrete-sets03872nas a2200733 4500008004100000020001400041245008100055210006900136260027000205300001600475490000700491520149600498100002001994700002402014700002202038700002002060700001902080700002102099700001802120700002202138700002302160700001902183700002002202700001702222700001902239700002202258700002302280700001402303700002102317700002202338700002002360700002002380700002202400700002002422700002302442700002402465700002302489700002302512700001902535700001802554700001802572700001802590700001202608700001402620700002402634700002002658700002202678700002202700700002502722700002002747700002102767700002002788700002102808700002002829700002102849700002202870700002002892700001902912700002702931700002302958700002002981700001403001856012303015 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 uhttp://www.inf.u-szeged.hu/en/publication/comparison-and-evaluation-of-methods-for-liver-segmentation-from-ct-datasets00434nas a2200133 4500008004100000020001400041245005100055210005100106260001200157300000600169490000700175100002300182856009500205 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 uhttp://www.inf.u-szeged.hu/en/publication/conference-of-phd-students-in-computer-science-101148nas a2200181 4500008004100000020001400041245009500055210006900150260001500219300001600234490000700250520049500257100001900752700002000771700001700791700002100808856013700829 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 uhttp://www.inf.u-szeged.hu/en/publication/detection-of-object-motion-regions-in-aerial-image-pairs-with-a-multilayer-markovian-model00511nas a2200133 4500008004100000020001400041245008400055210007400139260000900213300001400222490000700236100001600243856011800259 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 uhttp://www.inf.u-szeged.hu/en/publication/emisszios-diszkret-tomografiai-modszerek-alkalmazasa-faktorstrukturakra01356nas a2200181 4500008004100000020002200041245008700063210006900150260004500219300001400264520065900278100002000937700001800957700002400975700002600999700002001025856012901045 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 uhttp://www.inf.u-szeged.hu/en/publication/an-evolutionary-approach-for-object-based-image-reconstruction-using-learnt-priors01193nas a2200181 4500008004100000020002200041245009900063210006900162260005600231300001400287520045800301100002300759700002000782700001800802700002700820700002300847856014100870 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 uhttp://www.inf.u-szeged.hu/en/publication/fully-parallel-3d-thinning-algorithms-based-on-sufficient-conditions-for-topology-preservation00455nas a2200121 4500008004100000245005700041210005500098260004200153300001200195490000900207100001800216856009900234 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 uhttp://www.inf.u-szeged.hu/en/publication/a-graph-based-data-model-for-graphics-interpretation00654nas a2200169 4500008004100000020001400041245010700055210006900162260001200231300001400243490000700257100001900264700001600283700001700299700002100316856014700337 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 uhttp://www.inf.u-szeged.hu/en/publication/a-higher-order-active-contour-model-of-a-gas-of-circles-and-its-application-to-tree-crown-extraction00577nas a2200157 4500008004100000020001400041245008100055210006900136260000900205300001200214490000700226100001800233700002500251700002000276856012300296 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 uhttp://www.inf.u-szeged.hu/en/publication/learning-connectedness-and-convexity-of-binary-images-from-their-projections01107nas a2200157 4500008004100000020002300041245006800064210006500132260003300197300001600230520053700246100002300783700001700806700001600823856011000839 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 uhttp://www.inf.u-szeged.hu/en/publication/a-markov-random-field-model-for-extracting-near-circular-shapes00681nas a2200157 4500008004100000245010800041210006900149260003800218490001800256100002000274700001800294700002800312700001700340700001600357856015000373 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 uhttp://www.inf.u-szeged.hu/en/publication/method-and-system-for-automatically-segmenting-organs-from-three-dimensional-computed-tomography-images00583nam a2200157 4500008004100000020001900041245006300060210006200123260004300185490000900228100002200237700001500259700002800274700001900302856010400321 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 uhttp://www.inf.u-szeged.hu/en/publication/mippr-2009-multispectral-image-acquisition-and-processing03180nas a2200193 4500008004100000020001400041245011300055210006900168260000900237300000800246490000700254520246200261100001902723700001702742700002802759700002302787700002102810856015502831 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 uhttp://www.inf.u-szeged.hu/en/publication/multimodal-automated-glaucoma-detection-combining-the-glaucoma-probability-score-and-the-glaucoma-risk-index01319nas a2200157 4500008004100000020002300041245004400064210004400108260003300152300001600185520081900201100001901020700001901039700001701058856008601075 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 uhttp://www.inf.u-szeged.hu/en/publication/nonlinear-registration-of-binary-shapes01660nas a2200205 4500008004100000245007100041210006900112260003500181300001400216520096100230100002001191700001801211700001901229700002401248700001701272700002101289700001101310700002001321856011301341 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 uhttp://www.inf.u-szeged.hu/en/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_1301309nas a2200157 4500008004100000020002200041245009700063210006900160260008200229300001400311520062200325100002000947700002200967700002300989856013901012 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 uhttp://www.inf.u-szeged.hu/en/publication/reconstruction-of-canonical-hv-convex-discrete-sets-from-horizontal-and-vertical-projections01496nas a2200205 4500008004100000245005100041210005100092260004500143300001400188520082800202100001901030700001901049700002101068700002101089700001701110700002401127700002601151700002001177856009301197 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 uhttp://www.inf.u-szeged.hu/en/publication/recovering-affine-deformations-of-fuzzy-shapes01967nas a2200169 4500008004100000245006600041210006600107260003900173300002400212520136000236100002801596700001701624700001501641700001901656700001401675856010801689 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 uhttp://www.inf.u-szeged.hu/en/publication/retinal-image-analysis-for-automated-glaucoma-risk-evaluation01806nas a2200145 4500008004100000245006400041210006300105260003700168300001200205490000600217520129000223100002401513700001701537856010601554 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 uhttp://www.inf.u-szeged.hu/en/publication/semi-automatic-bone-fracture-reduction-in-surgical-planning01168nas 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.html00315nas a2200109 4500008004100000245002300041210002300064260001200087100001700099700002400116856006500140 2009 eng d00aVCP volar approach0 aVCP volar approach c2009///1 aVarga, Endre1 aErdőhelyi, Balázs uhttp://www.inf.u-szeged.hu/en/publication/vcp-volar-approach01267nas a2200145 4500008004100000020001400041245005100055210004800106260027600154300001400430490000800444520055300452100002301005856009301028 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 uhttp://www.inf.u-szeged.hu/en/publication/a-3d-fully-parallel-surface-thinning-algorithm00498nas a2200157 4500008004100000020001400041245005500055210005300110260000900163300000600172490000800178100002400186700001600210700001900226856009500245 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 uhttp://www.inf.u-szeged.hu/en/publication/algorithms-automata-complexity-and-games-preface01556nas a2200145 4500008004100000020001400041245009800055210006900153260004800222300001400270490000700284520095900291100002001250856014001270 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 a`Reconstructing 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 uhttp://www.inf.u-szeged.hu/en/publication/on-the-ambiguity-of-reconstructing-hv-convex-binary-matrices-with-decomposable-configurations02695nas a2200193 4500008004100000020001400041245006300055210006300118260000900181300000900190490000700199520208200206100001902288700001702307700002802324700002302352700002102375856010502396 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 uhttp://www.inf.u-szeged.hu/en/publication/automated-glaucoma-detection-from-color-fundus-photographs01518nas a2200157 4500008004100000020002200041245006500063210006500128260005200193300001400245520093500259100001901194700001701213700002301230856010701253 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 uhttp://www.inf.u-szeged.hu/en/publication/binary-image-registration-using-covariant-gaussian-densities00713nas a2200181 4500008003900000245011200039210006900151260001200220300001200232100002200244700001700266700001900283700001800302700001600320700002600336700001900362856015000381 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 uhttp://www.inf.u-szeged.hu/en/publication/comparison-radiography-and-tomography-possibilities-of-frm-ii-20-mw-and-budapest-10-mw-research-reactor01656nas a2200145 4500008004100000245010400041210006900145260004600214300001200260490000900272520104500281100002001326700001801346856014601364 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 uhttp://www.inf.u-szeged.hu/en/publication/decision-trees-in-binary-tomography-for-supporting-the-reconstruction-of-hv-convex-connected-images00717nas a2200169 4500008004100000245010400041210006900145260005300214300000700267100001800274700002000292700002300312700002300335700002000358700002300378856014600401 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 uhttp://www.inf.u-szeged.hu/en/publication/determination-of-geometric-features-of-binary-images-from-their-projections-by-using-decision-trees01273nas a2200145 4500008004100000020001400041245010600055210006900161260003100230300001400261490000700275520067700282100002000959856014800979 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 uhttp://www.inf.u-szeged.hu/en/publication/discrete-tomographic-reconstruction-of-binary-images-with-disjoint-components-using-shape-information02756nas a2200205 4500008004100000020001400041245012500055210006900180260001900249300000900268490000700277520197900284100001702263700001902280700001402299700002802313700002302341700002102364856016502385 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 uhttp://www.inf.u-szeged.hu/en/publication/the-erlanger-glaucoma-matrix-a-visualization-approach-towards-optimal-glaucomatous-optic-nerve-head-image-presentation00564nas a2200181 4500008004100000020001400041245005400055210005400109260001900163300000900182490000700191100001700198700002000215700002400235700001300259700001400272856009600286 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 uhttp://www.inf.u-szeged.hu/en/publication/finite-element-analysis-of-mandible-virtual-model00575nas a2200133 4500008004100000020001400041245010600055210006900161260002300230300001200253490000800265100002000273856014800293 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 uhttp://www.inf.u-szeged.hu/en/publication/a-framework-for-generating-some-discrete-sets-with-disjoint-components-by-using-uniform-distributions01186nas a2200193 4500008004100000020001400041245007700055210006900132260001300201300001400214490000700228520053400235100001900769700001800788700002800806700001700834700002000851856012100871 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 uhttp://www.inf.u-szeged.hu/en/publication/geometrical-model-based-segmentation-of-the-organs-of-sight-on-ct-images-000482nas a2200157 4500008004100000020001400041245004000055210003700095260003500132300001000167490000800177100002400185700001600209700001900225856008000244 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 uhttp://www.inf.u-szeged.hu/en/publication/in-memoriam-attila-kuba-1953-200601530nas a2200205 4500008004100000245010500041210006900146260004900215300001400264520073300278100001701011700001901028700002801047700002301075700002101098700001601119700002201135700002001157856014701177 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 uhttp://www.inf.u-szeged.hu/en/publication/novel-visualization-approach-of-an-automated-image-based-glaucoma-risk-index-for-intuitive-diagnosis01432nas a2200169 4500008004100000020002200041245004500063210003700108260004800145300001400193520087500207100002001082700002501102700002301127700002501150856008701175 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 uhttp://www.inf.u-szeged.hu/en/publication/on-the-number-of-hv-convex-discrete-sets01343nas a2200169 4500008004100000020002300041022001500064245006600079210006600145260004100211300001400252520074100266100001901007700001701026700002201043856010801065 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 uhttp://www.inf.u-szeged.hu/en/publication/parametric-estimation-of-affine-deformations-of-binary-images01562nas a2200289 4500008004100000020002200041022001400063245008600077210006900163260005000232300001600282520059600298100002000894700001800914700001900932700001900951700001900970700002100989700001901010700001801029700002101047700001601068700001701084700002501101700001801126856012801144 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 uhttp://www.inf.u-szeged.hu/en/publication/reconstruction-of-binary-images-with-few-disjoint-components-from-two-projections00495nas a2200133 4500008004100000020001400041245006700055210006700122260002500189300001400214490000700228100001700235856010900252 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 uhttp://www.inf.u-szeged.hu/en/publication/segmentation-of-color-images-via-reversible-jump-mcmc-sampling01310nas a2200217 4500008004100000020002200041022001400063245006100077210006100138260004900199300001400248520057800262100002000840700002300860700002100883700002000904700002500924700001900949700002100968856010300989 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 uhttp://www.inf.u-szeged.hu/en/publication/skeletonization-based-on-metrical-neighborhood-sequences00720nas a2200181 4500008003900000245011500039210006900154260001200223300001400235100002200249700002100271700001800292700001900310700001600329700001700345700001900362856015700381 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 uhttp://www.inf.u-szeged.hu/en/publication/study-of-the-inner-structure-of-a-damaged-control-rod-by-neutron-and-x-ray-radiography-and-discrete-tomography00672nas a2200181 4500008004100000245007300041210006900114260003800183490001800221100002000239700001700259700001800276700001800294700001700312700002800329700001800357856011500375 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 uhttp://www.inf.u-szeged.hu/en/publication/systems-and-methods-for-segmenting-an-organ-in-a-plurality-of-images01903nas a2200229 4500008004100000245007400041210006900115260003400184300001400218520110100232100002001333700001801353700002901371700002301400700002801423700002301451700002001474700001901494700002201513700002201535856011601557 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 uhttp://www.inf.u-szeged.hu/en/publication/techniques-of-virtual-dissection-of-the-colon-based-on-spiral-ct-data00390nas a2200109 4500008004100000245004800041210004800089260001200137100001700149700002400166856009000190 2008 eng d00aVirtual Planning Tool for Surgical Planning0 aVirtual Planning Tool for Surgical Planning c2008///1 aVarga, Endre1 aErdőhelyi, Balázs uhttp://www.inf.u-szeged.hu/en/publication/virtual-planning-tool-for-surgical-planning01507nas a2200193 4500008004100000020001400041245006400055210006300119260001400182300001400196490000600210520089000216100001901106700002801125700001801153700001701171700002001188856010501208 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 uhttp://www.inf.u-szeged.hu/en/publication/3d-segmentation-of-liver-kidneys-and-spleen-from-ct-images00982nas a2200181 4500008004100000020002200041022001400063245004800077210004400125260004700169300001400216520039400230100002300624700002500647700001900672700001900691856009000710 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 uhttp://www.inf.u-szeged.hu/en/publication/a-3-subiteration-surface-thinning-algorithm01693nam a2200121 4500008004100000245005700041210005700098260002100155520125600176100002301432700001701455856009901472 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 uhttp://www.inf.u-szeged.hu/en/publication/advances-in-discrete-tomography-and-its-applications01811nas a2200289 4500008004100000245008600041210006900127260007000196300001400266490000600280520081400286100001901100700001701119700002801136700002201164700002101186700002301207700002301230700001901253700002101272700002301293700001801316700002201334700001801356700001901374856012801393 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 identiﬁed an age-related feature with a strong inﬂuence of the temporal parapapillary area and the optic nerve head. The feature correlates with chronological age of the participants and is signiﬁcantly inﬂuenced 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 uhttp://www.inf.u-szeged.hu/en/publication/appearance-based-approach-to-extract-an-age-related-biomarker-from-retinal-images00489nas a2200097 4500008004100000245008600041210006900127260004800196100002000244856012700264 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 uhttp://www.inf.u-szeged.hu/en/publication/binary-tomography-using-geometrical-priors-uniqueness-and-reconstruction-results02151nas a2200229 4500008004100000020002200041022001400063245007500077210006900152260004200221300001400263520135500277100001901632700001701651700002101668700002801689700002301717700002301740700002301763700001801786856011701804 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 uhttp://www.inf.u-szeged.hu/en/publication/classifying-glaucoma-with-image-based-features-from-fundus-photographs01462nas a2200145 4500008004100000020001400041245009200055210006900147260003100216300001200247490000700259520089800266100001801164856013401182 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 uhttp://www.inf.u-szeged.hu/en/publication/contour-line-thinning-and-multigrid-generation-of-raster-based-digital-elevation-models01511nas a2200157 4500008004100000020002200041245008700063210006900150260003900219300001400258520089400272100002001166700002101186700001701207856012901224 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 uhttp://www.inf.u-szeged.hu/en/publication/decomposition-algorithms-for-reconstructing-discrete-sets-with-disjoint-components01195nas a2200145 4500008004100000020001400041245008500055210006900140260002300209300001600232490000700248520064700255100002000902856012700922 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 uhttp://www.inf.u-szeged.hu/en/publication/a-decomposition-technique-for-reconstructing-discrete-sets-from-four-projections01834nas a2200241 4500008004100000020002200041245006000063210005900123260002100182300001400203520108200217100002101299700001801320700001801338700001701356700001601373700001701389700002601406700002101432700002101453700001701474856010101491 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 uhttp://www.inf.u-szeged.hu/en/publication/discrete-tomography-methods-for-nondestructive-testing01876nas a2200229 4500008004100000020002200041022001400063245009100077210006900168260005000237300001400287520104100301100001701342700001901359700002101378700002801399700002301427700002501450700001901475700001901494856013301513 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 uhttp://www.inf.u-szeged.hu/en/publication/effects-of-preprocessing-eye-fundus-images-on-appearance-based-glaucoma-classification00532nas a2200133 4500008004100000245005500041210005500096260007300151300001400224100002300238700002000261700002000281856009700301 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 uhttp://www.inf.u-szeged.hu/en/publication/efficient-implementation-of-3d-thinning-algorithms01400nas a2200229 4500008004100000020002200041245003400063210003300097260003900130300001400169520074500183100002000928700002000948700001700968700001600985700002001001700001801021700001801039700002101057700001701078856007501095 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 uhttp://www.inf.u-szeged.hu/en/publication/emission-discrete-tomography02492nas a2200193 4500008004100000020001400041245009500055210006900150260000900219300000900228490000700237520180400244100002102048700002202069700001902091700002802110700002302138856013702161 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 uhttp://www.inf.u-szeged.hu/en/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.pdf00521nas a2200109 4500008004100000245007600041210006900117260008200186490000800268100001900276856011600295 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 uhttp://www.inf.u-szeged.hu/en/publication/the-gas-of-circles-model-and-its-application-to-tree-crown-extraction00592nas a2200145 4500008003900000245008600039210006900125260002500194100001900219700001600238700002000254700002300274700002300297856012600320 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 uhttp://www.inf.u-szeged.hu/en/publication/a-gas-of-circles-phase-field-model-and-its-application-to-tree-crown-extraction01793nas a2200169 4500008004100000020002200041022001400063245007000077210006900147260004900216300001400265520115400279100002001433700002801453700003001481856011201511 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 uhttp://www.inf.u-szeged.hu/en/publication/generation-and-empirical-investigation-of-hv-convex-discrete-sets00418nas a2200097 4500008004100000245007100041210006900112260000900181100001700190856011300207 2007 eng d00aMarkovian Image Models and their Application in Image Segmentation0 aMarkovian Image Models and their Application in Image Segmentati c20071 aKato, Zoltan uhttp://www.inf.u-szeged.hu/en/publication/markovian-image-models-and-their-application-in-image-segmentation00588nas a2200145 4500008004100000022001700041245009200058210006900150250002600219260000900245100001900254700001800273700001700291856013400308 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 uhttp://www.inf.u-szeged.hu/en/publication/method-and-system-for-automatically-transforming-ct-studies-to-a-common-reference-frame00655nas a2200157 4500008003900000245010900039210006900148260002900217300001200246490000900258100001900267700002200286700001700308700002100325856015100346 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 uhttp://www.inf.u-szeged.hu/en/publication/a-multispectral-data-model-for-higher-order-active-contours-and-its-application-to-tree-crown-extraction00654nas a2200169 4500008003900000245009500039210006900134260002600203300001200229490000900241100001900250700001600269700002600285700001900311700001900330856013500349 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 uhttp://www.inf.u-szeged.hu/en/publication/a-new-phase-field-model-of-a-gas-of-circles-for-tree-crown-extraction-from-aerial-images01747nas a2200181 4500008004100000020002300041245007900064210006900143260003700212300001400249520109300263100002001356700001401376700001601390700001701406700002101423856012101444 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 uhttp://www.inf.u-szeged.hu/en/publication/reconstructing-some-hv-convex-binary-images-from-three-or-four-projections00535nas a2200145 4500008004100000245005600041210005600097260003000153100001900183700001700202700002800219700002100247700002300268856009800291 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 uhttp://www.inf.u-szeged.hu/en/publication/retina-image-analysis-system-for-glaucoma-detection01087nas a2200181 4500008004100000020002200041022001400063245007500077210006900152260005100221300001400272520041500286100002300701700002300724700002300747700001800770856011700788 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 uhttp://www.inf.u-szeged.hu/en/publication/a-subiteration-based-surface-thinning-algorithm-with-a-period-of-three01279nas a2200157 4500008004100000245005700041210005700098260003000155300001400185490000600199520075900205100002400964700001700988700001701005856009901022 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 uhttp://www.inf.u-szeged.hu/en/publication/surgical-planning-tool-with-biomechanical-simulation00525nas a2200133 4500008004100000245007500041210006900116260001200185100001900197700002000216700001700236700002100253856011700274 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 uhttp://www.inf.u-szeged.hu/en/publication/a-three-layer-mrf-model-for-object-motion-detection-in-airborne-images02108nas a2200253 4500008004100000020002200041022001400063245004500077210004500122260005100167300001400218520131100232100002001543700002801563700002001591700001801611700002301629700002201652700002801674700001901702700002401721700002201745856008701767 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 uhttp://www.inf.u-szeged.hu/en/publication/whole-body-mri-intensity-standardization01537nas a2200169 4500008003900000245005900039210005600098260003300154300001400187490000600201520098600207100001901193700001601212700001701228700002101245856010101266 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 uhttp://www.inf.u-szeged.hu/en/publication/a-higher-order-active-contour-model-for-tree-detection01952nas a2200157 4500008004100000245008100041210006900122260004200191300001200233490000700245520136800252100001801620700001701638700001701655856012201672 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 uhttp://www.inf.u-szeged.hu/en/publication/image-reconstruction-and-correction-methods-in-neutron-and-x-ray-tomography00902nas a2200145 4500008004100000245005000041210004900091260002900140300001200169490008300181520036200264100002100626700001700647856009200664 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 uhttp://www.inf.u-szeged.hu/en/publication/multi-resolution-method-for-binary-tomography01694nas a2200169 4500008004100000245006600041210006600107260001500173300001200188490000700200520113700207100001601344700002101360700001701381700001801398856010801416 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 uhttp://www.inf.u-szeged.hu/en/publication/preliminary-studies-of-discrete-tomography-in-neutron-imaging00535nas a2200121 4500008004100000245007600041210006900117260002400186490004500210100002300255700001700278856011800295 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 uhttp://www.inf.u-szeged.hu/en/publication/proceedings-of-the-workshop-on-discrete-tomography-and-its-applications01445nas a2200145 4500008004100000245008300041210006900124260000900193300001200202490000800214520091600222100001701138700001901155856012501174 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 uhttp://www.inf.u-szeged.hu/en/publication/a-sufficient-condition-for-non-uniqueness-in-binary-tomography-with-absorption00475nas a2200121 4500008004100000245007700041210006900118260000900187300001200196490000700208100001900215856011900234 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 uhttp://www.inf.u-szeged.hu/en/publication/image-registration-methods-based-on-interactively-identified-point-pairs02541nas 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 a### Purpose

Demonstration of a technique for 3D assessment of tracheal stenoses, regarding site, length and degree, based on spiral computed tomography (S-CT).

### Patients and Methods

S-CT scanning and automated segmentation of the laryngo-tracheal tract (LTT) was followed by the extraction of the LTT medial axis using a skeletonisation algorithm. Orthogonal to the medial axis the LTT 3D cross sectional profile was computed and presented as line charts, where degree and length were obtained. Values for both parameters were compared between 36 patients and 18 normal controls separately. Accuracy and precision was derived from 17 phantom studies.

### Results

Average degree and length of tracheal stenoses were found to be 60.5% and 4.32 cm in patients compared to minor caliber changes of 8.8% and 2.31 cm in normal controls (p <0.005). For the phantoms an excellent correlation between the true and computed 3D cross sectional profile was found (p <0.005) and an accuray for length and degree measurements of 2.14 mm and 2.53% respectively could be determined. The corresponding figures for the precision were found to be 0.92 mm and 2.56%.

### Conclusion

LTT 3D cross sectional profiles permit objective, accurate and precise assessment of LTT caliber changes. Minor LTT caliber changes can be observed even in normals and, in case of an otherwise normal S-CT study, can be regarded as artefacts.

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-800419nas a2200133 4500008004100000245004300041210004300084260001200127300001400139490000700153100002300160700001700183856008500200 2003 eng d00aDiscrete tomography in medical imaging0 aDiscrete tomography in medical imaging cOctober a1612-16260 v911 aHerman, Gábor, T.1 aKuba, Attila uhttp://www.inf.u-szeged.hu/en/publication/discrete-tomography-in-medical-imaging00627nas a2200169 4500008004100000245008400041210006900125260000900194300001200203100002200215700002200237700001800259700001900277700001800296700001700314856012600331 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 uhttp://www.inf.u-szeged.hu/en/publication/composition-of-radiography-pictures-of-whole-helicopter-rotor-blades-in-hungary00546nas a2200133 4500008004100000245008700041210006900128300001500197490000700212100002900219700001800248700001700266856012900283 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 uhttp://www.inf.u-szeged.hu/en/publication/mathematical-generation-of-normal-data-for-evaluating-myocardial-perfusion-studies01245nas a2200145 4500008004100000245006500041210006500106260000900171300001200180490000800192520075700200100001700957700001800974856010700992 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 uhttp://www.inf.u-szeged.hu/en/publication/reconstruction-of-convex-2d-discrete-sets-in-polynomial-time00959nas a2200133 4500008004100000245003800041210003600079260003300115300001200148490000700160520055500167100002300722856008000745 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 uhttp://www.inf.u-szeged.hu/en/publication/a-3d-parallel-shrinking-algorithm00562nas a2200157 4500008004100000245007200041210006900113260001300182300001000195490000800205100001800213700001700231700001900248700002300267856011400290 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 uhttp://www.inf.u-szeged.hu/en/publication/comparison-of-algorithms-for-reconstructing-hv-convex-discrete-sets01943nas a2200169 4500008004100000245009400041210006900135300001000204490000800214520132000222100001901542700002201561700001901583700001701602700001901619856013501638 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 uhttp://www.inf.u-szeged.hu/en/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/e4cd2b3dc91dbb828db15e331a6230cc00493nas a2200097 4500008004100000245008500041210006900126260005600195100001700251856012700268 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 uhttp://www.inf.u-szeged.hu/en/publication/bayesian-color-image-segmentation-using-reversible-jump-markov-chain-monte-carlo00458nam a2200109 4500008004100000245006700041210006400108260003000172100002300202700001700225856010600242 1999 eng d00aDiscrete Tomography: Foundations, Algorithms, and Applications0 aDiscrete Tomography Foundations Algorithms and Applications bBirkhausercDecember 19991 aHerman, Gábor, T.1 aKuba, Attila uhttp://www.inf.u-szeged.hu/en/publication/discrete-tomography-foundations-algorithms-and-applications00410nas a2200121 4500008004100000245004800041210004500089260001500134300001200149100001800161700001900179856009000198 1999 eng d00aAn Interpretation System for Cadastral Maps0 aInterpretation System for Cadastral Maps bIEEEc1999 a792-7971 aKatona, Endre1 aHudra, György uhttp://www.inf.u-szeged.hu/en/publication/an-interpretation-system-for-cadastral-maps00697nas a2200193 4500008003900000245009700039210006900136260000900205300000800214490000700222100001900229700001900248700001800267700002000285700001700305700002000322700002200342856013900364 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ó uhttp://www.inf.u-szeged.hu/en/publication/assessment-of-myocardial-function-with-gated-spect-before-and-after-coronary-by-pass-surgery00609nas a2200169 4500008004100000245008200041210006900123260000900192300000800201490000700209100002000216700001800236700002100254700002000275700002200295856012200317 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ó uhttp://www.inf.u-szeged.hu/en/publication/efficiency-of-the-orthopan-tomoscintigram-opts-in-abnormalities-of-the-jaws00661nas a2200133 4500008003900000245014000039210006900179100001900248700001900267700002000286700001800306700002200324856018100346 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ó uhttp://www.inf.u-szeged.hu/en/publication/investigation-of-left-ventricular-wall-motion-by-gated-blood-pool-spect-using-three-dimensional-display-of-fourier-phase-and-amplitude00572nas a2200157 4500008004100000245007900041210006900120260000900189300001500198490000700213100001600220700001500236700001700251700002600268856012000294 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 uhttp://www.inf.u-szeged.hu/en/publication/can-dynamic-krypton-81m-imaging-separate-regional-ventillation-and-volume00488nas a2200145 4500008004100000245005500041210005500096300001000151490000600161100001700167700001900184700001800203700002200221856009900243 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ó uhttp://www.inf.u-szeged.hu/en/publication/data-processing-system-for-nuclear-medicine-images-000508nas a2200157 4500008004100000245005500041210005500096260000900151300001100160490000600171100001700177700001900194700001800213700002200231856009700253 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ó uhttp://www.inf.u-szeged.hu/en/publication/data-processing-system-for-nuclear-medicine-images00813nas a2200181 4500008004100000245017100041210006900212260000900281300000800290490000700298100001900305700001800324700001800342700001700360700002000377700002200397856021200419 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ó uhttp://www.inf.u-szeged.hu/en/publication/documentation-of-changes-in-regional-myocardial-function-due-to-coronary-bypass-surgery-by-gated-spect-using-three-dimensional-display-of-fourier-phase-and-amplitude00726nas a2200181 4500008004100000245012800041210006900169260000900238300001200247490000700259100001800266700001900284700002200303700001700325700001400342700001900356856016900375 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 uhttp://www.inf.u-szeged.hu/en/publication/three-dimensional-presentation-of-the-fourier-amplitude-and-phase-a-fast-display-method-for-gated-cardiac-blood-pool-spect00700nas a2200181 4500008004100000245011700041210006900158260000900227300000800236490000700244100001900251700001800270700002200288700001700310700001400327700001900341856015800360 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 uhttp://www.inf.u-szeged.hu/en/publication/3d-presentation-of-the-fourier-amplitude-and-phase-a-new-fast-display-method-for-gated-cardiac-blood-pool-spect00832nas a2200217 4500008004100000245014000041210006900181260000900250300001200259490000600271100001900277700001300296700001500309700001800324700001300342700001300355700002000368700002400388700002200412856018000434 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ó uhttp://www.inf.u-szeged.hu/en/publication/detection-and-localisation-of-ventricular-preexcitation-in-wolff-parkinson-white-syndrome-comparative-study-with-body-surface-mapping00451nas a2200121 4500008004100000245006500041210006100106300001200167490000600179100001900185700001800204856010700222 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 uhttp://www.inf.u-szeged.hu/en/publication/the-probabilistic-behaviour-of-the-nfd-bin-packing-algorithm