3 research outputs found

    Polynomial Representation for Persistence Diagram

    Full text link

    Persistence codebooks for topological data analysis

    Get PDF
    Persistent homology is a rigorous mathematical theory that provides a robust descriptor of data in the form of persistence diagrams (PDs) which are 2D multisets of points. Their variable size makes them, however, difficult to combine with typical machine learning workflows. In this paper we introduce persistence codebooks, a novel expressive and discriminative fixed-size vectorized representation of PDs that adapts to the inherent sparsity of persistence diagrams. To this end, we adapt bag-of-words, vectors of locally aggregated descriptors and Fischer vectors for the quantization of PDs. Persistence codebooks represent PDs in a convenient way for machine learning and statistical analysis and have a number of favorable practical and theoretical properties including 1-Wasserstein stability. We evaluate the presented representations on several heterogeneous datasets and show their (high) discriminative power. Our approach yields comparable-and partly even higher-performance in much less time than alternative approaches

    Wasserstein Stability for Persistence Diagrams

    Full text link
    The stability of persistence diagrams is among the most important results in applied and computational topology. Most results in the literature phrase stability in terms of the bottleneck distance between diagrams and the ∞\infty-norm of perturbations. This has two main implications: it makes the space of persistence diagrams rather pathological and it is often provides very pessimistic bounds with respect to outliers. In this paper, we provide new stability results with respect to the pp-Wasserstein distance between persistence diagrams. This includes an elementary proof for the setting of functions on sufficiently finite spaces in terms of the pp-norm of the perturbations, along with an algebraic framework for pp-Wasserstein distance which extends the results to wider class of modules. We also provide apply the results to a wide range of applications in topological data analysis (TDA) including topological summaries, persistence transforms and the special but important case of Vietoris-Rips complexes
    corecore