当Lipschitz遛你的狗:平移下离散Fréchet距离的算法工程
When Lipschitz Walks Your Dog: Algorithm Engineering of the Discrete Fréchet Distance under Translation
摘要:
考虑一个自然的问题,即如何通过一个在曲线平移下不变的量来度量平面中曲线的相似性。每当我们的目标是量化曲线形状的相似性而不是它们在平面中的位置时,这样的测量是合理的,例如,来比较手写字符的相似性。也许最自然的概念是平移下的(离散的)弗雷歇距离。不幸的是,关于这个问题的算法文献产生了一个非常悲观的观点:在具有$n$顶点的多边形曲线上,最快的算法在时间上运行$O(n^{4.667})$,并且不能在$n^{4-o(1)}$以下改进,除非强指数时间假设失败。我们还能得到一个在现实数据集上有效的实现吗?受最近实现的Fréchet距离的令人惊讶的性能的刺激,我们在平移下对Fréchet距离进行算法工程。我们的解决方案结合了快速,但不精确的工具,从连续优化(具体来说,分支定界算法的全局Lipschitz优化)与精确的,但昂贵的算法,从计算几何(具体来说,问题特定的算法的基础上安排建设)。我们结合这两个成分,以获得一个精确的决定算法的Fréchet距离下的翻译。对于计算距离值达到所需精度的相关任务,我们设计并比较了不同的方法。在涉及手写字符和路线轨迹的基准测试集上,我们的实现在标准桌面硬件上回答了几毫秒到一秒的范围内的典型查询。我们相信,我们的实现将使在应用程序中使用的翻译下的Fréchet距离,而以前的方法在计算上是不可行的。
英文摘要:
Consider the natural question of how to measure the similarity of curves in the plane by a quantity that is invariant under translations of the curves. Such a measure is justified whenever we aim to quantify the similarity of the curves' shapes rather than their positioning in the plane, e.g., to compare the similarity of handwritten characters. Perhaps the most natural such notion is the (discrete) Fréchet distance under translation. Unfortunately, the algorithmic literature on this problem yields a very pessimistic view: On polygonal curves with $n$ vertices, the fastest algorithm runs in time $O(n^{4.667})$ and cannot be improved below $n^{4-o(1)}$ unless the Strong Exponential Time Hypothesis fails. Can we still obtain an implementation that is efficient on realistic datasets? Spurred by the surprising performance of recent implementations for the Fréchet distance, we perform algorithm engineering for the Fréchet distance under translation. Our solution combines fast, but inexact tools from continuous optimization (specifically, branch-and-bound algorithms for global Lipschitz optimization) with exact, but expensive algorithms from computational geometry (specifically, problem-specific algorithms based on an arrangement construction). We combine these two ingredients to obtain an exact decision algorithm for the Fréchet distance under translation. For the related task of computing the distance value up to a desired precision, we engineer and compare different methods. On a benchmark set involving handwritten characters and route trajectories, our implementation answers a typical query for either task in the range of a few milliseconds up to a second on standard desktop hardware. We believe that our implementation will enable the use of the Fréchet distance under translation in applications, whereas previous approaches would have been computationally infeasible.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。