@article {2354, title = {A Measure of Directional Convexity Inspired by Binary Tomography}, journal = {Fundamenta Informaticae}, volume = {141}, year = {2015}, month = {Oct 2015}, pages = {151-167}, type = {Journal article}, chapter = {151}, abstract = {

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

}, doi = {10.3233/FI-2015-1269}, author = {P{\'e}ter Bal{\'a}zs and Zolt{\'a}n Ozsv{\'a}r and Tam{\'a}s S{\'a}muel Tasi and L{\'a}szl{\'o} G Ny{\'u}l} } @article {1989, title = {Reconstruction of hv-convex binary matrices from horizontal and vertical projections based on simulated annealing}, year = {2014}, pages = {50}, publisher = {University of Szeged}, type = {Abstract}, address = {Szeged, Hungary}, author = {Zolt{\'a}n Ozsv{\'a}r and P{\'e}ter Bal{\'a}zs} } @conference {1157, title = {A comparison of heuristics for reconstructing hv-convex binary matrices from horizontal and vertical projections}, booktitle = {A K{\'e}pfeldolgoz{\'o}k {\'e}s Alakfelismer{\H o}k T{\'a}rsas{\'a}g{\'a}nak konferenci{\'a}ja - K{\'E}PAF 2013}, year = {2013}, month = {Jan 2013}, pages = {168 - 181}, publisher = {NJSZT-K{\'E}PAF}, organization = {NJSZT-K{\'E}PAF}, type = {Conference paper}, address = {Veszpr{\'e}m}, author = {Zolt{\'a}n Ozsv{\'a}r and P{\'e}ter Bal{\'a}zs}, editor = {L{\'a}szl{\'o} Cz{\'u}ni} } @article {1162, title = {An empirical study of reconstructing hv-convex binary matrices from horizontal and vertical projections}, journal = {ACTA CYBERNETICA-SZEGED}, volume = {21}, year = {2013}, month = {2013}, pages = {149 - 163}, type = {Journal article}, abstract = {

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.

}, isbn = {0324-721X}, author = {Zolt{\'a}n Ozsv{\'a}r and P{\'e}ter Bal{\'a}zs} } @article {1146, title = {Empirical studies of reconstructing hv-convex binary matrices from horizontal and vertical projections}, year = {2012}, month = {June 2012}, pages = {44}, publisher = {University of Szeged, Institute of Informatics}, type = {Abstract}, address = {Szeged}, author = {Zolt{\'a}n Ozsv{\'a}r and P{\'e}ter Bal{\'a}zs} }