• A
  • A
  • A
  • ABC
  • ABC
  • ABC
  • А
  • А
  • А
  • А
  • А
Regular version of the site

Inference in Markov Random Fields

We study MRFs of different kinds. Espesially we are interested in the inference problem in MRFs with high-order potentials and global constraints. Here is an incomplete list of what we’ve tried so far:


In this work we are investigating decomposition methods that do not decompose the graph structure of the initial problem but e.g. use subproblems that relate to labels. One advantage of these methods is the potential ability to take into account some types of high-order cliques and some global constraints on the solution.

A. OsokinD. Vetrov, and V. Kolmogorov. Submodular Decomposition Framework for Inference in Associative Markov Networks with Global Constraints, In Computer Vision and Pattern Recognition (CVPR), June 2011. pdf

D. VetrovA. Osokin. Graph Preserving Label Decomposition in Discrete MRFs with Selfish Potentials. Proceedings of International Workshop on Discrete Optimization in Machine learning (DISCML NIPS), December 2011. pdf


 

In this work we focused on an energy that penalized the number of different labels actually used in the current labeling of MRF. We found some interesting theoretical intepretations for the energy, developed an algorithm, and tried it for geometric multi-model fitting (motion segmentation, homography estimation), image segmentation and compression.

 

A. DelongA. Osokin, H. Isack, and Y. Boykov. Fast Approximate Energy Minimization with Label Costs, International Journal of Computer Vision (IJCV), 96(1):1–27, 2012. pdfcode


 

Have you spotted a typo?
Highlight it, click Ctrl+Enter and send us a message. Thank you for your help!