Persistent cohomology and circular coordinates

DOI10.1007/S00454-011-9344-XzbMATH Open1216.68322arXiv0905.4887OpenAlexW4233964287WikidataQ59442788 ScholiaQ59442788MaRDI QIDQ540443FDOQ540443

Authors: Vin de Silva, Dmitriy Morozov, Mikael Vejdemo Johansson 

Publication date: 3 June 2011

Published in: Discrete \& Computational Geometry (Search for Journal in Brave)

Abstract: Nonlinear dimensionality reduction (NLDR) algorithms such as Isomap, LLE and Laplacian Eigenmaps address the problem of representing high-dimensional nonlinear data in terms of low-dimensional coordinates which represent the intrinsic structure of the data. This paradigm incorporates the assumption that real-valued coordinates provide a rich enough class of functions to represent the data faithfully and efficiently. On the other hand, there are simple structures which challenge this assumption: the circle, for example, is one-dimensional but its faithful representation requires two real coordinates. In this work, we present a strategy for constructing circle-valued functions on a statistical data set. We develop a machinery of persistent cohomology to identify candidates for significant circle-structures in the data, and we use harmonic smoothing and integration to obtain the circle-valued coordinate functions themselves. We suggest that this enriched class of coordinate functions permits a precise NLDR analysis of a broader range of realistic data sets.

Full work available at URL: https://arxiv.org/abs/0905.4887

Recommendations

• Persistent cohomology and circular coordinates
• Sparse Circular Coordinates via Principal $$\mathbb {Z}$$-Bundles
• Multiscale projective coordinates via persistent cohomology of sparse filtrations
• Nonlinear dimensionality reduction for data on manifold with rings
• The ring of algebraic functions on persistence bar codes

zbMATH Keywords

persistent homologydimensionality reductioncomputational topologypersistent cohomologyjPlex simplicial complex software

Mathematics Subject Classification ID

Other homology theories in algebraic topology (55N35) Software, source code, etc. for problems pertaining to algebraic topology (55-04) Simplicial sets and complexes in algebraic topology (55U10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Software, source code, etc. for problems pertaining to computer science (68-04)

Cites Work

• LSQR: An Algorithm for Sparse Linear Equations and Sparse Least Squares
• Persistent homology -- a survey
• Title not available (Why is that?)
• Barcodes: The persistent topology of data
• Computing persistent homology
• Topological persistence and simplification
• Hessian eigenmaps: Locally linear embedding techniques for high-dimensional data
• Reconstruction using witness complexes

Cited In (35)

• A Klein-bottle-based dictionary for texture representation
• Contractions in persistence and metric graphs
• Title not available (Why is that?)
• Cohomological learning of periodic motion
• Intrinsic disease maps using persistent cohomology
• Utilizing topological data analysis for studying signals of time-delay systems
• A higher homotopic extension of persistent (co)homology
• Sparse Circular Coordinates via Principal $$\mathbb {Z}$$-Bundles
• Aspects of topological approaches for data science
• Ringit, ring-ordering casual photos of a temporal event
• Discrete Morse theory for computing zigzag persistence
• A topological data analysis based classifier
• A topological approach for protein classification
• Evolutionary homology on coupled dynamical systems with applications to protein flexibility analysis
• Computing hypergraph homology
• Constant rank factorisations of smooth maps, with applications to sonar
• Sliding windows and persistence: an application of topological methods to signal analysis
• Persistent Cohomology for Data With Multicomponent Heterogeneous Information
• Hodge Laplacians on Graphs
• A maximum principle for circle-valued temperatures
• Decoding of Neural Data Using Cohomological Feature Extraction
• Fast computation of persistent homology representatives with involuted persistent homology
• Discrete Morse theory for computing cellular sheaf cohomology
• SimBa
• Computing persistent homology with various coefficient fields in a single pass
• Persistent cohomology and circular coordinates
• Persistent Laplacians: Properties, Algorithms and Implications
• Fast topological signal identification and persistent cohomological cycle matching
• Generalized penalty for circular coordinate representation
• Bipath persistence
• Twisty Takens: a geometric characterization of good observations on dense trajectories
• Ripser: efficient computation of Vietoris-Rips persistence barcodes
• Multiscale projective coordinates via persistent cohomology of sparse filtrations
• Local computation of homology variations over a construction process
• The compressed annotation matrix: an efficient data structure for computing persistent cohomology

Uses Software

• LSQR
• Dionysus
• jPlex
• CRAIG

This page was built for publication: Persistent cohomology and circular coordinates

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