Summary
2011 International Symposium on Nonlinear Theory and Its Applications
2011
Session Number:A4L-C
Session:
Number:A4L-C1
An Efficient Morse Theoretic Preprocessor for Computing Persistent Homology
Vidit Nanda,
pp.258-261
Publication Date:2011/9/4
Online ISSN:2188-5079
Summary:
We provide an efficient algorithm utilizing discrete Morse theory to dramatically reduce the size of a persistence complex while preserving its persistent homology groups. Significant gains in both time taken and memory consumed are observed when we compare to the existing methods of computing persistent homology. Our technique is not restricted to cubical, simplicial or even CW complexes.