mlsanityData to 7 Oct 2026

Foreground-Covering Prototype Generation and Matching for SAM-Aided Few-Shot Segmentation

arXiv 2501.00752 ↗First posted 1 Jan 2025cs.CVcited by 9

Not on the map. Why?

Abstract (arXiv)

We propose Foreground-Covering Prototype Generation and Matching to resolve Few-Shot Segmentation (FSS), which aims to segment target regions in unlabeled query images based on labeled support images. Unlike previous research, which typically estimates target regions in the query using support prototypes and query pixels, we utilize the relationship between support and query prototypes. To achieve this, we utilize two complementary features: SAM Image Encoder features for pixel aggregation and ResNet features for class consistency. Specifically, we construct support and query prototypes with SAM features and distinguish query prototypes of target regions based on ResNet features. For the query prototype construction, we begin by roughly guiding foreground regions within SAM features using the conventional pseudo-mask, then employ iterative cross-attention to aggregate foreground features into learnable tokens. Here, we discover that the cross-attention weights can effectively alternate the conventional pseudo-mask. Therefore, we use the attention-based pseudo-mask to guide ResNet features to focus on the foreground, then infuse the guided ResNet feature into the learnable tokens to generate class-consistent query prototypes. The generation of the support prototype is conducted symmetrically to that of the query one, with the pseudo-mask replaced by the ground-truth mask. Finally, we compare these query prototypes with support ones to generate prompts, which subsequently produce object masks through the SAM Mask Decoder. Our state-of-the-art performances on various datasets validate the effectiveness of the proposed method for FSS. Our official code is available at https://github.com/SuhoPark0706/FCP

Key facts. Cited by 9 papers in the map (data through 7 Oct 2026). Builds on 23 of its 31 references that are in the map. First posted on arXiv 1 Jan 2025.

Builds on

23 of 31 references.

References · 23

  1. 2021Learning Transferable Visual Models From Natural Language Supervisioncited by 33,456
  2. 2014Microsoft COCO: Common Objects in Contextcited by 17,498
  3. 2021Emerging Properties in Self-Supervised Vision Transformerscited by 6,893
  4. 2021SegFormer: Simple and Efficient Design for Semantic Segmentation with Transformerscited by 2,923
  5. 2021Masked-attention Mask Transformer for Universal Image Segmentationcited by 2,338
  6. 2021Segmenter: Transformer for Semantic Segmentationcited by 855
  7. 2021Extract Free Dense Labels from CLIPcited by 580
  8. 2014Semantic Image Segmentation with Deep Convolutional Nets and Fully Connected CRFscited by 552
  9. 2021DenseCLIP: Language-Guided Dense Prediction with Context-Aware Promptingcited by 530
  10. 2019PANet: Few-Shot Image Semantic Segmentation with Prototype Alignmentcited by 449
  11. 2017One-Shot Learning for Semantic Segmentationcited by 337
  12. 2020Prior Guided Feature Enrichment Network for Few-Shot Segmentationcited by 271
11 more
  1. 2023Inpaint Anything: Segment Anything Meets Image Inpaintingcited by 233
  2. 2021Adaptive Prototype Learning and Allocation for Few-Shot Segmentationcited by 207
  3. 2021Hypercorrelation Squeeze for Few-Shot Segmentationcited by 193
  4. 2019Feature Weighting and Boosting for Few-Shot Segmentationcited by 189
  5. 2023Semantic-SAM: Segment and Recognize Anything at Any Granularitycited by 185
  6. 2018SG-One: Similarity Guidance Network for One-Shot Semantic Segmentationcited by 169
  7. 2020Part-aware Prototype Network for Few-shot Semantic Segmentationcited by 162
  8. 2014Simultaneous Detection and Segmentationcited by 158
  9. 2021Few-Shot Segmentation via Cycle-Consistent Transformercited by 133
  10. 2024VRP-SAM: SAM with Visual Reference Promptcited by 75
  11. 2023On the Robustness of Segment Anythingcited by 24

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2025: 5; 2026: 4.

9 papers.