Error Correction for Discrete Tomography
From MaRDI portal
Publication:6094519
DOI10.3233/fi-222154arXiv2204.12349OpenAlexW4385462338MaRDI QIDQ6094519
Matthew Ceko, Robert Tijdeman, Lajos Hajdu
Publication date: 14 September 2023
Published in: Fundamenta Informaticae (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2204.12349
Biomedical imaging and signal processing (92C55) Image processing (compression, reconstruction, etc.) in information and communication theory (94A08) Linear equations (linear algebraic aspects) (15A06)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A robust image watermarking technique based on quantization noise visibility thresholds
- Sets uniquely determined by projections on axes. II: Discrete case
- On the computational complexity of reconstructing lattice sets from their \(X\)-rays
- On the computational complexity of determining polyatomic structures by X-rays
- Algorithms for linear time reconstruction by discrete tomography
- Algorithms for linear time reconstruction by discrete tomography. II
- Boundary ghosts for discrete tomography
- A rounding theorem for unique binary tomographic reconstruction
- Algebraic aspects of discrete tomography
- Fundamentals of Computerized Tomography
- Bounds for Approximate Discrete Tomography Solutions
- An Algebraic Framework for Discrete Tomography: Revealing the Structure of Dependencies
- Uniqueness Regions under Sets of Generic Projections in Discrete Tomography
- 13. On the reconstruction of static and dynamic discrete structures
- A geometrical characterization of regions of uniqueness and applications to discrete tomography
- Robust uncertainty principles: exact signal reconstruction from highly incomplete frequency information
- Discrete tomography: Determination of finite sets by X-rays
- Regions of Uniqueness Quickly Reconstructed by Three Directions in Discrete Tomography
- Consistency Conditions for Discrete Tomography*
- Dense Error Correction Via $\ell^1$-Minimization
- Discrete Geometry for Computer Imagery
- DART: A Practical Reconstruction Algorithm for Discrete Tomography
- Recovering Missing Slices of the Discrete Fourier Transform Using Ghosts
- On Stability, Error Correction, and Noise Compensation in Discrete Tomography
- For most large underdetermined systems of linear equations the minimal 𝓁1‐norm solution is also the sparsest solution
- Geometrical Characterization of the Uniqueness Regions Under Special Sets of Three Directions in Discrete Tomography
This page was built for publication: Error Correction for Discrete Tomography
