An in depth look at the Procrustes-Wasserstein distance: properties and barycenters
Davide Adamo, Marco Corneli, Manon Vuillien, Emmanuelle Vila
Abstract
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.
Ask about this paper
Your agent reads all of it.
Lune indexed this paper to the last equation, along with the top-tier papers that cite it. Ask a question and the answer quotes them.
Your agent calls
Luneget_paper_fulltext
Free to start. No credit card required.
Terminal
Install the CLIlune papers fulltext 0b1d955e-3f26-4161-8d37-e962d83f3236Builds on3
- Deep Shells: Unsupervised Shape Correspondence with Optimal TransportMarvin Eisenberger, Aysim Toker, Laura Leal-Taixé, Daniel CremersNeurIPS 2020 · 107 citations
- Online Graph Dictionary LearningCédric Vincent-Cuaz, Titouan Vayer, Rémi Flamary, Marco Corneli et al.ICML 2021 · 58 citations
- 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 citations
Related papers
- 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 et al.ICML 2024 · 13 citations
- Partial Gromov-Wasserstein MetricYikun Bai, Rocio Diaz Martin, Abihith Kothapalli, Hengrong Du et al.ICLR 2025
- Finding Wasserstein Ball Center: Efficient Algorithm and The Applications in FairnessYuntao Wang, Yuxuan Li, Qingyuan Yang, Hu DingICML 2025
