An output-sensitive algorithm for persistent homology

Proceedings of the Annual Symposium on Computational Geometry

Volumn , Issue , 2011, Pages 207-215

  Chen, Chao ^a,b   Kerber, Michael ^a  

^a INSTITUTE OF SCIENCE AND TECHNOLOGY AUSTRIA   (Austria)

^b VIENNA UNIVERSITY OF TECHNOLOGY   (Austria)

Author keywords

Computational topology; Persistent homology; Randomized algorithms; Rank computation

Indexed keywords

ARBITRARY CONSTANTS; COLUMN OPERATIONS; COMPUTATIONAL TOPOLOGY; MATRIX; MONTE CARLO ALGORITHMS; N-MATRIX; NONZERO ENTRIES; OUTPUT-SENSITIVE ALGORITHM; PERSISTENT HOMOLOGY; RANDOMIZED ALGORITHMS; RANK COMPUTATION; RUNNING TIME; SIMPLICIAL COMPLEX; SUB-MATRICES;

COMPUTATIONAL GEOMETRY; MATRIX ALGEBRA;

ALGORITHMS;

EID: 79960165024     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1998196.1998228     Document Type: Conference Paper

References (32)

1. P. Bendich, H. Edelsbrunner, M. Kerber: "Computing Robustness and Persistence for Images". IEEE Transactions on Visualization and Computer Graphics 16 (2010) 1251-1260.
2. P. Bendich, H. Edelsbrunner, D. Morozov, A. Patel: "The Robustness of Level Sets". In: Proceedings of the 18th European Symposium on Algorithms, 2010 1-10.
3. G. Carlsson, V. De Silva, D. Morozov: "Zigzag persistent homology and real-valued functions". In: Proceedings of the 25th Annual Symposium onComputational Geometry. ACM, 2009 247-256.
4. G. Carlsson, T. Ishkhanov, V. de Silva, A. Zomorodian: "On the Local Behavior of Spaces of Natural Images". International Journal of Computer Vision 76 (2008) 1-12. (Pubitemid 350234084)
5. A. Cerri, M. Ferri, D. Giorgi: "Retrieval of trademark images by means of size functions". Graphical Models 68 (2006) 451-471. Special Issue on the Vision, Video and Graphics Conference 2005. (Pubitemid 44648828)
6. F. Chazal, D. Cohen-Steiner, M. Glisse, L. Guibas, S. Oudot: "Proximity of persistence modules and their diagrams". In: Proceedings of the 25th Annual Symposium on Computational Geometry. ACM, 2009 237-246.
7. C. Chen, M. Kerber: "Persistent Homology Computation with a Twist". In: 27th European Workshop on Computational Geometry, 2011 .
8. M. Chung, P. Bubenik, P. Kim: "Persistence Diagrams of Cortical Surface Data". In: J. Prince, D. Pham, K. Myers (eds.) Information Processing in Medical Imaging, LNCS, vol. 5636, 386-397, 2009.
9. D. Cohen-Steiner, H. Edelsbrunner, J. Harer: "Stability of persistence diagrams". Discrete and Computational Geometry 37 (2007) 103-120.
10. D. Cohen-Steiner, H. Edelsbrunner, J. Harer: "Extending persistence using Poincaré and Lefschetz duality". Foundations of Computational Mathematics 9 (2009) 79-103.
11. D. Cohen-Steiner, H. Edelsbrunner, D. Morozov: "Vines and vineyards by updating persistence in linear time". In: Proceedings of the twenty-second Annual Symposium on Computational Geometry. SCG '06, 2006 119-126. (Pubitemid 44300779)
12. D. Coppersmith, S. Winograd: "Matrix multiplication via arithmetic progresssions". Journal of Symbolic Computation 9 (1990) 251-280.
13. T. Cormen, C. Leiserson, R. Rivest, C. Stein: Introduction to algorithms. The MIT press, 2001.
14. V. De Silva, M. Vejdemo-Johansson: "Persistent cohomology and circular coordinates". In: Proceedingsof the 25th Annual Symposium on Computational Geometry. ACM, 2009 227-236.
15. W. Eberly, M. Giesbrecht, P. Giorgi, A. Storjohann, G. Villard: "Faster inversion and other black box matrix computations using efficient block projections". In: Proceedings of the 2007 international symposium on Symbolic and algebraic computation (ISSAC 2007). ACM, 2007 143-150.
16. H. Edelsbrunner, J. Harer: Computational Topology, An Introduction. American Mathematical Society, 2010.
17. H. Edelsbrunner, D. Letscher, A. Zomorodian: "Topological Persistence and Simplification". Discrete & Computational Geometry 28 (2002) 511-533. (Pubitemid 36161396)
18. W. Harvey, Y. Wang, R. Wenger: "A randomized O(m log m) time algorithm for computing Reeb graphs of arbitrary simplicial complexes". In: Proceedings of the 2010 Annual Symposium on Computational Geometry, 2010 267-276.
19. B. Hudson, G. Miller, S. Oudot, D. Sheehy: "Topological inference via meshing". In: Proceedings of the 2010 Annual Symposium on Computational Geometry. ACM, 2010 277-286.
20. O. H. Ibara, S. Moran, R. Hui: "A Generalization of the Fast LUP Matrix Decomposition Algorithm and Applications". Journal of Algorithms 3 (1982) 45-56.
21. E. Kaltofen, B. David Saunders: "On Wiedemann's method of solving sparse linear systems". In: H. Mattson, T. Mora, T. Rao (eds.) Applied Algebra, Algebraic Algorithms and Error-Correcting Codes, vol. 539, 29-38. Springer, 1991.
22. N. Milosavljević, D. Morozov, P. Škraba: "Zigzag Persistent Homology in Matrix Multiplication Time". In: Proceedings of the twenty-seventh Annual Symposium on Computational Geometry, 2011 .
23. D. Morozov: "Persistence Algorithm Takes Cubic Time in the Worst Case". In: BioGeometry News. Duke Computer Science, Durham, NC, 2005.
24. J. Munkres: Elements of algebraic topology. Westview Press, 1984.
25. A. Schönhage, V. Strassen: "Schnelle Multiplikation grosser Zahlen". Computing 7 (1971) 281-292. In German.
26. V. de Silva, R. Ghrist: "Coverage in Sensor Networks via Persistent Homology". Algebraic and Geometric Topology 7 (2007) 339-358.
27. H. Wagner, C. Chen, E. Vuçini: "Efficient Computation of Persistent Homology for Cubical Data". In: Workshop on Topology-based Methods in Data Analysis and Visualization, 2011 .
28. Y. Wang, P. Agarwal, P. Brown, H. Edelsbrunner, J. Rudolph: "Coarse and reliable geometric alignment for protein docking". In: Proceedings of the Pacific Symposium on Biocomputing 2005, 2005 65-75.
29. D. H. Wiedemann: "Solving sparse linear equations over finite fields". IEEE Transactions on Information Theory 32 (1986) 54-62.
30. A. Zomorodian: "The tidy set: a minimal simplicial set for computing homology of clique complexes". In: Proceedings of the 2010 Annual Symposium on Computational Geometry, 2010 257-266.
31. A. Zomorodian, G. Carlsson: "Computing persistent homology". Discrete and Computational Geometry 33 (2005) 249-274. (Pubitemid 40176437)
32. A. Zomorodian, G. Carlsson: "The Theory of Multidimensional Persistence". Discrete and Computational Geometry 42 (2009) 73-93.