• 中国计算机学会会刊
  • 中国科技核心期刊
  • 中文核心期刊

J4 ›› 2014, Vol. 36 ›› Issue (08): 1571-1575.

• 论文 • 上一篇    下一篇

基于交互式图论的目标边缘检测算法

林选伟,吴谨   

  1. (武汉科技大学信息科学与工程学院,湖北 武汉 430081)
  • 收稿日期:2012-12-04 修回日期:2013-04-03 出版日期:2014-08-25 发布日期:2014-08-25
  • 基金资助:

    国家自然科学基金资助项目(60974012,61171160);湖北省教育厅科研计划项目(Q20131110);高等学校博士学科点专项科研基金(20124219120002);武汉科技大学青年科技骨干培养计划项目(2013xz010);国家级大学生创新创业训练计划项目(201210488062)

A novel target edge detection algorithm based on interactive graph theory         

LIN Xuanwei,WU Jin   

  1. (College of Information Science and Engineering,Wuhan University of Science and Technology,Wuhan 430081,China)
  • Received:2012-12-04 Revised:2013-04-03 Online:2014-08-25 Published:2014-08-25

摘要:

针对传统边缘检测算法无法准确提取目标及其边缘的问题,基于交互式图论的最大流/最小割理论提出了一种新的边缘检测算法,设计了一种新的代价函数OE_COST目标边缘代价函数;通过建立图割模型,能够在分割出目标的同时提取出目标边缘。算法通过交互式选择背景及目标像素集合作为硬性约束,通过图像特征(如灰度级、空间信息等)建立代价函数作为软性约束,同时施加软硬约束达到提取目标边缘的目的。实验结果表明,本算法可以准确提取出目标及其边缘轮廓。

关键词: 边缘检测, 交互式, 图论, 最大流/最小割, 代价函数

Abstract:

As the traditional algorithm for edge detection cannot extract the targets and edges accurately, based on the maxflow/min-cut theory of interactive graph theory, a novel edge detection method is proposed and a new cost-function, named Objects Edge Cost (OE_COST), is designed. The proposed algorithm establishes the graph cut mode to cut the objects and get their edges. The algorithm can extract the edges of targets through combining the hard constraints and soft constraints. The hard constraints can be got by selecting background seeds and object seeds interactively, while the soft constraints are based on the properties of images such as gray levels and space information. Experimental results show that the proposed algorithm can obtain the objects and edges exactly.

Key words: edge detection;interactive;graph theory;max-flow/min-cut;cost-functions