Skip to main content

Persistent Homology under Non-uniform Error

  • Conference paper
Mathematical Foundations of Computer Science 2010 (MFCS 2010)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 6281))

  • 931 Accesses

Abstract

Using ideas from persistent homology, the robustness of a level set of a real-valued function is defined in terms of the magnitude of the perturbation necessary to kill the classes. Prior work has shown that the homology and robustness information can be read off the extended persistence diagram of the function. This paper extends these results to a non-uniform error model in which perturbations vary in their magnitude across the domain.

This research is partially supported by the Defense Advanced Research Projects Agency (DARPA), under grants HR0011-05-1-0057 and HR0011-09-0065, as well as the National Science Foundation (NSF), under grant DBI-0820624.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Bendich, P., Edelsbrunner, H., Morozov, D., Patel, A.: Robustness of level and interlevel sets. Manuscript, IST Austria, Klosterneuburg, Austria (2010)

    Google Scholar 

  2. Carlsson, G., de Silva, V.: Zigzag persistence. Found. Comput. Math. (2010)

    Google Scholar 

  3. Carlsson, G., Ishkhanov, T., de Silva, V., Zomorodian, A.: On the local behavior of spaces of local images. Internat. J. Comput. Vision 76, 1–12 (2008)

    Article  Google Scholar 

  4. Cerri, A., Ferri, M., Giorgi, D.: Retrieval of trademark images by means of size functions. Graphical Models 68, 451–471 (2006)

    Article  Google Scholar 

  5. Chung, M.K., Bubenik, P., Kim, P.T.: Persistence diagrams of cortical surface data. In: Prince, J.L., Pham, D.L., Myers, K.J. (eds.) Information Processing in Medical Imaging. LNCS, vol. 5636, pp. 386–397. Springer, Heidelberg (2009)

    Chapter  Google Scholar 

  6. Cohen-Steiner, D., Edelsbrunner, H., Harer, J.: Stability of persistence diagrams. Discrete Comput. Geom. 28, 511–533 (2007)

    MathSciNet  Google Scholar 

  7. Cohen-Steiner, D., Edelsbrunner, H., Harer, J.: Extending persistence using Poincaré and Lefschetz duality. Found. Comput. Math. 9, 79–103 (2009)

    Article  MATH  MathSciNet  Google Scholar 

  8. de Silva, V., Ghrist, R.: Coverage in sensor networks via persistent homology. Alg. Geom. Topology 7, 339–358 (2007)

    Article  MATH  Google Scholar 

  9. Dequèant, M.-L., Ahnert, S., Edelsbrunner, H., Fink, T.M.A., Glynn, E.F., Hattem, G., Kudlicki, A., Mileyko, Y., Morton, J., Mushegian, A.R., Pachter, L., Rowicka, M., Shiu, A., Sturmfels, B., Pourquié, O.: Comparison of pattern detection methods in microarray time series of the segmentation clock. PLoS ONE 3, e2856 (2008), doi:10.1371/journal.pone.0002856

    Article  Google Scholar 

  10. Edelsbrunner, H., Harer, J.L.: Computational Topology. An Introduction. Amer. Math. Soc. (2009)

    Google Scholar 

  11. Edelsbrunner, H., Morozov, D., Patel, A.: Quantifying transversality by measuring the robustness of intersections. Manuscript, Dept. Comput. Sci., Duke Univ., Durham, North Carolina (2009)

    Google Scholar 

  12. Hatcher, A.: Algebraic Topology. Cambridge Univ. Press, Cambridge (2002)

    MATH  Google Scholar 

  13. Munkres, J.R.: Elements of Algebraic Topology. Perseus, Cambridge, Massachusetts (1984)

    Google Scholar 

  14. Thron, W.J.: Topological Structures. Holt, Rinehart & Winston, New York (1966)

    MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2010 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Bendich, P., Edelsbrunner, H., Kerber, M., Patel, A. (2010). Persistent Homology under Non-uniform Error. In: Hliněný, P., Kučera, A. (eds) Mathematical Foundations of Computer Science 2010. MFCS 2010. Lecture Notes in Computer Science, vol 6281. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-15155-2_2

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-15155-2_2

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-15154-5

  • Online ISBN: 978-3-642-15155-2

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics