Discrete tomography by convex--concave regularization and D.C. programming
From MaRDI portal
Publication:2573249
DOI10.1016/j.dam.2005.02.028zbMath1131.68571OpenAlexW1987507268MaRDI QIDQ2573249
T. Schüle, Stefan Weber, Christoph Schnörr, Joachim Hornegger
Publication date: 7 November 2005
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2005.02.028
Computational aspects related to convexity (52B55) Computing methodologies for image processing (68U10) Combinatorial optimization (90C27)
Related Items (29)
A unified DC programming framework and efficient DCA based approaches for large scale batch reinforcement learning ⋮ A new efficient algorithm based on DC programming and DCA for clustering ⋮ DC programming and DCA for solving Brugnano-Casulli piecewise linear systems ⋮ Bounds on the quality of reconstructed images in binary tomography ⋮ Image reconstruction from sparse projections using S-transform ⋮ Discrete tomography with unknown intensity levels using higher-order statistics ⋮ Finding robust minimizer for non-convex phase retrieval ⋮ Solving an Infinite-Horizon Discounted Markov Decision Process by DC Programming and DCA ⋮ On solving linear complementarity problems by DC programming and DCA ⋮ Solving nonmonotone affine variational inequalities problem by DC programming and DCA ⋮ Discrete Tomography Reconstruction Based on the Multi-well Potential ⋮ Binary image reconstruction from a small number of projections and the morphological skeleton ⋮ On image reconstruction algorithms for binary electromagnetic geotomography ⋮ DC programming and DCA: thirty years of developments ⋮ Continuous relaxation for discrete DC programming ⋮ A continuous approach for the concave cost supply problem via DC programming and DCA ⋮ Multivalued discrete tomography using dynamical system that describes competition ⋮ Comparison of approaches based on optimization and algebraic iteration for binary tomography ⋮ A branch and reduce approach for solving a class of low rank d.c. programs ⋮ Generic iterative subset algorithms for discrete tomography ⋮ DC programming approach for portfolio optimization under step increasing transaction costs ⋮ On Algorithms for Difference of Monotone Operators ⋮ On Algorithms for Difference of Monotone Operators ⋮ Grey Level Estimation for Discrete Tomography ⋮ Portfolio selection under downside risk measures and cardinality constraints based on DC programming and DCA ⋮ Regularized graph cuts based discrete tomography reconstruction methods ⋮ Adaptive Reconstruction of Discrete-Valued Objects from few Projections ⋮ Detection of Subsurface Bubbles with Discrete Electromagnetic Geotomography ⋮ Easy implementation of advanced tomography algorithms using the ASTRA toolbox with spot operators
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The discrete Radon transform and its approximate inversion via linear programming
- Discrete tomography. Foundations, algorithms, and applications
- Approximating Binary Images from Discrete X-Rays
- Mathematical Methods in Image Reconstruction
- A Linear Programming Relaxation for Binary Tomography with Smoothness Priors
- On the Goldstein-Levitin-Polyak gradient projection method
- Discrete tomography: Determination of finite sets by X-rays
- A D.C. Optimization Algorithm for Solving the Trust-Region Subproblem
- State Constraints in Convex Control Problems of Bolza
- Binary steering in discrete tomography reconstruction with sequential and simultaneous iterative algorithms
This page was built for publication: Discrete tomography by convex--concave regularization and D.C. programming
