Fast computation of persistent homology representatives with involuted persistent homology
نویسندگان
چکیده
Persistent homology is typically computed through persistent cohomology. While this generally improves the running time significantly, it does not facilitate extraction of representatives. The mentioned representatives are geometric manifestations corresponding holes and often carry desirable information.We propose a new method using In summary, we first compute cohomology use obtained information to significantly improve direct computations. This algorithm applied Rips filtrations computes much faster than standard methods.
منابع مشابه
Distributed Computation of Persistent Homology
Persistent homology is a popular and powerful tool for capturing topological features of data. Advances in algorithms for computing persistent homology have reduced the computation time drastically – as long as the algorithm does not exhaust the available memory. Following up on a recently presented parallel method for persistence computation on shared memory systems, we demonstrate that a simp...
متن کاملInterleaved computation for persistent homology
We describe an approach to bounded-memory computation of persistent homology and betti barcodes, in which a computational state is maintained with updates introducing new edges to the underlying neighbourhood graph and percolating the resulting changes into the simplex stream feeding the persistence algorithm. We further discuss the memory consumption and resulting speed and complexity behaviou...
متن کاملPersistent Homology Computation with a Twist
The persistence diagram of a filtered simplicial complex is usually computed by reducing the boundary matrix of the complex. We introduce a simple optimization technique: by processing the simplices of the complex in decreasing dimension, we can “kill” columns (i.e., set them to zero) without reducing them. This technique completely avoids reduction on roughly half of the columns. We demonstrat...
متن کاملSingular Persistent Homology with Effective Concurrent Computation
Persistent homology is a popular tool in Topological Data Analysis. It provides numerical characteristics which reflect global geometric properties of data sets. In order to be useful in practice, for example for feature generation in machine learning, it needs to be effectively computable. Classical homology is a computable topological invariant because of the Mayer-Vietoris exact and spectral...
متن کاملCharacterizing Vision with Persistent Homology
The neural code is one of the largest and most perplexing frontiers in modern science. There is an increasing body of evidence that suggests that the brain uses a small set of the same neural computations in different configurations to create the neural responses we see in different functional areas of the brain [1]. The primary visual cortex (V1) is commonly held as an exemplar for general neu...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Foundations of data science
سال: 2023
ISSN: ['2639-8001']
DOI: https://doi.org/10.3934/fods.2023006