资源分类
》 资源 》论文》MRF Inference by k-Fan Decomposition and Tight Lagrangian Relaxation

MRF Inference by k-Fan Decomposition and Tight Lagrangian Relaxation

2020-03-31 | |  61 |   44 |   0

Abstract

We present a novel dual decomposition approach to MAP inference with highly connected discrete graphical models. Decomposi- tions into cyclic k-fan structured subproblems are shown to significantly tighten the Lagrangian relaxation relative to the standard local polytope relaxation, while enabling efficient integer programming for solving the subproblems. Additionally, we introduce modified update rules for max- imizing the dual function that avoid oscillations and converge faster to an optimum of the relaxed problem, and never get stuck in non-optimal fixed points.

上一篇：Ring-Light Photometric Stereo

下一篇：Avoiding Confusing Features in Place Recognition

用户评价
全部评价

热门资源

  • 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 ...

  • A Mathematical Mo...

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

  • Rating-Boosted La...

    The performance of a recommendation system reli...