CSDL Home IEEE Transactions on Visualization & Computer Graphics 2010 vol.16 Issue No.06 - November/December
Issue No.06 - November/December (2010 vol.16)
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/TVCG.2010.139
We are interested in 3-dimensional images given as arrays of voxels with intensity values. Extending these values to acontinuous function, we study the robustness of homology classes in its level and interlevel sets, that is, the amount of perturbationneeded to destroy these classes. The structure of the homology classes and their robustness, over all level and interlevel sets, can bevisualized by a triangular diagram of dots obtained by computing the extended persistence of the function. We give a fast hierarchicalalgorithm using the dual complexes of oct-tree approximations of the function. In addition, we show that for balanced oct-trees, thedual complexes are geometrically realized in $R^3$ and can thus be used to construct level and interlevel sets. We apply these tools tostudy 3-dimensional images of plant root systems.
voxel arrays, oct-trees, persistent homology, persistence diagrams, level sets, robustness, approximations, plant roots
Paul Bendich, Herbert Edelsbrunner, Michael Kerber, "Computing Robustness and Persistence for Images", IEEE Transactions on Visualization & Computer Graphics, vol.16, no. 6, pp. 1251-1260, November/December 2010, doi:10.1109/TVCG.2010.139