A graph-based cell tracking algorithm with few manually tunable parameters and automated segmentation error correction
Fig 3
Extracted features to link segmented objects.
Shown are two correctly segmented objects at time point t and a single segmented object due to an under-segmentation error at time point t + 1. To calculate cost terms, for each segmentation mask i at time point t the mask centroid pi,t—shown as a cross –, a set of mask points —shown in a lighter shade—and a bounding box
—shown as a rectangle—are extracted. The Euclidean distance between the mask centroid pj,t+1 and the propagated mask centroid
is large, which can result in wrong links. The minimal Euclidean distance between the propagated mask centroid
and the set of mask points
, in contrast, is small.