arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1803.05093cs.CG
收藏

基于离散Morse理论的图重构

Graph Reconstruction by Discrete Morse Theory

Tamal K. Dey, Jiayuan Wang, Yusu Wang

摘要:

从潜在的噪声数据中恢复隐藏的类图结构是现代数据分析中的一项基本任务。最近,一个持久性引导的离散Morse为基础的框架,以提取几何图形从低维数据已成为流行。然而,到目前为止,有非常有限的理论理解这个框架的图形重建。本文为缩小这一差距迈出了第一步。具体来说,首先,利用现有的理论理解的持久性指导离散莫尔斯取消,我们提供了一个简化版本的现有离散莫尔斯为基础的图重建算法。然后,我们介绍了一个简单而自然的噪声模型,并表明上述框架可以正确地重建在此噪声模型下的图形,在这个意义上,它具有相同的循环结构的隐藏地面实况图,也是几何接近。我们还提供了一些实验结果,我们的简化图重建算法。

英文摘要:

Recovering hidden graph-like structures from potentially noisy data is a fundamental task in modern data analysis. Recently, a persistence-guided discrete Morse-based framework to extract a geometric graph from low-dimensional data has become popular. However, to date, there is very limited theoretical understanding of this framework in terms of graph reconstruction. This paper makes a first step towards closing this gap. Specifically, first, leveraging existing theoretical understanding of persistence-guided discrete Morse cancellation, we provide a simplified version of the existing discrete Morse-based graph reconstruction algorithm. We then introduce a simple and natural noise model and show that the aforementioned framework can correctly reconstruct a graph under this noise model, in the sense that it has the same loop structure as the hidden ground-truth graph, and is also geometrically close. We also provide some experimental results for our simplified graph-reconstruction algorithm.

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

↑