Earth mover's distances on discrete surfaces

Justin Solomon, Raif M. Rustamov, Leonidas Guibas, Adrian Butscher

ACM Transactions on Graphics · 2014 · 129 citations · 49 references

Concepts

TL;DR

The authors propose a new method for computing the earth mover’s distance between probability distributions on a discrete surface. Their approach replaces the quadratic‑size linear program with a dual differential formulation that scales linearly, discretized via finite elements and optimized for graphics and geometry‑processing tasks. The method produces a family of smooth surface distances that interpolate between spectral and geodesic metrics, can be extended to volumes, and is illustrated with several geometry‑processing applications.

Abstract

We introduce a novel method for computing the earth mover's distance (EMD) between probability distributions on a discrete surface. Rather than using a large linear program with a quadratic number of variables, we apply the theory of optimal transportation and pass to a dual differential formulation with linear scaling. After discretization using finite elements (FEM) and development of an accompanying optimization method, we apply our new EMD to problems in graphics and geometry processing. In particular, we uncover a class of smooth distances on a surface transitioning from a purely spectral distance to the geodesic distance between points; these distances also can be extended to the volume inside and outside the surface. A number of additional applications of our machinery to geometry problems in graphics are presented.

References

49