A Novel Convex Relaxation for Non-binary Discrete Tomography

DOI10.1007/978-3-319-58771-4_19zbMath1489.68386arXiv1703.03769OpenAlexW2953359470MaRDI QIDQ5864010

Jan Kuske, Paul Swoboda, Stefania Petra

Publication date: 3 June 2022

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1703.03769

zbMATH Keywords

linear programming relaxationconvex relaxationbundle methodrestricted isometry propertyhigh order factor

Mathematics Subject Classification ID

Computing methodologies for image processing (68U10)

Related Items (3)

Sparse recovery with integrality constraints ⋮ Unbiasing in iterative reconstruction algorithms for discrete compressed sensing ⋮ Recovery under side constraints

This page was built for publication: A Novel Convex Relaxation for Non-binary Discrete Tomography