首页> 外文期刊>BMC Bioinformatics >M-AMST: an automatic 3D neuron tracing method based on mean shift and adapted minimum spanning tree
【24h】

M-AMST: an automatic 3D neuron tracing method based on mean shift and adapted minimum spanning tree

机译:M-AMST:一种基于均值漂移和自适应最小生成树的自动3D神经元跟踪方法

获取原文
           

摘要

Background Understanding the working mechanism of the brain is one of the grandest challenges for modern science. Toward this end, the BigNeuron project was launched to gather a worldwide community to establish a big data resource and a set of the state-of-the-art of single neuron reconstruction algorithms. Many groups contributed their own algorithms for the project, including our mean shift and minimum spanning tree (M-MST). Although M-MST is intuitive and easy to implement, the MST just considers spatial information of single neuron and ignores the shape information, which might lead to less precise connections between some neuron segments. In this paper, we propose an improved algorithm, namely M-AMST, in which a rotating sphere model based on coordinate transformation is used to improve the weight calculation method in M-MST. Results Two experiments are designed to illustrate the effect of adapted minimum spanning tree algorithm and the adoptability of M-AMST in reconstructing variety of neuron image datasets respectively. In the experiment 1, taking the reconstruction of APP2 as reference, we produce the four difference scores (entire structure average (ESA), different structure average (DSA), percentage of different structure (PDS) and max distance of neurons’ nodes (MDNN)) by comparing the neuron reconstruction of the APP2 and the other 5 competing algorithm. The result shows that M-AMST gets lower difference scores than M-MST in ESA, PDS and MDNN. Meanwhile, M-AMST is better than N-MST in ESA and MDNN. It indicates that utilizing the adapted minimum spanning tree algorithm which took the shape information of neuron into account can achieve better neuron reconstructions. In the experiment 2, 7 neuron image datasets are reconstructed and the four difference scores are calculated by comparing the gold standard reconstruction and the reconstructions produced by 6 competing algorithms. Comparing the four difference scores of M-AMST and the other 5 algorithm, we can conclude that M-AMST is able to achieve the best difference score in 3 datasets and get the second-best difference score in the other 2 datasets. Conclusions We develop a pathway extraction method using a rotating sphere model based on coordinate transformation to improve the weight calculation approach in MST. The experimental results show that M-AMST utilizes the adapted minimum spanning tree algorithm which takes the shape information of neuron into account can achieve better neuron reconstructions. Moreover, M-AMST is able to get good neuron reconstruction in variety of image datasets.
机译:背景技术了解大脑的工作机制是现代科学面临的最大挑战之一。为此,发起了BigNeuron项目,以聚集世界各地的社区以建立大数据资源和一组最新的单神经元重建算法。许多小组为此项目贡献了自己的算法,包括我们的均值漂移和最小生成树(M-MST)。尽管M-MST直观且易于实现,但是MST仅考虑单个神经元的空间信息,而忽略形状信息,这可能导致某些神经元段之间的连接不那么精确。在本文中,我们提出了一种改进的算法,即M-AMST,其中使用了基于坐标变换的旋转球模型来改进M-MST中的权重计算方法。结果设计了两个实验,分别说明了自适应最小生成树算法和M-AMST在重建各种神经元图像数据集方面的可采性。在实验1中,以APP2的重建为参考,我们得出了四个差异分数(整个结构平均值(ESA),不同结构平均值(DSA),不同结构百分比(PDS)和神经元节点的最大距离(MDNN) )),通过比较APP2和其他5种竞争算法的神经元重构。结果表明,在ESA,PDS和MDNN中,M-AMST的得分低于M-MST。同时,在ESA和MDNN中,M-AMST优于N-MST。这表明利用考虑神经元形状信息的自适应最小生成树算法可以实现更好的神经元重建。在实验2中,重建了7个神经元图像数据集,并通过比较黄金标准重建图和由6种竞争算法生成的重建图来计算四个差异分数。比较M-AMST的四个差异分数和其他5个算法,我们可以得出结论,M-AMST能够在3个数据集中获得最佳差异分数,并在其他2个数据集中获得第二最佳差异分数。结论我们开发了一种基于坐标变换的旋转球模型的路径提取方法,以改进MST中的权重计算方法。实验结果表明,M-AMST利用自适应最小生成树算法,该算法考虑了神经元的形状信息,可以实现更好的神经元重建。此外,M-AMST能够在各种图像数据集中获得良好的神经元重建。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号