Sciweavers

4 search results - page 1 / 1
» A tiered move-making algorithm for general pairwise MRFs
Sort
View
CVPR
2012
IEEE
11 years 5 months ago
A tiered move-making algorithm for general pairwise MRFs
A large number of problems in computer vision can be modeled as energy minimization problems in a markov random field (MRF) framework. Many methods have been developed over the y...
Vibhav Vineet, Jonathan Warrell, Philip H. S. Torr
CVPR
2009
IEEE
14 years 9 months ago
Beyond Pairwise Energies: Efficient Optimization for Higher-order MRFs
In this paper, we introduce a higher-order MRF optimization framework. On the one hand, it is very general; we thus use it to derive a generic optimizer that can be applied to a...
Nikos Komodakis (University of Crete), Nikos Parag...
ECCV
2010
Springer
13 years 4 months ago
Towards More Efficient and Effective LP-based algorithms for MRF Optimization
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 ap...
ATAL
2008
Springer
13 years 4 months ago
Multi-robot Markov random fields
We propose Markov random fields (MRFs) as a probabilistic mathematical model for unifying approaches to multi-robot coordination or, more specifically, distributed action selectio...
Jesse Butterfield, Odest Chadwicke Jenkins, Brian ...