Spectral Gromov-Wasserstein Distances for Shape Matching

Abstract

We introduce a spectral notion of distance between shapes and study its theoretical properties. We show that our distance satisfies the properties of a metric on the class of isometric shapes, which means, in particular, that two shapes are at 0 distance if and only if they are isometric. Our construction is similar to the recently proposed Gromov-Wasserstein distance, but rather than viewing shapes merely as metric spaces, we define our distance via the comparison of heat kernels. This allows us to relate our distance to previously proposed spectral invariants used for shape comparison, such as the spectrum of the Laplace-Beltrami operator. In addition, the heat kernel provides a natural notion of scale, which is useful for multi-scale shape comparison. We also prove a hierarchy of lower bounds for our distance, which provide increasing discriminative power at the cost of increase in computational complexity.

Cite

Text

Mémoli. "Spectral Gromov-Wasserstein Distances for Shape Matching." IEEE/CVF International Conference on Computer Vision Workshops, 2009. doi:10.1109/ICCVW.2009.5457690

Markdown

[Mémoli. "Spectral Gromov-Wasserstein Distances for Shape Matching." IEEE/CVF International Conference on Computer Vision Workshops, 2009.](https://mlanthology.org/iccvw/2009/memoli2009iccvw-spectral/) doi:10.1109/ICCVW.2009.5457690

BibTeX

@inproceedings{memoli2009iccvw-spectral,
  title     = {{Spectral Gromov-Wasserstein Distances for Shape Matching}},
  author    = {Mémoli, Facundo},
  booktitle = {IEEE/CVF International Conference on Computer Vision Workshops},
  year      = {2009},
  pages     = {256-263},
  doi       = {10.1109/ICCVW.2009.5457690},
  url       = {https://mlanthology.org/iccvw/2009/memoli2009iccvw-spectral/}
}