Analysis and optimization of an algorithm for discrete tomography
From MaRDI portal
Recommendations
Cites work
Cited in
(19)- Generic iterative subset algorithms for discrete tomography
- Discrete tomography. Foundations, algorithms, and applications
- Algorithms for linear time reconstruction by discrete tomography. II
- Quality bounds for binary tomography with arbitrary projection matrices
- Binary image reconstruction based on prescribed numerical information
- An evolutionary algorithm for discrete tomography
- Approximating binary images from discrete X-rays
- The ordered subsets mirror descent optimization method with applications to tomography
- Discrete Tomography in Discrete Deconvolution: Deconvolution of Binary Images Using Ryser's Algorithm
- Bounds on the quality of reconstructed images in binary tomography
- scientific article; zbMATH DE number 1551782 (Why is no real title available?)
- On double-resolution imaging and discrete tomography
- Multiresolution greedy algorithm dedicated to reflective tomography
- A tabu search approach for the reconstruction of binary images without empty interior region
- A Benchmark Evaluation of Large-Scale Optimization Approaches to Binary Tomography
- Speeding up stochastic reconstructions of binary images from limited projection directions
- An algorithm for discrete tomography
- Error Correction for Discrete Tomography
- Analysis on the strip-based projection model for discrete tomography
This page was built for publication: Analysis and optimization of an algorithm for discrete tomography
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3438899)