Title :
Spectral Gromov-Wasserstein distances for shape matching
Author_Institution :
Math., Stanford Univ., Stanford, CA, USA
fDate :
Sept. 27 2009-Oct. 4 2009
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.
Keywords :
computational complexity; image matching; spectral analysis; Laplace-Beltrami operator; computational complexity; shape matching; spectral Gromov-Wasserstein distances; spectral invariants; Collaborative work; Computational complexity; Conferences; Costs; DNA; Extraterrestrial measurements; Kernel; Mathematics; Shape measurement; Space heating;
Conference_Titel :
Computer Vision Workshops (ICCV Workshops), 2009 IEEE 12th International Conference on
Conference_Location :
Kyoto
Print_ISBN :
978-1-4244-4442-7
Electronic_ISBN :
978-1-4244-4441-0
DOI :
10.1109/ICCVW.2009.5457690