Discrete tomography: Determination of finite sets by X-rays
DOI10.1090/S0002-9947-97-01741-8zbMATH Open0873.52015OpenAlexW1662624818MaRDI QIDQ4336565FDOQ4336565
Peter Gritzmann, Richard J. Gardner
Publication date: 13 May 1997
Published in: Transactions of the American Mathematical Society (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1090/s0002-9947-97-01741-8
Recommendations
Pattern recognition, speech recognition (68T10) Biomedical imaging and signal processing (92C55) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Lattice polytopes in convex geometry (including relations with commutative algebra and algebraic geometry) (52B20) Lattices and convex bodies in (n) dimensions (aspects of discrete geometry) (52C07) Convex sets in (n) dimensions (including convex hypersurfaces) (52A20) Statistical mechanics of crystals (82D25) Lattices and convex bodies in (2) dimensions (aspects of discrete geometry) (52C05)
Cites Work
- Title not available (Why is that?)
- Sets uniquely determined by projections on axes. II: Discrete case
- Reconstructing convex polyominoes from horizontal and vertical projections
- On the computational complexity of reconstructing lattice sets from their \(X\)-rays
- Geometric tomography.
- \(p\)-adic numbers. An introduction
- Successive Determination and Verification of Polytopes by their X-Rays
- The reconstruction of binary patterns from their projections
- A Problem of Plane Measure
- Reconstruction of pictures from their projections
- An algorithm for reconstructing convex bodies from their projections
- On Hammer's X-Ray Problem
- Reconstructing plane sets from projections
- Title not available (Why is that?)
- On projections of probability distributions
- On the determination of probability distributions of more dimensions by their projections
Cited In (65)
- The smallest sets of points not determined by their X-rays
- Reconstruction of convex lattice sets from tomographic projections in quartic time
- A rounding theorem for unique binary tomographic reconstruction
- Reconstruction of 4- and 8-connected convex discrete sets from row and column projections
- X-rays characterizing some classes of discrete sets
- Discrete tomography determination of bounded lattice sets from four X-rays
- Scanning integer matrices by means of two rectangular windows
- Adaptive Reconstruction of Discrete-Valued Objects from few Projections
- Histogram tomography
- On the geometric structure of lattice \(U\)-polygons
- Ghosts in discrete tomography
- Algorithms for linear time reconstruction by discrete tomography
- Analysis on the strip-based projection model for discrete tomography
- Prior Learning and Convex-Concave Regularization of Binary Tomography
- Determination of Q-convex sets by X-rays
- Stability in discrete tomography: some positive results
- Reconstruction of hv-convex sets by their coordinate X-ray functions
- Solving the Two Color Problem: An Heuristic Algorithm
- Further steps on the reconstruction of convex polyominoes from orthogonal projections
- Symmetric products of the line: Embeddings and retractions
- Homometry and direct-sum decompositions of lattice-convex sets
- 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
- Boundary ghosts for discrete tomography
- On the reconstruction of planar lattice-convex sets from the covariogram
- On a discrete version of Alexandrov's projection theorem
- Reconstruction of convex polyominoes from orthogonal projections of their contours
- Reconstruction of domino tiling from its two orthogonal projections
- An experimental study of the stability problem in discrete tomography
- A Brunn-Minkowski inequality for the integer lattice
- Discrete tomography determination of bounded sets in \(\mathbb{Z}^n\)
- Convex decomposition of \(U\)-polygons
- An algorithm reconstructing convex lattice sets.
- A geometrical characterization of regions of uniqueness and applications to discrete tomography
- On the computational complexity of reconstructing lattice sets from their \(X\)-rays
- Discrete tomography for inscribable lattice sets
- Discrete Point X-Rays of Convex Lattice Sets
- Discrete Q-Convex Sets Reconstruction from Discrete Point X-Rays
- The projections of convex lattice sets of points in \(\mathbb{E}^2\)
- Discrete tomography by convex--concave regularization and D.C. programming
- Determination of Q-convex bodies by X-rays
- On some geometric aspects of the class of \(hv\)-convex switching components
- On the existence of \(U\)-polygons of class \(c\geq 4\) in planar point sets
- Unique reconstruction of bounded sets in discrete tomography
- A discrete version of Koldobsky's slicing inequality
- Successive Determination and Verification of Polytopes by their X-Rays
- Ambiguous reconstructions of hv-convex polyominoes
- A solution to Hammer's X-ray reconstruction problem
- An introduction to periodical discrete sets from a tomographical perspective
- Sets determined by finitely many X-rays
- Regular switching components
- Sharp affine stability estimates for Hammer's problem
- On Double-Resolution Imaging and Discrete Tomography
- Error Correction for Discrete Tomography
- Title not available (Why is that?)
- A network flow algorithm for reconstructing binary images from discrete X-rays
- The two-dimensional Prouhet-Tarry-Escott problem
- An algorithm for discrete tomography
- Reconstruction of Convex Sets from One or Two X-rays
- Uniqueness and reconstruction of finite lattice sets from their line sums
- Estimation of the mean normal measure from flat sections
- Inversion of Band-Limited Discrete Fourier Transforms of Binary Images: Uniqueness and Algorithms
- How many points can be reconstructed from k projections?
- Characterization of hv-convex sequences
This page was built for publication: Discrete tomography: Determination of finite sets by X-rays
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4336565)