Exact solutions for discrete graphical models. Multicuts and reduction techniques

MaRDI QIDQ2875319zbMATH OpenFDO

Authors Markus Speth

Publication date 14 August 2014

Full work available at URL http://archiv.ub.uni-heidelberg.de/volltextserver/17173/1/Dissertation_Speth.pdf

Mathematics Subject Classification ID

Research exposition (monographs, survey articles) pertaining to computer science (68-02) Computing methodologies for image processing (68U10)

Recommendations

• Discrete graphical models -- an optimization perspective
• scientific article; zbMATH DE number 2062604
• A reduction method for graph cut optimization
• A survey and comparison of discrete and continuous multi-label optimization approaches for the Potts model
• Reduced graphs for min-cut/max-flow approaches in image segmentation

Cited in

(6)

• Multi-language evaluation of exact solvers in graphical model discrete optimization
• Inference on highly-connected discrete graphical models with applications to visual object recognition
• Multicuts and perturb \& MAP for probabilistic graph clustering
• Discrete graphical models -- an optimization perspective
• Model Reductions for Inference: Generality of Pairwise, Binary, and Planar Factor Graphs
• A reduction method for graph cut optimization

This page was built for publication: Exact solutions for discrete graphical models. Multicuts and reduction techniques

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2875319)