Computing consensus curves

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

doi:10.1007/978-3-319-07959-2_19

Computing consensus curves

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

Computer Science

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

2 Scopus citations

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.

Original language	English (US)
Title of host publication	Experimental Algorithms - 13th International Symposium, SEA 2014, Proceedings
Publisher	Springer-Verlag
Pages	223-234
Number of pages	12
ISBN (Print)	9783319079585
DOIs	https://doi.org/10.1007/978-3-319-07959-2_19
State	Published - 2014
Event	13th International Symposium on Experimental Algorithms, SEA 2014 - Copenhagen, Denmark Duration: Jun 29 2014 → Jul 1 2014

Publication series

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

Other

Other	13th International Symposium on Experimental Algorithms, SEA 2014
Country/Territory	Denmark
City	Copenhagen
Period	6/29/14 → 7/1/14

ASJC Scopus subject areas

Theoretical Computer Science
General Computer Science

Access to Document

10.1007/978-3-319-07959-2_19

Cite this

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

Computing consensus curves. / De La Cruz, Livio; Kobourov, Stephen; Pupyrev, Sergey et al.
Experimental Algorithms - 13th International Symposium, SEA 2014, Proceedings. Springer-Verlag, 2014. p. 223-234 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 8504 LNCS).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

De La Cruz, L, Kobourov, S, Pupyrev, S, Shen, PS & Veeramoni, S 2014, Computing consensus curves. in Experimental Algorithms - 13th International Symposium, SEA 2014, Proceedings. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 8504 LNCS, Springer-Verlag, pp. 223-234, 13th International Symposium on Experimental Algorithms, SEA 2014, Copenhagen, Denmark, 6/29/14. https://doi.org/10.1007/978-3-319-07959-2_19

De La Cruz L, Kobourov S, Pupyrev S, Shen PS, Veeramoni S. Computing consensus curves. In Experimental Algorithms - 13th International Symposium, SEA 2014, Proceedings. Springer-Verlag. 2014. p. 223-234. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). doi: 10.1007/978-3-319-07959-2_19

@inproceedings{8aba7a8890ac4494864be73d4d22d843,

title = "Computing consensus curves",

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.",

author = "\{De La Cruz\}, Livio and Stephen Kobourov and Sergey Pupyrev and Shen, \{Paul S.\} and Sankar Veeramoni",

year = "2014",

doi = "10.1007/978-3-319-07959-2\_19",

language = "English (US)",

isbn = "9783319079585",

series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

publisher = "Springer-Verlag",

pages = "223--234",

booktitle = "Experimental Algorithms - 13th International Symposium, SEA 2014, Proceedings",

note = "13th International Symposium on Experimental Algorithms, SEA 2014 ; Conference date: 29-06-2014 Through 01-07-2014",

}

TY - GEN

T1 - Computing consensus curves

AU - De La Cruz, Livio

AU - Kobourov, Stephen

AU - Pupyrev, Sergey

AU - Shen, Paul S.

AU - Veeramoni, Sankar

PY - 2014

Y1 - 2014

N2 - 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.

AB - 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.

UR - https://www.scopus.com/pages/publications/84903692950

UR - https://www.scopus.com/pages/publications/84903692950#tab=citedBy

U2 - 10.1007/978-3-319-07959-2_19

DO - 10.1007/978-3-319-07959-2_19

M3 - Conference contribution

AN - SCOPUS:84903692950

SN - 9783319079585

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 223

EP - 234

BT - Experimental Algorithms - 13th International Symposium, SEA 2014, Proceedings

PB - Springer-Verlag

T2 - 13th International Symposium on Experimental Algorithms, SEA 2014

Y2 - 29 June 2014 through 1 July 2014

ER -

Computing consensus curves

Abstract

Publication series

Other

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this