Bioinformatics Institute (BII), 30 Biopolis Street, #07-01, Matrix, Singapore 138671.
Cytometry A. 2010 Apr;77(4):379-86. doi: 10.1002/cyto.a.20876.
Analyzing cellular morphologies on a cell-by-cell basis is vital for drug discovery, cell biology, and many other biological studies. Interactions between cells in their culture environments cause cells to touch each other in acquired microscopy images. Because of this phenomenon, cell segmentation is a challenging task, especially when the cells are of similar brightness and of highly variable shapes. The concept of topological dependence and the maximum common boundary (MCB) algorithm are presented in our previous work (Yu et al., Cytometry Part A 2009;75A:289-297). However, the MCB algorithm suffers a few shortcomings, such as low computational efficiency and difficulties in generalizing to higher dimensions. To overcome these limitations, we present the evolving generalized Voronoi diagram (EGVD) algorithm. Utilizing image intensity and geometric information, EGVD preserves topological dependence easily in both 2D and 3D images, such that touching cells can be segmented satisfactorily. A systematic comparison with other methods demonstrates that EGVD is accurate and much more efficient.
在单细胞基础上分析细胞形态对于药物发现、细胞生物学和许多其他生物学研究至关重要。细胞在培养环境中的相互作用导致细胞在获得的显微镜图像中彼此接触。由于这种现象,细胞分割是一项具有挑战性的任务,特别是当细胞具有相似的亮度和高度可变的形状时。拓扑依赖性和最大公共边界(MCB)算法的概念在我们之前的工作中提出(Yu 等人,《细胞计量学 Part A》2009 年;75A:289-297)。然而,MCB 算法存在一些缺点,例如计算效率低,难以推广到更高维度。为了克服这些限制,我们提出了进化广义 Voronoi 图(EGVD)算法。EGVD 利用图像强度和几何信息,在 2D 和 3D 图像中轻松保持拓扑依赖性,从而可以满意地分割接触的细胞。与其他方法的系统比较表明,EGVD 既准确又高效得多。