相关论文: Bottleneck Profiles and Discrete Prokhorov Metrics…
Many topological data analysis (TDA) pipelines compute large collections of persistence diagrams, yet vectorizations and kernel methods discard the rank-induced implication relations among persistence intervals that are essential for…
Topological data analysis provides a multiscale description of the geometry and topology of quantitative data. The persistence landscape is a topological summary that can be easily combined with tools from statistics and machine learning.…
Persistence diagrams, combining geometry and topology for an effective shape description used in pattern recognition, have already proven to be an effective tool for shape representation with respect to a certainfiltering function.…
Topological data analysis (TDA) is a rising field in the intersection of mathematics, statistics, and computer science/data science. The cornerstone of TDA is persistent homology, which produces a summary of topological information called a…
Throughout this paper, a persistence diagram ${\cal P}$ is composed of a set $P$ of planar points (each corresponding to a topological feature) above the line $Y=X$, as well as the line $Y=X$ itself, i.e., ${\cal P}=P\cup\{(x,y)|y=x\}$.…
As graphical summaries for topological spaces and maps, Reeb graphs are common objects in the computer graphics or topological data analysis literature. Defining good metrics between these objects has become an important question for…
Interleaving distances are used widely in Topological Data Analysis (TDA) as a tool for comparing topological signatures of datasets. The theory of interleaving distances has been extended through various category-theoretic constructions,…
We introduce a construction and an algorithm, both based on Topological Data Analysis (TDA), to tackle the problem of the isomorphism check of Orthogonal Arrays (OAs). Specifically, we associate to any binary OA a persistence diagram, one…
Topological data analysis (TDA) delivers invaluable and complementary information on the intrinsic properties of data inaccessible to conventional methods. However, high computational costs remain the primary roadblock hindering the…
Appropriately representing elements in a database so that queries may be accurately matched is a central task in information retrieval; recently, this has been achieved by embedding the graphical structure of the database into a manifold in…
Persistent homology analysis provides means to capture the connectivity structure of data sets in various dimensions. On the mathematical level, by defining a metric between the objects that persistence attaches to data sets, we can…
Persistence diagrams are common objects in the field of Topological Data Analysis. They are topological summaries that capture both topological and geometric structure within data. Recently there has been a surge of interest in developing…
Topological data analysis offers a rich source of valuable information to study vision problems. Yet, so far we lack a theoretically sound connection to popular kernel-based learning techniques, such as kernel SVMs or kernel PCA. In this…
We prove that the space of persistence diagrams on $n$ points (with the bottleneck or a Wasserstein distance) coarsely embeds into Hilbert space by showing it is of asymptotic dimension $2n$. Such an embedding enables utilisation of Hilbert…
Persistent homology is a tool from Topological Data Analysis (TDA) used to summarize the topology underlying data. It can be conveniently represented through persistence diagrams. Observing a noisy signal, common strategies to infer its…
Barcodes form a complete set of invariants for interval decomposable persistence modules and are an important summary in topological data analysis. The set of barcodes is equipped with a canonical one-parameter family of metrics, the…
Computational difficulty of quadratic matching and the Gromov-Wasserstein distance has led to various approximation and relaxation schemes. One of such methods, relying on the notion of distance profiles, has been widely used in practice,…
We prove that persistence diagrams with the p-Wasserstein distance form the universal p-subadditive commutative monoid on an underlying metric space with a distinguished subset. This result applies to persistence diagrams, barcodes, and to…
Topological data analysis (TDA) is an emerging mathematical concept for characterizing shapes in complex data. In TDA, persistence diagrams are widely recognized as a useful descriptor of data, and can distinguish robust and noisy…
Persistent homology has become an important tool for extracting geometric and topological features from data, whose multi-scale features are summarized in a persistence diagram. From a statistical perspective, however, persistence diagrams…