most citedGraph Matching with Bi-level Noisy Correspondence

4 citations · 4 across the 1 of their papers we have counts for

collaborators

1 paper

cs.CV2022★ 4 cited

Graph Matching with Bi-level Noisy Correspondence

Yijie Lin, Mouxing Yang, Jun Yu +3

In this paper, we study a novel and widely existing problem in graph matching (GM), namely, Bi-level Noisy Correspondence (BNC), which refers to node-level noisy correspondence (NN…