Move schedules: fast persistence computations in coarse dynamic settings

DOI10.1007/S41468-023-00156-3MaRDI QIDQ6589170zbMATH OpenWikidataFDO

Authors Matthew Piekenbrock, Jose A. Perea

Publication date 19 August 2024

Published in Journal of Applied and Computational Topology (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

zbMATH Keywords

persistent homologycomputational topologytopological data analysis

Mathematics Subject Classification ID

Computational aspects of data analysis and big data (68T09) Persistent homology and applications, topological data analysis (55N31) Topological data analysis (62R40)

Recommendations

• Keeping it sparse: computing persistent homology revisited
• An output-sensitive algorithm for persistent homology
• Morse theory for filtrations and efficient computation of persistent homology
• An output-sensitive algorithm for persistent homology
• Zigzag persistent homology in matrix multiplication time

Cites work

• scientific article; zbMATH DE number 5506200 (Why is no real title available?)
• scientific article; zbMATH DE number 3584785 (Why is no real title available?)
• A Klein-bottle-based dictionary for texture representation
• A linear space algorithm for the LCS problem
• An efficient approach for the rank aggregation problem
• An efficient representation for filtrations of simplicial complexes
• An incremental algorithm for Betti numbers of simplicial complexes on the 3-sphere
• An output-sensitive algorithm for persistent homology
• Computing persistent homology
• Dualities in persistent (co)homology
• Dynamic graph connectivity in polylogarithmic worst case time
• Efficient algorithms for line and curve segment intersection using restricted predicates
• Enumerating longest increasing subsequences and patience sorting
• Lower bounding edit distances between permutations
• On the complexity of crossings in permutations
• On the distribution of the length of the longest increasing subsequence of random permutations
• On the local behavior of spaces of natural images
• Persistence images: a stable vector representation of persistent homology
• Robust Plane Sweep for Intersecting Segments
• Stability of persistence diagrams
• The nonlinear statistics of high-contrast patches in natural images
• The theory of multidimensional persistence
• Topological analysis of scalar fields with outliers
• Tracking a generator by persistence
• Worst-case analysis of a new heuristic for the travelling salesman problem
• \textsc{Phat} -- persistent homology algorithms toolbox

Cited in

(1)

• Keeping it sparse: computing persistent homology revisited

This page was built for publication: Move schedules: fast persistence computations in coarse dynamic settings

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6589170)