Abstract
The theory of multidimensional persistence captures the topology of a multifiltration – a multiparameter family of increasing spaces. Multifiltrations arise naturally in the topological analysis of scientific data. In this paper, we give a polynomial time algorithm for computing multidimensional persistence.
The authors were partially supported by the following grants:G. C. by NSF DMS-0354543; A. Z. by DARPA HR 0011-06-1-0038, ONR N 00014-08-1-0908, and NSF CCF-0845716; all by DARPA HR 0011-05-1-0007.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Carlsson, G., Zomorodian, A.: The theory of multidimensional persistence. Discrete & Computational Geometry 42(1), 71–93 (2009)
Gromov, M.: Hyperbolic groups. In: Gersten, S. (ed.) Essays in Group Theory, pp. 75–263. Springer, New York (1987)
de Silva, V., Carlsson, G.: Topological estimation using witness complexes. In: Proc. Symposium on Point-Based Graphics, pp. 157–166 (2004)
Zomorodian, A., Carlsson, G.: Computing persistent homology. Discrete & Computational Geometry 33(2), 249–274 (2005)
Collins, A., Zomorodian, A., Carlsson, G., Guibas, L.: A barcode shape descriptor for curve point cloud data. Computers and Graphics 28, 881–894 (2004)
Gyulassy, A., Natarajan, V., Pascucci, V., Bremer, P.T., Hamann, B.: Topology-based simplification for feature extraction from 3D scalar fields. In: Proc. IEEE Visualization, pp. 275–280 (2005)
de Silva, V., Ghrist, R., Muhammad, A.: Blind swarms for coverage in 2-D. In: Proceedings of Robotics: Science and Systems (2005), http://www.roboticsproceedings.org/rss01/
Singh, G., Memoli, F., Ishkhanov, T., Sapiro, G., Carlsson, G., Ringach, D.L.: Topological analysis of population activity in visual cortex. Journal of Vision 8(8), 1–18 (2008)
Carlsson, G., Ishkhanov, T., de Silva, V., Zomorodian, A.: On the local behavior of spaces of natural images. International Journal of Computer Vision 76(1), 1–12 (2008)
Frosini, P., Mulazzani, M.: Size homotopy groups for computation of natural size distances. Bull. Belg. Math. Soc. Simon Stevin 6(3), 455–464 (1999)
Cohen-Steiner, D., Edelsbrunner, H., Morozov, D.: Vines and vineyards by updating persistence in linear time. In: Proc. ACM Symposium on Computational Geometry, pp. 119–126 (2006)
Carlsson, G., Singh, G., Zomorodian, A.: Computing multidimensional persistence, http://arxiv.org/abs/0907.2423
Cox, D.A., Little, J., O’Shea, D.: Using algebraic geometry, 2nd edn. Graduate Texts in Mathematics, vol. 185. Springer, New York (2005)
Mayr, E.W.: Some complexity results for polynomial ideals. Journal of Complexity 13(3), 303–325 (1997)
von zur Gathen, J., Gerhard, J.: Modern Computer Algebra, 2nd edn. Cambridge University Press, Cambridge (2003)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2009 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Carlsson, G., Singh, G., Zomorodian, A. (2009). Computing Multidimensional Persistence. In: Dong, Y., Du, DZ., Ibarra, O. (eds) Algorithms and Computation. ISAAC 2009. Lecture Notes in Computer Science, vol 5878. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-10631-6_74
Download citation
DOI: https://doi.org/10.1007/978-3-642-10631-6_74
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-10630-9
Online ISBN: 978-3-642-10631-6
eBook Packages: Computer ScienceComputer Science (R0)