MS2DG-Net: Progressive Correspondence Learning via Multiple Sparse Semantics Dynamic Graph
Establishing superior-quality correspondences in an image pair is pivotal to many subsequent computer vision tasks. Using Euclidean distance between correspondences to find neighbors and extract local information is a common strategy in previous works. However, most such works ignore similar sparse…