Vertebra segmentation based on two-step refinement.

Journal of computational surgery Pub Date : 2016-01-01 Epub Date: 2016-07-26 DOI:10.1186/s40244-016-0018-0
Jean-Baptiste Courbot, Edmond Rust, Emmanuel Monfrini, Christophe Collet
{"title":"Vertebra segmentation based on two-step refinement.","authors":"Jean-Baptiste Courbot,&nbsp;Edmond Rust,&nbsp;Emmanuel Monfrini,&nbsp;Christophe Collet","doi":"10.1186/s40244-016-0018-0","DOIUrl":null,"url":null,"abstract":"<p><p>Knowledge of vertebra location, shape, and orientation is crucial in many medical applications such as orthopedics or interventional procedures. Computed tomography (CT) offers a high contrast between bone and soft tissues, but automatic vertebra segmentation remains difficult. Hence, the wide range of shapes, aging, and degenerative joint disease alterations as well as the variety of pathological cases encountered in an aging population make automatic segmentation sometimes challenging. Besides, daily practice implies a need for affordable computation time. This paper aims to present a new automated vertebra segmentation method (using a first bounding box for initialization) for CT 3D data which tackles these problems. This method is based on two consecutive steps. The first one is a new coarse-to-fine method efficiently reducing the data amount to obtain a coarse shape of the vertebra. The second step consists in a hidden Markov chain (HMC) segmentation using a specific volume transformation within a Bayesian framework. Our method does not introduce any prior on the expected shape of the vertebra within the bounding box and thus deals with the most frequent pathological cases encountered in daily practice. We experiment this method on a set of standard lumbar, thoracic, and cervical vertebrae and on a public dataset, on pathological cases, and in a simple integration example. Quantitative and qualitative results show that our method is robust to changes in shapes and luminance and provides correct segmentation with respect to pathological cases.</p>","PeriodicalId":91110,"journal":{"name":"Journal of computational surgery","volume":"4 ","pages":"1"},"PeriodicalIF":0.0000,"publicationDate":"2016-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1186/s40244-016-0018-0","citationCount":"8","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Journal of computational surgery","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1186/s40244-016-0018-0","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"2016/7/26 0:00:00","PubModel":"Epub","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 8

Abstract

Knowledge of vertebra location, shape, and orientation is crucial in many medical applications such as orthopedics or interventional procedures. Computed tomography (CT) offers a high contrast between bone and soft tissues, but automatic vertebra segmentation remains difficult. Hence, the wide range of shapes, aging, and degenerative joint disease alterations as well as the variety of pathological cases encountered in an aging population make automatic segmentation sometimes challenging. Besides, daily practice implies a need for affordable computation time. This paper aims to present a new automated vertebra segmentation method (using a first bounding box for initialization) for CT 3D data which tackles these problems. This method is based on two consecutive steps. The first one is a new coarse-to-fine method efficiently reducing the data amount to obtain a coarse shape of the vertebra. The second step consists in a hidden Markov chain (HMC) segmentation using a specific volume transformation within a Bayesian framework. Our method does not introduce any prior on the expected shape of the vertebra within the bounding box and thus deals with the most frequent pathological cases encountered in daily practice. We experiment this method on a set of standard lumbar, thoracic, and cervical vertebrae and on a public dataset, on pathological cases, and in a simple integration example. Quantitative and qualitative results show that our method is robust to changes in shapes and luminance and provides correct segmentation with respect to pathological cases.

Abstract Image

Abstract Image

Abstract Image

查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
基于两步细化的椎体分割。
椎体位置、形状和方向的知识在许多医学应用中是至关重要的,如骨科或介入性手术。计算机断层扫描(CT)提供了骨骼和软组织之间的高对比度,但自动椎体分割仍然困难。因此,广泛的形状、老化和退行性关节疾病改变以及老年人群中遇到的各种病理病例使自动分割有时具有挑战性。此外,日常实践意味着需要负担得起的计算时间。针对这些问题,本文提出了一种新的CT三维数据自动分割方法(使用第一边界框进行初始化)。该方法基于两个连续的步骤。第一种是一种新的从粗到精的方法,有效地减少了数据量,得到了粗糙的椎体形状。第二步是在贝叶斯框架中使用特定的体积变换进行隐马尔可夫链(HMC)分割。我们的方法不引入任何先验的椎体在边界框内的预期形状,因此处理在日常实践中遇到的最常见的病理病例。我们在一组标准的腰椎、胸椎和颈椎、一个公共数据集、病理病例和一个简单的整合示例上实验了这种方法。定量和定性结果表明,我们的方法对形状和亮度的变化具有鲁棒性,并且对病理病例提供了正确的分割。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Vertebra segmentation based on two-step refinement. Methodology for fast interactive segmentation of the peritoneum and diaphragm in multi-modal 3D medical image An intelligent hospital operating room to improve patient health care Towards immersive virtual reality (iVR): a route to surgical expertise. Patient-specific simulation of tumor growth, response to the treatment, and relapse of a lung metastasis: a clinical case
×
引用
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