Sciweavers

2032 search results - page 1 / 407
» Computing Robustness and Persistence for Images
Sort
View
TVCG
2010
162views more  TVCG 2010»
13 years 2 months ago
Computing Robustness and Persistence for Images
—We are interested in 3-dimensional images given as arrays of voxels with intensity values. Extending these values to a continuous function, we study the robustness of homology c...
Paul Bendich, Herbert Edelsbrunner, Michael Kerber
ESA
2010
Springer
248views Algorithms» more  ESA 2010»
13 years 5 months ago
The Robustness of Level Sets
We define the robustness of a level set homology class of a function f : X R as the magnitude of a perturbation necessary to kill the class. Casting this notion into a group theor...
Paul Bendich, Herbert Edelsbrunner, Dmitriy Morozo...
CORR
2011
Springer
162views Education» more  CORR 2011»
12 years 8 months ago
Homology and Robustness of Level and Interlevel Sets
Given a function f : X → R on a topological space, we consider the preimages of intervals and their homology groups and show how to read the ranks of these groups from the exten...
Paul Bendich, Herbert Edelsbrunner, Dmitriy Morozo...
MFCS
2010
Springer
13 years 2 months ago
Persistent Homology under Non-uniform Error
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 classe...
Paul Bendich, Herbert Edelsbrunner, Michael Kerber...
3DPH
2009
145views Healthcare» more  3DPH 2009»
13 years 2 months ago
The Persistent Morse Complex Segmentation of a 3-Manifold
We describe an algorithm for segmenting three-dimensional medical imaging data modeled as a continuous function on a 3-manifold. It is related to watershed algorithms developed in ...
Herbert Edelsbrunner, John Harer