【24h】

A Level Set Bridging Force for the Segmentation of Dendritic Spines

机译:树突棘分割的水平集架桥力。

获取原文
获取原文并翻译 | 示例
获取外文期刊封面目录资料

摘要

The paper focusses on a group of segmentation problems dealing with 3D data sets showing thin objects that appear disconnected in the data due to partial volume effects or a large spacing between neighbouring slices. We propose a modification of the speed function for the well-known level set method to bridge these discontinuities. This allows for the segmentation of the object as a whole. In this paper we are concerned with treelike structures, particularly dendrites in microscopic data sets, whose shape is unknown prior to segmentation. Using the modified speed function, our algorithm segments dendrites and their spines, even if parts of the object appear to be disconnected due to artifacts.
机译:本文关注于处理3D数据集的一组分割问题,这些问题显示由于部分体积效应或相邻切片之间的较大间距而在数据中显示为断开连接的薄对象。我们建议对速度函数进行修改,以用于众所周知的水平集方法以弥合这些不连续性。这允许整体上分割对象。在本文中,我们关注的是树状结构,尤其是微观数据集中的树突,其形状在分割之前是未知的。使用修改后的速度函数,即使对象的某些部分由于伪影而断开连接,我们的算法也可以分割树突及其刺。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号