首页> 外文会议>Biomedical Imaging (ISBI), 2012 9th IEEE International Symposium on >Hidden Markov models for tracking neuronal structure contours in electron micrograph stacks
【24h】

Hidden Markov models for tracking neuronal structure contours in electron micrograph stacks

机译:用于跟踪电子显微照片堆栈中神经元结构轮廓的隐马尔可夫模型

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

摘要

This paper is focused on the problem of tracking cell contours across an electron micrograph stack, so as to discern the 3D neuronal structures, with particular application to analysis of retinal images. While the problem bears similarity to traditional object tracking in video sequences, it poses additional significant challenges due to the coarse z-axis resolution which causes large contour deformations across frames, and involves major topological changes including contour splits and merges. The method proposed herein applies a deformable trellis, on which a hidden Markov model is defined, to track contour deformation. The first phase produces an estimated new contour and computes its probability given the model. The second phase detects low-confidence contour segments and tests the hypothesis that a topological change has occurred, by introducing corresponding hypothetical arcs and re-optimizing the contour. The most probable solution, including the topological hypothesis, is identified. Experimental results show, both quantitatively and qualitatively, that the proposed approach can effectively and efficiently track cell contours while accounting for splitting, merging, large contour displacements and deformations.
机译:本文致力于解决在电子显微照片堆栈上跟踪细胞轮廓的问题,从而识别3D神经元结构,特别是在视网膜图像分析中的应用。尽管该问题与视频序列中的传统对象跟踪具有相似之处,但是由于粗略的z轴分辨率会导致跨帧的轮廓变形较大,并且涉及主要的拓扑更改(包括轮廓分割和合并),因此带来了其他重大挑战。本文提出的方法应用了可变形的网格来跟踪轮廓变形,在网格上定义了隐马尔可夫模型。在给定模型的情况下,第一阶段将生成估计的新轮廓并计算其概率。第二阶段通过引入相应的假想弧并重新优化轮廓,检测低置信度轮廓线段并测试发生拓扑变化的假设。确定最可能的解决方案,包括拓扑假设。实验结果从定量和定性两个方面表明,该方法可以有效地跟踪单元格轮廓,同时考虑了分裂,合并,大轮廓位移和变形。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号