Computing consensus curves

2Citations
Citations of this article
5Readers
Mendeley users who have this article in their library.
Get full text

Abstract

We study the problem of extracting accurate average ant trajectories from many (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 better at this task. We consider several local (one ant at a time) and global (all ants together) methods. Our best performing algorithm uses a novel global method, based on finding edge-disjoint paths in a graph constructed from the input trajectories. The underlying optimization problem is a new and interesting network flow variant. Even though the problem is NP-complete, two heuristics work well in practice, outperforming all other approaches, including the best automated system. © 2014 Springer International Publishing.

Cite

CITATION STYLE

APA

De La Cruz, L., Kobourov, S., Pupyrev, S., Shen, P. S., & Veeramoni, S. (2014). Computing consensus curves. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 8504 LNCS, pp. 223–234). Springer Verlag. https://doi.org/10.1007/978-3-319-07959-2_19

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free