Algebraic aspects of discrete tomography
From MaRDI portal
Publication:2717078
DOI10.1515/crll.2001.037zbMath1058.92029OpenAlexW2083272543WikidataQ106102289 ScholiaQ106102289MaRDI QIDQ2717078
Publication date: 13 June 2001
Published in: Journal für die reine und angewandte Mathematik (Crelles Journal) (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1515/crll.2001.037
Related Items (33)
On bounded additivity in discrete tomography ⋮ A network flow algorithm for reconstructing binary images from discrete X-rays ⋮ On the geometric structure of lattice \(U\)-polygons ⋮ A geometrical characterization of regions of uniqueness and applications to discrete tomography ⋮ Bounds on the quality of reconstructed images in binary tomography ⋮ Discrete tomography determination of bounded lattice sets from four X-rays ⋮ Ghosts in discrete tomography ⋮ Characterization of hv-convex sequences ⋮ Error Correction for Discrete Tomography ⋮ Algebraic aspects of emission tomography with absorption. ⋮ Inversion of Band-Limited Discrete Fourier Transforms of Binary Images: Uniqueness and Algorithms ⋮ Computing the Hausdorff Boundary Measure of Semialgebraic Sets ⋮ A full row-rank system matrix generated along two directions in discrete tomography ⋮ Analysis on the strip-based projection model for discrete tomography ⋮ Convex decomposition of \(U\)-polygons ⋮ Discrete tomography determination of bounded sets in \(\mathbb{Z}^n\) ⋮ The smallest sets of points not determined by their X-rays ⋮ Algorithms for linear time reconstruction by discrete tomography ⋮ A rounding theorem for unique binary tomographic reconstruction ⋮ An algorithm for discrete tomography ⋮ Algorithms for linear time reconstruction by discrete tomography. II ⋮ Boundary ghosts for discrete tomography ⋮ Construction of a full row-rank matrix system for multiple scanning directions in discrete tomography ⋮ Generic iterative subset algorithms for discrete tomography ⋮ Three-dimensional maximal and boundary ghosts ⋮ On some geometric aspects of the class of \(hv\)-convex switching components ⋮ Power sum polynomials in a discrete tomography perspective ⋮ Ambiguous reconstructions of hv-convex polyominoes ⋮ Power sum polynomials and the ghosts behind them ⋮ Analysis and optimization of an algorithm for discrete tomography ⋮ Unique reconstruction of bounded sets in discrete tomography ⋮ Reconstruction of measurable sets from two generalized projections ⋮ An efficient algorithm for reconstructing binary matrices from horizontal and vertical absorbed projections
Cites Work
This page was built for publication: Algebraic aspects of discrete tomography
