Add to ORKGWe are concerned with binary matrix reconstruction from their orthogonal projections. To the basic problem we add new kinds of constraints such as adjacency constraints among neighbors, and bounded distance. Complexity results and polynomial time algorithms are given
We consider a variant of the NP-hard problem of reconstructing hv-convex binary matrices from two pr...
AbstractThe reconstruction of hv-convex binary matrices from their absorbed projections is considere...
AbstractIn earlier work, a stochastic method for reconstructing certain classes of two-dimensional b...
We are concerned with binary matrix reconstruction from their orthogonal projections. To the basic p...
Given a binary matrix, its horizontal and vertical projections are defined asthe sum of its elements...
This paper deals with the reconstruction of binary matrices having exactly-1-4-adjacency constraints...
Our focus is on the problem of reconstructing a binary matrix M from its vertical and horizontal pro...
AbstractUsing a dynamic programming approach, we prove that a large variety of matrix reconstruction...
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...
We study the problem of reconstructing a three dimensional binary matrices whose interiors are only ...
We study the problem of reconstructing hv-convex binary matrices from few projections. We solve a po...
In this paperweconsider the problem of reconstructing a binary matrix from absorbed projections, as ...
The reconstructing of an image from its projections is formulated and solved as a constraint optimiz...
Abstract—In this paper we establish the connection between the Orthogonal Optical Codes (OOC) and bi...
We consider a variant of the NP-hard problem of reconstructing hv-convex binary matrices from two pr...
AbstractThe reconstruction of hv-convex binary matrices from their absorbed projections is considere...
AbstractIn earlier work, a stochastic method for reconstructing certain classes of two-dimensional b...
We are concerned with binary matrix reconstruction from their orthogonal projections. To the basic p...
Given a binary matrix, its horizontal and vertical projections are defined asthe sum of its elements...
This paper deals with the reconstruction of binary matrices having exactly-1-4-adjacency constraints...
Our focus is on the problem of reconstructing a binary matrix M from its vertical and horizontal pro...
AbstractUsing a dynamic programming approach, we prove that a large variety of matrix reconstruction...
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...
We study the problem of reconstructing a three dimensional binary matrices whose interiors are only ...
We study the problem of reconstructing hv-convex binary matrices from few projections. We solve a po...
In this paperweconsider the problem of reconstructing a binary matrix from absorbed projections, as ...
The reconstructing of an image from its projections is formulated and solved as a constraint optimiz...
Abstract—In this paper we establish the connection between the Orthogonal Optical Codes (OOC) and bi...
We consider a variant of the NP-hard problem of reconstructing hv-convex binary matrices from two pr...
AbstractThe reconstruction of hv-convex binary matrices from their absorbed projections is considere...
AbstractIn earlier work, a stochastic method for reconstructing certain classes of two-dimensional b...