首页> 美国卫生研究院文献>other >Cell Segmentation Using Coupled Level Sets and Graph-Vertex Coloring
【2h】

Cell Segmentation Using Coupled Level Sets and Graph-Vertex Coloring

机译:使用耦合的水平集和图顶点着色进行细胞分割

代理获取
本网站仅为用户提供外文OA文献查询和代理获取服务,本网站没有原文。下单后我们将采用程序或人工为您竭诚获取高质量的原文,但由于OA文献来源多样且变更频繁,仍可能出现获取不到、文献不完整或与标题不符等情况,如果获取不到我们将提供退款服务。请知悉。

摘要

Current level-set based approaches for segmenting a large number of objects are computationally expensive since they require a unique level set per object (the N-level set paradigm), or ⌈log2N⌉ level sets when using a multiphase interface tracking formulation. Incorporating energy-based coupling constraints to control the topological interactions between level sets further increases the computational cost to O(N2). We propose a new approach, with dramatic computational savings, that requires only four, or fewer, level sets for an arbitrary number of similar objects (like cells) using the Delaunay graph to capture spatial relationships. Even more significantly, the coupling constraints (energy-based and topological) are incorporated using just constant O(1) complexity. The explicit topological coupling constraint, based on predicting contour collisions between adjacent level sets, is developed to further prevent false merging or absorption of neighboring cells, and also reduce fragmentation during level set evolution. The proposed four-color level set algorithm is used to efficiently and accurately segment hundreds of individual epithelial cells within a moving monolayer sheet from time-lapse images of in vitro wound healing without any false merging of cells.
机译:当前的基于水平集的用于分割大量对象的方法在计算上是昂贵的,因为当使用多相接口跟踪公式时,它们需要每个对象唯一的水平集(N水平集范例)或“ log2N”水平集。引入基于能量的耦合约束来控制级别集之间的拓扑相互作用会进一步增加O(N 2 )的计算成本。我们提出了一种新的方法,该方法节省了大量计算量,对于使用Delaunay图捕获空间关系的任意数量的相似对象(例如像元),只需要四个或更少的水平集即可。更重要的是,仅使用恒定的O(1)复杂度即可合并耦合约束(基于能量和拓扑)。基于预测相邻级别集之间的轮廓冲突的显式拓扑耦合约束条件被开发出来,以进一步防止相邻单元的错误合并或吸收,并减少级别集演化过程中的碎片。所提出的四色水平集算法用于从体外伤口愈合的延时图像中有效,准确地分割移动的单层薄片中的数百个单个上皮细胞,而不会发生任何错误的细胞融合。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
代理获取

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号