吠叫的狗:一种用于绕行检测的Fréchet距离变体
Barking dogs: A Fréchet distance variant for detour detection
AI总结:
本文提出吠叫距离这一非对称曲线相似性度量,用于检测折线Q中相对于P的离群点,并在离散、半离散和连续三种设定下给出计算算法及基于SETH的下界。
摘要:
想象你是一只站在栅栏Q后面的狗,一位徒步旅行者正沿着徒步路径P以恒定速度经过。为了履行你看门狗的职责,你希望尽可能长时间地对这个人吠叫。然而,你的吠叫声只能在固定半径ρ内被听到,并且作为一只狗,你的速度有界为s。假设你可以以最多为s的速度前后奔跑,你能否优化沿栅栏Q的路线,以最大化在半径ρ内的吠叫时间?我们将从具有n个顶点的折线P到具有m个顶点的折线Q的吠叫距离定义为:如果你沿Q以最优方式奔跑,徒步旅行者停留在你吠叫半径内的时间。这种两条曲线之间的非对称相似性度量可用于检测Q中相对于P的离群点,而其他已有度量(如Fréchet距离和动态时间规整)有时无法捕捉到这些离群点。我们在三种不同设定下考虑这一度量。在离散设定中,P和Q的遍历都是离散的。对于这种情况,我们证明从P到Q的吠叫距离可以在O(nm log s)时间内计算。在半离散设定中,Q的遍历是连续的,而P的遍历仍然是离散的。这里,我们展示如何在O(nm log (nm))时间内计算吠叫距离。最后,在两种遍历都是连续的连续设定中,我们证明该问题可以在多项式时间内解决。对于所有设定,我们证明在假设SETH成立的前提下,不存在真正亚二次的算法。
英文摘要:
Imagine you are a dog behind a fence $Q$ and a hiker is passing by at constant speed along the hiking path $P$. In order to fulfil your duties as a watchdog, you desire to bark as long as possible at the human. However, your barks can only be heard in a fixed radius $ρ$ and, as a dog, you have bounded speed $s$. Can you optimize your route along the fence $Q$ in order to maximize the barking time with radius $ρ$, assuming you can run backwards and forward at speed at most $s$? We define the barking distance from a polyline $P$ on $n$ vertices to a polyline $Q$ on $m$ vertices as the time that the hiker stays in your barking radius if you run optimally along $Q$. This asymmetric similarity measure between two curves can be used to detect outliers in $Q$ compared to $P$ that other established measures like the Fréchet distance and Dynamic Time Warping fail to capture at times. We consider this measure in three different settings. In the discrete setting, the traversals of $P$ and $Q$ are both discrete. For this case we show that the barking distance from $P$ to $Q$ can be computed in $O(nm\log s)$ time. In the semi-discrete setting, the traversal of $Q$ is continuous while the one of $P$ is again discrete. Here, we show how to compute the barking distance in time $O(nm\log (nm))$. Finally, in the continuous setting in which both traversals are continuous, we show that the problem can be solved in polynomial time. For all the settings we show that, assuming SETH, no truly subquadratic algorithm can exist.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。