Weakly Supervised Semantic Segmentation using Constrained Multi-Image Model and Saliency Prior

被引:0
作者
Yu, Mingjun [1 ]
Han, Zheng [2 ]
Wang, Pingquan [3 ]
Jia, Xiaoyan [1 ]
机构
[1] Chifeng Univ, Sch Phys & Elect Informat Engn, Chifeng 024000, Peoples R China
[2] Tianjin Polytech Univ, Sch Elect & Informat Engn, Tianjin 300387, Peoples R China
[3] Hohhot Minzu Coll, Comp Sci Dept, Hohhot 010000, Peoples R China
来源
TENTH INTERNATIONAL CONFERENCE ON DIGITAL IMAGE PROCESSING (ICDIP 2018) | 2018年 / 10806卷
关键词
semantic segmentation; weakly supervised learning; Constrained Multi-Image Model; semantic texton forest; conditional random fields;
D O I
10.1117/12.2503022
中图分类号
O43 [光学];
学科分类号
070207 ; 0803 ;
摘要
Building a graph model use the whole training set and solved by graph cut based algorithm is a common method in weak supervision semantic segmentation task, such as Multi-Image Model (MIM). It has two disadvantages: one is the parameter number of model increased rapidly with the scale growth of training set, which limited applied to large-scale data. Another is lack of use structure information in image internal. To solve above problems, we proposed a Constrained Multi-Image Model (CMIM) that training model with a part of the training data which acquired by our entropy based algorithm. It's made up of some components and each is a smaller graph. So, The CMIM can parallel or serial training and weaken the memory limit. To utilize the context information, we bring the saliency of image to unary potential in energy function. At first, we segment images to superpixels and extract the semantic texton forest (STF) feature. Then construct a conditional random fields (CRF) in the superpixel set from selected images. The data potential learned from STF featrue and saliency of superpixels. Finally, the labeling of superpixels converted to CRF optimization problem which can efficiency solved by alpha expansion algorithm. Experiments on the MSRC21 dataset show that the CMIM algorithm achieves accuracy comparable with some previous influential weakly-supervised segmentation algorithms.
引用
收藏
页数:7
相关论文
共 14 条
[1]   Weakly Supervised Semantic Segmentation Based on Semantic Texton Forest and Saliency Prior [J].
Han Zheng ;
Xiao Zhitao .
JOURNAL OF ELECTRONICS & INFORMATION TECHNOLOGY, 2018, 40 (03) :610-617
[2]   What energy functions can be minimized via graph cuts? [J].
Kolmogorov, V ;
Zabih, R .
IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE, 2004, 26 (02) :147-159
[3]   Associative Hierarchical Random Fields [J].
Ladicky, L'ubor ;
Russell, Chris ;
Kohli, Pushmeet ;
Torr, Philip H. S. .
IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE, 2014, 36 (06) :1056-1077
[4]   TurboPixels: Fast Superpixels Using Geometric Flows [J].
Levinshtein, Alex ;
Stere, Adrian ;
Kutulakos, Kiriakos N. ;
Fleet, David J. ;
Dickinson, Sven J. ;
Siddiqi, Kaleem .
IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE, 2009, 31 (12) :2290-2297
[5]  
Shotton J, 2008, PROC CVPR IEEE, P1245
[6]  
Shotton J, 2006, LECT NOTES COMPUT SC, V3951, P1
[7]  
Verbeek J., 2007, PROC IEEE C COMPUTER, P1, DOI DOI 10.1109/CVPR.2007.383098
[8]  
Vezhnevets A, 2012, PROC CVPR IEEE, P845, DOI 10.1109/CVPR.2012.6247757
[9]  
Vezhnevets A, 2012, PROC CVPR IEEE, P3162, DOI 10.1109/CVPR.2012.6248050
[10]  
Vezhnevets A, 2011, IEEE I CONF COMP VIS, P643, DOI 10.1109/ICCV.2011.6126299