OpenCCO: An Implementation of Constrained Constructive Optimization for Generating 2D and 3D Vascular Trees

IF 0.7 Q4 COMPUTER SCIENCE, SOFTWARE ENGINEERING Image Processing On Line Pub Date : 2023-11-01 DOI:10.5201/ipol.2023.477
Bertrand Kerautret, Phuc Ngo, Nicolas Passat, Hugues Talbot, Clara Jaquet
{"title":"OpenCCO: An Implementation of Constrained Constructive Optimization for Generating 2D and 3D Vascular Trees","authors":"Bertrand Kerautret, Phuc Ngo, Nicolas Passat, Hugues Talbot, Clara Jaquet","doi":"10.5201/ipol.2023.477","DOIUrl":null,"url":null,"abstract":"In this article, we focus on the algorithm called CCO (Constrained Constructive Optimization), initially proposed by Schreiner and Buxbaum [Computer-Optimization of Vascular Trees, IEEE Transactions on Biomedical Engineering, 40, 1993] and further extended by Karch et al. [A Three-Dimensional Model for Arterial Tree Representation, Generated by Constrained Constructive Optimization, Computers in Biology and Medicine, 29, 1999]. This algorithm can be considered as one of the gold standards for vascular tree structure generation. Modeling and/or simulating the morphology of vascular networks is a challenging but crucial task that can have a strong impact on different applications such as fluid simulation or learning processes related to image segmentation. Various implementations of CCO were proposed over the last years. However, to the best of our knowledge, there does not exist any open-source version that faithfully follows the native CCO algorithm. Our purpose is to propose such an implementation both in 2D and 3D.","PeriodicalId":54190,"journal":{"name":"Image Processing On Line","volume":null,"pages":null},"PeriodicalIF":0.7000,"publicationDate":"2023-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Image Processing On Line","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.5201/ipol.2023.477","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q4","JCRName":"COMPUTER SCIENCE, SOFTWARE ENGINEERING","Score":null,"Total":0}
引用次数: 0

Abstract

In this article, we focus on the algorithm called CCO (Constrained Constructive Optimization), initially proposed by Schreiner and Buxbaum [Computer-Optimization of Vascular Trees, IEEE Transactions on Biomedical Engineering, 40, 1993] and further extended by Karch et al. [A Three-Dimensional Model for Arterial Tree Representation, Generated by Constrained Constructive Optimization, Computers in Biology and Medicine, 29, 1999]. This algorithm can be considered as one of the gold standards for vascular tree structure generation. Modeling and/or simulating the morphology of vascular networks is a challenging but crucial task that can have a strong impact on different applications such as fluid simulation or learning processes related to image segmentation. Various implementations of CCO were proposed over the last years. However, to the best of our knowledge, there does not exist any open-source version that faithfully follows the native CCO algorithm. Our purpose is to propose such an implementation both in 2D and 3D.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
OpenCCO:用于生成2D和3D维管树的约束构造优化的实现
在本文中,我们关注的是一种名为CCO(约束构造优化)的算法,该算法最初由Schreiner和Buxbaum提出[血管树的计算机优化,IEEE生物医学工程学报,1993年第40期],并由Karch等人进一步扩展。[动脉树表示的三维模型,由约束构造优化生成,计算机生物学和医学,1999年第29期]。该算法可以被认为是血管树结构生成的金标准之一。建模和/或模拟血管网络的形态是一项具有挑战性但至关重要的任务,可以对流体模拟或与图像分割相关的学习过程等不同应用产生强烈影响。过去几年提出了各种CCO实现方案。然而,据我们所知,不存在任何忠实地遵循本地CCO算法的开源版本。我们的目的是在2D和3D中提出这样的实现。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
Image Processing On Line
Image Processing On Line COMPUTER SCIENCE, SOFTWARE ENGINEERING-
CiteScore
1.90
自引率
0.00%
发文量
23
审稿时长
16 weeks
期刊介绍: IPOL publishes relevant image processing and image analysis algorithms emphasizing the role of mathematics as a source for algorithm design. The publication is as precise and comprehensive as possible. To this aim, the publication of each algorithm is fourfold and includes: a manuscript containing the detailed description of the published algorithm, of its bibliography, along with commented examples and a failure case analysis; a software implementation of the algorithm in C, C++ or Matlab; an online demo, where the algorithm can be tested on data sets uploaded by the users; an archive containing extensive online experiments. The restricted goal of IPOL is to make accessible the algorithms in their uttermost explicit form to the scientific community. The publication of an algorithm by IPOL is different from, and complementary to a classic journal publication.
期刊最新文献
Accelerating NeRF with the Visual Hull A Brief Evaluation of InSAR Phase Denoising and Coherence Estimation with Phi-Net Survival Forest for Left-Truncated Right-Censored Data A Short Analysis of BigColor for Image Colorization A Brief Analysis of iColoriT for Interactive Image Colorization
×
引用
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