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.

1 aBalázs, Péter1 aOzsvár, Zoltán1 aTasi, Tamás Sámuel1 aNyúl, László, G uhttps://www.inf.u-szeged.hu/en/publication/a-measure-of-directional-convexity-inspired-by-binary-tomography00601nas a2200121 4500008004100000245011800041210006900159260004200228300000700270100002100277700002000298856016100318 2014 eng d00aReconstruction of hv-convex binary matrices from horizontal and vertical projections based on simulated annealing0 aReconstruction of hvconvex binary matrices from horizontal and v aSzeged, HungarybUniversity of Szeged a501 aOzsvár, Zoltán1 aBalázs, Péter uhttps://www.inf.u-szeged.hu/en/publication/reconstruction-of-hv-convex-binary-matrices-from-horizontal-and-vertical-projections-based-on-simulated-annealing00635nas a2200133 4500008004100000245011700041210006900158260003800227300001400265100002100279700002000300700002100320856016000341 2013 eng d00aA comparison of heuristics for reconstructing hv-convex binary matrices from horizontal and vertical projections0 acomparison of heuristics for reconstructing hvconvex binary matr aVeszprémbNJSZT-KÉPAFcJan 2013 a168 - 1811 aOzsvár, Zoltán1 aBalázs, Péter1 aCzúni, László uhttps://www.inf.u-szeged.hu/en/publication/a-comparison-of-heuristics-for-reconstructing-hv-convex-binary-matrices-from-horizontal-and-vertical-projections01385nas a2200157 4500008004100000020001400041245010800055210006900163260000900232300001400241490000700255520077300262100002101035700002001056856015101076 2013 eng d a0324-721X00aAn empirical study of reconstructing hv-convex binary matrices from horizontal and vertical projections0 aempirical study of reconstructing hvconvex binary matrices from c2013 a149 - 1630 v213 aThe reconstruction of hv-convex binary matrices (or equivalently, binary images) from their horizontal and vertical projections is proved to be NP-hard. In this paper we take a closer look at the difficulty of the problem. We investigate different heuristic reconstruction algorithms of the class, and compare them from the viewpoint of running-time and reconstruction quality. Using a large set of test images of different sizes and with varying number of components, we show that the reconstruction quality can depend not only on the size of the image, but on the number and location of its components, too. We also reveal that the reconstruction time can also be affected by the number of the so-called switching components present in the image.

1 aOzsvár, Zoltán1 aBalázs, Péter uhttps://www.inf.u-szeged.hu/en/publication/an-empirical-study-of-reconstructing-hv-convex-binary-matrices-from-horizontal-and-vertical-projections00607nas a2200121 4500008004100000245010700041210006900148260007000217300000700287100002100294700002000315856015000335 2012 eng d00aEmpirical studies of reconstructing hv-convex binary matrices from horizontal and vertical projections0 aEmpirical studies of reconstructing hvconvex binary matrices fro aSzegedbUniversity of Szeged, Institute of InformaticscJune 2012 a441 aOzsvár, Zoltán1 aBalázs, Péter uhttps://www.inf.u-szeged.hu/en/publication/empirical-studies-of-reconstructing-hv-convex-binary-matrices-from-horizontal-and-vertical-projections