arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1907.08720math.OCcs.SYeess.SY
收藏

静态和动态图的多路k割:最大熵原理方法

Multiway k-Cut in Static and Dynamic Graphs: A Maximum Entropy Principle Approach

Mayank Baranwal, Amber Srivastava, Srinivasa Salapaka

摘要:

本文提出了一个基于最大熵原理的算法,用于求解静态和动态{ \em有向图}上的最小多路$k$ -割问题。多路$k$割问题需要将图中的节点集划分为$k$子集,使得每个子集包含一个预先指定的节点,并且相应的总割权最小化。这些问题出现在许多应用中,并且在计算上是复杂的(NP难)。在静态设置本文提出了一种方法,使用一个宽松的多路$k$ -削减费用函数,我们表明,由此产生的算法收敛到一个局部极小值。该迭代算法的运行时间复杂度为$\sim O(kIN^3)$,其中$N$是顶点数,$I$是迭代次数,旨在避免不良的局部极小值。在动态设置中,边权重矩阵具有与能够受外部输入影响的图中的一些边相关联的动态。我们的目标是设计可控边的动力学,使得多路$k$切割值随着图在动力学下的演变而保持较小(或减小)。还需要确定定义最小多路$k$切割值的时变分区。我们的方法是选择一个松弛的多路$k$切割值,推导出使用最大熵原则,并将其作为一个控制李雅普诺夫函数设计控制律,影响重量动态。对交互式前景-背景分割、非可平面图的最小多路$k$ -割优化和动态演化图的实例进行了仿真,验证了算法的有效性。

英文摘要:

This work presents a maximum entropy principle based algorithm for solving minimum multiway $k$-cut problem defined over static and dynamic {\em digraphs}. A multiway $k$-cut problem requires partitioning the set of nodes in a graph into $k$ subsets, such that each subset contains one prespecified node, and the corresponding total cut weight is minimized. These problems arise in many applications and are computationally complex (NP-hard). In the static setting this article presents an approach that uses a relaxed multiway $k$-cut cost function; we show that the resulting algorithm converges to a local minimum. This iterative algorithm is designed to avoid poor local minima with its run-time complexity as $\sim O(kIN^3)$, where $N$ is the number of vertices and $I$ is the number of iterations. In the dynamic setting, the edge-weight matrix has an associated dynamics with some of the edges in the graph capable of being influenced by an external input. The objective is to design the dynamics of the controllable edges so that multiway $k$-cut value remains small (or decreases) as the graph evolves under the dynamics. Also it is required to determine the time-varying partition that defines the minimum multiway $k$-cut value. Our approach is to choose a relaxation of multiway $k$-cut value, derived using maximum entropy principle, and treat it as a control Lyapunov function to design control laws that affect the weight dynamics. Simulations on practical examples of interactive foreground-background segmentation, minimum multiway $k$-cut optimization for non-planar graphs and dynamically evolving graphs that demonstrate the efficacy of the algorithm, are presented.

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

↑