Search Results for author:
Found 4 papers, 2 papers with code
GASP, a generalized framework for agglomerative clustering of signed graphs and its application to Instance Segmentation
We propose a theoretical framework that generalizes simple and fast algorithms for hierarchical agglomerative clustering to weighted graphs with both attractive and repulsive interactions between the nodes.
Fusion Moves for Correlation Clustering
Correlation clustering, or multicut partitioning, is widely used in image segmentation for partitioning an undirected graph or image with positive and negative edge weights such that the sum of cut edge weights is minimized.
Cut, Glue & Cut: A Fast, Approximate Solver for Multicut Partitioning
Since this problem is NP-hard, we propose a new approximate solver based on the move-making paradigm: first, the graph is recursively partitioned into small regions (cut phase).
OpenGM: A C++ Library for Discrete Graphical Models
OpenGM is a C++ template library for defining discrete graphical models and performing inference on these models, using a wide range of state-of-the-art algorithms.
