图像序列中连通域的拓扑跟踪
Topological Tracking of Connected Components in Image Sequences
摘要:
持续同源性提供了关于沿着细胞复合物的过滤的同源类的寿命的信息。持久性条形码是这种信息的图形表示。在一组时空数据中,过滤可能由时间决定,但计算持久同源性的经典方法不尊重我们不能在时间上向后移动的事实。在本文中,作为输入的时变序列的二维(2D)二进制数字图像,我们开发了一种算法,用于编码,在所谓的{ \it时空条形码},寿命的连接组件(无论是前景或背景),随着时间的推移,在图像序列中移动(此信息可能不符合所提供的持久性条形码)。这样,给定序列中某个特定时刻的连通组件,我们就可以通过我们称之为{ \it时空路径}的方法,在时间上回溯该组件,直到它诞生的那一刻。本文相对于我们以前的作品的主要贡献在于在一个新的算法,直接计算时空路径,有效的前景和背景,并在一般情况下开发,为未来的扩展为跟踪更高维的拓扑特征$nD$二进制数字图像序列奠定基础。
英文摘要:
Persistent homology provides information about the lifetime of homology classes along a filtration of cell complexes. Persistence barcode is a graphical representation of such information. A filtration might be determined by time in a set of spatiotemporal data, but classical methods for computing persistent homology do not respect the fact that we can not move backwards in time. In this paper, taking as input a time-varying sequence of two-dimensional (2D) binary digital images, we develop an algorithm for encoding, in the so-called {\it spatiotemporal barcode}, lifetime of connected components (of either the foreground or background) that are moving in the image sequence over time (this information may not coincide with the one provided by the persistence barcode). This way, given a connected component at a specific time in the sequence, we can track the component backwards in time until the moment it was born, by what we call a {\it spatiotemporal path}. The main contribution of this paper with respect to our previous works lies in a new algorithm that computes spatiotemporal paths directly, valid for both foreground and background and developed in a general context, setting the ground for a future extension for tracking higher dimensional topological features in $nD$ binary digital image sequences.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。