Institutional Repository of Chinese Acad Sci, Inst Automat, CAS Key Lab Mol Imaging, Beijing 100190, Peoples R China
FAST LOCALIZE THE BIOLUMINESCENT SOURCE VIA GRAPH CUTS | |
Liu, Kai; Tian, J; Zhu, SP; Qin, CH; Zhang, X; Han, D; Tian, Jie | |
2010 | |
会议名称 | 2010 7TH IEEE INTERNATIONAL SYMPOSIUM ON BIOMEDICAL IMAGING: FROM NANO TO MACRO |
会议录名称 | International Symposium on Biomedical Imaging (ISBI) |
页码 | 696-699 |
会议日期 | 2010 |
会议地点 | Rotterdam, NETHERLANDS |
摘要 | 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 |
关键词 | Bioluminescence Tomography (Blt) Inverse Problem Light Propagation In Tissues Diffusion Equation |
文献类型 | 会议论文 |
条目标识符 | http://ir.ia.ac.cn/handle/173211/5450 |
专题 | 中国科学院分子影像重点实验室 |
通讯作者 | Tian, Jie |
推荐引用方式 GB/T 7714 | Liu, Kai,Tian, J,Zhu, SP,et al. FAST LOCALIZE THE BIOLUMINESCENT SOURCE VIA GRAPH CUTS[C],2010:696-699. |
条目包含的文件 | 下载所有文件 | |||||
文件名称/大小 | 文献类型 | 版本类型 | 开放类型 | 使用许可 | ||
05490079.pdf(309KB) | 会议论文 | 开放获取 | CC BY-NC-SA | 浏览 下载 |
除非特别说明,本系统中所有内容都受版权保护,并保留所有权利。
修改评论