利用辅助子模问题研究部分最优性
On Partial Opimality by Auxiliary Submodular Problems
摘要:
在这项工作中,我们证明了三种不同的能量最小化技术之间的关系。Ivan Kovtun(IK)、线性规划松弛法(LP)和Yuri Boykov的扩展移动算法(Expansion move algorithm)是最近提出的确定可证明最优变量部分分配的方法。基于LP松弛理论,我们提出了一个新的最优部分分配的充分条件,称为LP-自给自足。我们表明,Kovtun的方法,建立辅助子模块的问题,满足这个充分条件。因此建立了以下联系:LP松弛不能被IK收紧。对于非次模问题,这是一个非平凡的结果。在两个标签的情况下,LP松弛提供了最佳的部分分配,称为持久性,其中,正如我们所示,主导IK。将IK与扩展移动联系起来,我们证明了初始问题的任何“截断”规则的扩展移动不动点集与IK的一对一方法限制的问题都是重合的--即扩展移动不能通过这种方法得到改进。在两个标签的情况下,具有特定截断规则的扩展移动与one-vs-all方法一致。
英文摘要:
In this work, we prove several relations between three different energy minimization techniques. A recently proposed methods for determining a provably optimal partial assignment of variables by Ivan Kovtun (IK), the linear programming relaxation approach (LP) and the popular expansion move algorithm by Yuri Boykov. We propose a novel sufficient condition of optimal partial assignment, which is based on LP relaxation and called LP-autarky. We show that methods of Kovtun, which build auxiliary submodular problems, fulfill this sufficient condition. The following link is thus established: LP relaxation cannot be tightened by IK. For non-submodular problems this is a non-trivial result. In the case of two labels, LP relaxation provides optimal partial assignment, known as persistency, which, as we show, dominates IK. Relating IK with expansion move, we show that the set of fixed points of expansion move with any "truncation" rule for the initial problem and the problem restricted by one-vs-all method of IK would coincide -- i.e. expansion move cannot be improved by this method. In the case of two labels, expansion move with a particular truncation rule coincide with one-vs-all method.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。