LogCut - Efficient Graph Cut Optimization for Markov Random Fields - Microsoft Research

Microsoft Translator |

LogCut - Efficient Graph Cut Optimization for Markov Random Fields

Victor Lempitsky, Carsten Rother, and Andrew Blake
2007

iccv07-LogCut.pdf

In ICCV

Details

Type	Inproceedings

Related Projects

Discrete Optimization for Computer Vision

Related People

Related Groups

Computer Vision at MSR Cambridge

Related Labs

Microsoft Research Cambridge

Share

> Publications > LogCut - Efficient Graph Cut Optimization for Markov Random Fields