Back to Search Start Over

Cell Tracking Accuracy Measurement Based on Comparison of Acyclic Oriented Graphs

Authors :
Martin Maška
Michal Kozubek
Pavel Matula
Dmitry V. Sorokin
Petr Matula
Carlos Ortiz-de-Solorzano
Source :
PLoS ONE, Vol 10, Iss 12, p e0144959 (2015), PLoS ONE
Publication Year :
2015
Publisher :
Public Library of Science (PLoS), 2015.

Abstract

Tracking motile cells in time-lapse series is challenging and is required in many biomedical applications. Cell tracks can be mathematically represented as acyclic oriented graphs. Their vertices describe the spatio-temporal locations of individual cells, whereas the edges represent temporal relationships between them. Such a representation maintains the knowledge of all important cellular events within a captured field of view, such as migration, division, death, and transit through the field of view. The increasing number of cell tracking algorithms calls for comparison of their performance. However, the lack of a standardized cell tracking accuracy measure makes the comparison impracticable. This paper defines and evaluates an accuracy measure for objective and systematic benchmarking of cell tracking algorithms. The measure assumes the existence of a ground-truth reference, and assesses how difficult it is to transform a computed graph into the reference one. The difficulty is measured as a weighted sum of the lowest number of graph operations, such as split, delete, and add a vertex and delete, add, and alter the semantics of an edge, needed to make the graphs identical. The measure behavior is extensively analyzed based on the tracking results provided by the participants of the first Cell Tracking Challenge hosted by the 2013 IEEE International Symposium on Biomedical Imaging. We demonstrate the robustness and stability of the measure against small changes in the choice of weights for diverse cell tracking algorithms and fluorescence microscopy datasets. As the measure penalizes all possible errors in the tracking results and is easy to compute, it may especially help developers and analysts to tune their algorithms according to their needs.

Details

ISSN :
19326203
Volume :
10
Database :
OpenAIRE
Journal :
PLOS ONE
Accession number :
edsair.doi.dedup.....b7f89830b98d0fa61d863f0e09caadf2
Full Text :
https://doi.org/10.1371/journal.pone.0144959