mlsanityData to 7 Oct 2026

Integrating Efficient Optimal Transport and Functional Maps For Unsupervised Shape Correspondence Learning

arXiv 2403.01781 ↗First posted 4 Mar 2024cs.CV cs.AIcited by 12

Not on the map. Why?

Abstract (arXiv)

In the realm of computer vision and graphics, accurately establishing correspondences between geometric 3D shapes is pivotal for applications like object tracking, registration, texture transfer, and statistical shape analysis. Moving beyond traditional hand-crafted and data-driven feature learning methods, we incorporate spectral methods with deep learning, focusing on functional maps (FMs) and optimal transport (OT). Traditional OT-based approaches, often reliant on entropy regularization OT in learning-based framework, face computational challenges due to their quadratic cost. Our key contribution is to employ the sliced Wasserstein distance (SWD) for OT, which is a valid fast optimal transport metric in an unsupervised shape matching framework. This unsupervised framework integrates functional map regularizers with a novel OT-based loss derived from SWD, enhancing feature alignment between shapes treated as discrete probability measures. We also introduce an adaptive refinement process utilizing entropy regularized OT, further refining feature alignments for accurate point-to-point correspondences. Our method demonstrates superior performance in non-rigid shape matching, including near-isometric and non-isometric scenarios, and excels in downstream tasks like segmentation transfer. The empirical results on diverse datasets highlight our framework's effectiveness and generalization capabilities, setting new standards in non-rigid shape matching with efficient OT metrics and an adaptive refinement module.

Key facts. Cited by 12 papers in the map (data through 7 Oct 2026). Builds on 34 of its 65 references that are in the map. First posted on arXiv 4 Mar 2024.

Builds on

34 of 65 references.

References · 34

  1. 2013Sinkhorn Distances: Lightspeed Computation of Optimal Transportation Distancescited by 2,277
  2. 2020PointContrast: Unsupervised Pre-training for 3D Point Cloud Understandingcited by 502
  3. 20163D Menagerie: Modeling the 3D shape and pose of animalscited by 310
  4. 2017Near-linear time approximation algorithms for optimal transport via Sinkhorn iterationcited by 219
  5. 2020DiffusionNet: Discretization Agnostic Learning on Surfacescited by 163
  6. 2017Deep Functional Maps: Structured Prediction for Dense Shape Correspondencecited by 134
  7. 2020Deep Geometric Functional Maps: Robust Feature Learning for Shape Correspondencecited by 125
  8. 20214DComplete: Non-Rigid Motion Estimation Beyond the Observable Surfacecited by 123
  9. 2018Unsupervised Deep Learning for Structured Shape Matchingcited by 81
  10. 2018Continuous and Orientation-preserving Correspondences via Functional Mapscited by 77
  11. 2020Deep Shells: Unsupervised Shape Correspondence with Optimal Transportcited by 74
  12. 2019Smooth Shells: Multi-Scale Shape Registration with Functional Mapscited by 72
22 more
  1. 2023SATR: Zero-Shot Semantic Segmentation of 3D Shapescited by 62
  2. 2019On Efficient Optimal Transport: An Analysis of Greedy and Accelerated Mirror Descent Algorithmscited by 60
  3. 2021DPFM: Deep Partial Functional Mapscited by 58
  4. 2023Unsupervised Learning of Robust Spectral Shape Matchingcited by 57
  5. 2021Shape registration in the time of transformerscited by 51
  6. 2021Point-set Distances for Learning Representations of 3D Point Cloudscited by 48
  7. 2022Unsupervised Deep Multi-Shape Matchingcited by 39
  8. 2023Energy-Based Sliced Wasserstein Distancecited by 39
  9. 2021Accurate Point Cloud Registration with Robust Optimal Transportcited by 38
  10. 2022Smooth Non-Rigid Shape Matching via Effective Dirichlet Energy Optimizationcited by 37
  11. 2022Deep Orientation-Aware Functional Maps: Tackling Symmetry Issues in Shape Matchingcited by 36
  12. 2022Learning Multi-resolution Functional Maps with Spectral Attention for Robust Shape Matchingcited by 35
  13. 2019On the Efficiency of Entropic Regularized Algorithms for Optimal Transportcited by 34
  14. 2019Cyclic Functional Mapping: Self-supervised correspondence between non-isometric deformable shapescited by 30
  15. 2023Spatially and Spectrally Consistent Deep Functional Mapscited by 30
  16. 2020Fixed-Support Wasserstein Barycenters: Computational Hardness and Fast Algorithmcited by 29
  17. 2020Structured Regularization of Functional Map Computationscited by 26
  18. 2023Self-Supervised Learning for Multimodal Non-Rigid 3D Shape Matchingcited by 23
  19. 2023NCP: Neural Correspondence Prior for Effective Unsupervised Shape Matchingcited by 18
  20. 2023Diffeomorphic Mesh Deformation via Efficient Optimal Transport for Cortical Surface Reconstructioncited by 7
  21. 2023Hybrid Neural Diffeomorphic Flow for Shape Representation and Generation via Triplanecited by 6
  22. 2023Hybrid-CSR: Coupling Explicit and Implicit Shape Representation for Cortical Surface Reconstructioncited by 3

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2024: 1; 2025: 6; 2026: 5.

12 papers.