Approximating Bicolored Images from Discrete Projections
From MaRDI portal
Publication:3003545
DOI10.1007/978-3-642-21073-0_28zbMath1330.68304OpenAlexW1856641216MaRDI QIDQ3003545
Publication date: 27 May 2011
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-21073-0_28
Computing methodologies for image processing (68U10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Approximation algorithms (68W25)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A theorem on flows in networks
- The network flows approach for matrices with given row and column sums
- On the computational complexity of reconstructing lattice sets from their \(X\)-rays
- On tiling under tomographic constraints.
- On the computational complexity of determining polyatomic structures by X-rays
- On the precise number of (0, 1)-matrices in \({\mathfrak A}(R,S)\)
- A solvable case of image reconstruction in discrete tomography
- Solving problems of discrete tomography application in workforce scheduling
- An evolutionary algorithm for discrete tomography
- Using graphs for some discrete tomography problems
- 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.
- Beyond the flow decomposition barrier
- Combinatorial Properties of Matrices of Zeros and Ones
- Reconstructing 3-Colored Grids from Horizontal and Vertical Projections Is NP-hard
- Solving Some Instances of the 2-Color Problem
- Reconstructing polyatomic structures from discrete X-rays: NP-completeness proof for three atoms
- X-rays characterizing some classes of discrete sets
This page was built for publication: Approximating Bicolored Images from Discrete Projections
