@article{bendich_computing_2010,
abstract = {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 classes in its level and interlevel sets, that is, the amount of perturbation needed to destroy these classes. The structure of the homology classes and their robustness, over all level and interlevel sets, can be visualized by a triangular diagram of dots obtained by computing the extended persistence of the function. We give a fast hierarchical algorithm using the dual complexes of oct-tree approximations of the function. In addition, we show that for balanced oct-trees, the dual complexes are geometrically realized in R3 and can thus be used to construct level and interlevel sets. We apply these tools to study 3-dimensional images of plant root systems.},
author = {Bendich, P. and Edelsbrunner, H. and Kerber, M.},
date = {2010-10-28},
doi = {10.1109/TVCG.2010.139},
issn = {1941-0506},
journaltitle = {{IEEE} Transactions on Visualization and Computer Graphics},
keywords = {1 - Botany, 1 - Image analysis, 1 - Image processing, 1 - Plant roots, 1 - Root system, 2 - Persistence diagrams, 2 - Persistent homology, 3 - Voxel arrays},
note = {Conference Name: {IEEE} Transactions on Visualization and Computer Graphics},
number = {6},
pages = {1251--1260},
title = {Computing Robustness and Persistence for Images},
volume = {16}
}