资源分类
》 资源 》论文》Graph-based Simplex Method for Pairwise Energy Minimization with Binary Variables

Graph-based Simplex Method for Pairwise Energy Minimization with Binary Variables

2019-12-17 | |  80 |   45 |   0

Abstract

We show how the simplex algorithm can be tailored to the linear programming relaxation of pairwise energy minimization with binary variables. A special structure formed by basic and nonbasic variables in each stage of the algorithm is identifified and utilized to perform the whole iterative process combinatorially over the input energy minimization graph rather than algebraically over the simplex tableau. This leads to a new effificient solver. We demonstrate that for some computer vision instances it performs even better than methods reducing binary energy minimization to fifinding maximum flflow in a network.

上一篇：The k-Support Norm and Convex Envelopes of Cardinality and Rank

下一篇：Efficient and Accurate Approximations of Nonlinear Convolutional Networks

用户评价
全部评价

热门资源

  • The Variational S...

    Unlike traditional images which do not offer in...

  • Learning to Predi...

    Much of model-based reinforcement learning invo...

  • Stratified Strate...

    In this paper we introduce Stratified Strategy ...

  • Learning to learn...

    The move from hand-designed features to learned...

  • A Mathematical Mo...

    Direct democracy, where each voter casts one vo...