Towards more efficient and effective LP-based algorithms for MRF optimization

Authors:
Nikos Komodakis
Affiliations:
University of Crete, Computer Science Department
Venue:
ECCV'10 Proceedings of the 11th European conference on Computer vision: Part II
Year:
2010

Citing 9
Cited 3

Survey propagation: An algorithm for satisfiability

Random Structures & Algorithms
Globally Optimal Solutions for Energy Minimization in Stereo Vision Using Reweighted Belief Propagation

ICCV '05 Proceedings of the Tenth IEEE International Conference on Computer Vision (ICCV'05) Volume 1 - Volume 01
Efficient Belief Propagation for Early Vision

International Journal of Computer Vision
Convergent Tree-Reweighted Message Passing for Energy Minimization

IEEE Transactions on Pattern Analysis and Machine Intelligence
A Linear Programming Approach to Max-Sum Problem: A Review

IEEE Transactions on Pattern Analysis and Machine Intelligence
A Comparative Study of Energy Minimization Methods for Markov Random Fields with Smoothness-Based Priors

IEEE Transactions on Pattern Analysis and Machine Intelligence
Efficient MRF deformation model for non-rigid image matching

Computer Vision and Image Understanding
MAP estimation via agreement on trees: message-passing and linear programming

IEEE Transactions on Information Theory
Image Completion Using Efficient Belief Propagation Via Priority Scheduling and Dynamic Pruning

IEEE Transactions on Image Processing

Submodular relaxation for MRFs with high-order potentials

ECCV'12 Proceedings of the 12th international conference on Computer Vision - Volume Part III
Efficient pixel-grouping based on dempster's theory of evidence for image segmentation

ACCV'12 Proceedings of the 11th Asian conference on Computer Vision - Volume Part I
Markov Random Field modeling, inference & learning in computer vision & image understanding: A survey

Computer Vision and Image Understanding

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper proposes a framework that provides significant speed-ups and also improves the effectiveness of general message passing algorithms based on dual LP relaxations. It is applicable to both pairwise and higher order MRFs, as well as to any type of dual relaxation. It relies on combining two ideas. The first one is inspired by algebraic multigrid approaches for linear systems, while the second one employs a novel decimation strategy that carefully fixes the labels for a growing subset of nodes during the course of a dual LP-based algorithm. Experimental results on a wide variety of vision problems demonstrate the great effectiveness of this framework.