Tracking Tetrahymena Pyriformis Cells using Decision Trees

07/13/2012
by   Quan Wang, et al.
0

Matching cells over time has long been the most difficult step in cell tracking. In this paper, we approach this problem by recasting it as a classification problem. We construct a feature set for each cell, and compute a feature difference vector between a cell in the current frame and a cell in a previous frame. Then we determine whether the two cells represent the same cell over time by training decision trees as our binary classifiers. With the output of decision trees, we are able to formulate an assignment problem for our cell association task and solve it using a modified version of the Hungarian algorithm.

READ FULL TEXT
research
04/05/2023

Inapproximability of sufficient reasons for decision trees

In this note, we establish the hardness of approximation of the problem ...
research
06/26/2019

Joint Multi-frame Detection and Segmentation for Multi-cell Tracking

Tracking living cells in video sequence is difficult, because of cell mo...
research
06/08/2010

The Deterministic Dendritic Cell Algorithm

The Dendritic Cell Algorithm is an immune-inspired algorithm orig- inall...
research
02/14/2019

Some Interesting Features of Memristor CNN

In this paper, we introduce some interesting features of a memristor CNN...
research
10/19/2017

Post-Prognostics Decision for Optimizing the Commitment of Fuel Cell Systems

In a post-prognostics decision context, this paper addresses the problem...
research
10/20/2022

Cell tracking for live-cell microscopy using an activity-prioritized assignment strategy

Cell tracking is an essential tool in live-cell imaging to determine sin...
research
05/22/2023

On the Implementation of Boolean Functions on Content-Addressable Memories

Let [q⟩ denote the integer set {0,1,…,...,q-1} and let 𝔹={0,1}. The prob...

Please sign up or login with your details

Forgot password? Click here to reset