计算共识曲线
Computing Consensus Curves
摘要:
我们认为,从许多(可能是不准确的)公民科学家贡献的输入轨迹提取准确的平均蚂蚁轨迹的问题。虽然有许多通用的软件工具用于运动跟踪和昆虫跟踪的特定工具,但即使是未经训练的人也更擅长这项任务,提供了一种强大的方法来计算平均轨迹。我们实现并测试了几个本地(一次一只蚂蚁)和全局(所有蚂蚁一起)方法。我们的最佳性能的算法使用一种新的全球方法,基于寻找边缘不相交的路径从输入轨迹构造的蚂蚁交互图。底层优化问题是网络流的一个新的有趣的变体。尽管这个问题是NP难的,但我们实现了两个算法,它们在实践中工作得很好,优于所有其他方法,包括最好的自动化系统。
英文摘要:
We consider the problem of extracting accurate average ant trajectories from many (possibly inaccurate) input trajectories contributed by citizen scientists. Although there are many generic software tools for motion tracking and specific ones for insect tracking, even untrained humans are much better at this task, provided a robust method to computing the average trajectories. We implemented and tested several local (one ant at a time) and global (all ants together) method. Our best performing algorithm uses a novel global method, based on finding edge-disjoint paths in an ant-interaction graph constructed from the input trajectories. The underlying optimization problem is a new and interesting variant of network flow. Even though the problem is NP-hard, we implemented two heuristics, which work very well in practice, outperforming all other approaches, including the best automated system.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。