Efficient Computation of Image Persistence
From MaRDI portal
Abstract: We present an algorithm for computing the barcode of the image of a morphisms in persistent homology induced by an inclusion of filtered finite-dimensional chain complexes. These algorithms make 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. They form the basis for our implementation for Vietoris-Rips complexes in the framework of the software Ripser.
This page was built for publication: Efficient Computation of Image Persistence
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6388009)
