Polynomial Representation for Persistence Diagram

Persistence diagram (PD) has been considered as a compact descriptor for topological data analysis (TDA). Unfortunately, PD cannot be directly used in machine learning methods since it is a multiset of points. Recent efforts have been devoted to transforming PDs into vectors to accommodate machine learning methods. However, they share one common shortcoming: the mapping of PDs to a feature representation depends on a pre-defined polynomial. To address this limitation, this paper proposes an algebraic representation for PDs, i.e., polynomial representation. In this work, we discover a set of general polynomials that vanish on vectorized PDs and extract the task-adapted feature representation from these polynomials. We also prove two attractive properties of the proposed polynomial representation, i.e., stability and linear separability. Experiments also show that our method compares favorably with state-of-the-art TDA methods.

[1]  Steve Oudot,et al.  Sliced Wasserstein Kernel for Persistence Diagrams , 2017, ICML.

[2]  Ulrich Bauer,et al.  Distributed Computation of Persistent Homology , 2014, ALENEX.

[3]  Sebastian Pokutta,et al.  Approximate computation of zero-dimensional polynomial ideals , 2009, J. Symb. Comput..

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

[5]  Karthikeyan Natesan Ramamurthy,et al.  A Riemannian Framework for Statistical Analysis of Topological Persistence Diagrams , 2016, 2016 IEEE Conference on Computer Vision and Pattern Recognition Workshops (CVPRW).

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

[7]  Frédéric Chazal,et al.  Convergence rates for persistence diagram estimation in topological data analysis , 2014, J. Mach. Learn. Res..

[8]  Lijun Yin,et al.  Multi-scale Topological Features for Hand Posture Representation and Analysis , 2013, 2013 IEEE International Conference on Computer Vision.

[9]  Tamal K. Dey,et al.  Improved Image Classification using Topological Persistence , 2017, VMV.

[10]  R. Larsen Lanczos Bidiagonalization With Partial Reorthogonalization , 1998 .

[11]  Yi-Hsuan Yang,et al.  Applying Topological Persistence in Convolutional Neural Network for Music Audio Signals , 2016, ArXiv.

[12]  Chih-Jen Lin,et al.  LIBSVM: A library for support vector machines , 2011, TIST.

[13]  Guo-Wei Wei,et al.  A topological approach for protein classification , 2015, 1510.00953.

[14]  Steve Oudot,et al.  Eurographics Symposium on Geometry Processing 2015 Stable Topological Signatures for Points on 3d Shapes , 2022 .

[15]  David Cohen-Steiner,et al.  Stability of Persistence Diagrams , 2005, Discret. Comput. Geom..

[16]  Joe W. Harris,et al.  Algebraic Geometry: A First Course , 1995 .

[17]  L. Wasserman Topological Data Analysis , 2016, 1609.08227.

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

[19]  Massimo Ferri,et al.  Persistent Topology for Natural Data Analysis - A Survey , 2017, BIRS-IMLKE.

[20]  Kelin Xia,et al.  Persistent homology analysis of protein structure, flexibility, and folding , 2014, International journal for numerical methods in biomedical engineering.

[21]  Jianyi Yang,et al.  Improving taxonomy‐based protein fold recognition by using global and local features , 2011, Proteins.

[22]  Q. Zou,et al.  Recent Progress in Machine Learning-Based Methods for Protein Fold Recognition , 2016, International journal of molecular sciences.

[23]  Andreas Uhl,et al.  Deep Learning with Topological Signatures , 2017, NIPS.

[24]  Roi Livni,et al.  Vanishing Component Analysis , 2013, ICML.

[25]  Matti Pietikäinen,et al.  Outex - new framework for empirical evaluation of texture analysis algorithms , 2002, Object recognition supported by user interaction for service robots.

[26]  S. Rachev,et al.  Mass transportation problems , 1998 .

[27]  Shuhong Gao,et al.  Computing Gröbner Bases for Vanishing Ideals of Finite Sets of Points , 2006, AAECC.

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

[29]  Steve Oudot,et al.  Persistence-Based Pooling for Shape Pose Recognition , 2016, CTIC.

[30]  Danica Kragic,et al.  Persistent Homology for Learning Densities with Bounded Support , 2012, NIPS.

[31]  Jean-Louis Giavitto,et al.  Computation and Visualization of Musical Structures in Chord-Based Simplicial Complexes , 2013, MCM.

[32]  Frédéric Chazal,et al.  Stochastic Convergence of Persistence Landscapes and Silhouettes , 2013, J. Comput. Geom..

[33]  R. Ho Algebraic Topology , 2022 .

[34]  Frédéric Chazal,et al.  Robust Topological Inference: Distance To a Measure and Kernel Distance , 2014, J. Mach. Learn. Res..

[35]  Zhenhua Guo,et al.  A Completed Modeling of Local Binary Pattern Operator for Texture Classification , 2010, IEEE Transactions on Image Processing.

[36]  P. Cochat,et al.  Et al , 2008, Archives de pediatrie : organe officiel de la Societe francaise de pediatrie.

[37]  Nathan Halko,et al.  Finding Structure with Randomness: Probabilistic Algorithms for Constructing Approximate Matrix Decompositions , 2009, SIAM Rev..

[38]  Maks Ovsjanikov,et al.  Persistence-Based Structural Recognition , 2014, 2014 IEEE Conference on Computer Vision and Pattern Recognition.

[39]  Xiaojin Zhu,et al.  Persistent Homology: An Introduction and a New Text Representation for Natural Language Processing , 2013, IJCAI.

[40]  Massimo Ferri,et al.  Comparing Persistence Diagrams Through Complex Vectors , 2015, ICIAP.