The robustness of level sets

P. Bendich, H. Edelsbrunner, D. Morozov, A. Patel, in:, Springer, 2010, pp. 1–10.

Download
No fulltext has been uploaded. References only!

Conference Paper | Published | English
Department
Series Title
LNCS
Abstract
We define the robustness of a level set homology class of a function f:XR as the magnitude of a perturbation necessary to kill the class. Casting this notion into a group theoretic framework, we compute the robustness for each class, using a connection to extended persistent homology. The special case X=R3 has ramifications in medical imaging and scientific visualization.
Publishing Year
Date Published
2010-09-01
Volume
6346
Page
1 - 10
Conference
ESA: European Symposium on Algorithms
Conference Location
Liverpool, UK
Conference Date
2010-09-06 – 2010-09-08
IST-REx-ID

Cite this

Bendich P, Edelsbrunner H, Morozov D, Patel A. The robustness of level sets. In: Vol 6346. Springer; 2010:1-10. doi:10.1007/978-3-642-15775-2_1
Bendich, P., Edelsbrunner, H., Morozov, D., & Patel, A. (2010). The robustness of level sets (Vol. 6346, pp. 1–10). Presented at the ESA: European Symposium on Algorithms, Liverpool, UK: Springer. https://doi.org/10.1007/978-3-642-15775-2_1
Bendich, Paul, Herbert Edelsbrunner, Dmitriy Morozov, and Amit Patel. “The Robustness of Level Sets,” 6346:1–10. Springer, 2010. https://doi.org/10.1007/978-3-642-15775-2_1.
P. Bendich, H. Edelsbrunner, D. Morozov, and A. Patel, “The robustness of level sets,” presented at the ESA: European Symposium on Algorithms, Liverpool, UK, 2010, vol. 6346, pp. 1–10.
Bendich P, Edelsbrunner H, Morozov D, Patel A. 2010. The robustness of level sets. ESA: European Symposium on Algorithms, LNCS, vol. 6346. 1–10.
Bendich, Paul, et al. The Robustness of Level Sets. Vol. 6346, Springer, 2010, pp. 1–10, doi:10.1007/978-3-642-15775-2_1.

Export

Marked Publications

Open Data IST Research Explorer

Search this title in

Google Scholar