Subscribe to the gold package and get unlimited access to Shamra Academy
Register a new userEstimating Multidimensional Persistent Homology through a Finite Sampling
254
0
0.0
(
0
)
Ask ChatGPT about the research
No Arabic abstract
An exact computation of the persistent Betti numbers of a submanifold $X$ of a Euclidean space is possible only in a theoretical setting. In practical situations, only a finite sample of $X$ is available. We show 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. Using these inequalities we improve a previous lower bound for the natural pseudodistance to assess dissimilarity between the shapes of two objects from a sampling of them. Similar inequalities are proved for the multidimensional persistent Betti numbers of the ball union and the one of a combinatorial description of it.
rate research
Read More
Multidimensional persistence studies topological features of shapes by analyzing the lower level sets of vector-valued functions. The rank invariant completely determines the multidimensional analogue of persistent homology groups. We prove that multidimensional rank invariants are stable with respect to function perturbations. More precisely, we construct a distance between rank invariants such that small changes of the function imply only small changes of the rank invariant. This result can be obtained by assuming the function to be just continuous. Multidimensional stability opens the way to a stable shape comparison methodology based on multidimensional persistence.
The present lack of a stable method to compare persistent homology groups with torsion is a relevant problem in current research about Persistent Homology and its applications in Pattern Recognition. In this paper we introduce a pseudo-distance d_T that represents a possible solution to this problem. Indeed, d_T is a pseudo-distance between multidimensional persistent homology groups with coefficients in an Abelian group, hence possibly having torsion. Our main theorem proves the stability of the new pseudo-distance with respect to the change of the filtering function, expressed both with respect to the max-norm and to the natural pseudo-distance between topological spaces endowed with vector-valued filtering functions. Furthermore, we prove a result showing the relationship between d_T and the matching distance in the 1-dimensional case, when the homology coefficients are taken in a field and hence the comparison can be made.
Persistent Topology studies topological features of shapes by analyzing the lower level sets of suitable functions, called filtering functions, and encoding the arising information in a parameterized version of the Betti numbers, i.e. the ranks of persistent homology groups. Initially introduced by considering real-valued filtering functions, Persistent Topology has been subsequently generalized to a multidimensional setting, i.e. to the case of $R^n$-valued filtering functions, leading to studying the ranks of multidimensional homology groups. In particular, a multidimensional matching distance has been defined, in order to compare these ranks. The definition of the multidimensional matching distance is based on foliating the domain of the ranks of multidimensional homology groups by a collection of half-planes, and hence it formally depends on a subset of $R^ntimesR^n$ inducing a parameterization of these half-planes. It happens that it is possible to choose this subset in an infinite number of different ways. In this paper we show that the multidimensional matching distance is actually invariant with respect to such a choice.
We introduce weight
The Discrete Morse Theory of Forman appeared to be useful for providing filtration-preserving reductions of complexes in the study of persistent homology. So far, the algorithms computing discrete Morse matchings have only been used for one-dimensional filtrations. This paper is perhaps the first attempt in the direction of extending such algorithms to multidimensional filtrations. Initial framework related to Morse matchings for the multidimensional setting is proposed, and a matching algorithm given by King, Knudson, and Mramor is extended in this direction. The correctness of the algorithm is proved, and its complexity analyzed. The algorithm is used for establishing a reduction of a simplicial complex to a smaller but not necessarily optimal cellular complex. First experiments with filtrations of triangular meshes are presented.
Log in to be able to interact and post comments
comments
Fetching comments
Sign in to be able to follow your search criteria
