arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1304.6813cs.CG
收藏

压缩注释矩阵:一种计算持久上同调的有效数据结构

The Compressed Annotation Matrix: an Efficient Data Structure for Computing Persistent Cohomology

Jean-Daniel Boissonnat, Tamal K. Dey, Clément Maria

摘要:

由于对偶性,域F中系数的持久同调与上同调一致。我们提出了一个实施方案,最近推出的持久上同调附加注释向量的单纯形算法。我们将单纯复形的表示与上同调群的表示分开,并引入了一种新的数据结构来维护注释矩阵,该结构更加紧凑,大大减少了矩阵运算量.此外,我们还提出了一种简化上同调群表示的方法,并提高了时间和空间复杂度。本文提供了一个理论分析,以及详细的实验研究,我们的实施和比较与国家的最先进的软件持久的同源性和上同调。

英文摘要:

The persistent homology with coefficients in a field F coincides with the same for cohomology because of duality. We propose an implementation of a recently introduced algorithm for persistent cohomology that attaches annotation vectors with the simplices. We separate the representation of the simplicial complex from the representation of the cohomology groups, and introduce a new data structure for maintaining the annotation matrix, which is more compact and reduces substancially the amount of matrix operations. In addition, we propose heuristics to simplify further the representation of the cohomology groups and improve both time and space complexities. The paper provides a theoretical analysis, as well as a detailed experimental study of our implementation and comparison with state-of-the-art software for persistent homology and cohomology.

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

↑