MST: Adaptive Multi-Scale Tokens Guided Interactive Segmentation
About
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.
Related benchmarks
| Task | Dataset | Result | Rank | |
|---|---|---|---|---|
| Interactive Segmentation | Berkeley | NoC@901.5 | 230 | |
| Interactive Segmentation | GrabCut | NoC@901.48 | 225 | |
| Interactive Segmentation | DAVIS | NoC@904.55 | 197 | |
| Interactive Segmentation | SBD | NoC @ 90% Target5.11 | 171 | |
| Interactive Segmentation | Pascal VOC | NoC@851.69 | 43 | |
| Interactive Mask Correction | DAVIS From Initial Mask 585 | NoC 851.8 | 22 | |
| Interactive Instance Segmentation | COCO (MVal) | NoC @ 85%2.08 | 13 | |
| Interactive Segmentation | LoveDA (test) | NoC (80%)5.3 | 12 | |
| Interactive Segmentation | General Efficiency Benchmarking | Parameters (MB)166.8 | 6 |