Reconstruction of binary matrices under fixed size neighborhood constraints

Authors:
S. Brocchi;A. Frosini;C. Picouleau
Affiliations:
Dipartimento di Sistemi e Informatica, V.le Morgagni, 65 - 50134 Firenze, Italy;Dipartimento di Sistemi e Informatica, V.le Morgagni, 65 - 50134 Firenze, Italy;Laboratoire CEDRIC-CNAM, 292 rue Saint Martin - 75003 Paris, France
Venue:
Theoretical Computer Science
Year:
2008

Citing 13
Cited 5

Reconstructing convex polyominoes from horizontal and vertical projections

Theoretical Computer Science
Reconstruction of domino tiling from its two orthogonal projections

Theoretical Computer Science
The reconstruction of polyominoes from their orthogonal projections

Information Processing Letters
Reconstructing polyatomic structures from discrete X-rays: NP-completeness proof for three atoms

Theoretical Computer Science
Reconstruction of convex 2D discrete sets in polynomial time

Theoretical Computer Science
Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness
Tiling with bars under tomographic constraints

Theoretical Computer Science
On tiling under tomographic constraints

Theoretical Computer Science
Using graphs for some discrete tomography problems

Discrete Applied Mathematics
An introduction to periodical discrete sets from a tomographical perspective

Theoretical Computer Science
A solvable case of image reconstruction in discrete tomography

Discrete Applied Mathematics
Advances in Discrete Tomography and Its Applications (Applied and Numerical Harmonic Analysis)

Advances in Discrete Tomography and Its Applications (Applied and Numerical Harmonic Analysis)
Reconstructing an alternate periodical binary matrix from its orthogonal projections

ICTCS'05 Proceedings of the 9th Italian conference on Theoretical Computer Science

Solving some instances of the 2-color problem

DGCI'09 Proceedings of the 15th IAPR international conference on Discrete geometry for computer imagery
Solving the two color problem: an heuristic algorithm

IWCIA'11 Proceedings of the 14th international conference on Combinatorial image analysis
A reconstruction algorithm for a subclass of instances of the 2-color problem

Theoretical Computer Science
On the degree sequences of uniform hypergraphs

DGCI'13 Proceedings of the 17th IAPR international conference on Discrete Geometry for Computer Imagery
Solving Multicolor Discrete Tomography Problems by Using Prior Knowledge

Fundamenta Informaticae - Strategies for Tomography

Quantified Score

Hi-index	5.23

Visualization

Abstract

Using a dynamic programming approach, we prove that a large variety of matrix reconstruction problems from two projections can be solved in polynomial time whenever the number of rows (or columns) is fixed. We also prove some complexity results for several problems concerning the reconstruction of a binary matrix when a neighborhood constraint occurs.