Reconstruction of discrete sets from two absorbed projections: an algorithm
From MaRDI portal
Recommendations
- An algorithm for the reconstruction of discrete sets from two projections in presence of absorption
- Reconstruction of discrete sets with absorption
- Discrete Geometry for Computer Imagery
- Reconstruction of 4- and 8-connected convex discrete sets from row and column projections
- scientific article; zbMATH DE number 2087481
Cites work
- A sufficient condition for non-uniqueness in binary tomography with absorption
- Discrete tomography. Foundations, algorithms, and applications
- Geometric tomography.
- scientific article; zbMATH DE number 2079722 (Why is no real title available?)
- scientific article; zbMATH DE number 2087481 (Why is no real title available?)
Cited in
(13)- An algorithm for the reconstruction of discrete sets from two projections in presence of absorption
- An introduction to periodical discrete sets from a tomographical perspective
- A sufficient condition for non-uniqueness in binary tomography with absorption
- The complexity of the reconstruction of (r,h,v) from two projections and an approximation algorithm
- Structure of Total Reconstructed Sets from Given Two Projection Data
- scientific article; zbMATH DE number 1551777 (Why is no real title available?)
- scientific article; zbMATH DE number 1551778 (Why is no real title available?)
- scientific article; zbMATH DE number 2087481 (Why is no real title available?)
- Reconstruction of \(hv\)-convex binary matrices from their absorbed projections
- Discrete Geometry for Computer Imagery
- Discrete Geometry for Computer Imagery
- Reconstruction of 4- and 8-connected convex discrete sets from row and column projections
- Reconstruction of discrete sets with absorption
This page was built for publication: Reconstruction of discrete sets from two absorbed projections: an algorithm
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3438908)
