基于距离轮廓的鲁棒点匹配
Robust Point Matching with Distance Profiles
AI总结:
本文提出基于距离轮廓的改进匹配方法,解决高维下鲁棒点匹配问题,通过理论分析和实验验证,填补了该领域理论研究的空白。
摘要:
二次匹配和Gromov-Wasserstein距离的计算难度导致了各种近似和松弛方案的出现。其中一种方法依赖于距离轮廓的概念,已在实践中被广泛使用,但其理论理解有限。通过深入研究之前基于距离轮廓提出的方法的统计复杂性,我们表明,除非在底层度量测度空间上做出某些假设,否则该方法会受到维度灾难的限制。基于这一见解,我们提出并分析了一种改进的匹配过程,可以在一定的概率设置下实现鲁棒的点匹配。我们通过模拟和实际数据应用来展示所提出方法的性能,以补充理论发现。结果,我们通过提供基于距离不变量如距离轮廓的匹配过程的理论基础,为文献做出了贡献,这些方法在实践中被广泛使用,但很少有理论分析。
英文摘要:
Computational difficulty of quadratic matching and the Gromov-Wasserstein distance has led to various approximation and relaxation schemes. One of such methods, relying on the notion of distance profiles, has been widely used in practice, but its theoretical understanding is limited. By delving into the statistical complexity of the previously proposed method based on distance profiles, we show that it suffers from the curse of dimensionality unless we make certain assumptions on the underlying metric measure spaces. Building on this insight, we propose and analyze a modified matching procedure that can be used to robustly match points under a certain probabilistic setting. We demonstrate the performance of the proposed methods using simulations and real data applications to complement the theoretical findings. As a result, we contribute to the literature by providing theoretical underpinnings of the matching procedures based on distance invariants like distance profiles, which have been widely used in practice but rarely analyzed theoretically.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。