113 citations · 348 across the 23 of their papers we have counts for
4 papers · 1 filter
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…