A novel convex relaxation for non-binary discrete tomography

DOI10.1007/978-3-319-58771-4_19MaRDI QIDQ5864010zbMATH OpenOpenAlexFDO

Authors 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

convex relaxationrestricted isometry propertybundle methodlinear programming relaxationhigh order factor

Mathematics Subject Classification ID

Computing methodologies for image processing (68U10)

Abstract: We present a novel convex relaxation and a corresponding inference algorithm for the non-binary discrete tomography problem, that is, reconstructing discrete-valued images from few linear measurements. In contrast to state of the art approaches that split the problem into a continuous reconstruction problem for the linear measurement constraints and a discrete labeling problem to enforce discrete-valued reconstructions, we propose a joint formulation that addresses both problems simultaneously, resulting in a tighter convex relaxation. For this purpose a constrained graphical model is set up and evaluated using a novel relaxation optimized by dual decomposition. We evaluate our approach experimentally and show superior solutions both mathematically (tighter relaxation) and experimentally in comparison to previously proposed relaxations.

Recommendations

• Discrete tomography by convex--concave regularization and D.C. programming
• A convex programming algorithm for noisy discrete tomography
• A Linear Programming Relaxation for Binary Tomography with Smoothness Priors
• Image reconstruction by multilabel propagation
• Belief-propagation reconstruction for discrete tomography

Cited in

(8)

• A convex programming algorithm for noisy discrete tomography
• scientific article; zbMATH DE number 5561280 (Why is no real title available?)
• Unbiasing in iterative reconstruction algorithms for discrete compressed sensing
• Recovery under side constraints
• Prior Learning and Convex-Concave Regularization of Binary Tomography
• Image reconstruction by multilabel propagation
• Sparse recovery with integrality constraints
• Lifting the convex conjugate in Lagrangian relaxations: a tractable approach for continuous Markov random fields

This page was built for publication: A novel convex relaxation for non-binary discrete tomography

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5864010)