A convex programming algorithm for noisy discrete tomography
From MaRDI portal
Recommendations
- Parallel Block-Iterative Reconstruction Algorithms for Binary Tomography
- Discrete tomography by convex--concave regularization and D.C. programming
- Combinatorial Image Analysis
- Discrete tomography by convex-concave regularization using linear und quadratic optimization.
- A novel convex relaxation for non-binary discrete tomography
Cited in
(13)- A physics-constrained data-driven approach based on locally convex reconstruction for noisy database
- An evolutionary algorithm for discrete tomography
- Discrete tomography by convex--concave regularization and D.C. programming
- The ordered subsets mirror descent optimization method with applications to tomography
- Ergodic convergence of a stochastic proximal point algorithm
- Parallel Block-Iterative Reconstruction Algorithms for Binary Tomography
- Recovering convex edges of an image from noisy tomographic data
- Discrete tomography by convex-concave regularization using linear und quadratic optimization.
- Application of a discrete tomography approach to computerized tomography
- Combinatorial Image Analysis
- A novel convex relaxation for non-binary discrete tomography
- Random algorithms for convex minimization problems
- Discrete tomography with unknown intensity levels using higher-order statistics
This page was built for publication: A convex programming algorithm for noisy discrete tomography
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5434305)