A novel convex relaxation for non-binary discrete tomography
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...
Saved in:
| Main Authors: | , , |
|---|---|
| Format: | Chapter/Article Conference Paper |
| Language: | English |
| Published: |
18 May 2017
|
| In: |
Scale Space and Variational Methods in Computer Vision
Year: 2017, Pages: 235-246 |
| DOI: | 10.1007/978-3-319-58771-4_19 |
| Subjects: | |
| Online Access: | Verlag, Volltext: http://dx.doi.org/10.1007/978-3-319-58771-4_19 Verlag, Volltext: https://link.springer.com/chapter/10.1007/978-3-319-58771-4_19 
|
| Author Notes: | Jan Kuske, Paul Swoboda, Stefania Petra |
| Summary: | 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. |
|---|---|
| Item Description: | Gesehen am 14.03.2018 |
| Physical Description: | Online Resource |
| ISBN: | 9783319587714 |
| DOI: | 10.1007/978-3-319-58771-4_19 |