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