Command Palette
Search for a command to run...
Long Xu Shanghong Li Yongquan Chen Jun Luo Shiwu Lai

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.
Code Repositories
Benchmarks
| Benchmark | Methodology | Metrics |
|---|---|---|
| interactive-segmentation-on-berkeley | ViT-B+MST+CL | NoC@90: 1.50 |
| interactive-segmentation-on-coco-minival | ViT-B+MST+CL | NoC@85: 2.08 NoC@90: 2.85 |
| interactive-segmentation-on-davis | ViT-B+MST+CL | NoC@90: 4.55 |
| interactive-segmentation-on-davis-585 | ViT-B+MST+CL | NoC@85: 1.80 NoC@90: 2.29 |
| interactive-segmentation-on-grabcut | ViT-B+MST+CL | NoC@90: 1.48 |
| interactive-segmentation-on-pascalvoc | ViT-B+MST+CL | NoC@85: 1.69 NoC@90: 1.90 |
| interactive-segmentation-on-sbd | ViT-B+MST+CL | NoC@85: 3.03 |
Build AI with AI
From idea to launch — accelerate your AI development with free AI co-coding, out-of-the-box environment and best price of GPUs.