Complexity results for reconstructing binary images with disjoint components from horizontal and vertical projections
From MaRDI portal
Publication:387855
DOI10.1016/j.dam.2013.02.004zbMath1278.05047MaRDI QIDQ387855
Publication date: 17 December 2013
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2013.02.004
permutation matrix; discrete tomography; parameterized complexity; disjoint components; hv-convexity; polynomial-time reconstruction
68U10: Computing methodologies for image processing
05B20: Combinatorial aspects of matrices (incidence, Hadamard, etc.)
68R10: Graph theory (including graph drawing) in computer science
05B25: Combinatorial aspects of finite geometries
Cites Work
- Reconstructing convex polyominoes from horizontal and vertical projections
- On the reconstruction of binary and permutation matrices under (binary) tomographic constraints
- Polyominoes defined by two vectors
- Discrete tomography. Foundations, algorithms, and applications
- The reconstruction of polyominoes from their orthogonal projections
- Reconstruction of convex 2D discrete sets in polynomial time
- Reconstructing \(hv\)-convex polyominoes from orthogonal projections
- Reconstruction of 8-connected but not 4-connected \(hv\)-convex discrete sets
- Advances in discrete tomography and its applications. Some papers based on the presentations at the workshop on discrete tomography and its applications, New York, NY, USA, June 13--15, 2005.
- Reconstruction of Canonical hv-Convex Discrete Sets from Horizontal and Vertical Projections
- DISCRETE TOMOGRAPHIC RECONSTRUCTION OF BINARY IMAGES WITH DISJOINT COMPONENTS USING SHAPE INFORMATION
- The reconstruction of binary patterns from their projections
- Checker Boards and Polyominoes
- Comparison of algorithms for reconstructing \(hv\)-convex discrete sets
- Reconstruction of 4- and 8-connected convex discrete sets from row and column projections
