Skip to main content

Persistent homology under non-uniform error

Publication ,  Conference
Bendich, P; Edelsbrunner, H; Kerber, M; Patel, A
Published in: Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
November 22, 2010

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. © 2010 Springer-Verlag.

Duke Scholars

Published In

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

DOI

EISSN

1611-3349

ISSN

0302-9743

Publication Date

November 22, 2010

Volume

6281 LNCS

Start / End Page

12 / 23

Related Subject Headings

  • Artificial Intelligence & Image Processing
  • 46 Information and computing sciences
 

Citation

APA
Chicago
ICMJE
MLA
NLM
Bendich, P., Edelsbrunner, H., Kerber, M., & Patel, A. (2010). Persistent homology under non-uniform error. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 6281 LNCS, pp. 12–23). https://doi.org/10.1007/978-3-642-15155-2_2
Bendich, P., H. Edelsbrunner, M. Kerber, and A. Patel. “Persistent homology under non-uniform error.” In Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 6281 LNCS:12–23, 2010. https://doi.org/10.1007/978-3-642-15155-2_2.
Bendich P, Edelsbrunner H, Kerber M, Patel A. Persistent homology under non-uniform error. In: Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 2010. p. 12–23.
Bendich, P., et al. “Persistent homology under non-uniform error.” Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 6281 LNCS, 2010, pp. 12–23. Scopus, doi:10.1007/978-3-642-15155-2_2.
Bendich P, Edelsbrunner H, Kerber M, Patel A. Persistent homology under non-uniform error. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 2010. p. 12–23.

Published In

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

DOI

EISSN

1611-3349

ISSN

0302-9743

Publication Date

November 22, 2010

Volume

6281 LNCS

Start / End Page

12 / 23

Related Subject Headings

  • Artificial Intelligence & Image Processing
  • 46 Information and computing sciences