An in depth look at the Procrustes-Wasserstein distance: properties and barycenters
Davide Adamo, Marco Corneli, Manon Vuillien, Emmanuelle Vila
摘要
Due to its invariance to rigid transformations such as rotations and reflections, Procrustes-Wasserstein (PW) was introduced in the literature as an optimal transport (OT) distance, alternative to Wasserstein and more suited to tasks such as the alignment and comparison of point clouds. Having that application in mind, we carefully build a space of discrete probability measures and show that over that space PW actually is a distance. Algorithms to solve the PW problems already exist, however we extend the PW framework by discussing and testing several initialization strategies. We then introduce the notion of PW barycenter and detail an algorithm to estimate it from the data. The result is a new method to compute representative shapes from a collection of point clouds. We benchmark our method against existing OT approaches, demonstrating superior performance in scenarios requiring precise alignment and shape preservation. We finally show the usefulness of the PW barycenters in an archaeological context. Our results highlight the potential of PW in boosting 2D and 3D point cloud analysis for machine learning and computational geometry applications.
问问这篇 Paper
智能体会读完全文。
Lune 把这篇 Paper 索引到了最后一个公式,引用它的顶会 Paper 也一样。你提问,回答直接引用原文。
它引用的顶会 Paper3
- Deep Shells: Unsupervised Shape Correspondence with Optimal TransportMarvin Eisenberger, Aysim Toker, Laura Leal-Taixé, Daniel CremersNeurIPS 2020 · 被引用 107 次
- Online Graph Dictionary LearningCédric Vincent-Cuaz, Titouan Vayer, Rémi Flamary, Marco Corneli 等ICML 2021 · 被引用 58 次
- Aligning Embeddings and Geometric Random Graphs: Informational Results and Computational Approaches for the Procrustes-Wasserstein ProblemMathieu Even, Luca Ganassali, Jakob Maier, Laurent MassouliéNeurIPS 2024 · 被引用 5 次
相关 Paper
- Efficient Approximation Algorithm for Computing Wasserstein Barycenter under Euclidean MetricPankaj K. Agarwal, Sharath Raghvendra, Pouyan Shirzadian, Keegan YaoSODA 2025
- Optimal Transport Barycenter via Nonconvex-Concave Minimax OptimizationKaheon Kim, Rentian Yao, Changbo Zhu, Xiaohui ChenICML 2025
- Estimating Barycenters of Distributions with Neural Optimal TransportAlexander Kolesov, Petr Mokrov, Igor Udovichenko, Milena Gazdieva 等ICML 2024 · 被引用 13 次
- Partial Gromov-Wasserstein MetricYikun Bai, Rocio Diaz Martin, Abihith Kothapalli, Hengrong Du 等ICLR 2025
- Finding Wasserstein Ball Center: Efficient Algorithm and The Applications in FairnessYuntao Wang, Yuxuan Li, Qingyuan Yang, Hu DingICML 2025
