LogCut - Efficient Graph Cut Optimization for Markov Random Fields
Abstract
Markov Random Fields (MRFs) are ubiquitous in low- level computer vision. In this paper, we propose a new approach to the optimization of multi-labeled MRFs. Similarly to a-expansion it is based on iterative application of binary graph cut. However, the number of binary graph cuts required to compute a labelling grows only logarithmically with the size of label space, instead of linearly. We demonstrate that for applications such as optical flow, image restoration, and high resolution stereo, this gives an order of magnitude speed-up, for comparable energies. Iterations are performed by "fusion" of solutions, done with QPBO which is related to graph cut but can deal with non-submodularity. At convergence, the method achieves optima on a par with the best competitors, and sometimes even exceeds them.
Cite
Text
Lempitsky et al. "LogCut - Efficient Graph Cut Optimization for Markov Random Fields." IEEE/CVF International Conference on Computer Vision, 2007. doi:10.1109/ICCV.2007.4408907Markdown
[Lempitsky et al. "LogCut - Efficient Graph Cut Optimization for Markov Random Fields." IEEE/CVF International Conference on Computer Vision, 2007.](https://mlanthology.org/iccv/2007/lempitsky2007iccv-logcut/) doi:10.1109/ICCV.2007.4408907BibTeX
@inproceedings{lempitsky2007iccv-logcut,
title = {{LogCut - Efficient Graph Cut Optimization for Markov Random Fields}},
author = {Lempitsky, Victor S. and Rother, Carsten and Blake, Andrew},
booktitle = {IEEE/CVF International Conference on Computer Vision},
year = {2007},
pages = {1-8},
doi = {10.1109/ICCV.2007.4408907},
url = {https://mlanthology.org/iccv/2007/lempitsky2007iccv-logcut/}
}