mlsanityData to 14 Oct 2026

WiCo: Win-win Cooperation of Bottom-up and Top-down Referring Image Segmentation

arXiv 2306.10750 ↗First posted 19 Jun 2023cs.CV cs.MMcited by 3

Not on the map. Why?

Abstract (arXiv)

The top-down and bottom-up methods are two mainstreams of referring segmentation, while both methods have their own intrinsic weaknesses. Top-down methods are chiefly disturbed by Polar Negative (PN) errors owing to the lack of fine-grained cross-modal alignment. Bottom-up methods are mainly perturbed by Inferior Positive (IP) errors due to the lack of prior object information. Nevertheless, we discover that two types of methods are highly complementary for restraining respective weaknesses but the direct average combination leads to harmful interference. In this context, we build Win-win Cooperation (WiCo) to exploit complementary nature of two types of methods on both interaction and integration aspects for achieving a win-win improvement. For the interaction aspect, Complementary Feature Interaction (CFI) provides fine-grained information to top-down branch and introduces prior object information to bottom-up branch for complementary feature enhancement. For the integration aspect, Gaussian Scoring Integration (GSI) models the gaussian performance distributions of two branches and weightedly integrates results by sampling confident scores from the distributions. With our WiCo, several prominent top-down and bottom-up combinations achieve remarkable improvements on three common datasets with reasonable extra costs, which justifies effectiveness and generality of our method.

Key facts. Cited by 3 papers in the map (data through 14 Oct 2026). Builds on 26 of its 42 references that are in the map. First posted on arXiv 19 Jun 2023.

Builds on

26 of 42 references.

References · 26

  1. 2017Attention Is All You Needcited by 60,361
  2. 2015Deep Residual Learning for Image Recognitioncited by 52,096
  3. 2020An Image is Worth 16x16 Words: Transformers for Image Recognition at Scalecited by 30,186
  4. 2017Mask R-CNNcited by 7,277
  5. 2017Neural Discrete Representation Learningcited by 4,712
  6. 2021Masked-attention Mask Transformer for Universal Image Segmentationcited by 2,351
  7. 2016Modeling Context in Referring Expressionscited by 1,063
  8. 2015Generation and Comprehension of Unambiguous Object Descriptionscited by 904
  9. 2018MAttNet: Modular Attention Network for Referring Expression Comprehensioncited by 431
  10. 2021CRIS: CLIP-Driven Referring Image Segmentationcited by 353
  11. 2021LAVT: Language-Aware Vision Transformer for Referring Image Segmentationcited by 348
  12. 2019Cross-Modal Self-Attention Network for Referring Image Segmentationcited by 263
14 more
  1. 2016Segmentation from Natural Language Expressionscited by 257
  2. 2021Vision-Language Transformer and Query Generation for Referring Segmentationcited by 240
  3. 2020Multi-task Collaborative Network for Joint Referring Expression Comprehension and Segmentationcited by 204
  4. 2021Referring Transformer: A One-step Approach to Multi-task Visual Groundingcited by 143
  5. 2018Learning to Assemble Neural Module Tree Networks for Visual Groundingcited by 140
  6. 2022SeqTR: A Simple yet Universal Network for Visual Groundingcited by 139
  7. 2020Referring Image Segmentation via Cross-Modal Progressive Comprehensioncited by 131
  8. 2015Natural Language Object Retrievalcited by 124
  9. 2022ReSTR: Convolution-free Referring Image Segmentation Using Transformerscited by 112
  10. 2021Encoder Fusion Network with Co-Attention Embedding for Referring Image Segmentationcited by 111
  11. 2020Linguistic Structure Guided Context Modeling for Referring Image Segmentationcited by 102
  12. 2021Locate then Segment: A Strong Pipeline for Referring Image Segmentationcited by 98
  13. 2019Referring Expression Object Segmentation with Caption-Aware Consistencycited by 46
  14. 2022CoupAlign: Coupling Word-Pixel with Sentence-Mask Alignments for Referring Image Segmentationcited by 28

Built on by

Cited by year

Citing papers per year: 2023: 1; 2024: 0; 2025: 2.

3 papers.