• Corpus ID: 17339691

Objective-oriented Persistent Homology

  title={Objective-oriented Persistent Homology},
  author={Bao Wang and Guowei Wei},
  journal={arXiv: Biomolecules},
  • Bao Wang, G. Wei
  • Published 7 December 2014
  • Mathematics
  • arXiv: Biomolecules
Persistent homology provides a new approach for the topological simplification of big data via measuring the life time of intrinsic topological features in a filtration process and has found its success in scientific and engineering applications. However, such a success is essentially limited to qualitative data characterization, identification and analysis (CIA). In this work, we outline a general protocol to construct objective-oriented persistent homology methods. The minimization of the… 
Multidimensional persistence in biomolecular data
The utility, robustness, and efficiency of the proposed topological methods are demonstrated via protein folding, protein flexibility analysis, the topological denoising of cryoelectron microscopy data, and the scale dependence of nanoparticles.
A topological approach for protein classification
The present study establishes computational topology as an independent and effective alternative for protein classification as well as proposing a molecular topological fingerprint based support vector machine (MTF-SVM) classifier.
Multiresolution Topological Simplification
This work introduces multiresolution persistent homology for tackling large datasets and adjusts the resolution via a rigidity density-based filtration to create a topological microscopy for the underlying data.


Persistent homology analysis of protein structure, flexibility, and folding
  • Kelin XiaG. Wei
  • Biology
    International journal for numerical methods in biomedical engineering
  • 2014
The topology–function relationship of proteins is revealed, for the first time, and an excellent consistence between the persistent homology prediction and molecular dynamics simulation is found.
Multivariate Data Analysis Using Persistence-Based Filtering and Topological Signatures
This paper presents a visualization pipeline that extracts central structures of a data set in a hierarchical manner by using a persistence-based filtering algorithm that is theoretically well-founded and introduces persistence rings, a novel visualization technique for a class of topological features-the persistence intervals-of large data sets.
Reeb graphs: approximation and persistence
This paper begins the study of two important aspects of the Reeb graph, which can facilitate its broader applications in shape and data analysis and obtains an efficient near-linear time (expected) algorithm for computing the rank of H1(M) from point data.
A topological characterization of protein structure
An objective characterization of protein structure based entirely on the geometry of its parts is developed, and preliminary results from the discrimination of protein families using this representation are provided.
A Mayer–Vietoris Formula for Persistent Homology with an Application to Shape Recognition in the Presence of Occlusions
It is shown that persistence diagrams are able to recognize an occluded shape by showing a common subset of points and a Mayer–Vietoris formula involving the ranks of the persistent homology groups of X, A, B, and A∩B plus three extra terms is obtained.
Computing persistent homology
The analysis establishes the existence of a simple description of persistent homology groups over arbitrary fields and derives an algorithm for computing individual persistent homological groups over an arbitrary principal ideal domain in any dimension.
Persistent Brain Network Homology From the Perspective of Dendrogram
A novel multiscale framework that models all brain networks generated over every possible threshold and is based on persistent homology and its various representations such as the Rips filtration, barcodes, and dendrograms to quantify various persistent topological features at different scales in a coherent manner.
Efficient Computation of Persistent Homology for Cubical Data
This paper presents an efficient framework for computation of persistent homology of cubical data in arbitrary dimensions, and presents a data-structure designed to compactly store and quickly manipulate cubical complexes.
Geodesic Active Contours
A novel scheme for the detection of object boundaries based on active contours evolving in time according to intrinsic geometric measures of the image, allowing stable boundary detection when their gradients suffer from large variations, including gaps.