DART: A Practical Reconstruction Algorithm for Discrete Tomography
From MaRDI portal
Cited in
(24)- A novel approach to surface defect detection
- Multivalued discrete tomography using dynamical system that describes competition
- Algorithms for linear time reconstruction by discrete tomography
- A multi-level preconditioned Krylov method for the efficient solution of algebraic tomographic reconstruction problems
- Algorithms for linear time reconstruction by discrete tomography. II
- Histogram tomography
- Sparse recovery with integrality constraints
- Reconstruction of hv-convex sets by their coordinate X-ray functions
- A rounding theorem for unique binary tomographic reconstruction
- Algorithm for the reconstruction of dynamic objects in CT-scanning using optical flow
- Easy implementation of advanced tomography algorithms using the ASTRA toolbox with spot operators
- Simultaneous tomographic reconstruction and segmentation with class priors
- Shape-based image reconstruction using linearized deformations
- Bounds on the quality of reconstructed images in binary tomography
- CoShaRP: a convex program for single-shot tomographic shape sensing
- Material-separating regularizer for multi-energy x-ray tomography
- Fast binary CT using Fourier null space regularization (FNSR)
- An image reconstruction model regularized by edge-preserving diffusion and smoothing for limited-angle computed tomography
- A fast method for simultaneous reconstruction and segmentation in X-ray CT application
- Error Correction for Discrete Tomography
- Inferring object boundaries and their roughness with uncertainty quantification
- Binary tomography on the Cairo pattern
- Ghosts in discrete tomography
- Discrete tomography with unknown intensity levels using higher-order statistics
This page was built for publication: DART: A Practical Reconstruction Algorithm for Discrete Tomography
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5370203)
