Efficient Computation of Image Persistence

Ulrich Bauer, Maximilian Schmahl

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

1 Scopus citations

Abstract

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.

Original languageEnglish
Title of host publication39th International Symposium on Computational Geometry, SoCG 2023
EditorsErin W. Chambers, Joachim Gudmundsson
PublisherSchloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing
ISBN (Electronic)9783959772730
DOIs
StatePublished - 1 Jun 2023
Event39th International Symposium on Computational Geometry, SoCG 2023 - Dallas, United States
Duration: 12 Jun 202315 Jun 2023

Publication series

NameLeibniz International Proceedings in Informatics, LIPIcs
PublisherSchloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing
ISSN (Print)1868-8969

Conference

Conference39th International Symposium on Computational Geometry, SoCG 2023
Country/TerritoryUnited States
CityDallas
Period12/06/2315/06/23

Keywords

  • Persistent homology
  • barcode computation
  • image persistence

Fingerprint

Dive into the research topics of 'Efficient Computation of Image Persistence'. Together they form a unique fingerprint.

Cite this