Unlocking Geodesic Gromov-Wasserstein Distances for 3D Modeling
cs.CV, cs.DS, eess.IV
Submitted: 2026-09-26
Updated: 2026-10-02
Terminology
Sources
- Near-Linear Time Generalized Sinkhorn Algorithms for Bounded Genus Graphs
- A Survey on Algorithmic Developments in Optimal Transport Problem with Applications
- Manifold Random Features
- Optimal Transport for Machine Learners
- Semi-relaxed Gromov-Wasserstein divergence with applications on graphs
- Sinkhorn Algorithm for Sequentially Composed Optimal Transports
- Thingi10K: A Dataset of 10,000 3D-Printing Models
Related papers
- Loss Knows Best: Detecting Annotation Errors in Videos via Loss Trajectories
- AnchorWeave: World-Consistent Video Generation with Retrieved Local Spatial Memories
- Benchmarking the Robustness of Foundation Models for Mammography under Domain Shift
- MambaX-Net: Dual-Input Mamba-Enhanced Cross-Attention Network for Longitudinal MRI Segmentation
- TeleOCR: Navigating Document Parsing Across Digital and Camera-Captured Documents
- A Survey on Efficient Vision-Language-Action Models