An Image Segmentation Approach Based on Graph Theory and Optimal Threshold Model

被引：0

作者：

Guo, Xiangyun ^{[1
]}

Zhang, Xiuhua ^{[1
]}

Hong, Hanyu ^{[1
]}

机构：

[1] Wuhan Inst Technol, Lab Image Proc & Intelligent Control, Wuhan 430074, Hubei, Peoples R China

来源：

2010 6TH INTERNATIONAL CONFERENCE ON WIRELESS COMMUNICATIONS NETWORKING AND MOBILE COMPUTING (WICOM) | 2010年

关键词：

Graph Theory; Optimal Threshold; Segmentation; Regional properties; Boundary; Min-Cut/Max-Flow;

D O I：

暂无

中图分类号：

TP3 [计算技术、计算机技术];

学科分类号：

0812 ;

摘要：

Since the threshold segmentation methods can't divide the interested objects from intricate background perfectly, in this paper, we proposed a new method that combined graph theory with optimal threshold method. With this method we have made a good integration of the two methods above to ensure that the segment results have smooth boundary and complete regions. Through a lot of experiments, we can draw the conclusion that the proposed method can extract the objects from intricate background perfectly and meet the need of applications.

引用

页数：4

共 7 条

[1]

[Anonymous], 2001, Interactive Graph Cuts, DOI DOI 10.1109/ICCV.2001.937505

[2] An experimental comparison of min-cut/max-flow algorithms for energy minimization in vision [J].

Boykov, Y ;

Kolmogorov, V .

IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE, 2004, 26 (09) :1124-1137

[3] Graph cuts and efficient N-D image segmentation [J].

Boykov, Yuri ;

Funka-Lea, Gareth .

INTERNATIONAL JOURNAL OF COMPUTER VISION, 2006, 70 (02) :109-131

[4]

Collins T., 2004, GRAPH CUT MATCHING C

[5]

Gonzalez R.C., 2003, DIGITAL IMAGE PROCES, P485

[6]

Sinha S., 2004, Graph Cut Algorithms in Vision, Graphics and Machine Learning An Integrative Paper

[7]

Wu Bo, 2008, Computer Engineering, V34, P212

← 1 →