Interactive foreground/background segmentation based on graph cut

被引:2
作者
Wu, Xiaoyu [1 ]
Wang, Yangsheng [1 ]
机构
[1] Chinese Acad Sci, Inst Automat, Beijing 100080, Peoples R China
来源
CISP 2008: FIRST INTERNATIONAL CONGRESS ON IMAGE AND SIGNAL PROCESSING, VOL 3, PROCEEDINGS | 2008年
关键词
D O I
10.1109/CISP.2008.387
中图分类号
TM [电工技术]; TN [电子技术、通信技术];
学科分类号
0808 ; 0809 ;
摘要
This paper addresses the problem of natural image segmentation. We develop the interactive image segmentation system and construct two-scale graphs, including region-based graph and pixel-level graph. Building region-level graph is to partition the image into several constituent components. Graph cut is used to extract the foreground object from the image. New data cost functions are defined in the graph cut framework. Under some circumstances, boundary edit based on a pixel-level graph is performed in order to get accurate foreground edges. Experimental results prove that new cost functions are valid and satisfying segmentation results can be obtained by limited user efforts.
引用
收藏
页码:692 / 696
页数:5
相关论文
共 15 条
[1]  
[Anonymous], P EUR C COMP VIS ECC
[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]  
Boykov Y.Y., 2001, ICCV, V1, P105, DOI DOI 10.1109/ICCV.2001.937505
[4]  
CHUANGE Y, 2001, P IEEE INT C COMP VI
[5]  
Levin A., 2006, P IEEE CVPR
[6]  
LI Y, LAZY SNAPPING SIGGRA, V23, P303
[7]  
Martin D, 2001, EIGHTH IEEE INTERNATIONAL CONFERENCE ON COMPUTER VISION, VOL II, PROCEEDINGS, P416, DOI 10.1109/ICCV.2001.937655
[8]  
MARTIN R, 2004, IEEE T PATTERN ANAL, V26
[9]  
ROTHER C, 2004, P ACM SIGGRAPH, P309
[10]  
Ruzon MA, 2000, PROC CVPR IEEE, P18, DOI 10.1109/CVPR.2000.855793