On the algorithmic inversion of the discrete Radon transform
From MaRDI portal
Publication:1603700
DOI10.1016/S0304-3975(02)00023-3zbMath0997.68151MaRDI QIDQ1603700
Sven de Vries, Peter Gritzmann
Publication date: 15 July 2002
Published in: Theoretical Computer Science (Search for Journal in Brave)
Integer programming (90C10) Computing methodologies for image processing (68U10) Combinatorics in computer science (68R05)
Related Items
Kronecker products and the RSK correspondence., Analysis on the strip-based projection model for discrete tomography, On the reconstruction of binary and permutation matrices under (binary) tomographic constraints, Additivity obstructions for integral matrices and pyramids, Discrete tomography determination of bounded sets in \(\mathbb{Z}^n\), A full row-rank system matrix generated by the strip-based projection model in discrete tomography, On the computational complexity of reconstructing three-dimensional lattice sets from their two-dimensional \(X\)-rays, Stability of Kronecker coefficients via discrete tomography, Permutohedra and minimal matrices, Minimal matrices and discrete tomography
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Sets uniquely determined by projections on axes. II: Discrete case
- Sets of uniqueness and minimal matrices
- On the computational complexity of reconstructing lattice sets from their \(X\)-rays
- The discrete Radon transform and its approximate inversion via linear programming
- Discrete tomography. Foundations, algorithms, and applications
- A Strongly Polynomial Algorithm to Solve Combinatorial Linear Programs
- Combinatorial Properties of Matrices of Zeros and Ones
- Three-dimensional Statistical Data Security Problems
- The reconstruction of binary patterns from their projections
- On the computational complexity of reconstructing three-dimensional lattice sets from their two-dimensional \(X\)-rays