Tracking 3-D pulmonary tree structures

C. Pisupati, L. Wolff, W. Mitzner, E. Zerhouni
{"title":"Tracking 3-D pulmonary tree structures","authors":"C. Pisupati, L. Wolff, W. Mitzner, E. Zerhouni","doi":"10.1109/MMBIA.1996.534068","DOIUrl":null,"url":null,"abstract":"Physiological measurements like branch angles, branch lengths, branch diameters and branch cross-sectional area of the 3-D pulmonary tree structures are clinically essential in evaluating the function of normal and diseased lung and during the breathing process. In order to facilitate these measurements and study relative structural changes, the 3-D lung tree volumes are reduced to a 3-D Euclidean straight line central axis tree. The central axis tree captures the branch topology and geometric features of the tree volume. Since matching 3-D tree volumes is complex, as they change in branch topology and geometry, the authors accomplish it by designing an efficient algorithm that matches their corresponding central axis trees. The algorithm takes two binary central axis trees T/sub 1/=(V/sub 1/,E/sub 1/,W/sub 1/) and T/sub 2/=(V/sub 2/,E/sub 2/,W/sub 2/), where W/sub 1/ and W/sub 2/ are set of tuples containing geometric attributes corresponding to the nodes in T/sub 1/ and T/sub 2/, as inputs and returns the one-to-one matching function f of nodes in T/sub 1/ to T/sub 2/ that preserves the tree topology and closely matches the geometric attributes of these trees, i.e. branch points, branch lengths, and branch angles between mapped nodes of T/sub 1/ and T/sub 2/. Since the topology match alone could result in many choices of the mapping function f, the authors prune these choices by incorporating constraints on the geometric attributes of nodes in T/sub 1/ and T/sub 2/. The authors design a linear time algorithm that matches the branch topology and geometric features of T/sub 1/ and T/sub 2/. The authors' algorithm produced accurate matchings on various airway data sets of a dog lung obtained from Computed Tomography under simulated breathing conditions. T/sub 1/ and T/sub 2/ are obtained by running a two-pass central axis algorithm on the tree volumes.","PeriodicalId":436387,"journal":{"name":"Proceedings of the Workshop on Mathematical Methods in Biomedical Image Analysis","volume":"42 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1996-06-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"16","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings of the Workshop on Mathematical Methods in Biomedical Image Analysis","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/MMBIA.1996.534068","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 16

Abstract

Physiological measurements like branch angles, branch lengths, branch diameters and branch cross-sectional area of the 3-D pulmonary tree structures are clinically essential in evaluating the function of normal and diseased lung and during the breathing process. In order to facilitate these measurements and study relative structural changes, the 3-D lung tree volumes are reduced to a 3-D Euclidean straight line central axis tree. The central axis tree captures the branch topology and geometric features of the tree volume. Since matching 3-D tree volumes is complex, as they change in branch topology and geometry, the authors accomplish it by designing an efficient algorithm that matches their corresponding central axis trees. The algorithm takes two binary central axis trees T/sub 1/=(V/sub 1/,E/sub 1/,W/sub 1/) and T/sub 2/=(V/sub 2/,E/sub 2/,W/sub 2/), where W/sub 1/ and W/sub 2/ are set of tuples containing geometric attributes corresponding to the nodes in T/sub 1/ and T/sub 2/, as inputs and returns the one-to-one matching function f of nodes in T/sub 1/ to T/sub 2/ that preserves the tree topology and closely matches the geometric attributes of these trees, i.e. branch points, branch lengths, and branch angles between mapped nodes of T/sub 1/ and T/sub 2/. Since the topology match alone could result in many choices of the mapping function f, the authors prune these choices by incorporating constraints on the geometric attributes of nodes in T/sub 1/ and T/sub 2/. The authors design a linear time algorithm that matches the branch topology and geometric features of T/sub 1/ and T/sub 2/. The authors' algorithm produced accurate matchings on various airway data sets of a dog lung obtained from Computed Tomography under simulated breathing conditions. T/sub 1/ and T/sub 2/ are obtained by running a two-pass central axis algorithm on the tree volumes.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
跟踪三维肺树结构
肺三维树状结构的分支角度、分支长度、分支直径、分支截面积等生理测量在临床评价正常和病变肺的功能以及呼吸过程中是必不可少的。为了便于这些测量和研究相对的结构变化,将三维肺树体积简化为三维欧几里得直线中心轴树。中轴树捕获了树体的分支拓扑和几何特征。由于匹配三维树体是复杂的,因为它们在分支拓扑和几何上的变化,作者通过设计一个有效的算法来匹配相应的中心轴树来完成它。该算法以两棵二叉中轴树T/sub 1/=(V/sub 1/,E/sub 1/,W/sub 1/)和T/sub 2/=(V/sub 2/,E/sub 2/,W/sub 2/)为输入,其中W/sub 1/和W/sub 2/是包含T/sub 1/和T/sub 2/中节点对应的几何属性的元组集合,并返回T/sub 1/中节点到T/sub 2/的一对一匹配函数f,该函数保持了树的拓扑结构,并与这些树的几何属性紧密匹配,即分支点、分支长度、映射节点间的分支角为T/sub 1/和T/sub 2/。由于拓扑匹配本身可能导致映射函数f的许多选择,因此作者通过结合对T/sub 1/和T/sub 2/中节点的几何属性的约束来减少这些选择。设计了一种匹配T/sub 1/和T/sub 2/分支拓扑和几何特征的线性时间算法。作者的算法对模拟呼吸条件下从计算机断层扫描中获得的狗肺的各种气道数据集进行了精确匹配。T/sub 1/和T/sub 2/是通过在树体上运行两遍中心轴算法得到的。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Comparison of multiscale representations for a linking-based image segmentation model Shape bottlenecks and conservative flow systems [medical image analysis] Deformable models in medical image analysis Fractal analysis of bone images Fusion of short-axis and long-axis cardiac MR images
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1