Automatic vessel tree structure extraction by growing minimal paths and a mask

Da Chen, L. Cohen
{"title":"Automatic vessel tree structure extraction by growing minimal paths and a mask","authors":"Da Chen, L. Cohen","doi":"10.1109/ISBI.2014.6867992","DOIUrl":null,"url":null,"abstract":"In this paper, we propose a completely automatic method to extract the vessel tree structure including its centerlines and radius using geodesic paths technology. Our main goal is to find a set of key points located in the vessel centerlines, link each pair of key points by minimal paths for finding the vessels between them and stop this process automatically. This work adapts the growing minimal paths method to find the set of key points. The main drawback of growing minimal paths is when to stop the processing. To solve this problem we propose an automatic stopping criteria. Additionally, we use a cake wavelet to compute the vessel measurement consisting of both radius and orientation to develop the classical growing minimal paths model which cannot guarantee the extracted tree corresponds to the centerlines of the vessel tree.","PeriodicalId":440405,"journal":{"name":"2014 IEEE 11th International Symposium on Biomedical Imaging (ISBI)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2014-07-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2014 IEEE 11th International Symposium on Biomedical Imaging (ISBI)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ISBI.2014.6867992","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 3

Abstract

In this paper, we propose a completely automatic method to extract the vessel tree structure including its centerlines and radius using geodesic paths technology. Our main goal is to find a set of key points located in the vessel centerlines, link each pair of key points by minimal paths for finding the vessels between them and stop this process automatically. This work adapts the growing minimal paths method to find the set of key points. The main drawback of growing minimal paths is when to stop the processing. To solve this problem we propose an automatic stopping criteria. Additionally, we use a cake wavelet to compute the vessel measurement consisting of both radius and orientation to develop the classical growing minimal paths model which cannot guarantee the extracted tree corresponds to the centerlines of the vessel tree.
通过生长最小路径和掩模自动提取血管树结构
本文提出了一种基于测地线路径技术的血管树结构自动提取方法,包括其中心线和半径。我们的主要目标是找到一组位于血管中心线的关键点,通过最小路径连接每对关键点,以找到它们之间的血管,并自动停止此过程。本文采用最小成长路径法寻找关键点集。增长最小路径的主要缺点是何时停止处理。为了解决这个问题,我们提出了一个自动停止准则。此外,我们使用饼状小波计算由半径和方向组成的血管测量,建立了经典的生长最小路径模型,该模型不能保证提取的树与血管树的中心线对应。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术文献互助群
群 号:481959085
Book学术官方微信