Search Results for author:
Found 6 papers, 0 papers with code
A Polyhedral Study of Lifted Multicuts
Recently, a lifting of multicuts from a graph $G = (V, E)$ to an augmented graph $\hat G = (V, E \cup F)$ has been proposed in the field of image analysis, with the goal of obtaining a more expressive characterization of graph decompositions in which it is made explicit also for pairs $F \subseteq \tbinom{V}{2} \setminus E$ of non-neighboring nodes whether these are in the same or distinct components.
Combinatorial Persistency Criteria for Multicut and Max-Cut
We propose persistency criteria for the multicut and max-cut problem as well as fast combinatorial routines to verify them.
Partial Optimality and Fast Lower Bounds for Weighted Correlation Clustering
Weighted correlation clustering is hard to solve and hard to approximate for general graphs.
Analysis and Optimization of Graph Decompositions by Lifted Multicuts
We study the set of all decompositions (clusterings) of a graph through its characterization as a set of lifted multicuts.
Discrete-Continuous ADMM for Transductive Inference in Higher-Order MRFs
This paper introduces a novel algorithm for transductive inference in higher-order MRFs, where the unary energies are parameterized by a variable classifier.
Efficient Algorithms for Moral Lineage Tracing
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.
