使用平均路径的一种新Live-wire算法  被引量:1

Improved live-wire based on average cost path

在线阅读下载全文

作  者:周頔[1] 孙俊[2] 李晓光 

机构地区:[1]江南大学数字媒体学院数字媒体技术系,江苏无锡214122 [2]江南大学物联网工程学院,江苏无锡214122 [3]思创贯宇科技开发有限公司研发部,北京100039

出  处:《计算机工程与应用》2013年第22期185-189,222,共6页Computer Engineering and Applications

基  金:国家高新技术研究发展计划(863)(No.2008AA02Z21);国家自然科学基金(No.60703106;No.60474030)

摘  要:在传统Live-wire算法中,两个人工选定节点之间的最优路径被定义为具有最小累计能量的路径。因此传统live-wire算法在分割边缘转折剧烈的物体时,为了保证分割的正确性就需要人工添加较多的节点,从而增加整个分割过程的耗时。提出一种基于可控平均代价路径的新型Live-wire算法,并从理论上证明,传统live-wire算法其实是提出的新型算法的一种特例。实验表明,新型Live-wire算法与传统算法相比,能在保证精度的同时减少人工设定的节点个数,从而加快整个分割过程的速度。In the original live-wire algorithm, optimality is defined as the minimum cumulative cost path from a seed point to an- other, 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 be- tween two seed points. In theory, the original live-wire algorithm is only a special ease 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.

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

分 类 号:TP391.41[自动化与计算机技术—计算机应用技术]

 

参考文献:

正在载入数据...

 

二级参考文献:

正在载入数据...

 

耦合文献:

正在载入数据...

 

引证文献:

正在载入数据...

 

二级引证文献:

正在载入数据...

 

同被引文献:

正在载入数据...

 

相关期刊文献:

正在载入数据...

相关的主题
相关的作者对象
相关的机构对象