no code implementations • 28 Jun 2021 • Chaithanya Kumar Mummadi, Robin Hutmacher, Kilian Rambach, Evgeny Levinkov, Thomas Brox, Jan Hendrik Metzen
This paper focuses on the fully test-time adaptation setting, where only unlabeled data from the target distribution is required.
no code implementations • NeurIPS 2021 • Chaithanya Kumar Mummadi, Robin Hutmacher, Kilian Rambach, Evgeny Levinkov, Thomas Brox, Jan Hendrik Metzen
This paper focuses on the fully test-time adaptation setting, where only unlabeled data from the target distribution is required.
no code implementations • CVPR 2017 • Evgeny Levinkov, Jonas Uhrig, Siyu Tang, Mohamed Omran, Eldar Insafutdinov, Alexander Kirillov, Carsten Rother, Thomas Brox, Bernt Schiele, Bjoern Andres
In order to find feasible solutions efficiently, we define two local search algorithms that converge monotonously to a local optimum, offering a feasible solution at any time.
14 code implementations • CVPR 2017 • Eldar Insafutdinov, Mykhaylo Andriluka, Leonid Pishchulin, Siyu Tang, Evgeny Levinkov, Bjoern Andres, Bernt Schiele
In this paper we propose an approach for articulated tracking of multiple people in unconstrained videos.
Ranked #7 on Keypoint Detection on MPII Multi-Person
no code implementations • CVPR 2017 • Alexander Kirillov, Evgeny Levinkov, Bjoern Andres, Bogdan Savchynskyy, Carsten Rother
This work addresses the task of instance-aware semantic segmentation.
1 code implementation • 14 Nov 2016 • Evgeny Levinkov, Jonas Uhrig, Siyu Tang, Mohamed Omran, Eldar Insafutdinov, Alexander Kirillov, Carsten Rother, Thomas Brox, Bernt Schiele, Bjoern Andres
In order to find feasible solutions efficiently, we define two local search algorithms that converge monotonously to a local optimum, offering a feasible solution at any time.
no code implementations • CVPR 2016 • Florian Jug, Evgeny Levinkov, Corinna Blasse, Eugene W. Myers, Bjoern Andres
We propose an integer linear program (ILP) whose feasible solutions define a decomposition of each image in a sequence into cells (segmentation), and a lineage forest of cells across images (tracing).
no code implementations • ICCV 2015 • Margret Keuper, Evgeny Levinkov, Nicolas Bonneel, Guillaume Lavoué, Thomas Brox, Bjoern Andres
a pixel grid graph have received little attention, firstly, because the MP is NP-hard and instances w. r. t.