Skip to main navigation Skip to search Skip to main content

Multiple ant tracking with global foreground maximization and variable target proposal distribution

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

Abstract

Motion and behavior analysis of social insects such as ants requires tracking many ants over time. This process is highly labor-intensive and tedious. Automatic tracking is challenging as ants often interact with one another, resulting in frequent occlusions that cause drifts in tracking. In addition, tracking many objects is computationally expensive. In this paper, we present a robust and efficient method for tracking multiple ants. We first prevent drifts by maximizing the coverage of foreground pixels at at global scale. Secondly, we improve speed by reducing markov chain length through dynamically changing the target proposal distribution for perturbed ant selection. Using a real dataset with ground truth, we demonstrate that our algorithm was able to improve the accuracy by 15% (resulting in 98% tracking accuracy) and the speed by 76%.

Original languageEnglish (US)
Title of host publication2011 IEEE Workshop on Applications of Computer Vision, WACV 2011
PublisherIEEE Computer Society
Pages570-576
Number of pages7
ISBN (Print)9781424494965
DOIs
StatePublished - 2011

Publication series

Name2011 IEEE Workshop on Applications of Computer Vision, WACV 2011

ASJC Scopus subject areas

  • Computer Science Applications
  • Computer Vision and Pattern Recognition

Fingerprint

Dive into the research topics of 'Multiple ant tracking with global foreground maximization and variable target proposal distribution'. Together they form a unique fingerprint.

Cite this