The Joint Gromov Wasserstein Objective for Multiple Object Matching
This addresses the problem of multiple-to-one or multiple-to-multiple object matching for applications in computer graphics and structural biology, representing a novel extension rather than an incremental improvement.
The paper tackles the limitation of Gromov-Wasserstein distance to pairwise matching by introducing the Joint Gromov-Wasserstein objective for simultaneous multiple object matching, achieving superior accuracy and computational efficiency in benchmarks.
The Gromov-Wasserstein (GW) distance serves as a powerful tool for matching objects in metric spaces. However, its traditional formulation is constrained to pairwise matching between single objects, limiting its utility in scenarios and applications requiring multiple-to-one or multiple-to-multiple object matching. In this paper, we introduce the Joint Gromov-Wasserstein (JGW) objective and extend the original framework of GW to enable simultaneous matching between collections of objects. Our formulation provides a non-negative dissimilarity measure that identifies partially isomorphic distributions of mm-spaces, with point sampling convergence. We also show that the objective can be formulated and solved for point cloud object representations by adapting traditional algorithms in Optimal Transport, including entropic regularization. Our benchmarking with other variants of GW for partial matching indicates superior performance in accuracy and computational efficiency of our method, while experiments on both synthetic and real-world datasets show its effectiveness for multiple shape matching, including geometric shapes and biomolecular complexes, suggesting promising applications for solving complex matching problems across diverse domains, including computer graphics and structural biology.