This paper deals with the reconstruction of integer matrices from rectangular scans. In particular, since the case of one rectangular scan has already been treated in a previous paper, we consider two rectangular scans, given as two integer matrices, and we investigate the existence and the possibility of reconstruction of a third binary matrix which is compatible with them. Furthermore, our inspection implies interesting side results about the number of these reconstructed matrices for different choices of the dimensions of two windows used in the input scans
This paper deals with the reconstruction of binary matrices having exactly-1-4-adjacency constraints...
Abstract. We consider a generalization of the classical binary matrix reconstruction problem by cons...
We consider a variant of the NP-hard problem of reconstructing hv-convex binary matrices from two pr...
This paper deals with the reconstruction of integer matrices from rectangular scans. In particular, ...
AbstractThis paper deals with the reconstruction of integer matrices from rectangular scans. In part...
AbstractA binary matrix can be scanned by moving a fixed rectangular window (sub-matrix) across it, ...
We prove two small results on the reconstruction of binary matrices from their absorbed projections:...
We study the problem of reconstructing a three dimensional binary matrices whose interiors are only ...
In this paperweconsider the problem of reconstructing a binary matrix from absorbed projections, as ...
We consider the problem of reconstructing two-dimensional convex binary matrices from their row and ...
AbstractThe paper studies the problem of reconstructing binary matrices constrained by binary tomogr...
The paper studies the problem of reconstructing binary matrices constrained by binary tomographic in...
A full row-rank system matrix generated by scans along two directions in discrete tomography was rec...
We consider a variant of the NP-hard problem of reconstructing hv-convex binary matrices from two pr...
We are concerned with binary matrix reconstruction from their orthogonal projections. To the basic p...
This paper deals with the reconstruction of binary matrices having exactly-1-4-adjacency constraints...
Abstract. We consider a generalization of the classical binary matrix reconstruction problem by cons...
We consider a variant of the NP-hard problem of reconstructing hv-convex binary matrices from two pr...
This paper deals with the reconstruction of integer matrices from rectangular scans. In particular, ...
AbstractThis paper deals with the reconstruction of integer matrices from rectangular scans. In part...
AbstractA binary matrix can be scanned by moving a fixed rectangular window (sub-matrix) across it, ...
We prove two small results on the reconstruction of binary matrices from their absorbed projections:...
We study the problem of reconstructing a three dimensional binary matrices whose interiors are only ...
In this paperweconsider the problem of reconstructing a binary matrix from absorbed projections, as ...
We consider the problem of reconstructing two-dimensional convex binary matrices from their row and ...
AbstractThe paper studies the problem of reconstructing binary matrices constrained by binary tomogr...
The paper studies the problem of reconstructing binary matrices constrained by binary tomographic in...
A full row-rank system matrix generated by scans along two directions in discrete tomography was rec...
We consider a variant of the NP-hard problem of reconstructing hv-convex binary matrices from two pr...
We are concerned with binary matrix reconstruction from their orthogonal projections. To the basic p...
This paper deals with the reconstruction of binary matrices having exactly-1-4-adjacency constraints...
Abstract. We consider a generalization of the classical binary matrix reconstruction problem by cons...
We consider a variant of the NP-hard problem of reconstructing hv-convex binary matrices from two pr...