Regularized graph cuts based discrete tomography reconstruction methods
From MaRDI portal
Publication:2084613
DOI10.1007/s10878-021-00730-4zbMath1504.90176OpenAlexW3153846185MaRDI QIDQ2084613
Publication date: 18 October 2022
Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10878-021-00730-4
discrete tomographybinary tomographygraph cuts optimizationenergy minimization methodsshape circularity
Uses Software
Cites Work
- Fast approximate energy minimization with label costs
- A Hu moment invariant as a shape circularity measure
- Discrete tomography. Foundations, algorithms, and applications
- Graph cuts based tomography enhanced by shape orientation
- Discrete tomography by convex--concave regularization and D.C. programming
- Discrete Tomography Reconstruction Based on the Multi-well Potential
- The Barzilai and Borwein Gradient Method for the Large Scale Unconstrained Minimization Problem
- Two-Point Step Size Gradient Methods
- Nonmonotone Spectral Projected Gradient Methods on Convex Sets
- A Nonmonotone Line Search Technique for Newton’s Method
- Dense Projection Tomography on the Triangular Tiling
- Algorithm 813
- A spectral conjugate gradient method for unconstrained optimization
This page was built for publication: Regularized graph cuts based discrete tomography reconstruction methods