欧氏度量的乘积及其在曲线邻近问题中的应用
Products of Euclidean metrics and applications to proximity questions among curves
摘要:
近似最近邻(ANN)搜索问题是计算机科学中的基础问题,并且在过去的几十年中已经受益于显著的进展。然而,大多数工作一直致力于点集,而复杂的形状没有得到充分的处理。在这里,我们专注于欧氏空间中的离散曲线之间的距离函数:它们出现在广泛的应用中,从道路段到一般维度的时间序列。对于欧几里德度量的$\ell_p$ -产品,对于任何$p$,我们设计了简单而有效的数据结构的人工神经网络,基于随机投影,这是独立的利益。它们用于解决离散曲线之间的距离概念下的邻近问题,该距离概括了离散Fréchet距离和动态时间弯曲距离。这些是比较这些曲线的最流行和最实用的方法。我们提供了第一个数据结构和查询算法的人工神经网络与任意好的近似因子,在现有的方法增加空间使用和预处理时间的代价。查询的时间复杂度与我们的算法相当或有显著的改善,我们的算法在曲线长度有界时特别有效。
英文摘要:
The problem of Approximate Nearest Neighbor (ANN) search is fundamental in computer science and has benefited from significant progress in the past couple of decades. However, most work has been devoted to pointsets whereas complex shapes have not been sufficiently treated. Here, we focus on distance functions between discretized curves in Euclidean space: they appear in a wide range of applications, from road segments to time-series in general dimension. For $\ell_p$-products of Euclidean metrics, for any $p$, we design simple and efficient data structures for ANN, based on randomized projections, which are of independent interest. They serve to solve proximity problems under a notion of distance between discretized curves, which generalizes both discrete Fréchet and Dynamic Time Warping distances. These are the most popular and practical approaches to comparing such curves. We offer the first data structures and query algorithms for ANN with arbitrarily good approximation factor, at the expense of increasing space usage and preprocessing time over existing methods. Query time complexity is comparable or significantly improved by our algorithms, our algorithm is especially efficient when the length of the curves is bounded.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。