计算机工程与应用 ›› 2013, Vol. 49 ›› Issue (22): 185-189.

• 图形图像处理 • 上一篇    下一篇

使用平均路径的一种新Live-wire算法

周  頔1,孙  俊2,李晓光3   

  1. 1.江南大学 数字媒体学院 数字媒体技术系,江苏 无锡 214122
    2.江南大学 物联网工程学院,江苏 无锡 214122
    3.思创贯宇科技开发有限公司 研发部,北京 100039
  • 出版日期:2013-11-15 发布日期:2013-11-15

Improved live-wire based on average cost path

ZHOU Di1, SUN Jun2, LI Xiaoguang3   

  1. 1.Department of Digital Media, Jiangnan University, Wuxi, Jiangsu 214122, China
    2.Department of Internet of Things, Jiangnan University, Wuxi, Jiangsu 214122, China
    3.Research and Development Department, CREALIFE Medical Technology Inc., Beijing 100039, China
  • Online:2013-11-15 Published:2013-11-15

摘要: 在传统Live-wire算法中,两个人工选定节点之间的最优路径被定义为具有最小累计能量的路径。因此传统live-wire算法在分割边缘转折剧烈的物体时,为了保证分割的正确性就需要人工添加较多的节点,从而增加整个分割过程的耗时。提出一种基于可控平均代价路径的新型Live-wire算法,并从理论上证明,传统live-wire算法其实是提出的新型算法的一种特例。实验表明,新型Live-wire算法与传统算法相比,能在保证精度的同时减少人工设定的节点个数,从而加快整个分割过程的速度。

关键词: 分割, Live-wire算法, 平均代价路径, 带权重的Canny边缘

Abstract: In the original live-wire algorithm, optimality is defined as the minimum cumulative cost path from a seed point to another, where the cumulative cost of a path is the sum of the local edge costs on the path. Consequently, when delineating a boundary with acute concaves and convexes, more seed points are required which can become very time consuming to calculate. This paper proposes an improved live-wire algorithm where the optimality is redefined as the minimum average cost path between two seed points. In theory, the original live-wire algorithm is only a special case of the improved algorithm. Experiments conduct on a variety of image types have shown that this improved live-wire algorithm requires less seed points than the original algorithm when delineating the same boundary and as a result, reduces the time required to complete the calculation.

Key words: segmentation, live-wire, average cost path, weighted Canny edge