The Compressed Annotation Matrix: an Efficient Data Structure for Computing Persistent Cohomology - Inria - Institut national de recherche en sciences et technologies du numérique Accéder directement au contenu
Article Dans Une Revue Algorithmica Année : 2015

The Compressed Annotation Matrix: an Efficient Data Structure for Computing Persistent Cohomology

Résumé

The persistent homology with coefficients in a field F coincides with the same for cohomology because of duality. We propose an implementation of a recently introduced algorithm for persistent cohomology that attaches annotation vectors with the simplices. We separate the representation of the simplicial complex from the representation of the cohomology groups, and introduce a new data structure for maintaining the annotation matrix, which is more compact and reduces substancially the amount of matrix operations. In addition, we propose heuristics to simplify further the representation of the cohomology groups and improve both time and space complexities. The paper provides a theoretical analysis, as well as a detailed experimental study of our implementation and comparison with state-of-the-art software for persistent homology and cohomology.
Fichier principal
Vignette du fichier
main.pdf (344.85 Ko) Télécharger le fichier
Vignette du fichier
vignette.png (17.95 Ko) Télécharger le fichier
Format : Figure, Image

Dates et versions

hal-00761468 , version 1 (07-01-2013)
hal-00761468 , version 2 (11-02-2013)
hal-00761468 , version 3 (24-04-2013)
hal-00761468 , version 4 (06-01-2020)

Identifiants

Citer

Jean-Daniel Boissonnat, Tamal K. Dey, Clément Maria. The Compressed Annotation Matrix: an Efficient Data Structure for Computing Persistent Cohomology. Algorithmica, 2015, 73 (3), pp.14. ⟨10.1007/s00453-015-9999-4⟩. ⟨hal-00761468v4⟩
958 Consultations
717 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More