Computing consensus curves

Livio De La Cruz, Stephen Kobourov, Sergey Pupyrev, Paul S. Shen, Sankar Veeramoni

Research output: Chapter in Book/Report/Conference proceedingConference contribution

2 Scopus citations


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.

Original languageEnglish (US)
Title of host publicationExperimental Algorithms - 13th International Symposium, SEA 2014, Proceedings
Number of pages12
ISBN (Print)9783319079585
StatePublished - 2014
Event13th International Symposium on Experimental Algorithms, SEA 2014 - Copenhagen, Denmark
Duration: Jun 29 2014Jul 1 2014

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume8504 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349


Other13th International Symposium on Experimental Algorithms, SEA 2014

ASJC Scopus subject areas

  • Theoretical Computer Science
  • General Computer Science


Dive into the research topics of 'Computing consensus curves'. Together they form a unique fingerprint.

Cite this