• Corpus ID: 1544445

Dimension Detection with Local Homology

@article{Dey2014DimensionDW,
title={Dimension Detection with Local Homology},
author={Tamal K. Dey and Fengtao Fan and Yusu Wang},
journal={ArXiv},
year={2014},
volume={abs/1405.3534}
}
• Published 14 May 2014
• Computer Science, Mathematics
• ArXiv
Detecting the dimension of a hidden manifold from a point sample has become an important problem in the current data-driven era. Indeed, estimating the shape dimension is often the first step in studying the processes or phenomena associated to the data. Among the many dimension detection algorithms proposed in various fields, a few can provide theoretical guarantee on the correctness of the estimated dimension. However, the correctness usually requires certain regularity of the input: the…
10 Citations

Figures and Tables from this paper

More general and robust conditions for local homology recovery are introduced and it is shown that tame homology stratification sets, including Whitney stratified sets, satisfy these conditions away from strata boundaries, thus obtaining control over the regions where local homological recovery may not be feasible.
• Yuriy Mileyko
• Mathematics
Journal of Applied and Computational Topology
• 2020
Recovering homological features of spaces from samples has become one of the central themes of topological data analysis, leading to many successful applications. Many of the results in this area
• Mathematics
• 2018
This survey describes some useful properties of the local homology of abstract simplicial complexes. Although the existing literature on local homology is somewhat dispersed, it is largely dedicated
• Computer Science, Mathematics
Foundations of Data Science
• 2021
An algorithm is presented that learns the abstract structure of an embedded graph and models the specific embedding from a point cloud sampled from it and proves the correctness of the identified abstract structure under assumptions on the embedding.
• Computer Science
2015 International Joint Conference on Neural Networks (IJCNN)
• 2015
We introduce a method called multi-scale local shape analysis for extracting features that describe the local structure of points within a dataset. The method uses both geometric and topological
• Mathematics
2016 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP)
• 2016
A survey is provided that explores persistent local homology, a new tool that can be used to extract local structure from a dataset, emphasizing its use in data analysis.
• Mathematics
ArXiv
• 2019
It is shown that the bottleneck distance between two zigzag persistence modules restricted to an interval is always bounded above by the distance between the unrestricted versions, which is not surprising but could have different practical implications.
• Mathematics
ArXiv
• 2023
We propose an extension of the classical union-of-balls filtration of persistent homology: fixing a point $q$, we focus our attention to a ball centered at $q$ whose radius is controlled by a second
• Computer Science
ArXiv
• 2022
A topological framework is developed that identifies singularities of complex spaces, while also capturing singular structures and local geometric complexity in image data, and yields a Euclidicity score for assessing the ‘manifoldness’ of a point along multiple scales.
• Computer Science, Mathematics
ArXiv
• 2021
An algorithm is presented that learns the abstract structure of an embedded graph and models the specific embedding from a point cloud sampled from it and proves the correctness of the identified abstract structure under assumptions on the embedding.

References

SHOWING 1-10 OF 32 REFERENCES

• Mathematics, Computer Science
SCG '08
• 2008
A novel approach that stands in-between classical reconstruction and topological estimation, and whose complexity scales up with the intrinsic dimension of the data is introduced.
• Computer Science
Int. J. Comput. Geom. Appl.
• 2005
The experimental results validate the effectiveness of the approach in computing the dimension and both the algorithm and its analysis can be generalized to the noisy case, in which outliers and a small perturbation of the samples are allowed.
• Mathematics, Computer Science
SODA
• 2012
This paper uses methods derived from kernel and cokernel persistent homology to cluster the data points into different strata, and provides a probabilistic guarantee for the clustering for the point sample setting.
• Mathematics, Computer Science
Discret. Comput. Geom.
• 2008
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.
• Computer Science
ICML '07
• 2007
This paper proposes an algorithm for dimension estimation and studies its finite-sample behaviour and shows that the rate of convergence of the resulting estimate is independent of the dimension of the input space and hence the algorithm is “manifold-adaptive”.
• Mathematics
SODA
• 2009
A novel approach to estimate the dimension m of an unknown manifold M⊂ Rd with positive reach from a set of point samples P ⊂ M by analyzing the shape of simplices formed by point samples, which proves that the dimension can be correctly output in O(kd|P|1+1/k) time with probability greater than 1-2-k.
• Mathematics
SODA
• 2014
It is shown that the persistence diagrams used for estimating local homology, can be approximated using families of Vietoris-Rips complexes, whose simple constructions are robust in any dimension.
• Mathematics
48th Annual IEEE Symposium on Foundations of Computer Science (FOCS'07)
• 2007
This work uses the vineyard of the distance function restricted to a 1-parameter family of neighborhoods of a point to assess the local homology of the stratified space at that point and proves the correctness of this assessment under the assumption of a sufficiently dense sample.
• Computer Science
SODA '02
• 2002
A Voronoi-based dimension detection algorithm is presented that assigns a dimension to a sample point which is the topological dimension of the manifold it belongs to and an algorithm to approximate shapes of arbitrary dimension from their samples is presented.
• Mathematics
• 2010
We present a novel approach for estimating the intrinsic dimension of certain point clouds: we assume that the points are sampled from a manifold M of dimension k, with k << D, and corrupted by