Search Results for author:
Found 8 papers, 2 papers with code
Test-Time Adaptation to Distribution Shift by Confidence Maximization and Input Transformation
This paper focuses on the fully test-time adaptation setting, where only unlabeled data from the target distribution is required.
Test-Time Adaptation to Distribution Shifts by Confidence Maximization and Input Transformation
This paper focuses on the fully test-time adaptation setting, where only unlabeled data from the target distribution is required.
Joint Graph Decomposition & Node Labeling: Problem, Algorithms, Applications
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.
ArtTrack: Articulated Multi-person Tracking in the Wild
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
InstanceCut: from Edges to Instances with MultiCut
This work addresses the task of instance-aware semantic segmentation.
Joint Graph Decomposition and Node Labeling: Problem, Algorithms, Applications
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.
Moral Lineage Tracing
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).
Efficient Decomposition of Image and Mesh Graphs by Lifted Multicuts
a pixel grid graph have received little attention, firstly, because the MP is NP-hard and instances w. r. t.
