![]() |
![]() |
University of Birmingham > Talks@bham > Optimisation and Numerical Analysis Seminars > A Novel Convex Relaxation for Non-Binary Discrete Tomography
A Novel Convex Relaxation for Non-Binary Discrete TomographyAdd to your list(s) Download to your calendar using vCal
If you have a question about this talk, please contact Sergey Sergeev. 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. This talk is part of the Optimisation and Numerical Analysis Seminars series. This talk is included in these lists:Note that ex-directory lists are not shown. |
Other listsReading Group in Combinatorics and Probability Theoretical computer science seminar Algebra SeminarOther talksSeminar: TBA Seminar: TBA The science of the large scale heliosphere and the missions that made it possible TBC Cost optimisation of hybrid institutional incentives for promoting cooperation in finite populations Seminar: TBA |