欧氏空间中基于持久性的重建
Towards Persistence-Based Reconstruction in Euclidean Spaces
摘要:
流形重建在过去的十年中得到了广泛的研究,特别是在二维和三维。最近,显着的改进,在更高的维度,导致新的方法来重建大型类的紧凑子集的欧几里德空间$\R^d$。然而,这些方法的复杂性随着d呈指数级增长,这使得它们在中或高维中不切实际,即使是处理低维子流形。在本文中,我们介绍了一种新的方法,站在经典的重建和拓扑估计之间,其复杂性随数据的内在维度而增加。具体地说,当数据点足够密集地从$\R^d$的光滑$m$ -子流形中采样时,我们的方法在最多$c(m)n^5$的时间上检索子流形的同源性,其中$n$是输入的大小,$c(m)$是仅取决于$m$的常数。它也可以证明很好地处理范围广泛的$\R^d$的紧凑子集,但复杂性较差。沿着证明我们的算法的正确性的道路上,我们获得了新的结果,在Čech,撕裂,并见证复杂的过滤在欧几里得空间。
英文摘要:
Manifold reconstruction has been extensively studied for the last decade or so, especially in two and three dimensions. Recently, significant improvements were made in higher dimensions, leading to new methods to reconstruct large classes of compact subsets of Euclidean space $\R^d$. However, the complexities of these methods scale up exponentially with d, which makes them impractical in medium or high dimensions, even for handling low-dimensional submanifolds. In this paper, we introduce a novel approach that stands in-between classical reconstruction and topological estimation, and whose complexity scales up with the intrinsic dimension of the data. Specifically, when the data points are sufficiently densely sampled from a smooth $m$-submanifold of $\R^d$, our method retrieves the homology of the submanifold in time at most $c(m)n^5$, where $n$ is the size of the input and $c(m)$ is a constant depending solely on $m$. It can also provably well handle a wide range of compact subsets of $\R^d$, though with worse complexities. Along the way to proving the correctness of our algorithm, we obtain new results on Čech, Rips, and witness complex filtrations in Euclidean spaces.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。