Efficient Computation of Persistent Homology for Cubical Data
From MaRDI portal
Recommendations
- Computing persistent homology
- Computing persistent homology
- Efficient and robust persistent homology for measures
- Efficient and robust persistent homology for measures
- Clear and compress: computing persistent homology in chunks
- Persistent homology computation using combinatorial map simplification
- Singular persistent homology with geometrically parallelizable computation
- scientific article; zbMATH DE number 1390164
- Persistent intersection homology for the analysis of discrete data
Cites work
- An output-sensitive algorithm for persistent homology
- Computational homology
- Computational topology. An introduction
- Coreduction homology algorithm for inclusions and persistent homology
- Flexible isosurfaces: Simplifying and displaying scalar topology using the contour tree
- scientific article; zbMATH DE number 4102053 (Why is no real title available?)
- Introduction to algorithms.
- Simplizialzerlegungen von beschränkter Flachheit
- Stability of persistence diagrams
- Topological persistence and simplification
- What is known about unit cubes
- Zigzag persistent homology in matrix multiplication time
Cited in
(25)- Rigorous cubical approximation and persistent homology of continuous functions
- Persistent homology in \(\ell_\infty\) metric
- An efficient algorithm for 1-dimensional (Persistent) path homology
- Weighted fundamental group
- Improved approximate Rips filtrations with shifted integer lattices and cubical complexes
- 3D well-composed polyhedral complexes
- Object-oriented persistent homology
- Fast, simple and separable computation of Betti numbers on three-dimensional cubical complexes
- Morse theory for filtrations and efficient computation of persistent homology
- Computing Connection Matrices via Persistence-Like Reductions
- ToFU: topology functional units for deep learning
- Using persistent homology topological features to characterize medical images: case studies on lung and brain cancers
- Significance of modes in the torus by topological data analysis
- Keeping it sparse: computing persistent homology revisited
- Topological fingerprints for audio identification
- Slice, simplify and stitch: topology-preserving simplification scheme for massive voxel data
- Feature Detection and Hypothesis Testing for Extremely Noisy Nanoparticle Images using Topological Data Analysis
- Topological data analysis of monopole current networks in U(1) lattice gauge theory
- Detection of small holes by the scale-invariant robust density-aware distance (RDAD) filtration
- VHS: a package for homological simplification of voxelized plant root data for skeletonization
- Computing a connection matrix and persistence efficiently from a Morse decomposition
- Face recognition using life-centroid distance between featured persistence diagrams
- Generalized Morse theory of distance functions to surfaces for persistent homology
- The persistent Laplacian of non-branching complexes
- Persistent (co)homology in matrix multiplication time
This page was built for publication: Efficient Computation of Persistent Homology for Cubical Data
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2915452)
