Enhanced Figure-Ground Classification With Background Prior Propagation

被引:4
作者
Chen, Yisong [1 ]
Chan, Antoni B. [2 ,3 ]
机构
[1] Peking Univ, Dept Elect Engn & Comp Sci, Key Lab Machine Percept, Beijing 100871, Peoples R China
[2] City Univ Hong Kong, Multimedia Software Engn Res Ctr, Dept Comp Sci, Hong Kong, Hong Kong, Peoples R China
[3] MERC Shenzhen, Shenzhen, Guangdong, Peoples R China
基金
美国国家科学基金会;
关键词
Image segmentation; multiple hypotheses fusion; similarity voting; SEGMENTATION;
D O I
10.1109/TIP.2015.2389612
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
We present an adaptive figure-ground segmentation algorithm that is capable of extracting foreground objects in a generic environment. Starting from an interactively assigned background mask, an initial background prior is defined and multiple soft-label partitions are generated from different foreground priors by progressive patch merging. These partitions are fused to produce a foreground probability map. The probability map is then binarized via threshold sweeping to create multiple hard-label candidates. A set of segmentation hypotheses is formed using different evaluation scores. From this set, the hypothesis with maximal local stability is propagated as the new background prior, and the segmentation process is repeated until convergence. Similarity voting is used to select a winner set, and the corresponding hypotheses are fused to yield the final segmentation result. Experiments indicate that our method performs at or above the current state-of-the-art on several data sets, with particular success on challenging scenes that contain irregular or multiple-connected foregrounds.
引用
收藏
页码:873 / 885
页数:13
相关论文
共 40 条
[1]  
[Anonymous], P BMVC
[2]  
[Anonymous], 2007, COMPUTER VISION PATT, DOI DOI 10.1109/CVPR.2007.383017
[3]  
[Anonymous], 2004, 2004 C COMPUTER VISI
[4]  
Bagon S, 2008, LECT NOTES COMPUT SC, V5305, P30, DOI 10.1007/978-3-540-88693-8_3
[5]   Graph Cut Segmentation with a Global Constraint: Recovering Region Distribution via a Bound of the Bhattacharyya Measure [J].
Ben Ayed, Ismail ;
Chen, Hua-mei ;
Punithakumar, Kumaradevan ;
Ross, Ian ;
Li, Shuo .
2010 IEEE CONFERENCE ON COMPUTER VISION AND PATTERN RECOGNITION (CVPR), 2010, :3288-3295
[6]  
Boykov YY, 2001, EIGHTH IEEE INTERNATIONAL CONFERENCE ON COMPUTER VISION, VOL I, PROCEEDINGS, P105, DOI 10.1109/ICCV.2001.937505
[7]   Constrained Parametric Min-Cuts for Automatic Object Segmentation [J].
Carreira, Joao ;
Sminchisescu, Cristian .
2010 IEEE CONFERENCE ON COMPUTER VISION AND PATTERN RECOGNITION (CVPR), 2010, :3241-3248
[8]  
Chen YS, 2012, PROC CVPR IEEE, P654, DOI 10.1109/CVPR.2012.6247733
[9]   Mean shift: A robust approach toward feature space analysis [J].
Comaniciu, D ;
Meer, P .
IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE, 2002, 24 (05) :603-619
[10]   An algorithm for data-driven bandwidth selection [J].
Comaniciu, D .
IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE, 2003, 25 (02) :281-288