Acyclic partial matchings for multidimensional persistence: algorithm and combinatorial interpretation
DOI10.1007/s10851-018-0843-8zbMath1431.55007OpenAlexW2888851372WikidataQ129318907 ScholiaQ129318907MaRDI QIDQ1722615
Filippo Masoni, Madjid Allili, Tomasz Kaczynski, Landi, Claudia
Publication date: 18 February 2019
Published in: Journal of Mathematical Imaging and Vision (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10851-018-0843-8
matching algorithmdiscrete Morse theorymultidimensional persistent homologyacyclic partial matchingsreduced complex
Image processing (compression, reconstruction, etc.) in information and communication theory (94A08) Simple homotopy type, Whitehead torsion, Reidemeister-Franz torsion, etc. (57Q10) Other homology theories in algebraic topology (55N35)
Related Items (4)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Morse theory for filtrations and efficient computation of persistent homology
- Comparison of persistent homologies for vector functions: from continuous to discrete and back
- Reducing complexes in multidimensional persistent homology theory
- Coreduction homology algorithm
- Homology computation by reduction of chain complexes
- Morse theory for cell complexes
- Algorithmic construction of acyclic partial matchings for multidimensional persistence
- Topological persistence and simplification
- Computing multiparameter persistent homology through a discrete Morse-based approach
- Computing Persistence Modules on Commutative Ladders of Finite Type
- A Global Method for Reducing Multidimensional Size Graphs
- Generating Discrete Morse Functions from Point Data
- Topology and data
- Persistent homology transform for modeling shapes and surfaces
This page was built for publication: Acyclic partial matchings for multidimensional persistence: algorithm and combinatorial interpretation