arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1412.4098stat.ML
收藏

使用最短路径距离和联合邻域选择的流形匹配

Manifold Matching using Shortest-Path Distance and Joint Neighborhood Selection

Cencheng Shen, Joshua T. Vogelstein, Carey E. Priebe

AI总结:

针对多模态数据匹配中未利用对应信息导致次优性能的问题,提出一种基于最短路径距离与联合邻域选择的非线性流形匹配算法,通过构建联合最近邻图并在低维欧几里得空间中嵌入匹配,显著提升了不同数据集的匹配性能。

摘要:

匹配多模态数据集已成为数据分析中的重要任务。现有方法通常依赖每个单一模态的嵌入和变换,而不利用任何对应信息,这往往导致次优的匹配性能。在本文中,我们提出了一种使用最短路径距离和联合邻域选择的非线性流形匹配算法。具体而言,为所有模态构建了一个联合最近邻图。然后从联合邻域图中计算每个模态内部的最短路径距离,随后嵌入到共同的低维欧几里得空间中进行匹配。与现有算法相比,我们的方法在匹配多模态的不同数据集时表现出更优的性能。

英文摘要:

Matching datasets of multiple modalities has become an important task in data analysis. Existing methods often rely on the embedding and transformation of each single modality without utilizing any correspondence information, which often results in sub-optimal matching performance. In this paper, we propose a nonlinear manifold matching algorithm using shortest-path distance and joint neighborhood selection. Specifically, a joint nearest-neighbor graph is built for all modalities. Then the shortest-path distance within each modality is calculated from the joint neighborhood graph, followed by embedding into and matching in a common low-dimensional Euclidean space. Compared to existing algorithms, our approach exhibits superior performance for matching disparate datasets of multiple modalities.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑