A Riemannian Framework for Statistical Analysis of Topological Persistence Diagrams

Topological data analysis is becoming a popular way to study high dimensional feature spaces without any contextual clues or assumptions. This paper concerns itself with one popular topological feature, which is the number of d–dimensional holes in the dataset, also known as the Betti–d number. The persistence of the Betti numbers over various scales is encoded into a persistence diagram (PD), which indicates the birth and death times of these holes as scale varies. A common way to compare PDs is by a pointto-point matching, which is given by the n-Wasserstein metric. However, a big drawback of this approach is the need to solve correspondence between points before computing the distance, for n points, the complexity grows according to O(n3). Instead, we propose to use an entirely new framework built on Riemannian geometry, that models PDs as 2D probability density functions that are represented in the square-root framework on a Hilbert Sphere. The resulting space is much more intuitive with closed form expressions for common operations. The distance metric is 1) correspondence-free and also 2) independent of the number of points in the dataset. The complexity of computing distance between PDs now grows according to O(K2), for a K K discretization of [0, 1]2. This also enables the use of existing machinery in differential geometry towards statistical analysis of PDs such as computing the mean, geodesics, classification etc. We report competitive results with the Wasserstein metric, at a much lower computational load, indicating the favorable properties of the proposed approach.

[1]  Sivaraman Balakrishnan,et al.  Confidence sets for persistence diagrams , 2013, The Annals of Statistics.

[2]  Sayan Mukherjee,et al.  Fréchet Means for Distributions of Persistence Diagrams , 2012, Discrete & Computational Geometry.

[3]  Henry Adams,et al.  Persistence Images: A Stable Vector Representation of Persistent Homology , 2015, J. Mach. Learn. Res..

[4]  Ulrich Bauer,et al.  A stable multi-scale kernel for topological machine learning , 2014, 2015 IEEE Conference on Computer Vision and Pattern Recognition (CVPR).

[5]  Dimitri P. Bertsekas,et al.  A new algorithm for the assignment problem , 1981, Math. Program..

[6]  P. Thomas Fletcher,et al.  Principal geodesic analysis for the study of nonlinear statistics of shape , 2004, IEEE Transactions on Medical Imaging.

[7]  Afra Zomorodian,et al.  Fast construction of the Vietoris-Rips complex , 2010, Comput. Graph..

[8]  Herbert Edelsbrunner,et al.  Topological Persistence and Simplification , 2000, Proceedings 41st Annual Symposium on Foundations of Computer Science.

[9]  Peter Bubenik,et al.  Statistical topological data analysis using persistence landscapes , 2012, J. Mach. Learn. Res..

[10]  Pavan K. Turaga,et al.  Shape Distributions of Nonlinear Dynamical Systems for Video-Based Inference , 2016, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[11]  Kenji Fukumizu,et al.  Persistence weighted Gaussian kernel for topological data analysis , 2016, ICML.

[12]  Rama Chellappa,et al.  Rate-Invariant Recognition of Humans and Their Activities , 2009, IEEE Transactions on Image Processing.

[13]  S. Wolf,et al.  Assessing Wolf Motor Function Test as Outcome Measure for Research in Patients After Stroke , 2001, Stroke.

[14]  Mubarak Shah,et al.  Chaotic Invariants for Human Action Recognition , 2007, 2007 IEEE 11th International Conference on Computer Vision.

[15]  M. Rosenstein,et al.  A practical method for calculating largest Lyapunov exponents from small data sets , 1993 .

[16]  Mehmet Emre Çek,et al.  Analysis of observed chaotic data , 2004 .

[17]  Sayan Mukherjee,et al.  Probabilistic Fréchet Means and Statistics on Vineyards , 2013, ArXiv.

[18]  H. Karcher,et al.  How to conjugateC1-close group actions , 1973 .

[19]  Jiping He,et al.  A Computational Framework for Quantitative Evaluation of Movement during Rehabilitation , 2011 .

[20]  Anuj Srivastava,et al.  Riemannian Analysis of Probability Density Functions with Applications in Vision , 2007, 2007 IEEE Conference on Computer Vision and Pattern Recognition.

[21]  David Cohen-Steiner,et al.  Lipschitz Functions Have Lp-Stable Persistence , 2010, Found. Comput. Math..

[22]  Karthikeyan Natesan Ramamurthy,et al.  Persistent homology of attractors for action recognition , 2016, 2016 IEEE International Conference on Image Processing (ICIP).

[23]  Sayan Mukherjee,et al.  Probabilistic Fréchet Means and Statistics on Vineyards , 2013, ArXiv.

[24]  Dmitriy Morozov,et al.  Geometry Helps to Compare Persistence Diagrams , 2016, ALENEX.

[25]  S. Mukherjee,et al.  Probability measures on the space of persistence diagrams , 2011 .

[26]  F. Takens Detecting strange attractors in turbulence , 1981 .