On the computational complexity of reconstructing three-dimensional lattice sets from their two-dimensional \(X\)-rays
From MaRDI portal
Publication:5955125
DOI10.1016/S0024-3795(01)00437-2zbMath1007.65109MaRDI QIDQ5955125
No author found.
Publication date: 7 February 2002
Published in: Linear Algebra and its Applications (Search for Journal in Brave)
Biomedical imaging and signal processing (92C55) Signal theory (characterization, reconstruction, filtering, etc.) (94A12) Radon transform (44A12) Numerical methods for integral transforms (65R10)
Related Items (9)
On vanishing of Kronecker coefficients ⋮ Kronecker products and the RSK correspondence. ⋮ 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\) ⋮ Stability of Kronecker coefficients via discrete tomography ⋮ Permutohedra and minimal matrices ⋮ Minimal matrices and discrete tomography ⋮ On the algorithmic inversion of the discrete Radon transform
Cites Work
- Unnamed Item
- Unnamed Item
- Reconstructing convex polyominoes from horizontal and vertical projections
- A theorem on flows in networks
- On the reconstruction of binary and permutation matrices under (binary) tomographic constraints
- Matrices of zeros and ones with fixed row and column sum vectors
- On the computational complexity of reconstructing lattice sets from their \(X\)-rays
- On the algorithmic inversion of the discrete Radon transform
- Reconstructing \(hv\)-convex polyominoes from orthogonal projections
- Approximating Binary Images from Discrete X-Rays
- Combinatorial Properties of Matrices of Zeros and Ones
- Three-dimensional Statistical Data Security Problems
This page was built for publication: On the computational complexity of reconstructing three-dimensional lattice sets from their two-dimensional \(X\)-rays
