SSAP: Single-Shot Instance Segmentation With Affinity Pyramid

被引:177
作者
Gao, Naiyu [1 ,2 ]
Shan, Yanhu [3 ]
Wang, Yupei [1 ,2 ]
Zhao, Xin [1 ,2 ]
Yu, Yinan [3 ]
Yang, Ming [3 ]
Huang, Kaiqi [1 ,2 ,4 ]
机构
[1] Chinese Acad Sci, Inst Automat, CRISE, Beijing, Peoples R China
[2] Univ Chinese Acad Sci, Beijing, Peoples R China
[3] Horizon Robot Inc, Beijing, Peoples R China
[4] CAS Ctr Excellence Brain Sci & Intelligence Techn, Beijing, Peoples R China
来源
2019 IEEE/CVF INTERNATIONAL CONFERENCE ON COMPUTER VISION (ICCV 2019) | 2019年
基金
中国国家自然科学基金;
关键词
D O I
10.1109/ICCV.2019.00073
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
Recently, proposal-free instance segmentation has received increasing attention due to its concise and efficient pipeline. Generally, proposal-free methods generate instance-agnostic semantic segmentation labels and instance-aware features to group pixels into different object instances. However, previous methods mostly employ separate modules for these two sub-tasks and require multiple passes for inference. We argue that treating these two sub-tasks separately is suboptimal. In fact, employing multiple separate modules significantly reduces the potential for application. The mutual benefits between the two complementary sub-tasks are also unexplored. To this end, this work proposes a single-shot proposal-free instance segmentation method that requires only one single pass for prediction. Our method is based on a pixel-pair affinity pyramid, which computes the probability that two pixels belong to the same instance in a hierarchical manner. The affinity pyramid can also be jointly learned with the semantic class labeling and achieve mutual benefits. Moreover, incorporating with the learned affinity pyramid, a novel cascaded graph partition module is presented to sequentially generate instances from coarse to fine. Unlike previous time-consuming graph partition methods, this module achieves 5x speedup and 9% relative improvement on Average-Precision (AP). Our approach achieves new state of the art on the challenging Cityscapes dataset.
引用
收藏
页码:642 / 651
页数:10
相关论文
共 49 条
[1]  
[Anonymous], 2015, ICCV
[2]  
[Anonymous], 2018, P IEEE C COMP VIS PA
[3]  
[Anonymous], 2017, Computing Research Repository, DOI DOI 10.4271/2018-01-1635
[4]  
[Anonymous], 2018, P IEEE C COMP VIS PA
[5]  
[Anonymous], 2018, IEEE T PATTERN ANAL, DOI DOI 10.1007/S11738-017-2587-2
[6]  
[Anonymous], 2019, CVPR
[7]  
[Anonymous], 2015, Arxiv.Org, DOI DOI 10.3389/FPSYG.2013.00124
[8]  
[Anonymous], 2017, CVPR
[9]  
[Anonymous], 2014, P IEEE CVPR
[10]  
[Anonymous], 2016, ARXIV160308678