Command Palette
Search for a command to run...
Cascaded Sparse Feature Propagation Network for Interactive Segmentation
Zhang Chuyu ; Hu Chuanyang ; Ren Hui ; Liu Yongfei ; He Xuming

Abstract
We aim to tackle the problem of point-based interactive segmentation, inwhich the key challenge is to propagate the user-provided annotations tounlabeled regions efficiently. Existing methods tackle this challenge byutilizing computationally expensive fully connected graphs or transformerarchitectures that sacrifice important fine-grained information required foraccurate segmentation. To overcome these limitations, we propose a cascadesparse feature propagation network that learns a click-augmented featurerepresentation for propagating user-provided information to unlabeled regions.The sparse design of our network enables efficient information propagation onhigh-resolution features, resulting in more detailed object segmentation. Wevalidate the effectiveness of our method through comprehensive experiments onvarious benchmarks, and the results demonstrate the superior performance of ourapproach. Code is available at\href{https://github.com/kleinzcy/CSFPN}{https://github.com/kleinzcy/CSFPN}.
Code Repositories
Benchmarks
| Benchmark | Methodology | Metrics |
|---|---|---|
| interactive-segmentation-on-berkeley | IA-FP-Net(HRNet, C+L) | NoC@90: 2.12 |
| interactive-segmentation-on-davis | IA-FP-Net | NoC@85: 4.03 NoC@90: 5.22 |
| interactive-segmentation-on-grabcut | IA-FP-Net | NoC@90: 1.68 |
| interactive-segmentation-on-sbd | IA-FP-Net(HRNet,SBD) | NoC@85: 3.33 NoC@90: 5.25 |
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.