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.
The k-PDTM : a coreset for robust geometric inference
分析到紧致子流形的距离的子水平集是TDA中理解紧致子流形拓扑结构的常用方法。Chazal,Cohen-Steiner和M{é}rigot在[7]中引入了距离测量(Distance to measure,DTM),以解决距离测量对噪声和离群点的不鲁棒性。这个功能使得可能的推理的拓扑结构的一个紧凑的子集的R d从一个嘈杂的云的n个点躺在附近的Wasserstein意义。在实践中,这些子水平集可以使用DTM的近似值来计算,例如q见证距离[10]或其他功率距离[6]。这些方法最终导致计算n个增长球的联合的同调,当n很大时,这可能变得难以处理。为了同时面对大量点和噪声这两个问题,我们引入了k次幂距离测量(k-PDTM)。这种新的距离测量近似可以被认为是一个基于k-核心集的DTM近似。它的子水平集由k个球的并组成,k << n,并且这个距离对噪声也是鲁棒的。我们评估的质量,这种近似k可能显着小于n,例如k = n 1 3被证明是最佳的2维形状。我们还提供了一个算法来计算这个k-PDTM。