207 citations · 207 across the 4 of their papers we have counts for
5 papers
Convergent Data-driven Regularizations for CT Reconstruction
Samira Kabri, Alexander Auras, Danilo Riccio +4
The reconstruction of images from their corresponding noisy Radon transform is a typical example of an ill-posed linear inverse problem as arising in the application of computerize…
Lifting the Convex Conjugate in Lagrangian Relaxations: A Tractable Approach for Continuous Markov Random Fields
Hartmut Bauermeister, Emanuel Laude, Thomas Möllenhoff +2
Dual decomposition approaches in nonconvex optimization may suffer from a duality gap. This poses a challenge when applying them directly to nonconvex problems such as MAP-inferenc…
Exploiting the Logits: Joint Sign Language Recognition and Spell-Correction
Christina Runkel, Stefan Dorenkamp, Hartmut Bauermeister +1
Machine learning techniques have excelled in the automatic semantic analysis of images, reaching human-level performances on challenging benchmarks. Yet, the semantic analysis of v…
Fast Convex Relaxations using Graph Discretizations
Jonas Geiping, Fjedor Gaede, Hartmut Bauermeister +1
Matching and partitioning problems are fundamentals of computer vision applications with examples in multilabel segmentation, stereo estimation and optical-flow computation. These…
Inverting Gradients -- How easy is it to break privacy in federated learning?
Jonas Geiping, Hartmut Bauermeister, Hannah Dröge +1
The idea of federated learning is to collaboratively train a neural network on a server. Each user receives the current weights of the network and in turns sends parameter updates…