01550nas a2200145   4500008004100000020001400041245009800055210006900153260004800222300001400270490000700284520095900291100002001250856013401270       2008                        eng d  a0324-721X00aOn the ambiguity of reconstructing hv-convex binary matrices with decomposable configurations0 aambiguity of reconstructing hvconvex binary matrices with decomp  aSzeged, HungarybUniversity of Szegedc2008  a367 - 3770 v183 a<p><tt>Reconstructing binary matrices from their row, column, diagonal, and antidiagonal sums (also called projections) plays a central role in discrete tomography. One of the main difficulties in this task is that in certain cases the projections do not uniquely determine the binary matrix. This can yield an extremely large number of (sometimes very different) solutions. This ambiguity can be reduced by having some prior knowledge about the matrix to be reconstructed. The main challenge here is to find classes of binary matrices where ambiguity is drastically reduced or even completely eliminated. The goal of this paper is to study the class of $hv$-convex matrices which have decomposable configurations from the viewpoint of ambiguity. First, we give a negative result in the case of three projections. Then, we present a heuristic for the reconstruction using four projections and analyze its performance in quality and running time.</tt></p>1 aBalázs, Péter  uhttps://www.inf.szte.hu/publication/on-the-ambiguity-of-reconstructing-hv-convex-binary-matrices-with-decomposable-configurations