Binary steering in discrete tomography reconstruction with sequential and simultaneous iterative algorithms
From MaRDI portal
Recommendations
Cites work
- Averaging strings of sequential iterations for convex feasibility problems.
- Block-Iterative Algorithms with Diagonally Scaled Oblique Projections for the Linear Feasibility Problem
- Component averaging: An efficient iterative parallel algorithm for large and sparse unstructured problems
- scientific article; zbMATH DE number 1511597 (Why is no real title available?)
- scientific article; zbMATH DE number 1551783 (Why is no real title available?)
- scientific article; zbMATH DE number 1382772 (Why is no real title available?)
- scientific article; zbMATH DE number 3423594 (Why is no real title available?)
- scientific article; zbMATH DE number 3027894 (Why is no real title available?)
- On Projection Algorithms for Solving Convex Feasibility Problems
- The discrete Radon transform and its approximate inversion via linear programming
Cited in
(7)- Discrete tomography by convex--concave regularization and D.C. programming
- A Linear Programming Relaxation for Binary Tomography with Smoothness Priors
- Adaptive Reconstruction of Discrete-Valued Objects from few Projections
- scientific article; zbMATH DE number 1551783 (Why is no real title available?)
- Fast binary CT using Fourier null space regularization (FNSR)
- Comparison of approaches based on optimization and algebraic iteration for binary tomography
- Discrete tomography with unknown intensity levels using higher-order statistics
This page was built for publication: Binary steering in discrete tomography reconstruction with sequential and simultaneous iterative algorithms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5955128)