Sciweavers

ICCV
2007
IEEE
15 years 1 months ago
LogCut - Efficient Graph Cut Optimization for Markov Random Fields
Markov Random Fields (MRFs) are ubiquitous in lowlevel computer vision. In this paper, we propose a new approach to the optimization of multi-labeled MRFs. Similarly to -expansion...
Victor S. Lempitsky, Carsten Rother, Andrew Blake
CVPR
2009
IEEE
15 years 6 months ago
Higher-Order Clique Reduction in Binary Graph Cut
We introduce a new technique that can reduce any higher-order Markov random field with binary labels into a first-order one that has the same minima as the original. Moreover, w...
Hiroshi Ishikawa 0002