摘要
Live-Wire分割算法提供了一种精确的、可再现的交互式医学图像分割方法。Live-Wire算法中最优路径的搜索通常采用Dijkstra算法,其时间复杂度为O[n2]。提出从两个方面对Live-Wire医学图像分割算法的搜索策略进行改进以提高Live-Wire算法的实时性:(1)在最短路径的搜索过程中应用二叉堆排序,使算法的时间复杂度从原来的O[n2]降为O[nlnn];(2)在最短路径搜索中加入到达目标节点即停止的限制条件,可明显减少搜索节点数,使算法的时间复杂度远小于O[nlnn]。经算法分析及实验表明,搜索策略的改进可显著提高Live-Wire算法的运行效率。
Live-wire segmentation algorithm provides an accurate,reproducible and interactive boundary extraction tool for the object segmentation in the medical images.Dijkstra algorithm with the complexity of the calculation time O[n^2] is generally used for searching optimal path in Live-wire.The paper improves the search strategy of Live-Wire algorithm in two aspects：Heap sort is used for searching the globally optimal path from the start node to the goal node.The complexity of the calculation time can be reduced from O[n^2] to O[n ln n] by the algorithm;The restriction condition that search ends namely with the finding of the goal node,is set up to greatly reduce searched nodes.Thus the complexity of the calculation time is much smaller than O[n ln n]. Algorithm analysis and experiments indicate that the presented search strategy can evidently improve the efficiency of Live-Wire algorithm.
出处
《计算机工程与应用》
CSCD
北大核心
2007年第29期24-26,共3页
Computer Engineering and Applications
基金
国家高技术研究发展计划( 863)( the National High- Tech Research and Development Plan of China under Grant No.2006AA02Z499)
兰州交通大学校科研基金( the Science Research Foundation of Lanzhou Jiaotong Uiversity)
