首页> 外文会议>Image Processing pt.3; Progress in Biomedical Optics and Imaging; vol.6 no.24 >Tracking neural stem cells in time-lapse microscopy image sequences
【24h】

Tracking neural stem cells in time-lapse microscopy image sequences

机译:在延时显微镜图像序列中跟踪神经干细胞

获取原文
获取原文并翻译 | 示例

摘要

This paper describes an algorithm for tracking neural stem/progenitor cells in a time-lapse microscopy image sequence. The cells were segmented in a semiautomatic way using dynamic programming. Since the interesting cells were identified by fluorescent staining at the end of the sequence, the tracking was performed backwards. The number of detected cells varied throughout the sequence: cells could appear or disappear at the image boundaries or at cell clusters, some cells split, and the segmentation was not always correct. To solve this asymmetric assignment problem, a modified version of the auction algorithm by Bertsekas was used. The assignment weights were calculated based on distance, correlation and size between possible matching cells. Cell splits are of special interest, therefore tracks without a matching cell were divided into two groups: 1. Merging cells (splitting cells, moving forward in time) and 2. Non-merging cells. These groups were separated based on difference in size of the involved cells, and difference in image intensity of the contour and interior of the possibly merged cell. The tracking algorithm was evaluated using a sequence consisting of 57 images, each image containing approximately 50 cells. The evaluation showed that 99% of the cell-to-cell associations were correct. In most cases, only one association per track was incorrect so in total 55 out, of 78 different tracks in the sequence were tracked correctly. Further improvements will be to apply interleaved segmentation and tracking to produce a more reliable segmentation as well as better tracking results.
机译:本文介绍了一种用于在延时显微镜图像序列中跟踪神经干/祖细胞的算法。使用动态编程以半自动方式对单元进行分段。由于感兴趣的细胞是通过序列末尾的荧光染色鉴定的,因此追踪是向后进行的。在整个序列中,检测到的细胞数量各不相同:细胞可能会在图像边界或细胞簇处出现或消失,某些细胞分裂,并且分割并不总是正确的。为了解决这个不对称分配问题,使用了Bertsekas的拍卖算法的修改版本。根据可能的匹配像元之间的距离,相关性和大小来计算分配权重。单元拆分特别令人关注,因此,没有匹配单元的磁道分为两组:1.合并单元(拆分单元,随时间向前移动)和2.非合并单元。根据所涉及单元的大小差异以及可能合并的单元的轮廓和内部的图像强度差异,将这些组分开。使用包含57个图像的序列评估跟踪算法,每个图像包含大约50个细胞。评估显示99%的细胞间关联是正确的。在大多数情况下,每个音轨只有一个关联是不正确的,因此序列中的78个不同音轨中总共有55个被正确追踪。进一步的改进将是应用交错的分段和跟踪以产生更可靠的分段以及更好的跟踪结果。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号