SSAP: Single-Shot Instance Segmentation With Affinity Pyramid

被引:25
作者
Gao, Naiyu [1 ,2 ]
Shan, Yanhu [3 ]
Wang, Yupei [4 ,5 ,6 ,7 ]
Zhao, Xin [1 ,2 ]
Huang, Kaiqi [1 ,2 ,8 ,9 ]
机构
[1] Chinese Acad Sci, Ctr Res Intelligent Syst & Engn, Inst Automat, Beijing 100190, Peoples R China
[2] Univ Chinese Acad Sci, Sch Artificial Intelligence, Beijing 100049, Peoples R China
[3] Horizon Robot, Beijing 100000, Peoples R China
[4] Chinese Acad Sci, Inst Automat, Beijing 100190, Peoples R China
[5] Beijing Inst Technol, Beijing 100081, Peoples R China
[6] Beijing Inst Technol, Chongqing Innovat Ctr, Chongqing 401135, Peoples R China
[7] Beijing Key Lab Embedded Real Time Informat Proc, Beijing 100081, Peoples R China
[8] Chinese Acad Sci, Inst Automat, Natl Lab Pattern Recognit, Beijing 100190, Peoples R China
[9] Chinese Acad Sci, CAS Ctr Excellence Brain Sci & Intelligence Techn, Beijing 100190, Peoples R China
基金
中国国家自然科学基金;
关键词
Semantics; Image segmentation; Training; Proposals; Task analysis; Automation; Predictive models; Instance segmentation; affinity pyramid; feature pyramid; single-shot; graph partition;
D O I
10.1109/TCSVT.2020.2985420
中图分类号
TM [电工技术]; TN [电子技术、通信技术];
学科分类号
0808 ; 0809 ;
摘要
Proposal-free instance segmentation methods mainly 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. In addition to the lack of efficiency, previous methods also failed to perform as well as proposal-based approaches. 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 learning an affinity pyramid, which computes the probability that two pixels belong to the same instance in a hierarchical manner. Moreover, incorporating with the learned affinity pyramid, a novel cascaded graph partition (CGP) module is presented to fuse the two predictions and segment instances efficiently. As an additional contribution, we conduct an experiment to demonstrate the benefits of proposal-free methods in capturing detailed structures from finely annotated training examples. Our approach is evaluated on the Cityscapes and COCO datasets and achieves state-of-the-art performance.
引用
收藏
页码:661 / 673
页数:13
相关论文
共 60 条
[1]   Learning Pixel-level Semantic Affinity with Image-level Supervision forWeakly Supervised Semantic Segmentation [J].
Ahn, Jiwoon ;
Kwak, Suha .
2018 IEEE/CVF CONFERENCE ON COMPUTER VISION AND PATTERN RECOGNITION (CVPR), 2018, :4981-4990
[2]  
[Anonymous], 2015, PROC ADVNEURAL INF P
[3]  
[Anonymous], pervised Semantic Segmentation via Adversarial Learning
[4]  
[Anonymous], 2022, IEEE T PATTERN ANAL, DOI [DOI 10.1109/CVPR46437.2021.01135, DOI 10.1109/TPAMI.2019.2932058]
[5]  
[Anonymous], ARXIV151201274
[6]  
[Anonymous], 2017, IEEE INT C COMPUT VI, DOI [10.1109/iccv.201, DOI 10.1109/ICCV.2017.322]
[7]   Pixelwise Instance Segmentation with a Dynamically Instantiated Network [J].
Arnab, Anurag ;
Torr, Philip H. S. .
30TH IEEE CONFERENCE ON COMPUTER VISION AND PATTERN RECOGNITION (CVPR 2017), 2017, :879-888
[8]   Deep Watershed Transform for Instance Segmentation [J].
Bai, Min ;
Urtasun, Raquel .
30TH IEEE CONFERENCE ON COMPUTER VISION AND PATTERN RECOGNITION (CVPR 2017), 2017, :2858-2866
[9]  
Bailoni A., 2019, A generalized framework for agglomerative clustering of signed graphs applied to instance segmentation
[10]   Convolutional Random Walk Networks for Semantic Image Segmentation [J].
Bertasius, Gedas ;
Torresani, Lorenzo ;
Yu, Stella X. ;
Shi, Jianbo .
30TH IEEE CONFERENCE ON COMPUTER VISION AND PATTERN RECOGNITION (CVPR 2017), 2017, :6137-6145