Algorithms for linear time reconstruction by discrete tomography. II
From MaRDI portal
Publication:2028077
Abstract: The reconstruction of an unknown function from its line sums is the aim of discrete tomography. However, two main aspects prevent reconstruction from being an easy task. In general, many solutions are allowed due to the presence of the switching functions. Even when uniqueness conditions are available, results about the NP-hardness of reconstruction algorithms make their implementation inefficient when the values of are in certain sets. We show that this is not the case when takes values in a field or a unique factorization domain, such as or . We present a linear time reconstruction algorithm (in the number of directions and in the size of the grid), which outputs the original function values for all points outside of the switching domains. Freely chosen values are assigned to the other points, namely, those with ambiguities. Examples are provided.
Recommendations
- Algorithms for linear time reconstruction by discrete tomography
- An algorithm for discrete tomography
- scientific article; zbMATH DE number 2086609
- Analysis and optimization of an algorithm for discrete tomography
- scientific article; zbMATH DE number 1551782
- Discrete tomography. Foundations, algorithms, and applications
- Fast Approximation of Algebraic Reconstruction Methods for Tomography
- An algebraic framework for discrete tomography: revealing the structure of dependencies
- scientific article; zbMATH DE number 869701
- Algebraic discrete tomography
Cites work
- scientific article; zbMATH DE number 45971 (Why is no real title available?)
- scientific article; zbMATH DE number 3599866 (Why is no real title available?)
- A geometrical characterization of regions of uniqueness and applications to discrete tomography
- A rounding theorem for unique binary tomographic reconstruction
- Algebraic aspects of discrete tomography
- Algorithms for linear time reconstruction by discrete tomography
- Bounds for discrete tomography solutions
- Combinatorial Properties of Matrices of Zeros and Ones
- DART: A Practical Reconstruction Algorithm for Discrete Tomography
- Discrete tomography determination of bounded lattice sets from four X-rays
- Discrete tomography: Determination of finite sets by X-rays
- Fast Approximation of Algebraic Reconstruction Methods for Tomography
- Fundamentals of Computerized Tomography
- Geometrical characterization of the uniqueness regions under special sets of three directions in discrete tomography
- On the computational complexity of determining polyatomic structures by X-rays
- On the computational complexity of reconstructing lattice sets from their X-rays
- Regions of uniqueness quickly reconstructed by three directions in discrete tomography
- Sets uniquely determined by projections on axes. II: Discrete case
- The mathematics of computerized tomography
- Unique reconstruction of bounded sets in discrete tomography
- Uniqueness regions under sets of generic projections in discrete tomography
Cited in
(8)- Discrete tomography in four directions
- Algorithms for linear time reconstruction by discrete tomography
- Boundary ghosts for discrete tomography
- A linear time approach to three-dimensional reconstruction by discrete tomography
- Three-dimensional maximal and boundary ghosts
- Algebraic aspects of discrete tomography
- Error Correction for Discrete Tomography
- An algorithm for discrete tomography
This page was built for publication: Algorithms for linear time reconstruction by discrete tomography. II
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2028077)
