Fast localize the bioluminescent source via graph cuts

Kai Liu, Jie Tian, Shouping Zhu, C. Qin, Xing Zhang, Dong Han
{"title":"Fast localize the bioluminescent source via graph cuts","authors":"Kai Liu, Jie Tian, Shouping Zhu, C. Qin, Xing Zhang, Dong Han","doi":"10.1109/ISBI.2010.5490079","DOIUrl":null,"url":null,"abstract":"Bioluminescence imaging (BLI) and bioluminescence tomography (BLT) make it possible to elucidate cellular signatures to better understand the effects of human disease in small animal in vivo. However, to the best of our knowledge, the existing gradient-type reconstruction methods in BLT are not very efficient, and often require a relatively small volume of interest (VOI) for feasible results. In this paper, a fast graph cuts based reconstruction method for BLT is presented, which is to localize the bioluminescent source in heterogeneous mouse atlas via max-flow/min-cut algorithm. Since the original graph cuts theory can only handle graph-representable problem, the quadratic pseudo-boolean optimization is incorporated to make the graph tractable. The internal light source can be reconstructed from the whole domain, so a priori knowledge of VOI can be avoided in this method. In the experiments, the proposed method is validated in a heterogeneous mouse atlas, and the source can be localized reliably and efficiently by graph cuts; and compared with a gradient-type method, graph cuts is about 25–50 times faster.","PeriodicalId":250523,"journal":{"name":"2010 IEEE International Symposium on Biomedical Imaging: From Nano to Macro","volume":"89 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2010-04-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2010 IEEE International Symposium on Biomedical Imaging: From Nano to Macro","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ISBI.2010.5490079","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

Bioluminescence imaging (BLI) and bioluminescence tomography (BLT) make it possible to elucidate cellular signatures to better understand the effects of human disease in small animal in vivo. However, to the best of our knowledge, the existing gradient-type reconstruction methods in BLT are not very efficient, and often require a relatively small volume of interest (VOI) for feasible results. In this paper, a fast graph cuts based reconstruction method for BLT is presented, which is to localize the bioluminescent source in heterogeneous mouse atlas via max-flow/min-cut algorithm. Since the original graph cuts theory can only handle graph-representable problem, the quadratic pseudo-boolean optimization is incorporated to make the graph tractable. The internal light source can be reconstructed from the whole domain, so a priori knowledge of VOI can be avoided in this method. In the experiments, the proposed method is validated in a heterogeneous mouse atlas, and the source can be localized reliably and efficiently by graph cuts; and compared with a gradient-type method, graph cuts is about 25–50 times faster.
通过图切割快速定位生物发光源
生物发光成像(BLI)和生物发光断层扫描(BLT)使阐明细胞特征成为可能,从而更好地了解人类疾病在小动物体内的影响。然而,据我们所知,现有的BLT梯度型重建方法效率不高,并且通常需要相对较小的兴趣量(VOI)才能获得可行的结果。本文提出了一种基于图切割的BLT快速重建方法,利用最大流量/最小切割算法在异质小鼠图谱中定位生物发光源。由于原有的图割理论只能处理图可表示问题,因此引入二次伪布尔优化,使图具有可处理性。该方法可以从整个域重构内部光源,从而避免了对视场的先验知识。实验结果表明,该方法在异种小鼠图谱中得到了验证,通过图切可以可靠有效地定位源;与梯度型方法相比,图切割的速度大约快25-50倍。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术官方微信