arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2209.12869cs.CGcs.CV
收藏

几何图的距离测度

Distance Measures for Geometric Graphs

University of California, Berkeley(加州大学伯克利分校);Tulane University(杜兰大学)

Sushovan Majhi, Carola Wenk

摘要:

几何图是一种组合图,具有从其在欧几里得空间中的嵌入继承的几何形状。在模式识别中,对两个这样的几何图的组合结构和几何结构的(不)相似性进行有意义的度量是一个具有挑战性的问题。本文研究了几何图的两种距离测度,即几何编辑距离(GED)和几何图距离(GGD)。前者基于编辑一个图以将其转换为另一个图的想法,而后者则受到图的不精确匹配的启发。几十年来,这两个概念都被用来衡量属性图之间的相似性。然而,如果不加任何修改地使用,它们就不能为几何图形提供有意义的距离度量--甚至不再是度量。我们已经为几何图的上下文策划了它们的相关成本函数。除了研究GED和GGD的度量属性,我们还研究了这两个概念的比较。我们进一步我们的理解GGD的计算方面,显示的距离是$\mathcal{NP}$ -难以计算,即使图形是平面和任意的成本系数是允许的。

英文摘要:

A geometric graph is a combinatorial graph, endowed with a geometry that is inherited from its embedding in a Euclidean space. Formulation of a meaningful measure of (dis-)similarity in both the combinatorial and geometric structures of two such geometric graphs is a challenging problem in pattern recognition. We study two notions of distance measures for geometric graphs, called the geometric edit distance (GED) and geometric graph distance (GGD). While the former is based on the idea of editing one graph to transform it into the other graph, the latter is inspired by inexact matching of the graphs. For decades, both notions have been lending themselves well as measures of similarity between attributed graphs. If used without any modification, however, they fail to provide a meaningful distance measure for geometric graphs -- even cease to be a metric. We have curated their associated cost functions for the context of geometric graphs. Alongside studying the metric properties of GED and GGD, we investigate how the two notions compare. We further our understanding of the computational aspects of GGD by showing that the distance is $\mathcal{NP}$-hard to compute, even if the graphs are planar and arbitrary cost coefficients are allowed.

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

↑