Grownbb: Gromov-Wasserstein learning of neural best buddies for cross-domain correspondence

被引:0
作者
Tang, Ruolan [1 ]
Wang, Weiwei [1 ]
Han, Yu [2 ]
Feng, Xiangchu [1 ]
机构
[1] Xidian Univ, Sch Math & Stat, Xian 710071, Shaanxi, Peoples R China
[2] Shenzhen Univ, Sch Math Sci, Shenzhen 518060, Guangdong, Peoples R China
基金
中国国家自然科学基金;
关键词
Cross-domain correspondence; Optimal transport; Neural best buddies; Gromov-Wasserstein distance; IMAGE; SCALE; FEATURES;
D O I
10.1007/s00371-023-03251-9
中图分类号
TP31 [计算机软件];
学科分类号
081202 ; 0835 ;
摘要
Identifying pixel correspondences between two images is a fundamental task in computer vision, and has been widely used for 3D reconstruction, image morphing, and image retrieval. The neural best buddies (NBB) finds sparse correspondences between cross-domain images, which have semantically related local structures, though could be quite different in semantics as well as appearances. This paper presents a new method for cross-domain image correspondence, called GroWNBB, by incorporating the Gromov-Wasserstein learning into the NBB framework. Specifically, we utilize the NBB as the backbone to search feature matching from deep layer and propagate to low layer. While for each layer, we modify the strategy of NBB by further mapping the matching pairs obtained from the NBB within and across images into graphs, then formulate the matches as optimal transport between graphs, and use Gromov-Wasserstein learning to establish matches between these graphs. Consequently, our approach considers the relationships between images as well as the relationships within images, which makes the correspondence more stable. Our experiments demonstrate that GroWNBB achieves state-of-the-art performance on cross-domain correspondence and outperforms other popular methods in intra-class and same object correspondence estimation. Our code is available at https://github.com/NolanInLowland/GroWNBB.
引用
收藏
页码:8517 / 8530
页数:14
相关论文
共 49 条
  • [1] Neural Best-Buddies: Sparse Cross-Domain Correspondence
    Aberman, Kfir
    Liao, Jing
    Shi, Mingyi
    Lischinski, Dani
    Chen, Baoquan
    Cohen-Or, Daniel
    [J]. ACM TRANSACTIONS ON GRAPHICS, 2018, 37 (04):
  • [2] Agrawal M, 2008, LECT NOTES COMPUT SC, V5305, P102, DOI 10.1007/978-3-540-88693-8_8
  • [3] KAZE Features
    Alcantarilla, Pablo Fernandez
    Bartoli, Adrien
    Davison, Andrew J.
    [J]. COMPUTER VISION - ECCV 2012, PT VI, 2012, 7577 : 214 - 227
  • [4] Balntas V., 2016, BMVC, P3
  • [5] Key.Net: Keypoint Detection by Handcrafted and Learned CNN Filters Revisited
    Barroso-Laguna, Axel
    Mikolajczyk, Krystian
    [J]. IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE, 2023, 45 (01) : 698 - 711
  • [6] Speeded-Up Robust Features (SURF)
    Bay, Herbert
    Ess, Andreas
    Tuytelaars, Tinne
    Van Gool, Luc
    [J]. COMPUTER VISION AND IMAGE UNDERSTANDING, 2008, 110 (03) : 346 - 359
  • [7] A Gromov-Hausdorff Framework with Diffusion Geometry for Topologically-Robust Non-rigid Shape Matching
    Bronstein, Alexander M.
    Bronstein, Michael M.
    Kimmel, Ron
    Mahmoudi, Mona
    Sapiro, Guillermo
    [J]. INTERNATIONAL JOURNAL OF COMPUTER VISION, 2010, 89 (2-3) : 266 - 286
  • [8] BRIEF: Binary Robust Independent Elementary Features
    Calonder, Michael
    Lepetit, Vincent
    Strecha, Christoph
    Fua, Pascal
    [J]. COMPUTER VISION-ECCV 2010, PT IV, 2010, 6314 : 778 - 792
  • [9] Learning to Detect Local Features Using Information Change
    Cho, Yongju
    Faisal, Muhammad
    Sadiq, Usama
    Arif, Tabasher
    Hafiz, Rehan
    Seo, Jeongil
    Ali, Mohsen
    [J]. IEEE ACCESS, 2021, 9 : 43898 - 43908
  • [10] SuperPoint: Self-Supervised Interest Point Detection and Description
    DeTone, Daniel
    Malisiewicz, Tomasz
    Rabinovich, Andrew
    [J]. PROCEEDINGS 2018 IEEE/CVF CONFERENCE ON COMPUTER VISION AND PATTERN RECOGNITION WORKSHOPS (CVPRW), 2018, : 337 - 349