Cut, Glue, &amp;amp;amp; Cut: A Fast, Approximate Solver for Multicut Partitioning

Beier, Thorsten; Kroeger, Thorben; Kappes, Jörg Hendrik; Köthe, Ullrich; Hamprecht, Fred A.

doi:10.1109/cvpr.2014.17

Cited by 38 publications

(48 citation statements)

References 22 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Although QPBO‐I yielded good results in our experiments, other data sets may require different solvers and possibly solver‐specific adaptations of the problem definition. Most notably, Cut‐Glue‐Cut [BKK*14] and CC‐Fusion [BHK15] seem to be viable candidates.…”

Section: Discussionmentioning

confidence: 99%

Towards Globally Optimal Normal Orientations for Large Point Clouds

Schertler

Savchynskyy

Gumhold

2016

Computer Graphics Forum

View full text Add to dashboard Cite

Various processing algorithms on point set surfaces rely on consistently oriented normals (e.g. Poisson surface reconstruction). While several approaches exist for the calculation of normal directions, in most cases, their orientation has to be determined in a subsequent step. This paper generalizes propagation‐based approaches by reformulating the task as a graph‐based energy minimization problem. By applying global solvers, we can achieve more consistent orientations than simple greedy optimizations. Furthermore, we present a streaming‐based framework for orienting large point clouds. This framework orients patches locally and generates a globally consistent patch orientation on a reduced neighbour graph, which achieves similar quality to orienting the full graph.

show abstract

Section: Discussionmentioning

confidence: 99%

Towards Globally Optimal Normal Orientations for Large Point Clouds

Schertler

Savchynskyy

Gumhold

2016

Computer Graphics Forum

View full text Add to dashboard Cite

show abstract

“…We refer to any update of θ according to the rules (10)- (11) as message passing. Message passing does not change the cost of any primal feasible solution, as…”

Section: Message Passingmentioning

confidence: 99%

A Message Passing Algorithm for the Minimum Cost Multicut Problem

Swoboda

Andres

2017

2017 IEEE Conference on Computer Vision and Pattern Recognition (CVPR)

View full text Add to dashboard Cite

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 amenable to efficient optimization by message passing. Like other polyhedral relaxations, it can be tightened efficiently by cutting planes. We define an algorithm that alternates between message passing and efficient separation of cycle-and odd-wheel inequalities. This algorithm is more efficient than state-of-the-art algorithms based on linear programming, including algorithms written in the framework of leading commercial software, as we show in experiments with large instances of the problem from applications in computer vision, biomedical image analysis and data mining.

show abstract

“…Jug et al [21], on the other hand, have proposed a rigorous mathematical abstraction of the joint problem which they call the moral lineage tracing problem (MLTP). It is a hybrid of the minimum cost multicut problem (MCMCP), which has been studied extensively for image decomposition [4,5,6,7,8,9,10,23,28,29,48,49], and the minimum cost disjoint arborescence problem, variations of which have been applied to reconstruct lineage forests in [22,24,36,41,40] or tree-like structures [15,46,45]. Feasible solutions to the MLTP define not only a valid cell lineage forest over time, but also a segmentation of the cells in every frame (cf.…”

Section: Introductionmentioning

confidence: 99%

Efficient Algorithms for Moral Lineage Tracing

Rempfler

Lange

Jug

et al. 2017

2017 IEEE International Conference on Computer Vision (ICCV)

View full text Add to dashboard Cite

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. [21] have proposed a mathematical abstraction of this task, the moral lineage tracing problem (MLTP), whose feasible solutions define both a segmentation of every image and a lineage forest of cells. Their branch-and-cut algorithm, however, is prone to many cuts and slow convergence for large instances. To address this problem, we make three contributions: (i) we devise the first efficient primal feasible local search algorithms for the MLTP, (ii) we improve the branchand-cut algorithm by separating tighter cutting planes and by incorporating our primal algorithms, (iii) we show in experiments that our algorithms find accurate solutions on the problem instances of Jug et al. and scale to larger instances, leveraging moral lineage tracing to practical significance. * Authors contributed equally.

show abstract

Cut, Glue, &amp; Cut: A Fast, Approximate Solver for Multicut Partitioning

Cited by 38 publications

References 22 publications

Towards Globally Optimal Normal Orientations for Large Point Clouds

Towards Globally Optimal Normal Orientations for Large Point Clouds

A Message Passing Algorithm for the Minimum Cost Multicut Problem

Efficient Algorithms for Moral Lineage Tracing

Contact Info

Product

Resources

About