基于配对堆的交互式医学图像分割算法的研究

计算机科学 ›› 2009, Vol. 36 ›› Issue (11): 290-292.

基于配对堆的交互式医学图像分割算法的研究

党建武,杜晓刚,王阳萍

(兰州交通大学电子与信息工程学院兰州730070)

出版日期:2018-11-16 发布日期:2018-11-16
基金资助:
本文受国家863高技术研究发展计划基金项目(2006AA02Z499)，甘肃省科技攻关计划项目(0708GKCA047)和甘肃省自然科学基金项目(0803R7ZA015)资助。

Research of Interactive Medical Image Segmentation Algorithm Based on Paring Heap

DANG Jian-wu,DU Xiao-gang,WANG Yang-ping

Online:2018-11-16 Published:2018-11-16

摘要/Abstract

摘要： 在序列医学图像的交互式分割过程中，分割速度是交互式算法应用的一个瓶颈。提出了一种基于配对堆的交互式医学图像分割算法。通过使用配对堆实现可降级的优先队列，降低了Live-Wire交互式分割算法从图上大量节点中动态搜索两目标点之间最短路径的时间复杂度。经算法分析以及在放疗计划系统中的应用实验表明，该算法可有效提高序列医学图像的分割效率。

关键词: 医学图像，Live-Wire算法，交互式分割，配对堆

Abstract: The segmentation speed is a bottleneck of application of interactive algorithm in the interactive segmentation of serial medical images. This paper provided an interactive medical image segmentation algorithm based on pairing heap. The time complexity of procedure of searching the shortest path dynamically of Liv}Wire was decreased by paring heap implementing degradable prior-queue. Algorithm analysis and experiment in radiation therapy plan system indicate that the algorithm can improve the segmentation efficiency of serial medical images.

Key words: Medical image, Live-Wire algorithm, Interactive segmentation, Paring heap

党建武,杜晓刚,王阳萍. 基于配对堆的交互式医学图像分割算法的研究[J]. 计算机科学, 2009, 36(11): 290-292. https://doi.org/

DANG Jian-wu,DU Xiao-gang,WANG Yang-ping. Research of Interactive Medical Image Segmentation Algorithm Based on Paring Heap[J]. Computer Science, 2009, 36(11): 290-292. https://doi.org/

参考文献

Metrics

Viewed

Full text

Abstract

Cited

Shared

Discussed