arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1808.01983cs.CG
收藏

Fréchet距离的概率嵌入

Probabilistic embeddings of the Fréchet distance

Anne Driemel, Amer Krivošija

摘要:

Fréchet距离是一种流行的曲线距离度量,它自然适用于基本的计算任务,例如聚类,最近邻搜索和相应度量空间中的球形范围搜索。然而,其固有的复杂性在实践中提出了相当大的计算挑战。为了解决这个问题,我们研究失真的概率嵌入,结果从投影曲线到一个随机选择的线。这样的嵌入可以与例如位置敏感散列结合使用。我们表明,在最坏的情况下,在合理的假设下,离散Fréchet距离的两个多边形曲线的复杂性$t$在$\mathbb{R}^d$,其中$d\in\lbrace 2,3,4,5\rbrace$,降低了一个因素的线性$t$与恒定的概率。我们显示上界和下界的失真。我们还评估了我们的研究结果经验的基准数据集。初步的实验结果与我们的下限形成鲜明对比。它们表明,高度扭曲的投影在实践中很少发生,并且仅用于强条件输入曲线。关键词:Fréchet距离,度量嵌入,随机投影

英文摘要:

The Fréchet distance is a popular distance measure for curves which naturally lends itself to fundamental computational tasks, such as clustering, nearest-neighbor searching, and spherical range searching in the corresponding metric space. However, its inherent complexity poses considerable computational challenges in practice. To address this problem we study distortion of the probabilistic embedding that results from projecting the curves to a randomly chosen line. Such an embedding could be used in combination with, e.g. locality-sensitive hashing. We show that in the worst case and under reasonable assumptions, the discrete Fréchet distance between two polygonal curves of complexity $t$ in $\mathbb{R}^d$, where $d\in\lbrace 2,3,4,5\rbrace$, degrades by a factor linear in $t$ with constant probability. We show upper and lower bounds on the distortion. We also evaluate our findings empirically on a benchmark data set. The preliminary experimental results stand in stark contrast with our lower bounds. They indicate that highly distorted projections happen very rarely in practice, and only for strongly conditioned input curves. Keywords: Fréchet distance, metric embeddings, random projections

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑