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

基于拓扑方法的高维点云数据图形化

Graph skeletonization of high-dimensional point cloud data via topological method

Lucas Magee, Yusu Wang

摘要:

几何图形成了数据背后隐藏结构的重要家族。在本文中,我们开发了一个有效的和强大的算法来推断一个高维点云数据集(PCD)的图形骨架。以前,已经有很多工作,以恢复隐藏图从低维密度场,或从一个相对干净的高维PCD。我们所提出的方法建立在最近的工作线上使用持久性指导离散莫尔斯(DM)理论为基础的方法来重建几何图形从密度场定义在一个低维三角剖分。特别是,我们首先给出了一个非常简单的概括,这个基于DM的算法从密度函数的角度来看,一般的过滤的角度。在理论方面,我们证明了广义算法的输出包含一个所谓的字典最优持续循环基础w.r.t的输入过滤,证明输出确实是有意义的。在算法方面,推广使我们能够结合稀疏加权RIP过滤,开发一种新的图形重建算法的噪声点云数据。新算法对背景噪声和输入点的非均匀分布具有很好的鲁棒性,并通过实验验证了算法的有效性。

英文摘要:

Geometric graphs form an important family of hidden structures behind data. In this paper, we develop an efficient and robust algorithm to infer a graph skeleton of a high-dimensional point cloud dataset (PCD). Previously, there has been much work to recover a hidden graph from a low-dimensional density field, or from a relatively clean high-dimensional PCD. Our proposed approach builds upon the recent line of work on using a persistence-guided discrete Morse (DM) theory based approach to reconstruct a geometric graph from a density field defined over a low-dimensional triangulation. In particular, we first give a very simple generalization of this DM-based algorithm from a density-function perspective to a general filtration perspective. On the theoretical front, we show that the output of the generalized algorithm contains a so-called lexicographic-optimal persistent cycle basis w.r.t the input filtration, justifying that the output is indeed meaningful. On the algorithmic front, the generalization allows us to combine sparsified weighted Rips filtration to develop a new graph reconstruction algorithm for noisy point cloud data. The new algorithm is robust to background noise and non-uniform distribution of input points, and we provide various experimental results to show its effectiveness.

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

↑