Efficient computation of image persistence

We present an algorithm for computing the barcode of the image of a morphism in persistent homology induced by an inclusion of filtered finite-dimensional chain complexes. The algorithm makes use of the clearing optimization and can be applied to inclusion-induced maps in persistent absolute homolog...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Hauptverfasser: Bauer, Ulrich (VerfasserIn) , Schmahl, Maximilian (VerfasserIn)
Dokumenttyp: Article (Journal)
Sprache:Englisch
Veröffentlicht: 23 October 2025
In: Discrete & computational geometry
Year: 2025, Jahrgang: 74, Heft: 4, Pages: 999-1019
ISSN:1432-0444
DOI:10.1007/s00454-025-00769-8
Online-Zugang:Verlag, kostenfrei, Volltext: https://doi.org/10.1007/s00454-025-00769-8
Verlag, kostenfrei, Volltext: https://link.springer.com/article/10.1007/s00454-025-00769-8?utm_source=getftr&utm_medium=getftr&utm_campaign=getftr_pilot&getft_integrator=clarivate
Volltext
Verfasserangaben:Ulrich Bauer, Maximilian Schmahl
Beschreibung
Zusammenfassung:We present an algorithm for computing the barcode of the image of a morphism in persistent homology induced by an inclusion of filtered finite-dimensional chain complexes. The algorithm makes use of the clearing optimization and can be applied to inclusion-induced maps in persistent absolute homology and persistent relative cohomology for filtrations of pairs of simplicial complexes. The clearing optimization works particularly well in the context of relative cohomology, and using previous duality results we can translate the barcodes of images in relative cohomology to those in absolute homology. This forms the basis for an implementation of image persistence computations for inclusions of filtrations of Vietoris-Rips complexes in the framework of the software Ripser.
Beschreibung:Gesehen am 23.01.2026
Beschreibung:Online Resource
ISSN:1432-0444
DOI:10.1007/s00454-025-00769-8