arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2009.00311math.GNmath.AT
收藏

有限幅数字图像的拓扑复杂性

Topological Complexities of Finite Digital Images

Melih İs, İsmet Karaca

摘要:

数字拓扑方法是计算数字图像拓扑复杂度的常用方法。为了确定一个数字连接的有限数字图像的拓扑复杂性,我们给出了新的结果之间的关系,减少和数字压缩。我们提出了所有可能的情况下的拓扑复杂性TC有限的数字图像在Z和Z^2$。最后,我们确定了更高的拓扑复杂性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.

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

↑