转运情况下Wasserstein距离的近似
Approximation of Wasserstein distance with Transshipment
摘要：
提出了一种非结构化离散网格上直方图间p-Wasserstein距离的近似算法。该算法基于一个低维子空间上的重心计算，对应于一个转运问题。还考虑了多尺度策略。该方法提供了稀疏的传输矩阵，可应用于大规模和非结构化数据。
英文摘要：
An algorithm for approximating the p-Wasserstein distance between histograms defined on unstructured discrete grids is presented. It is based on the computation of a barycenter constrained to be supported on a low dimensional subspace, which corresponds to a transshipment problem. A multi-scale strategy is also considered. The method provides sparse transport matrices and can be applied to large scale and non structured data.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
