3.8 Proceedings Paper

Delving Deep into Many-to-many Attention for Few-shot Video Object Segmentation

出版社

IEEE COMPUTER SOC
DOI: 10.1109/CVPR46437.2021.01382

关键词

-

资金

  1. National Natural Science Foundation of China [61972162]
  2. CCF-Tencent Open Research fund

向作者/读者索取更多资源

This paper introduces a novel Domain Agent Network (DAN) for Few-Shot Video Object Segmentation (FSVOS) task, breaking down full-rank attention into two smaller ones to improve performance. By considering one single frame of the query video as the domain agent, DAN effectively bridges between support images and query videos, while a learning strategy combining meta-learning with online learning further enhances segmentation accuracy, achieving state-of-the-art performance on both computational cost and accuracy.
This paper tackles the task of Few-Shot Video Object Segmentation (FSVOS), i.e., segmenting objects in the query videos with certain class specified in a few labeled support images. The key is to model the relationship between the query videos and the support images for propagating the object information. This is a many-to-many problem and often relies on full-rank attention, which is computationally intensive. In this paper, we propose a novel Domain Agent Network (DAN), breaking down the full-rank attention into two smaller ones. We consider one single frame of the query video as the domain agent, bridging between the support images and the query video. Our DAN allows a linear space and time complexity as opposed to the original quadratic form with no loss of performance. In addition, we introduce a learning strategy by combining meta-learning with online learning to further improve the segmentation accuracy. We build a FSVOS benchmark on the Youtube-VIS dataset and conduct experiments to demonstrate that our method outperforms baselines on both computational cost and accuracy, achieving the state-of-the-art performance. Code is available at https://github.com/scutpaul/DANet.

作者

我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。

评论

主要评分

3.8
评分不足

次要评分

新颖性
-
重要性
-
科学严谨性
-
评价这篇论文

推荐

暂无数据
暂无数据