交互式轨迹图分割的快速聚类

E. Olivetti, Thien Bao Nguyen, E. Garyfallidis, Nivedita Agarwal, P. Avesani
{"title":"交互式轨迹图分割的快速聚类","authors":"E. Olivetti, Thien Bao Nguyen, E. Garyfallidis, Nivedita Agarwal, P. Avesani","doi":"10.1109/PRNI.2013.20","DOIUrl":null,"url":null,"abstract":"We developed a novel interactive system for human brain tractography segmentation to assist neuroanatomists in identifying white matter anatomical structures of interest from diffusion magnetic resonance imaging (dMRI) data. The difficulty in segmenting and navigating tractographies lies in the very large number of reconstructed neuronal pathways, i.e. the streamlines, which are in the order of hundreds of thousands with modern dMRI techniques. The novelty of our system resides in presenting the user a clustered version of the tractography in which she selects some of the clusters to identify a superset of the streamlines of interest. This superset is then re-clustered at a finer scale and again the user is requested to select the relevant clusters. The process of re-clustering and manual selection is iterated until the remaining streamlines faithfully represent the desired anatomical structure of interest. In this work we present a solution to solve the computational issue of clustering a large number of streamlines under the strict time constraints requested by the interactive use. The solution consists in embedding the streamlines into a Euclidean space and then in adopting a state-of-the art scalable implementation of the k-means algorithm. We tested the proposed system on tractographies from amyotrophic lateral sclerosis (ALS) patients and healthy subjects that we collected for a forthcoming study about the systematic differences between their corticospinal tracts.","PeriodicalId":144007,"journal":{"name":"2013 International Workshop on Pattern Recognition in Neuroimaging","volume":"50 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2013-06-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"11","resultStr":"{\"title\":\"Fast Clustering for Interactive Tractography Segmentation\",\"authors\":\"E. Olivetti, Thien Bao Nguyen, E. Garyfallidis, Nivedita Agarwal, P. Avesani\",\"doi\":\"10.1109/PRNI.2013.20\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"We developed a novel interactive system for human brain tractography segmentation to assist neuroanatomists in identifying white matter anatomical structures of interest from diffusion magnetic resonance imaging (dMRI) data. The difficulty in segmenting and navigating tractographies lies in the very large number of reconstructed neuronal pathways, i.e. the streamlines, which are in the order of hundreds of thousands with modern dMRI techniques. The novelty of our system resides in presenting the user a clustered version of the tractography in which she selects some of the clusters to identify a superset of the streamlines of interest. This superset is then re-clustered at a finer scale and again the user is requested to select the relevant clusters. The process of re-clustering and manual selection is iterated until the remaining streamlines faithfully represent the desired anatomical structure of interest. In this work we present a solution to solve the computational issue of clustering a large number of streamlines under the strict time constraints requested by the interactive use. The solution consists in embedding the streamlines into a Euclidean space and then in adopting a state-of-the art scalable implementation of the k-means algorithm. We tested the proposed system on tractographies from amyotrophic lateral sclerosis (ALS) patients and healthy subjects that we collected for a forthcoming study about the systematic differences between their corticospinal tracts.\",\"PeriodicalId\":144007,\"journal\":{\"name\":\"2013 International Workshop on Pattern Recognition in Neuroimaging\",\"volume\":\"50 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2013-06-22\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"11\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2013 International Workshop on Pattern Recognition in Neuroimaging\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/PRNI.2013.20\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2013 International Workshop on Pattern Recognition in Neuroimaging","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/PRNI.2013.20","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 11

摘要

我们开发了一种新的交互式系统,用于人脑束状图分割,以帮助神经解剖学家从扩散磁共振成像(dMRI)数据中识别感兴趣的白质解剖结构。神经束图分割和导航的困难在于重建的神经元通路数量非常大,即流线,用现代dMRI技术可以达到数十万个数量级。我们系统的新颖之处在于向用户展示了一个束状图的聚类版本,用户可以在其中选择一些簇来识别感兴趣的流线的超集。然后以更小的规模重新聚集这个超集,并再次要求用户选择相关的集群。重复重新聚类和人工选择的过程,直到剩余的流线忠实地代表感兴趣的所需解剖结构。在此工作中,我们提出了一种解决大量流线在交互使用所要求的严格时间限制下聚类计算问题的解决方案。解决方案包括将流线嵌入欧几里得空间,然后采用最先进的k-means算法的可扩展实现。我们在肌萎缩性侧索硬化症(ALS)患者和健康受试者的束束造影上测试了该系统,我们收集了这些受试者用于即将进行的关于他们皮质脊髓束系统差异的研究。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Fast Clustering for Interactive Tractography Segmentation
We developed a novel interactive system for human brain tractography segmentation to assist neuroanatomists in identifying white matter anatomical structures of interest from diffusion magnetic resonance imaging (dMRI) data. The difficulty in segmenting and navigating tractographies lies in the very large number of reconstructed neuronal pathways, i.e. the streamlines, which are in the order of hundreds of thousands with modern dMRI techniques. The novelty of our system resides in presenting the user a clustered version of the tractography in which she selects some of the clusters to identify a superset of the streamlines of interest. This superset is then re-clustered at a finer scale and again the user is requested to select the relevant clusters. The process of re-clustering and manual selection is iterated until the remaining streamlines faithfully represent the desired anatomical structure of interest. In this work we present a solution to solve the computational issue of clustering a large number of streamlines under the strict time constraints requested by the interactive use. The solution consists in embedding the streamlines into a Euclidean space and then in adopting a state-of-the art scalable implementation of the k-means algorithm. We tested the proposed system on tractographies from amyotrophic lateral sclerosis (ALS) patients and healthy subjects that we collected for a forthcoming study about the systematic differences between their corticospinal tracts.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术文献互助群
群 号:481959085
Book学术官方微信