在实践中快速遛狗:Fréchet距离的算法工程
Walking the Dog Fast in Practice: Algorithm Engineering of the Fréchet Distance
摘要:
Fréchet距离为计算两条(多边形)曲线的相似性的流行任务提供了一种自然和直观的度量。虽然一个简单的算法计算它在近二次时间,一个强次二次算法不存在,除非强指数时间假设失败。尽管如此,Fréchet距离的快速实际实现,特别是对于真实的输入曲线,是非常可取的。这甚至导致了一个指定的竞争,ACM SIGSPATIAL GIS Cup 2017:在这里,挑战是在Fréchet距离下实现近邻数据结构。前三个实现的瓶颈恰恰是Fréchet距离的决策过程。在这项工作中,我们提出了一个快速的,认证的实现决定Fréchet距离,以(1)补充其悲观的最坏情况下的硬度通过对现实的输入数据的实证分析,并(2)提高GIS杯挑战的最先进的。我们的实验评估我们的实现一个大型的基准组成的几个数据集(包括手写字符和GPS轨迹)。的GIS杯的获奖实施相比,我们获得了运行时间的改善,高达两个以上的数量级的决策过程和查询的近邻数据结构的因素高达30。
英文摘要:
The Fréchet distance provides a natural and intuitive measure for the popular task of computing the similarity of two (polygonal) curves. While a simple algorithm computes it in near-quadratic time, a strongly subquadratic algorithm cannot exist unless the Strong Exponential Time Hypothesis fails. Still, fast practical implementations of the Fréchet distance, in particular for realistic input curves, are highly desirable. This has even lead to a designated competition, the ACM SIGSPATIAL GIS Cup 2017: Here, the challenge was to implement a near-neighbor data structure under the Fréchet distance. The bottleneck of the top three implementations turned out to be precisely the decision procedure for the Fréchet distance. In this work, we present a fast, certifying implementation for deciding the Fréchet distance, in order to (1) complement its pessimistic worst-case hardness by an empirical analysis on realistic input data and to (2) improve the state of the art for the GIS Cup challenge. We experimentally evaluate our implementation on a large benchmark consisting of several data sets (including handwritten characters and GPS trajectories). Compared to the winning implementation of the GIS Cup, we obtain running time improvements of up to more than two orders of magnitude for the decision procedure and of up to a factor of 30 for queries to the near-neighbor data structure.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。