arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1312.1492cs.CGcs.CVmath.AT
收藏

一种快速鲁棒的噪声云中拓扑持续空洞计数算法

A fast and robust algorithm to count topologically persistent holes in noisy clouds

Durham University(杜伦大学)

Vitaliy Kurlin

摘要:

预处理2D图像通常会产生一个有噪声的兴趣点云。我们研究了平面上无组织云的孔洞计数问题。当在所有可能的尺度上分析云时,给定云中的孔通过其边界轮廓的拓扑持久性来量化。我们设计的算法来计算孔是最持久的过滤偏移(邻域)周围的给定点。输入是平面中的一组$n$点,没有任何用户定义的参数。该算法具有$O(n\log n)$时间和$O(n)$空间。输出是数组(孔数,过滤中的相对持久性)。我们证明理论上的保证,当算法找到正确数量的孔(组件的补充)的一个未知的形状近似的云。

英文摘要:

Preprocessing a 2D image often produces a noisy cloud of interest points. We study the problem of counting holes in unorganized clouds in the plane. The holes in a given cloud are quantified by the topological persistence of their boundary contours when the cloud is analyzed at all possible scales. We design the algorithm to count holes that are most persistent in the filtration of offsets (neighborhoods) around given points. The input is a cloud of $n$ points in the plane without any user-defined parameters. The algorithm has $O(n\log n)$ time and $O(n)$ space. The output is the array (number of holes, relative persistence in the filtration). We prove theoretical guarantees when the algorithm finds the correct number of holes (components in the complement) of an unknown shape approximated by a cloud.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑