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

Abstract : 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.
Document type :
Reports
[Research Report] RR-8195, INRIA. 2013, pp.14


https://hal.inria.fr/hal-00761468
Contributor : Clément Maria <>
Submitted on : Wednesday, April 24, 2013 - 4:17:46 PM
Last modification on : Wednesday, January 7, 2015 - 3:21:01 PM

Files

RR-8195.pdf
fileSource_public_author

Identifiers

  • HAL Id : hal-00761468, version 3
  • ARXIV : 1304.6813

Collections

Citation

Jean-Daniel Boissonnat, Tamal K. Dey, Clément Maria. The Compressed Annotation Matrix: an Efficient Data Structure for Computing Persistent Cohomology. [Research Report] RR-8195, INRIA. 2013, pp.14. <hal-00761468v3>

Export

Share

Metrics

Consultation de
la notice

419

Téléchargement du document

125