Clear and Compress: Computing Persistent Homology in Chunks

DOI10.1007/978-3-319-04099-8_7zbMath1326.68299arXiv1303.0477OpenAlexW2124338751MaRDI QIDQ3454948

Jan Reininghaus, Ulrich Bauer, Michael Kerber

Publication date: 3 December 2015

Published in: Mathematics and Visualization (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1303.0477

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Parallel algorithms in computer science (68W10) Chain complexes in algebraic topology (55U15) Other homology theories in algebraic topology (55N35)

Related Items

Persistence diagrams with linear machine learning models ⋮ The Offset Filtration of Convex Objects ⋮ The Persistent Homology of Cyclic Graphs ⋮ A topological approach for protein classification ⋮ Volume-Optimal Cycle: Tightest Representative Cycle of a Generator in Persistent Homology ⋮ Barcodes of towers and a streaming algorithm for persistent homology ⋮ Distributing persistent homology via spectral sequences ⋮ The compressed annotation matrix: an efficient data structure for computing persistent cohomology ⋮ Computing Connection Matrices via Persistence-Like Reductions ⋮ A heuristic for short homology basis of digital objects ⋮ Local computation of homology variations over a construction process ⋮ Multiscale persistent functions for biomolecular structure characterization ⋮ Computing multiparameter persistent homology through a discrete Morse-based approach ⋮ Persistent homology for low-complexity models ⋮ Continuation of point clouds via persistence diagrams ⋮ Singular persistent homology with geometrically parallelizable computation ⋮ Unnamed Item ⋮ Discrete Morse theory for computing zigzag persistence ⋮ \textsc{Phat} -- persistent homology algorithms toolbox ⋮ Computing Persistent Homology of Flag Complexes via Strong Collapses ⋮ Persistent homology in \(\ell_\infty\) metric ⋮ Computing persistent homology with various coefficient fields in a single pass ⋮ SimBa ⋮ Decomposing filtered chain complexes: geometry behind barcoding algorithms ⋮ Compression for \(2\)-parameter persistent homology

Uses Software

• PHAT
• Dionysus

Cites Work

• Unnamed Item
• Optimal topological simplification of discrete functions on surfaces
• Morse theory for cell complexes
• The nonlinear statistics of high-contrast patches in natural images
• Computing persistent homology
• Topological persistence and simplification
• Dualities in persistent (co)homology