MST: Adaptive Multi-Scale Tokens Guided Interactive Segmentation
Not on the map. Why?
Abstract (arXiv)
Interactive segmentation has gained significant attention for its application in human-computer interaction and data annotation. To address the target scale variation issue in interactive segmentation, a novel multi-scale token adaptation algorithm is proposed. By performing top-k operations across multi-scale tokens, the computational complexity is greatly simplified while ensuring performance. To enhance the robustness of multi-scale token selection, we also propose a token learning algorithm based on contrastive loss. This algorithm can effectively improve the performance of multi-scale token adaptation. Extensive benchmarking shows that the algorithm achieves state-of-the-art (SOTA) performance, compared to current methods. An interactive demo and all reproducible codes will be released at https://github.com/hahamyt/mst.
Key facts. Cited by 2 papers in the map (data through 7 Oct 2026). Builds on 36 of its 59 references that are in the map. First posted on arXiv 9 Jan 2024.
Builds on
36 of 59 references.
References · 36
- 2015Deep Residual Learning for Image Recognitioncited by 51,809
- 2020An Image is Worth 16x16 Words: Transformers for Image Recognition at Scalecited by 29,915
- 2014Microsoft COCO: Common Objects in Contextcited by 17,498
- 2021Swin Transformer: Hierarchical Vision Transformer using Shifted Windowscited by 12,082
- 2023Segment Anythingcited by 8,158
- 2019Momentum Contrast for Unsupervised Visual Representation Learningcited by 7,482
- 2021Masked Autoencoders Are Scalable Vision Learnerscited by 7,339
- 2021Switch Transformers: Scaling to Trillion Parameter Models with Simple and Efficient Sparsitycited by 3,014
- 2021SegFormer: Simple and Efficient Design for Semantic Segmentation with Transformerscited by 2,923
- 2023FlashAttention-2: Faster Attention with Better Parallelism and Work Partitioningcited by 2,551
- 2021Vision Transformers for Dense Predictioncited by 1,789
- 2019Deep High-Resolution Representation Learning for Visual Recognitioncited by 1,417
24 more
- 2019LVIS: A Dataset for Large Vocabulary Instance Segmentationcited by 1,215
- 2021Per-Pixel Classification is Not All You Need for Semantic Segmentationcited by 1,148
- 2021Multiscale Vision Transformerscited by 896
- 2021CrossViT: Cross-Attention Multi-Scale Vision Transformer for Image Classificationcited by 806
- 2022Exploring Plain Vision Transformer Backbones for Object Detectioncited by 723
- 2023Segment Anything in High Qualitycited by 373
- 2021LoveDA: A Remote Sensing Land-Cover Dataset for Domain Adaptive Semantic Segmentationcited by 259
- 2023EfficientSAM: Leveraged Masked Image Pretraining for Efficient Segment Anythingcited by 187
- 2021Reviving Iterative Training with Mask Guidance for Interactive Segmentationcited by 162
- 2016Deep Interactive Object Selectioncited by 160
- 2022FlexiViT: One Model for All Patch Sizescited by 151
- 2022QuadTree Attention for Vision Transformerscited by 129
- 2020f-BRS: Rethinking Backpropagating Refinement for Interactive Segmentationcited by 117
- 2022SimpleClick: Interactive Image Segmentation with Simple Vision Transformerscited by 109
- 2022FocalClick: Towards Practical Interactive Image Segmentationcited by 101
- 2021Shunted Self-Attention via Multi-Scale Token Aggregationcited by 90
- 2021Differentiable Patch Selection for Image Recognitioncited by 68
- 2021Efficient Video Transformers with Spatial-Temporal Token Selectioncited by 58
- 2021EdgeFlow: Achieving Practical Interactive Segmentation with Edge-Guided Flowcited by 40
- 2019A Remote Sensing Image Dataset for Cloud Removalcited by 28
- 2023Unbiased Scene Graph Generation via Two-stage Causal Modelingcited by 21
- 2023CFR-ICL: Cascade-Forward Refinement with Iterative Click Loss for Interactive Image Segmentationcited by 17
- 2023Detect Any Shadow: Segment Anything for Video Shadow Detectioncited by 16
- 2018A Fully Convolutional Two-Stream Fusion Network for Interactive Image Segmentationcited by 15
Built on by
Citing papers per year: 2025: 1; 2026: 1.
2 papers.