Please use this identifier to cite or link to this item: http://hdl.handle.net/10995/102451
Title: Computing consensus curves
Authors: De, La, Cruz, L.
Kobourov, S.
Pupyrev, S.
Shen, P. S.
Veeramoni, S.
Issue Date: 2014
Publisher: Springer Verlag
Citation: Computing consensus curves / L. De La Cruz, S. Kobourov, S. Pupyrev, et al. — DOI 10.1007/978-3-319-07959-2_19 // Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). — 2014. — Vol. 8504 LNCS. — P. 223-234.
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.
Keywords: AUTOMATION
OPTIMIZATION
AUTOMATED SYSTEMS
EDGE-DISJOINT PATHS
GENERIC SOFTWARES
GLOBAL METHODS
INPUT TRAJECTORY
MOTION TRACKING
NETWORK FLOWS
OPTIMIZATION PROBLEMS
TRAJECTORIES
URI: http://hdl.handle.net/10995/102451
Access: info:eu-repo/semantics/openAccess
SCOPUS ID: 84903692950
PURE ID: 370643
552529e1-d3e3-4521-a206-856e38e0e294
ISSN: 3029743
ISBN: 9783319079585
DOI: 10.1007/978-3-319-07959-2_19
Appears in Collections:Научные публикации, проиндексированные в SCOPUS и WoS CC

Files in This Item:
File Description SizeFormat 
2-s2.0-84903692950.pdf1,48 MBAdobe PDFView/Open


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.