Mosig Axel, Jäger Stefan, Wang Chaofeng, Nath Sumit, Ersoy Ilker, Palaniappan Kannap-pan, Chen Su-Shing
Department of Combinatorics and Geometry, CAS-MPG Partner Institute for Computational Biology, 200031 Shanghai, PR China.
Algorithms Mol Biol. 2009 Jul 16;4:10. doi: 10.1186/1748-7188-4-10.
With the increasing availability of live cell imaging technology, tracking cells and other moving objects in live cell videos has become a major challenge for bioimage informatics. An inherent problem for most cell tracking algorithms is over- or under-segmentation of cells - many algorithms tend to recognize one cell as several cells or vice versa.
We propose to approach this problem through so-called topological alignments, which we apply to address the problem of linking segmentations of two consecutive frames in the video sequence. Starting from the output of a conventional segmentation procedure, we align pairs of consecutive frames through assigning sets of segments in one frame to sets of segments in the next frame. We achieve this through finding maximum weighted solutions to a generalized "bipartite matching" between two hierarchies of segments, where we derive weights from relative overlap scores of convex hulls of sets of segments. For solving the matching task, we rely on an integer linear program.
Practical experiments demonstrate that the matching task can be solved efficiently in practice, and that our method is both effective and useful for tracking cells in data sets derived from a so-called Large Scale Digital Cell Analysis System (LSDCAS).
The source code of the implementation is available for download from http://www.picb.ac.cn/patterns/Software/topaln.
随着活细胞成像技术的日益普及,在活细胞视频中追踪细胞及其他移动物体已成为生物图像信息学面临的一项重大挑战。大多数细胞追踪算法存在的一个固有问题是细胞的过度分割或分割不足——许多算法往往会将一个细胞识别为多个细胞,反之亦然。
我们建议通过所谓的拓扑对齐来解决这个问题,我们将其应用于解决视频序列中两个连续帧的分割链接问题。从传统分割程序的输出开始,我们通过将一帧中的段集分配到下一帧中的段集来对齐连续帧对。我们通过找到两个段层次结构之间广义“二分匹配”的最大加权解来实现这一点,其中我们从段集凸包的相对重叠分数中导出权重。为了解决匹配任务,我们依赖于整数线性规划。
实际实验表明,匹配任务在实践中可以有效地解决,并且我们的方法对于在源自所谓大规模数字细胞分析系统(LSDCAS)的数据集中追踪细胞既有效又有用。