Exact and Approximate Inference in Associative Hierarchical Networks using Graph Cuts

03/15/2012
by   Chris Russell, et al.
0

Markov Networks are widely used through out computer vision and machine learning. An important subclass are the Associative Markov Networks which are used in a wide variety of applications. For these networks a good approximate minimum cost solution can be found efficiently using graph cut based move making algorithms such as alpha-expansion. Recently a related model has been proposed, the associative hierarchical network, which provides a natural generalisation of the Associative Markov Network for higher order cliques (i.e. clique size greater than two). This method provides a good model for object class segmentation problem in computer vision. Within this paper we briefly describe the associative hierarchical network and provide a computationally efficient method for approximate inference based on graph cuts. Our method performs well for networks containing hundreds of thousand of variables, and higher order potentials are defined over cliques containing tens of thousands of variables. Due to the size of these problems standard linear programming techniques are inapplicable. We show that our method has a bound of 4 for the solution of general associative hierarchical network with arbitrary clique size noting that few results on bounds exist for the solution of labelling of Markov Networks with higher order cliques.

READ FULL TEXT
research
05/23/2018

Efficient Relaxations for Dense CRFs with Sparse Higher Order Potentials

Dense conditional random fields (CRFs) with Gaussian pairwise potentials...
research
09/11/2011

Efficient Minimization of Higher Order Submodular Functions using Monotonic Boolean Functions

Submodular function minimization is a key problem in a wide variety of a...
research
07/05/2015

Parsimonious Labeling

We propose a new family of discrete energy minimization problems, which ...
research
10/31/2019

Graph Structured Prediction Energy Networks

For joint inference over multiple variables, a variety of structured pre...
research
12/03/2018

Structure Learning Using Forced Pruning

Markov networks are widely used in many Machine Learning applications in...
research
06/24/2015

Kernel Cuts: MRF meets Kernel & Spectral Clustering

We propose a new segmentation model combining common regularization ener...
research
09/28/2013

Structured learning of sum-of-submodular higher order energy functions

Submodular functions can be exactly minimized in polynomial time, and th...

Please sign up or login with your details

Forgot password? Click here to reset