A rounding theorem for unique binary tomographic reconstruction
From MaRDI portal
Publication:2274077
DOI10.1016/j.dam.2019.05.005zbMath1427.68339arXiv1707.05231OpenAlexW2738022247WikidataQ127670270 ScholiaQ127670270MaRDI QIDQ2274077
Silvia M. C. Pagani, Paolo Dulio
Publication date: 19 September 2019
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1707.05231
Computing methodologies for image processing (68U10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)
Related Items (4)
Characterization of hv-convex sequences ⋮ Error Correction for Discrete Tomography ⋮ Algorithms for linear time reconstruction by discrete tomography. II ⋮ On some geometric aspects of the class of \(hv\)-convex switching components
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Bounds on the quality of reconstructed images in binary tomography
- Discrete tomography determination of bounded lattice sets from four X-rays
- Ghosts in discrete tomography
- Analysis on the strip-based projection model for discrete tomography
- Stability results for uniquely determined sets from two directions in discrete tomography
- An instance of the cutting stock problem for which the rounding property does not hold
- The modified integer round-up property of the one-dimensional cutting stock problem
- Sets uniquely determined by projections on axes. II: Discrete case
- On the computational complexity of reconstructing lattice sets from their \(X\)-rays
- Maximal \(N\)-ghosts and minimal information recovery from \(N\) projected views of an array
- Bounds for discrete tomography solutions
- Discrete tomography determination of bounded sets in \(\mathbb{Z}^n\)
- Algebraic aspects of discrete tomography
- Mixed Integer Linear Programming Formulation Techniques
- Bounds for Approximate Discrete Tomography Solutions
- On the difference between solutions of discrete tomography problems
- On the difference between solutions of discrete tomography problems II
- Growth of Discrete Projection Ghosts Created by Iteration
- Properties of Minimal Ghosts
- Projection Selection Dependency in Binary Tomography
- Non-additive Bounded Sets of Uniqueness in ℤ n
- Uniqueness in Discrete Tomography: Three Remarks and a Corollary
- Integer Rounding for Polymatroid and Branching Optimization Problems
- The cutting stock problem and integer rounding
- Discrete tomography: Determination of finite sets by X-rays
- On the Non-additive Sets of Uniqueness in a Finite Grid
- On J-additivity and Bounded Additivity
- Probabilistic Reconstruction of hv-convex Polyominoes from Noisy Projection Data
- DART: A Practical Reconstruction Algorithm for Discrete Tomography
This page was built for publication: A rounding theorem for unique binary tomographic reconstruction
