A graph-based cell tracking algorithm with few manually tunable parameters and automated segmentation error correction
Fig 4
The tracking graph is modified by applying untangling operations (a) such that each track has at most one predecessor and at most two successors—to model cell division. Different combinations of untangling operations, however, all lead to valid tracking graphs (b). We model the problem of selecting a set of untangling operations as an optimization problem and choose the set of untangling operations that induces the fewest modifications on the graph—highlighted in green.