Graph cuts, sum-of-submodular flow, and linear programming: effective inference in higher-order markov random fields

Alexander Fix