Our new X account is live! Follow @wizwand_team for updates
WorkDL logo mark

Learning Semantic Correspondence with Sparse Annotations

About

Finding dense semantic correspondence is a fundamental problem in computer vision, which remains challenging in complex scenes due to background clutter, extreme intra-class variation, and a severe lack of ground truth. In this paper, we aim to address the challenge of label sparsity in semantic correspondence by enriching supervision signals from sparse keypoint annotations. To this end, we first propose a teacher-student learning paradigm for generating dense pseudo-labels and then develop two novel strategies for denoising pseudo-labels. In particular, we use spatial priors around the sparse annotations to suppress the noisy pseudo-labels. In addition, we introduce a loss-driven dynamic label selection strategy for label denoising. We instantiate our paradigm with two variants of learning strategies: a single offline teacher setting, and mutual online teachers setting. Our approach achieves notable improvements on three challenging benchmarks for semantic correspondence and establishes the new state-of-the-art. Project page: https://shuaiyihuang.github.io/publications/SCorrSAN.

Shuaiyi Huang, Luyu Yang, Bo He, Songyang Zhang, Xuming He, Abhinav Shrivastava• 2022

Related benchmarks

TaskDatasetResultRank
Semantic CorrespondenceSPair-71k (test)
PCK@0.155.3
122
Semantic CorrespondencePF-WILLOW
PCK@0.1 (bbox)80
109
Semantic CorrespondencePF-PASCAL
PCK @ alpha=0.193.3
98
Keypoint TransferSPair-71k (test)
Bicycle40.3
38
Semantic CorrespondenceSPair-71k
Aero Accuracy57.1
23
Semantic MatchingSPair-71k 1.0 (test)
PCK@0.1 (Aero)57.1
16
Semantic MatchingSPair-71k
PCK@0.0536.3
14
Semantic CorrespondenceSPair-71k
PCK @ 0.013.6
11
Showing 8 of 8 rows

Other info

Follow for update