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

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