Corpus ID: 237532695

Graph skeletonization of high-dimensional point cloud data via topological method

  title={Graph skeletonization of high-dimensional point cloud data via topological method},
  author={Lucas Magee and Yusu Wang},
Geometric graphs form an important family of hidden structures behind data. In this paper, we develop an efficient and robust algorithm to infer a graph skeleton behind a point cloud dataset (PCD) embedded in high-dimensional space. Previously, there has been much work to recover a hidden graph from a low-dimensional density field, or from a relatively clean high-dimensional PCD (in the sense that the input points are within a small bounded distance to a true hidden graph). Our proposed… Expand


Data Skeletonization via Reeb Graphs
This paper develops a framework to extract, as well as to simplify, a one-dimensional "skeleton" from unorganized data using the Reeb graph, which is very simple, does not require complex optimizations and can be easily applied to unorganized high-dimensional data such as point clouds or proximity graphs. Expand
Graph Reconstruction by Discrete Morse Theory
This paper provides a simplified version of the existing discrete Morse-based graph reconstruction algorithm and shows that the aforementioned framework can correctly reconstruct a graph under this noise model, in the sense that it has the same loop structure as the hidden ground-truth graph, and is also geometrically close. Expand
Efficient and Robust Persistent Homology for Measures
An efficient and reliable scheme to approximate the topological structure of the family of sublevel-sets of the distance to a measure that works in arbitrary metric spaces is proposed. Expand
Geometric Inference for Probability Measures
Replacing compact subsets by measures, a notion of distance function to a probability distribution in ℝd is introduced and it is shown that it is possible to reconstruct offsets of sampled shapes with topological guarantees even in the presence of outliers. Expand
Statistical analysis of metric graph reconstruction
Lower and upper bounds on the minimax risk for the noiseless case and tubular noise case are derived and the reconstruction algorithm given in Aanjaneya et al. (2012) is considered. Expand
Skeletonization and Partitioning of Digital Images Using Discrete Morse Theory
This paper defines basins and skeletons via Morse-theoretic cancellation of critical cells in the discrete gradient vector field using a strategy informed by persistent homology and proves the topological validity of these constructions. Expand
Metric graph reconstruction from noisy data
This work presents a novel algorithm that takes as an input such a data set, and outputs the underlying metric graph with guarantees, and implements the algorithm, and evaluates its performance on a variety of real world data sets. Expand
Lexicographic optimal chains and manifold triangulations
Given a simplicial complex K, we consider the problem of finding a simplicial d-chain minimal in a given homology class. This is sometimes referred to as the Optimal Homologous Chain Problem (OHCP).Expand
Piecewise Linear Skeletonization Using Principal Curves
The results indicated that the proposed algorithm can find a smooth medial axis in the great majority of a wide variety of character templates and that it substantially improves the pixel-wise skeleton obtained by traditional thinning methods. Expand
Efficient map reconstruction and augmentation via topological methods
A novel framework for map reconstruction based on a topological idea: the Morse theory is presented, which allows the use of Morse theory and topological simplification to handle the issues of both noise and non-homogeneous sampling in an elegant unified framework. Expand