Name
Abstract | ||
|---|---|---|
Panoptic segmentation, which needs to assign a category label to each pixel and segment each object instance simultaneously, is a challenging topic. Traditionally, the existing approaches utilize two independent models without sharing features, which makes the pipeline inefficient to implement. In addition, a heuristic method is usually employed to merge the results. However, the overlapping relationship between object instances is difficult to determine without sufficient context information during the merging process. To address the problems, we propose a novel end-to-end Occlusion Aware Network (OANet) for panoptic segmentation, which can efficiently and effectively predict both the instance and stuff segmentation in a single network. Moreover, we introduce a novel spatial ranking module to deal with the occlusion problem between the predicted instances. Extensive experiments have been done to validate the performance of our proposed method and promising results have been achieved on the COCO Panoptic benchmark. |
Year | DOI | Venue |
|---|---|---|
2019 | 10.1109/CVPR.2019.00633 | 2019 IEEE/CVF CONFERENCE ON COMPUTER VISION AND PATTERN RECOGNITION (CVPR 2019) |
Field | DocType | Volume |
Panopticon,Heuristic,Ranking,Pattern recognition,Segmentation,Computer science,End-to-end principle,Pixel,Artificial intelligence,Merge (version control),Machine learning | Journal | abs/1903.05027 |
ISSN | Citations | PageRank |
1063-6919 | 11 | 0.49 |
References | Authors | |
20 | 7 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Huanyu Liu | 1 | 20 | 0.92 |
| Chao Peng | 2 | 25 | 1.71 |
| Changqian Yu | 3 | 22 | 4.46 |
| Jingbo Wang | 4 | 21 | 3.43 |
| Xu Liu | 5 | 11 | 0.49 |
| Gang Yu | 6 | 382 | 19.85 |
| Wei Jiang | 7 | 11 | 0.49 |