Earth mover's distances on discrete surfaces

ACM Trans. Graph.(2014)

引用 146|浏览163
暂无评分
摘要
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.
更多
查看译文
关键词
earth mover's distance,convex programming,geometric algorithms, languages, and systems,geometric median,finite elements,wasserstein metric,optimal transportation,earth mover s distance
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要