<?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%">Péter Balázs</style></author><author><style face="normal" font="default" size="100%">Zoltán Ozsvár</style></author><author><style face="normal" font="default" size="100%">Tamás Sámuel Tasi</style></author><author><style face="normal" font="default" size="100%">László G Nyúl</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">A Measure of Directional Convexity Inspired by Binary Tomography</style></title><secondary-title><style face="normal" font="default" size="100%">Fundamenta Informaticae</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%">Oct 2015</style></date></pub-dates></dates><volume><style face="normal" font="default" size="100%">141</style></volume><pages><style face="normal" font="default" size="100%">151-167</style></pages><language><style face="normal" font="default" size="100%">eng</style></language><abstract><style face="normal" font="default" size="100%">&lt;p&gt;&lt;span&gt;Inspired 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. &lt;/span&gt;&lt;span class=&quot;below-fold&quot; data-below-fold=&quot;FI1269&quot;&gt;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. &lt;/span&gt;&lt;/p&gt;</style></abstract><issue><style face="normal" font="default" size="100%">2-3</style></issue><work-type><style face="normal" font="default" size="100%">Journal article</style></work-type><section><style face="normal" font="default" size="100%">151</style></section></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%">Zoltán Ozsvár</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%">Reconstruction of hv-convex binary matrices from horizontal and vertical projections based on simulated annealing</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%">50</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>47</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Zoltán Ozsvár</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%">László Czúni</style></author></secondary-authors></contributors><titles><title><style face="normal" font="default" size="100%">A comparison of heuristics for reconstructing hv-convex binary matrices from horizontal and vertical projections</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%">168 - 181</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>17</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Zoltán Ozsvár</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%">An empirical study of reconstructing hv-convex binary matrices from horizontal and vertical projections</style></title><secondary-title><style face="normal" font="default" size="100%">ACTA CYBERNETICA-SZEGED</style></secondary-title><short-title><style face="normal" font="default" size="100%">ACTA CYBERN-SZEGED</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%">21</style></volume><pages><style face="normal" font="default" size="100%">149 - 163</style></pages><isbn><style face="normal" font="default" size="100%">0324-721X</style></isbn><language><style face="normal" font="default" size="100%">eng</style></language><abstract><style face="normal" font="default" size="100%">&lt;p&gt;The 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.&lt;/p&gt;&lt;p&gt;&amp;nbsp;&lt;/p&gt;</style></abstract><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%">Zoltán Ozsvár</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%">Empirical studies of reconstructing hv-convex binary matrices from horizontal and vertical projections</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%">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%">University of Szeged, Institute of Informatics</style></publisher><pub-location><style face="normal" font="default" size="100%">Szeged</style></pub-location><pages><style face="normal" font="default" size="100%">44</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>