首页> 外文会议>Annual European symposium on algorithms >FPTAS for Minimizing Earth Mover's Distance under Rigid Transformations
【24h】

FPTAS for Minimizing Earth Mover's Distance under Rigid Transformations

机译:FPTAS,用于在刚性转换下最小化土方的距离

获取原文
获取外文期刊封面目录资料

摘要

In this paper, we consider the problem (denoted as EMDRT) of minimizing the earth mover's distance between two sets of weighted points A and B in a fixed dimensional R~d space under rigid transformation. EMDRT is an important problem in both theory and applications and has received considerable attentions in recent years. In this paper, we present the first FPTAS algorithm for EMDRT. Our algorithm runs roughly in O((nm)~(d+2)(log nm)~(2d)) time which matches the order of magnitude of the degree of a lower bound for any PTAS of this problem, where n and m are the sizes of A and B, respectively. Our result is based on several new techniques, such as the Sequential Orthogonal Decomposition (SOD) and Optimum Guided Base (OGB). Our technique can also be extended to several related problems, such as the alignment problem, and achieves FPTAS for each of them.
机译:在本文中,我们考虑了在刚性变换下使固定维数R〜d空间中两组加权点A和B之间的推土机距离最小化的问题(称为EMDRT)。 EMDRT在理论和应用上都是一个重要的问题,并且近年来受到了相当多的关注。在本文中,我们提出了用于EMDRT的第一个FPTAS算法。我们的算法大约在O((nm)〜(d + 2)(log nm)〜(2d))时间内运行,该时间与该问题的任何PTAS的下界度的数量级相匹配,其中n和m分别是A和B的大小。我们的结果基于几种新技术,例如顺序正交分解(SOD)和最佳导引基数(OGB)。我们的技术还可以扩展到几个相关的问题,例如对齐问题,并为每个问题实现FPTAS。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号