Topological estimation using witness complexes

V. Silva, G. Carlsson
{"title":"Topological estimation using witness complexes","authors":"V. Silva, G. Carlsson","doi":"10.2312/SPBG/SPBG04/157-166","DOIUrl":null,"url":null,"abstract":"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. \n \nOur 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].","PeriodicalId":136739,"journal":{"name":"Symposium on Point Based Graphics","volume":"26 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2004-06-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"408","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Symposium on Point Based Graphics","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.2312/SPBG/SPBG04/157-166","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 408

Abstract

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].
使用见证复合体的拓扑估计
本文仅利用从物体上采样的点云数据,鲁棒地解决了几何物体拓扑不变量的计算问题。现在人们普遍认识到,这种拓扑分析可以提供关于数据集的定性信息,这是通过其他方式不易获得的。特别是,它可以帮助高维数据的可视化。用于近似底层空间拓扑类型的标准简单复合体(如Cech、Rips或a-shape)产生的简单复合体的顶点集与底层点云数据集具有相同的大小。这样的构造有时仍然是可处理的,但是会浪费(计算资源),因为底层对象的同伦类型通常可以在更小的顶点集上实现。我们通过从数据集中选择一组“地标”点来获得较小的复合体,然后利用欧几里得空间中通常的Delaunay复合体所激发的思想,在这个集合上构建一个“见证复合体”。关键思想是,剩余的(非地标)数据点被用作由地标点组合跨越的边或简单点存在的见证。我们的构造在两个方向上推广了Martinetz和Schulten [MS94]的拓扑保持图。首先,它生成一个简单的复合体,而不是一个图形。其次,它实际上产生了一组嵌套的简单复合体,这些简单复合体代表了不同特征尺度的数据,适合于计算持久同源性[ELZ00, ZC04]。我们发现,除了复合物更小之外,它们还提供(在精确意义上)比使用所有数据点的全尺寸结构具有更少噪声的更好的同源性图像。我们举例说明了这些复合物在定性分析David Mumford等人[LPM03]研究的3 × 3像素补丁数据集中的使用。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信