Weak feature size and persistent homology: computing homology of solids in Rn from noisy data samples

@article{Chazal2005WeakFS,
  title={Weak feature size and persistent homology: computing homology of solids in Rn from noisy data samples},
  author={Fr{\'e}d{\'e}ric Chazal and Andr{\'e} Lieutier},
  journal={Proceedings of the twenty-first annual symposium on Computational geometry},
  year={2005}
}
  • F. Chazal, A. Lieutier
  • Published 6 June 2005
  • Mathematics
  • Proceedings of the twenty-first annual symposium on Computational geometry
In this work, one proves that under quite general assumptions one can deduce the topology of a bounded open set in Rn from a Hausdorff distance approximation of it. For this, one introduces the weak feature size (wfs) that generalizes the notion of local feature size. Our results apply to open sets with positive wfs, which include many sets whose boundaries are not smooth and even nowhere smooth. This class includes also the piecewise analytic open sets which cover many cases encountered in… 

Figures from this paper

Finding the Homology of Manifolds using Ellipsoids
A standard problem in applied topology is how to discover topological invariants of data from a noisy point cloud that approximates it. We consider the case where a sample is drawn from a properly
Smooth manifold reconstruction from noisy and non-uniform approximation with guarantees
The Persistent Homology of Distance Functions under Random Projection
TLDR
This paper shows that the persistent homology of the distance function to P is also preserved up to a comparable constant factor, and proves these results in the more general setting of weighted kth nearest neighbor distances.
Estimating Multidimensional Persistent Homology Through a Finite Sampling
TLDR
It is shown that, under suitable density conditions, it is possible to estimate the multidimensional persistent Betti numbers of X from the ones of a union of balls centered on the sample points; this even yields the exact value in restricted areas of the domain.
Finding the Homology of Submanifolds with High Confidence from Random Samples
TLDR
This work considers the case where data are drawn from sampling a probability distribution that has support on or near a submanifold of Euclidean space and shows how to “learn” the homology of the sub manifold with high confidence.
A∞ Persistent Homology Estimates Detailed Topology from Pointcloud Datasets
Let X be a closed subspace of a metric space M. It is well known that, under mild hypotheses, one can estimate the Betti numbers of X from a finite set $$P\subset M$$ of points approximating X. In
Manifold reconstruction in arbitrary dimensions using witness complexes
TLDR
This paper proves that the results of proved that the witness complex coincides with the restricted Delaunay triangulation on curves, and is still a subset of it on surfaces, do not extend to higher-dimensional manifolds, even under strong sampling conditions such as uniform point density.
Algorithms and hardness results in computational homology
TLDR
The definition and algorithm of a canonical basis of the homology group, namely, the optimal homology basis is provided, and various issues concerning characterizing topological features in computation are addressed.
Two Extensions to Manifold Learning Algorithms using α-Complexes
A large body of work has grown up over the past decade [2, 9, 10, 13, 14, 3, 4, 5, 8, 15, 19, 20] dealing with ways of recovering topological invariants of a submanifold M ⊂ RN from a point cloud Z
Measuring and Localizing Homology Classes
We develop a method for measuring and localizing homology classes. This involves two problems. First, we dene relevant notions of size for both a homology class and a homology group basis, using
...
...

References

SHOWING 1-10 OF 34 REFERENCES
The flow complex: a data structure for geometric modeling
Critical point theory for distance functions
Morse theory is a basic tool in differential topology which also has many applications in Riemannian geometry. Roughly speaking, Morse theory relates the topology of M to the critical points of a
Computing and comprehending topology: persistence and hierarchical morse complexes
TLDR
The authors begin by extending the concept of addition to binary operations, which is based on abstracting from algebra its core properties, and studying algebra in terms of those properties.
Any open bounded subset of Rn has the same homotopy type as its medial axis
Three-dimensional alpha shapes
TLDR
This article introduces the formal notion of the family of α-shapes of a finite point set in R, a well-defined polytope, derived from the Delaunay triangulation of the point set, with a parameter α ε R controlling the desired level of detail.
A simple algorithm for homeomorphic surface reconstruction
TLDR
The crust algorithm of [1] reconstructs a surface with topological and geometric guarantees using the Voronoi diagram of the input point set, and for the first time a proof that the crust is homeomorphic to the input surface.
Critical points of distance functions and applications to geometry
8. Introduction Critical points of distance functions Toponogov's theorem; first application:a Background on finiteness theorems Homotopy Finiteness Appendix. Some volume estimates Betti numbers and
Stability and Finiteness Properties of Medial Axis and Skeleton
The medial axis is a geometric object associated with any bounded open set in ℝn which has various applications in computer science. We study it from a mathematical point of view. We give some
A generalized sphere theorem
A basic problem in Riemannian geometry is the study of relations between the topological structure and the Riemannian structure of a complete, connected Riemannian manifold M of dimension n > 2. By a
Stability of Persistence Diagrams
The persistence diagram of a real-valued function on a topological space is a multiset of points in the extended plane. We prove that under mild assumptions on the function, the persistence diagram
...
...