Efficient computation of image persistence

DOI10.4230/LIPICS.SOCG.2023.14MaRDI QIDQ6620501zbMATH OpenFDO

Authors Ulrich Bauer, Maximilian Schmahl

Publication date 16 October 2024

Full work available at URL https://doi.org/10.4230/LIPICS.SOCG.2023.14

zbMATH Keywords

barcode computationimage persistencepersistent homology

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Recommendations

• Ripser: efficient computation of Vietoris-Rips persistence barcodes
• Clear and compress: computing persistent homology in chunks
• Coreduction homology algorithm for inclusions and persistent homology
• Computing persistent homology
• An output-sensitive algorithm for persistent homology

Cited in

(5)

• GPU-Accelerated Computation of Vietoris-Rips Persistence Barcodes.
• Keeping it sparse: computing persistent homology revisited
• Cycling signatures: identifying cycling motions in time series using algebraic topology
• Cup product persistence and its efficient computation
• Persistent intrinsic volumes

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