MST: Adaptive Multi-Scale Tokens Guided Interactive Segmentation
Long Xu, Shanghong Li, Yongquan Chen, Jun Luo, Shiwu Lai
Code Available — Be the first to reproduce this paper.
ReproduceCode
- github.com/hahamyt/mstOfficialIn paperpytorch★ 4
Abstract
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.
Tasks
Benchmark Results
| Dataset | Model | Metric | Claimed | Verified | Status |
|---|---|---|---|---|---|
| Berkeley | ViT-B+MST+CL | NoC@90 | 1.5 | — | Unverified |
| COCO minival | ViT-B+MST+CL | NoC@85 | 2.08 | — | Unverified |
| DAVIS | ViT-B+MST+CL | NoC@90 | 4.55 | — | Unverified |
| DAVIS-585 | ViT-B+MST+CL | NoC@90 | 2.29 | — | Unverified |
| GrabCut | ViT-B+MST+CL | NoC@90 | 1.48 | — | Unverified |
| PascalVOC | ViT-B+MST+CL | NoC@85 | 1.69 | — | Unverified |
| SBD | ViT-B+MST+CL | NoC@85 | 3.03 | — | Unverified |