Towards minimal barcodes

DOI10.1007/978-3-642-38221-5_20MaRDI QIDQ4922163zbMATH OpenOpenAlexFDO

Authors Hamid Krim, Rocío González-Díaz, M. J. Jiménez

Publication date 28 May 2013

Published in Graph-Based Representations in Pattern Recognition (Search for Journal in Brave)

Full work available at URL https://idus.us.es/xmlui/handle/11441/30771

zbMATH Keywords

graphspersistence barcodespersistent homologypolyhedral complexes

Mathematics Subject Classification ID

Other homology theories in algebraic topology (55N35) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Computing methodologies for image processing (68U10)

Recommendations

• An entropy-based persistence barcode
• Computing persistent homology
• Computing persistent homology
• Persistent homology over directed acyclic graphs
• Barcodes of towers and a streaming algorithm for persistent homology

Cited in

(7)

• An entropy-based persistence barcode
• Holes and dependences in an ordered complex
• Barcodes of towers and a streaming algorithm for persistent homology
• Barcodes of towers and a streaming algorithm for persistent homology
• Persistent 1-cycles: definition, computation, and its application
• Harmonic Persistent Homology
• Minimal on-line labelling

This page was built for publication: Towards minimal barcodes

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4922163)