具有理论保证的高噪声散乱点云的离散化算法
Skeletonisation Algorithms with Theoretical Guarantees for Unorganised Point Clouds with High Levels of Noise
摘要:
数据科学旨在从无组织的数据中提取有意义的知识。真实的数据集通常以只有成对距离的点云的形式出现。许多应用需要可视化从非线性对象采样的点的噪声云的整体形状,该非线性对象比不相交聚类的联合更复杂。最困难的形式是找到一个正确表示云形状的一维骨架。本文比较了几种算法,解决上述问题的任意点云,并保证一个成功的重建。例如,给定未知底层图的高噪声点样本,重建的骨架应该在几何上接近并且同伦等价于底层图(具有相同数量的独立循环)。其中一种算法为任何云生成一个没有额外参数的同源持久骨架(HoPeS)。这个通用的骨架包含子图,可证明表示任何尺度下的云的一维形状。HoPeS的其他子图从具有正确同伦类型的噪声点样本中重建未知图,并且在样本的小偏移内。对合成数据和真实数据的大量实验首次揭示了允许成功的图形重建的最大噪声水平。
英文摘要:
Data Science aims to extract meaningful knowledge from unorganised data. Real datasets usually come in the form of a cloud of points with only pairwise distances. Numerous applications require to visualise an overall shape of a noisy cloud of points sampled from a non-linear object that is more complicated than a union of disjoint clusters. The skeletonisation problem in its hardest form is to find a 1-dimensional skeleton that correctly represents a shape of the cloud. This paper compares several algorithms that solve the above skeletonisation problem for any point cloud and guarantee a successful reconstruction. For example, given a highly noisy point sample of an unknown underlying graph, a reconstructed skeleton should be geometrically close and homotopy equivalent to (has the same number of independent cycles as) the underlying graph. One of these algorithm produces a Homologically Persistent Skeleton (HoPeS) for any cloud without extra parameters. This universal skeleton contains sub-graphs that provably represent the 1-dimensional shape of the cloud at any scale. Other subgraphs of HoPeS reconstruct an unknown graph from its noisy point sample with a correct homotopy type and within a small offset of the sample. The extensive experiments on synthetic and real data reveal for the first time the maximum level of noise that allows successful graph reconstructions.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。