<?xml version="1.0" encoding="UTF-8"?><xml><records><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>17</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Norbert Hantos</style></author><author><style face="normal" font="default" size="100%">Szabolcs Iván</style></author><author><style face="normal" font="default" size="100%">Péter Balázs</style></author><author><style face="normal" font="default" size="100%">Kálmán Palágyi</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">Binary image reconstruction from a small number of projections and the morphological skeleton</style></title><secondary-title><style face="normal" font="default" size="100%">ANNALS OF MATHEMATICS AND ARTIFICIAL INTELLIGENCE</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2015</style></year><pub-dates><date><style  face="normal" font="default" size="100%">2015</style></date></pub-dates></dates><publisher><style face="normal" font="default" size="100%">Springer</style></publisher><volume><style face="normal" font="default" size="100%">75</style></volume><pages><style face="normal" font="default" size="100%">195-216</style></pages><language><style face="normal" font="default" size="100%">eng</style></language><issue><style face="normal" font="default" size="100%">1</style></issue><work-type><style face="normal" font="default" size="100%">Journal article</style></work-type></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>13</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Norbert Hantos</style></author><author><style face="normal" font="default" size="100%">Péter Balázs</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">Eliminating switching components in binary matrices</style></title><secondary-title><style face="normal" font="default" size="100%">Proceedings of the 9th Conference of PhD Students in Computer Science (CSCS'14)</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2014</style></year></dates><publisher><style face="normal" font="default" size="100%">University of Szeged</style></publisher><pub-location><style face="normal" font="default" size="100%">Szeged, Hungary</style></pub-location><pages><style face="normal" font="default" size="100%">21</style></pages><language><style face="normal" font="default" size="100%">eng</style></language><work-type><style face="normal" font="default" size="100%">Abstract</style></work-type></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>5</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Norbert Hantos</style></author><author><style face="normal" font="default" size="100%">Péter Balázs</style></author></authors><secondary-authors><author><style face="normal" font="default" size="100%">E. Bayro-Corrochano</style></author><author><style face="normal" font="default" size="100%">E. Hancock</style></author></secondary-authors></contributors><titles><title><style face="normal" font="default" size="100%">Fast Heuristics for Eliminating Switching Components in Binary Matrices by 0-1 Flips</style></title><secondary-title><style face="normal" font="default" size="100%">Progress in Pattern Recognition, Image Analysis, Computer Vision, and Applications: 19th Iberoamerican Congress (CIARP)</style></secondary-title><tertiary-title><style face="normal" font="default" size="100%">LNCS</style></tertiary-title><short-title><style face="normal" font="default" size="100%">LNCS</style></short-title></titles><dates><year><style  face="normal" font="default" size="100%">2014</style></year><pub-dates><date><style  face="normal" font="default" size="100%">2014</style></date></pub-dates></dates><number><style face="normal" font="default" size="100%">8827</style></number><publisher><style face="normal" font="default" size="100%">Springer</style></publisher><pub-location><style face="normal" font="default" size="100%">Puerto Vallarta, Mexico</style></pub-location><pages><style face="normal" font="default" size="100%">62-69</style></pages><isbn><style face="normal" font="default" size="100%">978-3-319-12567-1</style></isbn><language><style face="normal" font="default" size="100%">eng</style></language><abstract><style face="normal" font="default" size="100%">&lt;p&gt;Switching 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.&lt;/p&gt;</style></abstract><work-type><style face="normal" font="default" size="100%">Conference paper</style></work-type></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>47</ref-type><contributors></contributors><titles><title><style face="normal" font="default" size="100%">Bináris képek rekonstrukciója két vetületből és morfológiai vázból</style></title><secondary-title><style face="normal" font="default" size="100%">A Képfeldolgozók és Alakfelismerők Társaságának konferenciája - KÉPAF 2013</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2013</style></year><pub-dates><date><style  face="normal" font="default" size="100%">Jan 2013</style></date></pub-dates></dates><publisher><style face="normal" font="default" size="100%">NJSZT-KÉPAF</style></publisher><pub-location><style face="normal" font="default" size="100%">Veszprém</style></pub-location><pages><style face="normal" font="default" size="100%">182 - 193</style></pages><language><style face="normal" font="default" size="100%">eng</style></language><work-type><style face="normal" font="default" size="100%">Conference paper</style></work-type></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>5</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Norbert Hantos</style></author><author><style face="normal" font="default" size="100%">Péter Balázs</style></author></authors><secondary-authors><author><style face="normal" font="default" size="100%">Jose Ruiz-Shulcloper</style></author><author><style face="normal" font="default" size="100%">Gabriella Sanniti di Baja</style></author></secondary-authors></contributors><titles><title><style face="normal" font="default" size="100%">Reconstruction and Enumeration of hv-Convex Polyominoes with Given Horizontal Projection</style></title><secondary-title><style face="normal" font="default" size="100%">Progress in Pattern Recognition, Image Analysis, Computer Vision, and Applications (CIARP)</style></secondary-title><tertiary-title><style face="normal" font="default" size="100%">Lecture Notes in Computer Science</style></tertiary-title><alt-title><style face="normal" font="default" size="100%">LNCS</style></alt-title></titles><dates><year><style  face="normal" font="default" size="100%">2013</style></year><pub-dates><date><style  face="normal" font="default" size="100%">Nov 2013</style></date></pub-dates></dates><number><style face="normal" font="default" size="100%">8258</style></number><publisher><style face="normal" font="default" size="100%">Springer</style></publisher><pub-location><style face="normal" font="default" size="100%">Heidelberg; London; New York</style></pub-location><pages><style face="normal" font="default" size="100%">100 - 107</style></pages><isbn><style face="normal" font="default" size="100%">978-3-642-41821-1</style></isbn><language><style face="normal" font="default" size="100%">eng</style></language><work-type><style face="normal" font="default" size="100%">Conference paper</style></work-type><notes><style face="normal" font="default" size="100%">ScopusID: 84893181366doi: 10.1007/978-3-642-41822-8_13</style></notes></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>17</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Norbert Hantos</style></author><author><style face="normal" font="default" size="100%">Péter Balázs</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">The reconstruction of polyominoes from horizontal and vertical projections and morphological skeleton is NP-complete</style></title><secondary-title><style face="normal" font="default" size="100%">FUNDAMENTA INFORMATICAE</style></secondary-title><short-title><style face="normal" font="default" size="100%">FUND INFOR</style></short-title></titles><dates><year><style  face="normal" font="default" size="100%">2013</style></year><pub-dates><date><style  face="normal" font="default" size="100%">2013</style></date></pub-dates></dates><volume><style face="normal" font="default" size="100%">125</style></volume><pages><style face="normal" font="default" size="100%">343 - 359</style></pages><isbn><style face="normal" font="default" size="100%">0169-2968</style></isbn><language><style face="normal" font="default" size="100%">eng</style></language><issue><style face="normal" font="default" size="100%">3-4</style></issue><work-type><style face="normal" font="default" size="100%">Journal article</style></work-type><notes><style face="normal" font="default" size="100%">UT: 000322028300009ScopusID: 84881495517doi: 10.3233/FI-2013-868</style></notes></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>47</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Norbert Hantos</style></author><author><style face="normal" font="default" size="100%">Péter Balázs</style></author></authors><secondary-authors><author><style face="normal" font="default" size="100%">Giovanni Ramponi</style></author><author><style face="normal" font="default" size="100%">Sven Lončarić</style></author><author><style face="normal" font="default" size="100%">Alberto Carini</style></author><author><style face="normal" font="default" size="100%">Karen Egiazarian</style></author></secondary-authors></contributors><titles><title><style face="normal" font="default" size="100%">A uniqueness result for reconstructing hv-convex polyominoes from horizontal and vertical projections and morphological skeleton</style></title><secondary-title><style face="normal" font="default" size="100%">Proceedings of International Symposium on Image and Signal Processing and Analysis (ISPA)</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2013</style></year><pub-dates><date><style  face="normal" font="default" size="100%">Sep 2013</style></date></pub-dates></dates><publisher><style face="normal" font="default" size="100%">IEEE</style></publisher><pub-location><style face="normal" font="default" size="100%">Trieste</style></pub-location><pages><style face="normal" font="default" size="100%">788 - 793</style></pages><language><style face="normal" font="default" size="100%">eng</style></language><abstract><style face="normal" font="default" size="100%">&lt;div class=&quot;article&quot;&gt;&lt;p&gt;In this article we study the &lt;span class=&quot;snippet&quot;&gt;uniqueness&lt;/span&gt; of the reconstruction in a special class of 4-connected &lt;span class=&quot;snippet&quot;&gt;hv&lt;/span&gt;-&lt;span class=&quot;snippet&quot;&gt;convex&lt;/span&gt; images, using two &lt;span class=&quot;snippet&quot;&gt;projections&lt;/span&gt; and the so-called &lt;span class=&quot;snippet&quot;&gt;morphological&lt;/span&gt; &lt;span class=&quot;snippet&quot;&gt;skeleton&lt;/span&gt;. Generally, if just the two &lt;span class=&quot;snippet&quot;&gt;projections&lt;/span&gt; are given, there can be exponentially many &lt;span class=&quot;snippet&quot;&gt;hv&lt;/span&gt;-&lt;span class=&quot;snippet&quot;&gt;convex&lt;/span&gt; 4-connected images satisfying them. Knowing the &lt;span class=&quot;snippet&quot;&gt;morphological&lt;/span&gt; &lt;span class=&quot;snippet&quot;&gt;skeleton&lt;/span&gt; in addition, we can reduce the number of solutions. In the studied class, the images are defined by two parameters. We show that the &lt;span class=&quot;snippet&quot;&gt;uniqueness&lt;/span&gt; of their reconstruction depends only on the values of those parameters.&lt;/p&gt;&lt;/div&gt;&lt;p&gt;&amp;nbsp;&lt;/p&gt;</style></abstract><work-type><style face="normal" font="default" size="100%">Conference paper</style></work-type><accession-num><style face="normal" font="default" size="100%">14027951 </style></accession-num></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>5</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Norbert Hantos</style></author><author><style face="normal" font="default" size="100%">Péter Balázs</style></author><author><style face="normal" font="default" size="100%">Kálmán Palágyi</style></author></authors><secondary-authors><author><style face="normal" font="default" size="100%">Reneta P Barneva</style></author><author><style face="normal" font="default" size="100%">Valentin E Brimkov</style></author><author><style face="normal" font="default" size="100%">Jake K Aggarwal</style></author></secondary-authors></contributors><titles><title><style face="normal" font="default" size="100%">Binary image reconstruction from two projections and skeletal information</style></title><secondary-title><style face="normal" font="default" size="100%">Combinatorial Image Analysis</style></secondary-title><tertiary-title><style face="normal" font="default" size="100%">Lecture Notes in Computer Science</style></tertiary-title><short-title><style face="normal" font="default" size="100%">LNCS</style></short-title></titles><dates><year><style  face="normal" font="default" size="100%">2012</style></year><pub-dates><date><style  face="normal" font="default" size="100%">Nov 2012</style></date></pub-dates></dates><number><style face="normal" font="default" size="100%">7655</style></number><publisher><style face="normal" font="default" size="100%">Springer Verlag</style></publisher><pub-location><style face="normal" font="default" size="100%">Berlin; Heidelberg; New York; London; Paris; Tokyo</style></pub-location><pages><style face="normal" font="default" size="100%">263 - 273</style></pages><language><style face="normal" font="default" size="100%">eng</style></language><abstract><style face="normal" font="default" size="100%">&lt;p&gt;In binary tomography, the goal is to reconstruct binary images from a small set of their projections. However, especially when only two projections are used, the task can be extremely underdetermined. In this paper, we show how to reduce ambiguity by using the morphological skeleton of the image as a priori. Three different variants of our method based on Simulated Annealing are tested using artificial binary images, and compared by reconstruction time and error. © 2012 Springer-Verlag.&lt;/p&gt;</style></abstract><work-type><style face="normal" font="default" size="100%">Conference paper</style></work-type><notes><style face="normal" font="default" size="100%">ScopusID: 84869986820doi: 10.1007/978-3-642-34732-0_20</style></notes></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>47</ref-type><contributors></contributors><titles><title><style face="normal" font="default" size="100%">Binary tomography using two projections and morphological skeleton</style></title><secondary-title><style face="normal" font="default" size="100%">Conference of PhD Students in Computer Science</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2012</style></year><pub-dates><date><style  face="normal" font="default" size="100%">June 2012</style></date></pub-dates></dates><publisher><style face="normal" font="default" size="100%">Univ Szeged Institute of Informatics</style></publisher><pub-location><style face="normal" font="default" size="100%">Szeged</style></pub-location><volume><style face="normal" font="default" size="100%">Volume of Extended Abstracts</style></volume><pages><style face="normal" font="default" size="100%">20</style></pages><language><style face="normal" font="default" size="100%">eng</style></language></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>47</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Norbert Hantos</style></author><author><style face="normal" font="default" size="100%">Péter Balázs</style></author><author><style face="normal" font="default" size="100%">Kálmán Palágyi</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">Solving binary tomography from morphological skeleton via optimization</style></title><secondary-title><style face="normal" font="default" size="100%">Veszprém Optimization Conference: Advanced Algorithms (VOCAL)</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2012</style></year><pub-dates><date><style  face="normal" font="default" size="100%">Dec 2012</style></date></pub-dates></dates><publisher><style face="normal" font="default" size="100%">University of Pannonia</style></publisher><pub-location><style face="normal" font="default" size="100%">Veszprém</style></pub-location><pages><style face="normal" font="default" size="100%">42</style></pages><language><style face="normal" font="default" size="100%">eng</style></language><work-type><style face="normal" font="default" size="100%">Conference paper</style></work-type></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>47</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Norbert Hantos</style></author><author><style face="normal" font="default" size="100%">Péter Balázs</style></author></authors><secondary-authors><author><style face="normal" font="default" size="100%">Zoltan Kato</style></author><author><style face="normal" font="default" size="100%">Kálmán Palágyi</style></author></secondary-authors></contributors><titles><title><style face="normal" font="default" size="100%">Mediánszűrés alkalmazása algebrai rekonstrukciós módszerekben</style></title><secondary-title><style face="normal" font="default" size="100%">A Képfeldolgozók és Alakfelismerők Társaságának konferenciája - KÉPAF 2011</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2011</style></year><pub-dates><date><style  face="normal" font="default" size="100%">Jan 2011</style></date></pub-dates></dates><publisher><style face="normal" font="default" size="100%">NJSZT</style></publisher><pub-location><style face="normal" font="default" size="100%">Szeged</style></pub-location><pages><style face="normal" font="default" size="100%">106 - 116</style></pages><language><style face="normal" font="default" size="100%">eng</style></language><work-type><style face="normal" font="default" size="100%">Conference paper</style></work-type></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>5</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Norbert Hantos</style></author><author><style face="normal" font="default" size="100%">Péter Balázs</style></author></authors><secondary-authors><author><style face="normal" font="default" size="100%">George Bebis</style></author><author><style face="normal" font="default" size="100%">Richard Boyle</style></author><author><style face="normal" font="default" size="100%">Bahram Parvin</style></author><author><style face="normal" font="default" size="100%">Darko Koracin</style></author><author><style face="normal" font="default" size="100%">Ronald Chung</style></author><author><style face="normal" font="default" size="100%">Riad Hammound</style></author><author><style face="normal" font="default" size="100%">Muhammad Hussain</style></author><author><style face="normal" font="default" size="100%">Tan Kar-Han</style></author><author><style face="normal" font="default" size="100%">Roger Crawfis</style></author><author><style face="normal" font="default" size="100%">Daniel Thalmann</style></author><author><style face="normal" font="default" size="100%">David Kao</style></author><author><style face="normal" font="default" size="100%">Lisa Avila</style></author></secondary-authors></contributors><titles><title><style face="normal" font="default" size="100%">Image enhancement by median filters in algebraic reconstruction methods: an experimental study</style></title><secondary-title><style face="normal" font="default" size="100%">Advances in Visual Computing</style></secondary-title><tertiary-title><style face="normal" font="default" size="100%">Lecture Notes in Computer Science</style></tertiary-title><short-title><style face="normal" font="default" size="100%">LNCS</style></short-title></titles><dates><year><style  face="normal" font="default" size="100%">2010</style></year><pub-dates><date><style  face="normal" font="default" size="100%">Nov-Dec 2010</style></date></pub-dates></dates><number><style face="normal" font="default" size="100%">6455</style></number><publisher><style face="normal" font="default" size="100%">Springer Verlag</style></publisher><pub-location><style face="normal" font="default" size="100%">Las Vegas, NV, USA</style></pub-location><pages><style face="normal" font="default" size="100%">339 - 348</style></pages><isbn><style face="normal" font="default" size="100%">978-3-642-17276-2</style></isbn><language><style face="normal" font="default" size="100%">eng</style></language><abstract><style face="normal" font="default" size="100%">&lt;div class=&quot;abstract-content formatted&quot; itemprop=&quot;description&quot;&gt;&lt;p class=&quot;a-plus-plus&quot;&gt;Algebraic 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.&lt;/p&gt;&lt;/div&gt;&lt;p&gt;&amp;nbsp;&lt;/p&gt;</style></abstract><work-type><style face="normal" font="default" size="100%">Conference paper</style></work-type><notes><style face="normal" font="default" size="100%">UT: 000290358400035ScopusID: 78650793785doi: 10.1007/978-3-642-17277-9_35</style></notes></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>47</ref-type><contributors></contributors><titles><title><style face="normal" font="default" size="100%">Median filtering in algebraic reconstruction methods</style></title><secondary-title><style face="normal" font="default" size="100%">Conference of PhD Students in Computer Science. Volume of Extended Abstracts.</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2010</style></year><pub-dates><date><style  face="normal" font="default" size="100%">June 2010</style></date></pub-dates></dates><publisher><style face="normal" font="default" size="100%">University of Szeged</style></publisher><pub-location><style face="normal" font="default" size="100%">Szeged, Hungary</style></pub-location><pages><style face="normal" font="default" size="100%">36</style></pages><language><style face="normal" font="default" size="100%">eng</style></language><work-type><style face="normal" font="default" size="100%">Abstract</style></work-type></record></records></xml>