论文标题
有限数字图像的拓扑复杂性
Topological Complexities of Finite Digital Images
论文作者
论文摘要
数字拓扑方法通常用于计算数字图像的拓扑复杂性。我们为可降低性和数字合同之间的关系提供了新的结果，以确定数字连接有限数字图像的拓扑复杂性。我们介绍了Z和Z^2 $中有限数字图像的拓扑复杂性TC的所有可能情况。最后，我们确定有限不可记录的数字图像的较高拓扑复杂性TC_ {N}独立于n> 1的点数。
Digital topological methods are often used on computing the topological complexity of digital images. We give new results on the relation between reducibility and digital contractibility in order to determine the topological complexity of a digitally connected finite digital image. We present all possible cases of the topological complexity TC of a finite digital image in Z and Z^2$. Finally, we determine the higher topological complexity TC_{n} of finite irreducible digital images independently of the number of points for n > 1.
