On the computational complexity of reconstructing lattice sets from their X-rays
From MaRDI portal
Publication:1301705
DOI10.1016/S0012-365X(98)00347-1zbMATH Open0947.68160WikidataQ127011891 ScholiaQ127011891MaRDI QIDQ1301705FDOQ1301705
Authors: D. Prangenberg, Richard J. Gardner, Peter Gritzmann 
Publication date: 29 November 1999
Published in: Discrete Mathematics (Search for Journal in Brave)
Recommendations
- On the computational complexity of reconstructing three-dimensional lattice sets from their two-dimensional \(X\)-rays
- scientific article; zbMATH DE number 1551775
- Reconstruction of lattice sets from their horizontal, vertical and diagonal \(X\)-rays
- On the computational complexity of determining polyatomic structures by X-rays
- Reconstructing polyatomic structures from discrete X-rays: NP-completeness proof for three atoms
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- The complexity of computing the permanent
- Sets uniquely determined by projections on axes. II: Discrete case
- Binary vectors partially determined by linear equation systems
- The discrete Radon transform and its approximate inversion via linear programming
- Title not available (Why is that?)
- Title not available (Why is that?)
- The complexity of satisfiability problems
- Reconstructing convex polyominoes from horizontal and vertical projections
- Discrete tomography: Determination of finite sets by X-rays
- Sampling contingency tables
- Switching components and the ambiguity problem in the reconstruction of pictures from their projections
- Three-dimensional Statistical Data Security Problems
- The reconstruction of binary patterns from their projections
- X-rays characterizing some classes of discrete sets
- A Graph Theoretic Approach to Statistical Data Security
- Reconstruction of pictures from their projections
- An algorithm for reconstructing convex bodies from their projections
- Reconstructing plane sets from projections
- On projections of probability distributions
Cited In (53)
- A linear time approach to three-dimensional reconstruction by discrete tomography
- A rounding theorem for unique binary tomographic reconstruction
- Numerical characterization of \(n\)-cube subset partitioning
- X-rays characterizing some classes of discrete sets
- Adaptive thresholding of tomograms by projection distance minimization
- Solving some instances of the 2-color problem
- A short scientific biography of Maurice Nivat
- Discrete tomography determination of bounded lattice sets from four X-rays
- The fewest clues problem of Picross 3D
- Computational complexity of three-dimensional discrete tomography with missing data
- Discrete tomography: Determination of finite sets by X-rays
- On the computational complexity of reconstructing three-dimensional lattice sets from their two-dimensional \(X\)-rays
- Algorithms for linear time reconstruction by discrete tomography
- On the reconstruction of binary and permutation matrices under (binary) tomographic constraints
- Stability results for uniquely determined sets from two directions in discrete tomography
- Generic iterative subset algorithms for discrete tomography
- Further steps on the reconstruction of convex polyominoes from orthogonal projections
- On double-resolution imaging and discrete tomography
- Inversion of Band-Limited Discrete Fourier Transforms of Binary Images: Uniqueness and Algorithms
- The medians of discrete sets
- Colour degree matrices of graphs with at most one cycle
- Hankel and Toeplitz X-rays of permutations
- Reconstructing \(hv\)-convex polyominoes from orthogonal projections
- On the algorithmic inversion of the discrete Radon transform
- Title not available (Why is that?)
- Parallel Cholesky-based reduction for the weighted integer least squares problem
- A note on affinely regular polygons
- Uniqueness in discrete tomography of Delone sets with long-range order
- Algorithms for linear time reconstruction by discrete tomography. II
- Reconstructing polyatomic structures from discrete X-rays: NP-completeness proof for three atoms
- Approximating Bicolored Images from Discrete Projections
- Discrete tomography determination of bounded sets in \(\mathbb{Z}^n\)
- An algorithm reconstructing convex lattice sets.
- Discrete tomography with unknown intensity levels using higher-order statistics
- On the X-rays of permutations
- A reconstruction algorithm for a subclass of instances of the 2-color problem
- On the computational complexity of determining polyatomic structures by X-rays
- Half-regular factorizations of the complete bipartite graph
- Regular switching components
- Discrete tomography of model sets: reconstruction and uniqueness
- Error Correction for Discrete Tomography
- Dynamic discrete tomography
- On polyatomic tomography over abelian groups: some remarks on consistency, tree packings and complexity
- A network flow algorithm for reconstructing binary images from discrete X-rays
- Title not available (Why is that?)
- A new algorithm for 3D binary tomography
- Reconstruction of lattice sets from their horizontal, vertical and diagonal \(X\)-rays
- Constructing bounded degree graphs with prescribed degree and neighbor degree sequences
- DISCRETE TOMOGRAPHIC RECONSTRUCTION OF BINARY IMAGES WITH DISJOINT COMPONENTS USING SHAPE INFORMATION
- An evolutionary algorithm for discrete tomography
- On the Algorithmic Complexity of Minkowski's Reconstruction Theorem
- Fast binary CT using Fourier null space regularization (FNSR)
- Selection of Local Thresholds for Tomogram Segmentation by Projection Distance Minimization
This page was built for publication: On the computational complexity of reconstructing lattice sets from their \(X\)-rays
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1301705)
