Clear and Compress: Computing Persistent Homology in Chunks

Abstract

We present a parallelizable algorithm for computing the persistent homology of a filtered chain complex. Our approach differs from the commonly used reduction algorithm by first computing persistence pairs within local chunks, then simplifying the unpaired columns, and finally applying standard reduction on the simplified matrix. The approach generalizes a technique by Günther et al., which uses discrete Morse Theory to compute persistence; we derive the same worst-case complexity bound in a more general context. The algorithm employs several practical optimization techniques which are of independent interest. Our sequential implementation of the algorithm is competitive with state-of-the-art methods, and we improve the performance through parallelized computation.

DOI: 10.1007/978-3-319-04099-8_7

2 Figures and Tables

051015201520162017
Citations per Year

Citation Velocity: 8

Averaging 8 citations per year over the last 3 years.

Learn more about how we calculate this metric in our FAQ.

Cite this paper

@inproceedings{Bauer2014ClearAC, title={Clear and Compress: Computing Persistent Homology in Chunks}, author={Ulrich Bauer and Michael Kerber and Jan Reininghaus}, booktitle={Topological Methods in Data Analysis and Visualization}, year={2014} }