Cookies on this website
We use cookies to ensure that we give you the best experience on our website. If you click 'Continue' we'll assume that you are happy to receive all cookies and you won't see this message again. Click 'Find out more' for information on how to change your cookie settings.
Skip to main content

A growing number of screening applications require the automated monitoring of cell populations in a high-throughput, high-content environment. These applications depend on accurate cell tracking of individual cells that display various behaviors including mitosis, occlusion, rapid movement, and entering and leaving the field of view. We present a tracking approach that explicitly models each of these behaviors and represents the association costs in a graph-theoretic minimum-cost flow framework. We show how to extend the minimum-cost flow algorithm to account for mitosis and merging events by coupling particular edges. We applied the algorithm to nearly 6,000 images of 400,000 cells representing 32,000 tracks taken from five separate datasets, each composed of multiple wells.Our algorithm is able to track cells and detect different cell behaviors with an accuracy of over 99%. © 2009 Springer Berlin Heidelberg.

Original publication

DOI

10.1007/978-3-642-02498-6_31

Type

Journal article

Journal

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

Publication Date

21/09/2009

Volume

5636 LNCS

Pages

374 - 385