期刊
JOURNAL OF SCIENTIFIC COMPUTING
卷 75, 期 1, 页码 182-197出版社
SPRINGER/PLENUM PUBLISHERS
DOI: 10.1007/s10915-017-0529-1
关键词
Earth Mover's distance; Optimal transport; Compressed sensing; Primal-dual algorithm; L-1 regularization
资金
- ONR [N000141410683, N000141210838]
- DOE [DE-SC00183838]
- Direct For Mathematical & Physical Scien
- Division Of Mathematical Sciences [1440415] Funding Source: National Science Foundation
We propose a new algorithm to approximate the Earth Mover's distance (EMD). Our main idea is motivated by the theory of optimal transport, in which EMD can be reformulated as a familiar type minimization. We use a regularization which gives us a unique solution for this type problem. The new regularized minimization is very similar to problems which have been solved in the fields of compressed sensing and image processing, where several fast methods are available. In this paper, we adopt a primal-dual algorithm designed there, which uses very simple updates at each iteration and is shown to converge very rapidly. Several numerical examples are provided.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据