Topology representing networks
Neural Networks
Neural Networks for Pattern Recognition
Neural Networks for Pattern Recognition
The Nonlinear Statistics of High-Contrast Patches in Natural Images
International Journal of Computer Vision - Special Issue on Computational Vision at Brown University
Manhattan world: orientation and outlier detection by Bayesian inference
Neural Computation
Topological persistence and simplification
FOCS '00 Proceedings of the 41st Annual Symposium on Foundations of Computer Science
SCG '04 Proceedings of the twentieth annual symposium on Computational geometry
Stability of persistence diagrams
SCG '05 Proceedings of the twenty-first annual symposium on Computational geometry
Unsupervised, Information-Theoretic, Adaptive Image Filtering for Image Restoration
IEEE Transactions on Pattern Analysis and Machine Intelligence
Vines and vineyards by updating persistence in linear time
Proceedings of the twenty-second annual symposium on Computational geometry
Weak witnesses for Delaunay triangulations of submanifolds
Proceedings of the 2007 ACM symposium on Solid and physical modeling
The theory of multidimensional persistence
SCG '07 Proceedings of the twenty-third annual symposium on Computational geometry
Manifold reconstruction in arbitrary dimensions using witness complexes
SCG '07 Proceedings of the twenty-third annual symposium on Computational geometry
Coordinate-free Coverage in Sensor Networks with Controlled Boundaries via Homology
International Journal of Robotics Research
Network sketching or: "How Much Geometry Hides in Connectivity?--Part II"
SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
Reconstruction using witness complexes
SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
On the Local Behavior of Spaces of Natural Images
International Journal of Computer Vision
Geodesic Delaunay triangulation and witness complex in the plane
Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms
Using persistent homology to recover spatial information from encounter traces
Proceedings of the 9th ACM international symposium on Mobile ad hoc networking and computing
Towards persistence-based reconstruction in euclidean spaces
Proceedings of the twenty-fourth annual symposium on Computational geometry
Describing shapes by geometrical-topological properties of real functions
ACM Computing Surveys (CSUR)
Persistent homology for kernels, images, and cokernels
SODA '09 Proceedings of the twentieth Annual ACM-SIAM Symposium on Discrete Algorithms
Cut locus and topology from surface point data
Proceedings of the twenty-fifth annual symposium on Computational geometry
Persistent cohomology and circular coordinates
Proceedings of the twenty-fifth annual symposium on Computational geometry
A barcode shape descriptor for curve point cloud data
Computers and Graphics
Computing Multidimensional Persistence
ISAAC '09 Proceedings of the 20th International Symposium on Algorithms and Computation
A growing self-organizing network for reconstructing curves and surfaces
IJCNN'09 Proceedings of the 2009 international joint conference on Neural Networks
Minds and Machines
Technical Section: Fast construction of the Vietoris-Rips complex
Computers and Graphics
The tidy set: a minimal simplicial set for computing homology of clique complexes
Proceedings of the twenty-sixth annual symposium on Computational geometry
Topological inference via meshing
Proceedings of the twenty-sixth annual symposium on Computational geometry
Optimal reconstruction might be hard
Proceedings of the twenty-sixth annual symposium on Computational geometry
Geodesic delaunay triangulations in bounded planar domains
ACM Transactions on Algorithms (TALG)
Algorithms and theory of computation handbook
Local homology transfer and stratification learning
Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms
Nonparametric neighborhood statistics for MRI denoising
IPMI'05 Proceedings of the 19th international conference on Information Processing in Medical Imaging
Unsupervised texture segmentation with nonparametric neighborhood statistics
ECCV'06 Proceedings of the 9th European conference on Computer Vision - Volume Part II
Multinerves and helly numbers of acyclic families
Proceedings of the twenty-eighth annual symposium on Computational geometry
Linear-size approximations to the vietoris-rips filtration
Proceedings of the twenty-eighth annual symposium on Computational geometry
Technical Section: Efficient construction of the Čech complex
Computers and Graphics
A barcode shape descriptor for curve point cloud data
SPBG'04 Proceedings of the First Eurographics conference on Point-Based Graphics
WADS'07 Proceedings of the 10th international conference on Algorithms and Data Structures
The simplex tree: an efficient data structure for general simplicial complexes
ESA'12 Proceedings of the 20th Annual European conference on Algorithms
Homological reconstruction and simplification in R3
Proceedings of the twenty-ninth annual symposium on Computational geometry
Graph induced complex on point data
Proceedings of the twenty-ninth annual symposium on Computational geometry
| Hi-index | 0.00 |
This paper tackles the problem of computing topological invariants of geometric objects in a robust manner, using only point cloud data sampled from the object. It is now widely recognised that this kind of topological analysis can give qualitative information about data sets which is not readily available by other means. In particular, it can be an aid to visualisation of high dimensional data. Standard simplicial complexes for approximating the topological type of the underlying space (such as Cech, Rips, or a-shape) produce simplicial complexes whose vertex set has the same size as the underlying set of point cloud data. Such constructions are sometimes still tractable, but are wasteful (of computing resources) since the homotopy types of the underlying objects are generally realisable on much smaller vertex sets. We obtain smaller complexes by choosing a set of 'landmark' points from our data set, and then constructing a "witness complex" on this set using ideas motivated by the usual Delaunay complex in Euclidean space. The key idea is that the remaining (non-landmark) data points are used as witnesses to the existence of edges or simplices spanned by combinations of landmark points. Our construction generalises the topology-preserving graphs of Martinetz and Schulten [MS94] in two directions. First, it produces a simplicial complex rather than a graph. Secondly it actually produces a nested family of simplicial complexes, which represent the data at different feature scales, suitable for calculating persistent homology [ELZ00, ZC04]. We find that in addition to the complexes being smaller, they also provide (in a precise sense) a better picture of the homology, with less noise, than the full scale constructions using all the data points. We illustrate the use of these complexes in qualitatively analyzing a data set of 3 × 3 pixel patches studied by David Mumford et al [LPM03].