113 citations · 348 across the 23 of their papers we have counts for
25 papers
Contrastive Learning and Correlation Clustering for Sequences of Network Telescope Data
Jannik Presberger, Alexander Männel, Maynard Koch +3
Understanding activities of Internet scanners is challenging; it often requires identifying relationships between sources, a task for which semantic annotations are scarce. This wo…
A Graph Multi-separator Problem for Image Segmentation
Jannik Irmai, Shengxian Zhao, Jannik Presberger +1
We propose a novel abstraction of the image segmentation task in the form of a combinatorial optimization problem that we call the multi-separator problem. Feasible solutions indic…
Correlation Clustering of Bird Sounds
David Stein, Bjoern Andres
Bird sound classification is the task of relating any sound recording to those species of bird that can be heard in the recording. Here, we study bird sound clustering, the task of…
Partial Optimality in Cubic Correlation Clustering
David Stein, Silvia Di Gregorio, Bjoern Andres
The higher-order correlation clustering problem is an expressive model, and recently, local search heuristics have been proposed for several applications. Certifying optimality, ho…
A Polyhedral Study of Lifted Multicuts
Bjoern Andres, Silvia Di Gregorio, Jannik Irmai +1
Fundamental to many applications in data analysis are the decompositions of a graph, i.e. partitions of the node set into component-inducing subsets. One way of encoding decomposit…
Inapproximability of a Pair of Forms Defining a Partial Boolean Function
David Stein, Bjoern Andres
We consider the problem of jointly minimizing forms of two Boolean functions such that and so as to separate disjoint sets $A \cu…
End-to-end Learning for Graph Decomposition
Jie Song, Bjoern Andres, Michael Black +2
We propose a novel end-to-end trainable framework for the graph decomposition problem. The minimum cost multicut problem is first converted to an unconstrained binary cubic formula…
Combinatorial persistency criteria for multicut and max-cut
Jan-Hendrik Lange, Bjoern Andres, Paul Swoboda
In combinatorial optimization, partial variable assignments are called persistent if they agree with some optimal solution. We propose persistency criteria for the multicut and max…
Decomposition of Trees and Paths via Correlation
Jan-Hendrik Lange, Bjoern Andres
We study the problem of decomposing (clustering) a tree with respect to costs attributed to pairs of nodes, so as to minimize the sum of costs for those pairs of nodes that are in…
Discrete-Continuous ADMM for Transductive Inference in Higher-Order MRFs
Emanuel Laude, Jan-Hendrik Lange, Jonas Schüpfer +5
This paper introduces a novel algorithm for transductive inference in higher-order MRFs, where the unary energies are parameterized by a variable classifier. The considered task is…
Efficient Algorithms for Moral Lineage Tracing
Markus Rempfler, Jan-Hendrik Lange, Florian Jug +4
Lineage tracing, the joint segmentation and tracking of living cells as they move and divide in a sequence of light microscopy images, is a challenging task. Jug et al. have propos…
A Message Passing Algorithm for the Minimum Cost Multicut Problem
Paul Swoboda, Bjoern Andres
We propose a dual decomposition and linear program relaxation of the NP -hard minimum cost multicut problem. Unlike other polyhedral relaxations of the multicut polytope, it is ame…
ArtTrack: Articulated Multi-person Tracking in the Wild
Eldar Insafutdinov, Mykhaylo Andriluka, Leonid Pishchulin +4
In this paper we propose an approach for articulated tracking of multiple people in unconstrained videos. Our starting point is a model that resembles existing architectures for si…
InstanceCut: from Edges to Instances with MultiCut
Alexander Kirillov, Evgeny Levinkov, Bjoern Andres +2
This work addresses the task of instance-aware semantic segmentation. Our key motivation is to design a simple method with a new modelling-paradigm, which therefore has a different…
Joint Graph Decomposition and Node Labeling: Problem, Algorithms, Applications
Evgeny Levinkov, Jonas Uhrig, Siyu Tang +7
We state a combinatorial optimization problem whose feasible solutions define both a decomposition and a node labeling of a given graph. This problem offers a common mathematical a…
Multi-Person Tracking by Multicut and Deep Matching
Siyu Tang, Bjoern Andres, Mykhaylo Andriluka +1
In [1], we proposed a graph-based formulation that links and clusters person hypotheses over time by solving a minimum cost subgraph multicut problem. In this paper, we modify and…
A Multi-cut Formulation for Joint Segmentation and Tracking of Multiple Objects
Margret Keuper, Siyu Tang, Yu Zhongjie +3
Recently, Minimum Cost Multicut Formulations have been proposed and proven to be successful in both motion trajectory segmentation and multi-target tracking scenarios. Both tasks b…
The Minimum Cost Connected Subgraph Problem in Medical Image Analysis
Markus Rempfler, Bjoern Andres, Bjoern H. Menze
Several important tasks in medical image analysis can be stated in the form of an optimization problem whose feasible solutions are connected subgraphs. Examples include the recons…
DeeperCut: A Deeper, Stronger, and Faster Multi-Person Pose Estimation Model
Eldar Insafutdinov, Leonid Pishchulin, Bjoern Andres +2
The goal of this paper is to advance the state-of-the-art of articulated pose estimation in scenes with multiple people. To that end we contribute on three fronts. We propose (1) i…
Convexification of Learning from Constraints
Iaroslav Shcherbatyi, Bjoern Andres
Regularized empirical risk minimization with constrained labels (in contrast to fixed labels) is a remarkably general abstraction of learning. For common loss and regularization fu…
DeepCut: Joint Subset Partition and Labeling for Multi Person Pose Estimation
Leonid Pishchulin, Eldar Insafutdinov, Siyu Tang +4
This paper considers the task of articulated human pose estimation of multiple people in real world images. We propose an approach that jointly solves the tasks of detection and po…
Moral Lineage Tracing
Florian Jug, Evgeny Levinkov, Corinna Blasse +2
Lineage tracing, the tracking of living cells as they move and divide, is a central problem in biological image analysis. Solutions, called lineage forests, are key to understandin…
Efficient Decomposition of Image and Mesh Graphs by Lifted Multicuts
Margret Keuper, Evgeny Levinkov, Nicolas Bonneel +3
Formulations of the Image Decomposition Problem as a Multicut Problem (MP) w.r.t. a superpixel graph have received considerable attention. In contrast, instances of the MP w.r.t. a…
Analysis and Optimization of Graph Decompositions by Lifted Multicuts
Andrea Horňáková, Jan-Hendrik Lange, Bjoern Andres
We study the set of all decompositions (clusterings) of a graph through its characterization as a set of lifted multicuts. This leads us to practically relevant insights related to…