A simulated annealing for reconstructing hv-convex binary matrices Page 1 A simulated
annealing for reconstructing hv-convex binary matrices Fethi JARRAY a,b,c,1, Ghassen …

We study the problem of reconstructing hv-convex binary matrices from few projections. We
solve a polynomial time case and we determine some properties of the hv-convex matrices …

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 …

In this paper we summarize the most important generation methods developed for the
subclasses of hv-convex discrete sets. We also present some new generation techniques to …

In this paper, we consider the discret tomography problem (DTP), namely reconstruction
convex binary matrices from their row and column sums respectively H and V, RBM (H, V) …

Discrete tomography deals with the reconstruction of discrete sets from few projections.
Assuming that the set to be reconstructed belongs to a certain class of discrete sets with …

In this paper, we consider a variant of the NP-complete problem of reconstructing HV-convex
binary images from two orthogonal projections, noted by RCBI (H, V). This variant is …

We consider the problem of reconstructing two-dimensional convex binary matrices from
their row and column sums with adjacent ones. Instead of requiring the ones to occur …

In this paper the well-known problem of reconstructing hv-convex polyominoes is
considered from a set of noisy data. Differently from the usual approach of Binary …

One of the basic problems in discrete tomography is the reconstruction of discrete sets from
few projections. Assuming that the set to be reconstructed fulfills some geometrical …