局部正确的Frechet匹配
Locally Correct Frechet Matchings
摘要:
Frechet距离是比较两条曲线的度量,它基于这些曲线之间的单调匹配。我们把导致弗雷歇距离的匹配称为弗雷歇匹配。通常有许多不同的弗雷歇匹配,并不是所有这些都能很好地捕捉曲线之间的相似性。我们建议限制设置的Frechet匹配的“自然”匹配,并为此引入本地正确的Frechet匹配。我们证明了至少存在一个这样的匹配两个多边形曲线,并给出了一个O(N^3 log N)的算法来计算它,其中N是在两条曲线的边的总数。我们还提出了一个O(N^2)的算法来计算一个局部正确的离散Frechet匹配。
英文摘要:
The Frechet distance is a metric to compare two curves, which is based on monotonous matchings between these curves. We call a matching that results in the Frechet distance a Frechet matching. There are often many different Frechet matchings and not all of these capture the similarity between the curves well. We propose to restrict the set of Frechet matchings to "natural" matchings and to this end introduce locally correct Frechet matchings. We prove that at least one such matching exists for two polygonal curves and give an O(N^3 log N) algorithm to compute it, where N is the total number of edges in both curves. We also present an O(N^2) algorithm to compute a locally correct discrete Frechet matching.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。