Add to ORKGIn this paper we introduce a new class of binary matrices whose entries show periodical configurations, and we furnish a first approach to their analysis from a tomographical point of view. In particular we propose a polynomial-time algorithm for reconstructing matrices with a special periodical behavior from their horizontal and vertical projections. We succeeded in our aim by using a reduction involving polyominoes which can be characterized by means of 2 − SAT formulas
In the field of Discrete Tomography, the 2-color problem consists in reconstructing a matrix whose e...
In this paper, we propose a new class of techniques to identify periodicities in data. We target the...
Discrete tomography deals with image reconstruction of an object with a finitely many gray levels (s...
AbstractIn this paper we introduce a new class of binary matrices whose entries show periodical conf...
In this paper we introduce a new class of binary matrices whose entries show periodical configuratio...
The paper studies the problem of reconstructing binary matrices constrained by binary tomographic in...
AbstractThe paper studies the problem of reconstructing binary matrices constrained by binary tomogr...
We study the problem of reconstructing a three dimensional binary matrices whose interiors are only ...
AbstractReconstructing discrete bidimensional sets from their projections is involved in many differ...
AbstractOne of the main problems in discrete tomography is the reconstruction of binary matrices fro...
Abstract. We consider a generalization of the classical binary matrix reconstruction problem by cons...
AbstractA discretized rotation acts on a pixel grid: the edges of the neighborhood relation are affe...
A full row-rank system matrix generated by the strip-based projection model along one scanning direc...
AbstractA plane partition is a p×q matrix A=(aij), where 1⩽i⩽p and 1⩽j⩽q, with non-negative integer ...
A \textit{plane partition} is a $p\times q$ matrix $A=(a_{ij})$, where $1\leq i\leq p$ and $1\leq j\...
In the field of Discrete Tomography, the 2-color problem consists in reconstructing a matrix whose e...
In this paper, we propose a new class of techniques to identify periodicities in data. We target the...
Discrete tomography deals with image reconstruction of an object with a finitely many gray levels (s...
AbstractIn this paper we introduce a new class of binary matrices whose entries show periodical conf...
In this paper we introduce a new class of binary matrices whose entries show periodical configuratio...
The paper studies the problem of reconstructing binary matrices constrained by binary tomographic in...
AbstractThe paper studies the problem of reconstructing binary matrices constrained by binary tomogr...
We study the problem of reconstructing a three dimensional binary matrices whose interiors are only ...
AbstractReconstructing discrete bidimensional sets from their projections is involved in many differ...
AbstractOne of the main problems in discrete tomography is the reconstruction of binary matrices fro...
Abstract. We consider a generalization of the classical binary matrix reconstruction problem by cons...
AbstractA discretized rotation acts on a pixel grid: the edges of the neighborhood relation are affe...
A full row-rank system matrix generated by the strip-based projection model along one scanning direc...
AbstractA plane partition is a p×q matrix A=(aij), where 1⩽i⩽p and 1⩽j⩽q, with non-negative integer ...
A \textit{plane partition} is a $p\times q$ matrix $A=(a_{ij})$, where $1\leq i\leq p$ and $1\leq j\...
In the field of Discrete Tomography, the 2-color problem consists in reconstructing a matrix whose e...
In this paper, we propose a new class of techniques to identify periodicities in data. We target the...
Discrete tomography deals with image reconstruction of an object with a finitely many gray levels (s...