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 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.

[1]  P ? ? ? ? ? ? ? % ? ? ? ? , 1991 .

[2]  Valerio Pascucci,et al.  Contour trees and small seed sets for isosurface traversal , 1997, SCG '97.

[3]  Moo K. Chung,et al.  Persistence Diagrams of Cortical Surface Data , 2009, IPMI.

[4]  Herbert Edelsbrunner,et al.  Computational Topology - an Introduction , 2009 .

[5]  Daniela Giorgi,et al.  Retrieval of trademark images by means of size functions , 2006, Graph. Model..

[6]  Herbert Edelsbrunner,et al.  Coarse and Reliable Geometric Alignment for Protein Docking , 2005, Pacific Symposium on Biocomputing.

[7]  Valerio Pascucci,et al.  The contour spectrum , 1997, Proceedings. Visualization '97 (Cat. No. 97CB36155).

[8]  Andrew Gillette,et al.  Topology Based Selection and Curation of Level Sets , 2009, Topology-Based Methods in Visualization II.

[9]  Valerio Pascucci,et al.  Robust on-line computation of Reeb graphs: simplicity and speed , 2007, ACM Trans. Graph..

[10]  Herbert Edelsbrunner,et al.  Homology and Robustness of Level and Interlevel Sets , 2011, ArXiv.

[11]  Vin de Silva,et al.  Coverage in sensor networks via persistent homology , 2007 .

[12]  Afra Zomorodian,et al.  Computational topology , 2010 .

[13]  Khadija Iqbal,et al.  An introduction , 1996, Neurobiology of Aging.

[14]  David Eppstein,et al.  Provably good mesh generation , 1990, Proceedings [1990] 31st Annual Symposium on Foundations of Computer Science.

[15]  Herbert Edelsbrunner,et al.  Quantifying Transversality by Measuring the Robustness of Intersections , 2009, Found. Comput. Math..

[16]  Hong Yi,et al.  A survey of the marching cubes algorithm , 2006, Comput. Graph..

[17]  James R. Munkres,et al.  Elements of algebraic topology , 1984 .

[18]  Vin de Silva,et al.  On the Local Behavior of Spaces of Natural Images , 2007, International Journal of Computer Vision.

[19]  Bernd Hamann,et al.  A topological approach to simplification of three-dimensional scalar functions , 2006, IEEE Transactions on Visualization and Computer Graphics.

[20]  Milan Sonka,et al.  Image Processing, Analysis and Machine Vision , 1993, Springer US.

[21]  Earl F. Glynn,et al.  Comparison of Pattern Detection Methods in Microarray Time Series of the Segmentation Clock , 2008, PloS one.

[22]  Hanan Samet,et al.  The Design and Analysis of Spatial Data Structures , 1989 .