Metrics for comparing explicit representations of interconnected biological networks

D. Mayerich, C. Björnsson, Jonothan Taylor, B. Roysam
{"title":"Metrics for comparing explicit representations of interconnected biological networks","authors":"D. Mayerich, C. Björnsson, Jonothan Taylor, B. Roysam","doi":"10.1109/BioVis.2011.6094051","DOIUrl":null,"url":null,"abstract":"One of the major goals in biomedical image processing is accurate segmentation of networks embedded in volumetric data sets. Biological networks are composed of a meshwork of thin filaments that span large volumes of tissue. Examples of these structures include neurons and microvasculature, which can take the form of both hierarchical trees and fully connected networks, depending on the imaging modality and resolution. Network function depends on both the geometric structure and connectivity. Therefore, there is considerable demand for algorithms that segment biological networks embedded in three-dimensional data. While a large number of tracking and segmentation algorithms have been published, most of these do not generalize well across data sets. One of the major reasons for the lack of general-purpose algorithms is the limited availability of metrics that can be used to quantitiatively compare their effectiveness against a pre-constructed ground-truth. In this paper, we propose a robust metric for measuring and visualizing the differences between network models. Our algorithm takes into account both geometry and connectivity to measure network similarity. These metrics are then mapped back onto an explicit model for visualization.","PeriodicalId":354473,"journal":{"name":"2011 IEEE Symposium on Biological Data Visualization (BioVis).","volume":"18 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2011-10-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"7","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2011 IEEE Symposium on Biological Data Visualization (BioVis).","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/BioVis.2011.6094051","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 7

Abstract

One of the major goals in biomedical image processing is accurate segmentation of networks embedded in volumetric data sets. Biological networks are composed of a meshwork of thin filaments that span large volumes of tissue. Examples of these structures include neurons and microvasculature, which can take the form of both hierarchical trees and fully connected networks, depending on the imaging modality and resolution. Network function depends on both the geometric structure and connectivity. Therefore, there is considerable demand for algorithms that segment biological networks embedded in three-dimensional data. While a large number of tracking and segmentation algorithms have been published, most of these do not generalize well across data sets. One of the major reasons for the lack of general-purpose algorithms is the limited availability of metrics that can be used to quantitiatively compare their effectiveness against a pre-constructed ground-truth. In this paper, we propose a robust metric for measuring and visualizing the differences between network models. Our algorithm takes into account both geometry and connectivity to measure network similarity. These metrics are then mapped back onto an explicit model for visualization.
用于比较相互连接的生物网络的显式表示的度量
生物医学图像处理的主要目标之一是准确分割嵌入在体积数据集中的网络。生物网络是由跨越大量组织的细丝网组成的。这些结构的例子包括神经元和微血管,它们可以采取分层树和完全连接网络的形式,这取决于成像方式和分辨率。网络的功能取决于网络的几何结构和连通性。因此,对嵌入在三维数据中的生物网络进行分割的算法有相当大的需求。虽然已经发表了大量的跟踪和分割算法,但大多数算法都不能很好地泛化数据集。缺乏通用算法的主要原因之一是可用于将其有效性与预先构建的基础真值进行定量比较的度量的可用性有限。在本文中,我们提出了一个鲁棒度量来测量和可视化网络模型之间的差异。我们的算法同时考虑几何和连通性来衡量网络的相似性。然后将这些指标映射回显式模型以进行可视化。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信