skip to main content
10.1145/1542362.1542407acmconferencesArticle/Chapter ViewAbstractPublication PagessocgConference Proceedingsconference-collections
research-article

Proximity of persistence modules and their diagrams

Published:08 June 2009Publication History

ABSTRACT

Topological persistence has proven to be a key concept for the study of real-valued functions defined over topological spaces. Its validity relies on the fundamental property that the persistence diagrams of nearby functions are close. However, existing stability results are restricted to the case of continuous functions defined over triangulable spaces. In this paper, we present new stability results that do not suffer from the above restrictions. Furthermore, by working at an algebraic level directly, we make it possible to compare the persistence diagrams of functions defined over different spaces, thus enabling a variety of new applications of the concept of persistence. Along the way, we extend the definition of persistence diagram to a larger setting, introduce the notions of discretization of a persistence module and associated pixelization map, define a proximity measure between persistence modules, and show how to interpolate between persistence modules, thereby lending a more analytic character to this otherwise algebraic setting. We believe these new theoretical concepts and tools shed new light on the theory of persistence, in addition to simplifying proofs and enabling new applications.

References

  1. D. Attali, M. Glisse, S. Hornus, F. Lazarus, and D. Morozov. Persistence-sensitive simplification of functions on surfaces in linear time. Presented at the workshop TopoInVis'09.Google ScholarGoogle Scholar
  2. P. Bendich, D. Cohen-Steiner, H. Edelsbrunner, J. Harer, and D. Morozov. Inferring local homology from sampled stratified spaces. In Proc. 48th Annu. IEEE Sympos. Foundations of Computer Science, pages 536--546, 2007. Google ScholarGoogle ScholarDigital LibraryDigital Library
  3. S. Biasotti, A. Cerri, P. Frosini, D. Giorgi, and C. Landi. Multidimensional size functions for shape comparison. Journal of Mathematical Imaging and Vision, 32:161--179, 2008. Google ScholarGoogle ScholarDigital LibraryDigital Library
  4. F. Cagliari, B. Di Fabio, and M. Ferri. Title: One-dimensional reduction of multidimensional persistent homology. Research report, University of Bologna, February 2007. LANL arXiv:math/0702713v2 {Math.AT}.Google ScholarGoogle Scholar
  5. G. Carlsson and A. Zomorodian. The theory of multi-dimensional persistence. In Proc. 23rd ACM Sympos. on Comput. Geom., pages 184--193, 2007. Google ScholarGoogle ScholarDigital LibraryDigital Library
  6. G. Carlsson, A. Zomorodian, A. Collins, and L. Guibas. Persistence barcodes for shapes. Internat. Journal of Shape Modeling, 11:149--187, 2005.Google ScholarGoogle ScholarCross RefCross Ref
  7. F. Chazal and D. Cohen-Steiner. Geometric Inference. submitted as a book chapter, 2007.Google ScholarGoogle Scholar
  8. F. Chazal, D. Cohen-Steiner, M. Glisse, L. J. Guibas, and S. Y. Oudot. Proximity of persistence modules and their diagrams. Research Report 6568, INRIA, November 2008. http://hal.inria.fr/inria-00292566/en/.Google ScholarGoogle Scholar
  9. F. Chazal, L. J. Guibas, S. Y. Oudot, and P. Skraba. Analysis of scalar fields over point cloud data. In Proc. 19th ACM-SIAM Sympos. on Discrete Algorithms, pages 1021--1030, 2009. Google ScholarGoogle ScholarDigital LibraryDigital Library
  10. C. Chen and D. Freedman. Quantifying homology classes. In Proc. 25th Symposium on Theoretical Aspects of Computer Science (STACS), 2008.Google ScholarGoogle Scholar
  11. D. Cohen-Steiner and H. Edelsbrunner. Inequalities for the curvature of curves and surfaces. In Proc. 21st Sympos. on Comput. Geom., pages 272--277, 2005. Google ScholarGoogle ScholarDigital LibraryDigital Library
  12. D. Cohen-Steiner, H. Edelsbrunner, and J. Harer. Stability of persistence diagrams. In Proc. 21st ACM Sympos. Comput. Geom., pages 263--271, 2005. Google ScholarGoogle ScholarDigital LibraryDigital Library
  13. D. Cohen-Steiner, H. Edelsbrunner, and J. Harer. Extending persistence using Poincaré and Lefschetz duality. Found. Comput. Math., 2008. To appear. Google ScholarGoogle ScholarDigital LibraryDigital Library
  14. D. Cohen-Steiner, H. Edelsbrunner, and D. Morozov. Vines and vineyards by updating persistence in linear time. In Proc. 22nd Sympos. on Comput. Geom., pages 119--126, 2006. Google ScholarGoogle ScholarDigital LibraryDigital Library
  15. M. D'Amico, P. Frosini, and C. Landi. Using matching distance in size theory: a survey. Internat. Journal of Imaging Systems and Technology, 16(5):154--161, 2006.Google ScholarGoogle ScholarCross RefCross Ref
  16. M. D'Amico, P. Frosini, and C. Landi. Natural pseudo-distance and optimal matching between reduced size functions. Acta Appl. Math., 2008. Online: http://www.springerlink.com/content/cj84327h4n280144/.Google ScholarGoogle Scholar
  17. H. Edelsbrunner, D. Letscher, and A. Zomorodian. Topological persistence and simplification. Discrete Comput. Geom., 28:511--533, 2002.Google ScholarGoogle ScholarDigital LibraryDigital Library
  18. H. Edelsbrunner, D. Morozov, and V. Pascucci. Persistence-sensitive simplification of functions on 2-manifolds. In Proc. 22nd Sympos. on Comput. Geom., pages 127--134, 2006. Google ScholarGoogle ScholarDigital LibraryDigital Library
  19. A. Hatcher. Algebraic Topology. Cambridge University Press, 2001.Google ScholarGoogle Scholar
  20. D. Morozov. Homological Illusions of Persistence and Stability. Ph.d. dissertation, Department of Computer Science, Duke University, August 2008. Google ScholarGoogle ScholarDigital LibraryDigital Library
  21. A. Zomorodian and G. Carlsson. Computing persistent homology. Discrete Comput. Geom., 33(2):249--274, 2005. Google ScholarGoogle ScholarDigital LibraryDigital Library

Index Terms

  1. Proximity of persistence modules and their diagrams

    Recommendations

    Comments

    Login options

    Check if you have access through your login credentials or your institution to get full access on this article.

    Sign in
    • Published in

      cover image ACM Conferences
      SCG '09: Proceedings of the twenty-fifth annual symposium on Computational geometry
      June 2009
      426 pages
      ISBN:9781605585017
      DOI:10.1145/1542362

      Copyright © 2009 ACM

      Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

      Publisher

      Association for Computing Machinery

      New York, NY, United States

      Publication History

      • Published: 8 June 2009

      Permissions

      Request permissions about this article.

      Request Permissions

      Check for updates

      Qualifiers

      • research-article

      Acceptance Rates

      Overall Acceptance Rate625of1,685submissions,37%

    PDF Format

    View or Download as a PDF file.

    PDF

    eReader

    View online with eReader.

    eReader