Cascaded Sparse Feature Propagation Network for Interactive Segmentation

10 Mar 2022  ·  Chuyu Zhang, Chuanyang Hu, Hui Ren, Yongfei Liu, Xuming He ·

We aim to tackle the problem of point-based interactive segmentation, in which the key challenge is to propagate the user-provided annotations to unlabeled regions efficiently. Existing methods tackle this challenge by utilizing computationally expensive fully connected graphs or transformer architectures that sacrifice important fine-grained information required for accurate segmentation. To overcome these limitations, we propose a cascade sparse feature propagation network that learns a click-augmented feature representation for propagating user-provided information to unlabeled regions. The sparse design of our network enables efficient information propagation on high-resolution features, resulting in more detailed object segmentation. We validate the effectiveness of our method through comprehensive experiments on various benchmarks, and the results demonstrate the superior performance of our approach. Code is available at \href{https://github.com/kleinzcy/CSFPN}{https://github.com/kleinzcy/CSFPN}.

PDF Abstract

Datasets


Results from the Paper


Task Dataset Model Metric Name Metric Value Global Rank Result Benchmark
Interactive Segmentation Berkeley IA-FP-Net(HRNet, C+L) NoC@90 2.12 # 6
Interactive Segmentation DAVIS IA-FP-Net NoC@85 4.03 # 4
NoC@90 5.22 # 5
Interactive Segmentation GrabCut IA-FP-Net NoC@90 1.68 # 8
Interactive Segmentation SBD IA-FP-Net(HRNet,SBD) NoC@85 3.33 # 5
NoC@90 5.25 # 4

Methods


No methods listed for this paper. Add relevant methods here