Efficient computation of image persistence

DOI10.1007/S00454-025-00769-8MaRDI QIDQ6878294zbMATH OpenFDO

Authors Ulrich Bauer, Maximilian Schmahl

Publication date 6 January 2026

Published in Discrete \& Computational Geometry (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.1007/S00454-025-00769-8

zbMATH Keywords

persistent homologybarcode computationimage persistence

Mathematics Subject Classification ID

Persistent homology and applications, topological data analysis (55N31) Computational homological algebra (13P20) Topological data analysis (62R40)

Cites work

• scientific article; zbMATH DE number 5506200 (Why is no real title available?)
• Decomposition of pointwise finite-dimensional persistence modules.
• Dualities in persistent (co)homology
• Fast topological signal identification and persistent cohomological cycle matching
• Induced matchings and the algebraic stability of persistence barcodes
• Lifespan functors and natural dualities in persistent homology
• Persistence diagrams as diagrams: a categorification of the stability theorem
• Persistent homology for kernels, images, and cokernels
• Ripser: efficient computation of Vietoris-Rips persistence barcodes
• Stability of persistence diagrams
• The structure and stability of persistence modules
• Topological Data Analysis for Genomics and Evolution

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 Q6878294)