arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1401.7623cs.DScs.CGcs.CVmath.OC
收藏

图匹配:放松还是不放松?

Graph matching: relax or not?

Technion(以色列理工学院);Tel Aviv University(特拉维夫大学)

Yonathan Aflalo, Alex Bronstein, Ron Kimmel

摘要:

我们考虑加权无向图的精确和不精确匹配问题,其中寻求双射对应以最小化二次权不一致。这个计算上具有挑战性的问题通常被放松为凸二次规划,其中置换空间被双随机矩阵空间所取代。然而,这种放松的适用性知之甚少。我们定义了一个广泛的类友好的图形,其特征在于一个容易验证的光谱性质。我们证明了对于友好图,凸松弛保证找到确切的同构或证明其不存在。这一结果进一步扩展到近似同构图,我们开发了一个明确的重量分歧量的限制下,保证放松找到全局最优近似同构。我们还表明,在许多情况下,图匹配问题可以进一步无害地放松到一个凸二次规划,只有n个可分离的线性等式约束,这是更有效的比标准松弛涉及2n个等式和n^2不等式约束。最后,我们表明,我们的结果仍然是有效的不友好的图形,如果额外的信息,种子或属性的形式是允许的,后者满足一个易于验证的谱特性。

英文摘要:

We consider the problem of exact and inexact matching of weighted undirected graphs, in which a bijective correspondence is sought to minimize a quadratic weight disagreement. This computationally challenging problem is often relaxed as a convex quadratic program, in which the space of permutations is replaced by the space of doubly-stochastic matrices. However, the applicability of such a relaxation is poorly understood. We define a broad class of friendly graphs characterized by an easily verifiable spectral property. We prove that for friendly graphs, the convex relaxation is guaranteed to find the exact isomorphism or certify its inexistence. This result is further extended to approximately isomorphic graphs, for which we develop an explicit bound on the amount of weight disagreement under which the relaxation is guaranteed to find the globally optimal approximate isomorphism. We also show that in many cases, the graph matching problem can be further harmlessly relaxed to a convex quadratic program with only n separable linear equality constraints, which is substantially more efficient than the standard relaxation involving 2n equality and n^2 inequality constraints. Finally, we show that our results are still valid for unfriendly graphs if additional information in the form of seeds or attributes is allowed, with the latter satisfying an easy to verify spectral characteristic.

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

↑