arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1404.3653cs.DM
收藏

能量最小化的最大持续时间

Maximum Persistency in Energy Minimization

Alexander Shekhovtsov

摘要:

我们考虑离散成对能量最小化问题(加权约束满足,最大和标签)和方法,确定一个全局最优的部分分配的变量。当找到一个完整的最优分配是棘手的,确定一部分变量的最优值是一个有趣的可能性。现有的方法是基于不同的充分条件。我们提出了一个新的部分最优性的充分条件,它是:(1)在多项式时间内可验证的;(2)对问题的重新参数化和标号的置换不变性;(3)包含了许多已有的充分条件作为特例。我们提出的问题,找到最大的最优部分分配可识别的新的充分条件。提出了一种多项式方法,它保证了分配相同或更大的一部分变量比现有的几种方法。该方法的核心是一个特殊构造的线性规划,它可以识别任意多标签设置中的持久分配。

英文摘要:

We consider discrete pairwise energy minimization problem (weighted constraint satisfaction, max-sum labeling) and methods that identify a globally optimal partial assignment of variables. When finding a complete optimal assignment is intractable, determining optimal values for a part of variables is an interesting possibility. Existing methods are based on different sufficient conditions. We propose a new sufficient condition for partial optimality which is: (1) verifiable in polynomial time (2) invariant to reparametrization of the problem and permutation of labels and (3) includes many existing sufficient conditions as special cases. We pose the problem of finding the maximum optimal partial assignment identifiable by the new sufficient condition. A polynomial method is proposed which is guaranteed to assign same or larger part of variables than several existing approaches. The core of the method is a specially constructed linear program that identifies persistent assignments in an arbitrary multi-label setting.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑