A challenge in computational topology is to deal with large filtered geometric complexes built from point cloud data such as Vietoris-Rips filtrations. This has led to the development of schemes for parallel computation and compression which restrict simplices to lie in open sets in a cover of the data. We extend the method of acyclic carriers to the setting of persistent homology to give detailed bounds on the relationship between Vietoris-Rips filtrations restricted to covers and the full construction. We show how these complexes can be used to study data over a base space and use our results to guide the selection of covers of data. We demonstrate these techniques on a variety of covers, and show the utility of this construction in investigating higher-order homology of a model of high-dimensional image patches.
翻译:计算表层的一个挑战是处理从点云数据(如Vietoris-Rips过滤器)中建造的大型过滤式几何综合体,这导致制定平行计算和压缩计划,限制在数据封面的开放套件中存在不简单现象。我们将自行车载体的方法扩大到持久性同系物的设置,以详细限定越南-Rips过滤系统仅限于覆盖和完整构造之间的关系。我们展示这些复杂因素如何用于在基空间上研究数据,并使用我们的结果指导数据覆盖物的选择。我们在各种覆盖物上展示这些技术,并展示这种构造在调查高分辨率图像补丁模型的更高层次同系方面的实用性。