Multicuts and perturb \& MAP for probabilistic graph clustering

DOI10.1007/s10851-016-0659-3zbMath1392.68431arXiv1601.02088OpenAlexW2294754899MaRDI QIDQ334274

Paul Swoboda, Jörg Hendrik Kappes, Christoph Schnörr, Bogdan Savchynskyy, Tamir Hazan

Publication date: 1 November 2016

Published in: Journal of Mathematical Imaging and Vision (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1601.02088

zbMATH Keywords

graphical modelscorrelation clusteringmulticutperturb and MAP

Mathematics Subject Classification ID

Classification and discrimination; cluster analysis (statistical aspects) (62H30) Social networks; opinion dynamics (91D30) Computing methodologies for image processing (68U10)

Uses Software

• LibDAI
• BSDS
• OpenGM

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Ambrosio-Tortorelli segmentation of stochastic images: model extensions, theoretical investigations and numerical methods
• Correlation clustering
• Nonparametric Bayesian image segmentation
• The ellipsoid method and its consequences in combinatorial optimization
• The partition problem
• Correlation clustering in general weighted graphs
• Combinatorial theory.
• Continuous Multiclass Labeling Approaches and Algorithms
• Approximation of functional depending on jumps by elliptic functional via t-convergence
• On Finding Graph Clusterings with Maximum Modularity
• Constructing Free-Energy Approximations and Generalized Belief Propagation Algorithms
• A Survey of Statistical Network Models
• Graphical Models, Exponential Families, and Variational Inference
• On clusterings
• An Efficient Heuristic Procedure for Partitioning Graphs
• Factor graphs and the sum-product algorithm
• Tree-based reparameterization framework for analysis of sum-product and related algorithms
• A Convex Approach to Minimal Partitions

This page was built for publication: Multicuts and perturb \& MAP for probabilistic graph clustering