arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1908.07015math.ATcs.GR
收藏

数字Jordan曲线空间的拓扑复杂性

The Topological Complexity of Spaces of Digital Jordan Curves

Shelley Kandola

摘要:

本研究的动机是通过拓扑透镜研究图像处理算法。我们在这里关注的图像是那些已经被分割的数字约旦曲线作为图像压缩的一种手段。感兴趣的算法是那些连续地将一个数字图像变形成另一个数字图像的算法。几十年来,人们已经以各种形式研究了数字乔丹曲线。我们的贡献,这一领域是解释一组数字约旦曲线,可以存在于一个给定的数字平面作为一个有限的拓扑空间。计算该空间的拓扑复杂度确定将一个图像变换成另一个图像所需的最小数量的连续运动规划规则,并且确定与拓扑复杂度相关联的运动规划器提供了用于这样做的特定算法。第三节的主要结果是我们的数字Jordan曲线空间是连通的,因此它的拓扑复杂性是有限的。为了进一步说明这一点,我们在第2节中证明了一些关于路径和距离函数的结果,这些结果在T2空间中是显而易见的,但在$T_0$空间中却令人惊讶地难以捉摸。我们在第4节结束,在其中我们研究这些结果的应用。特别是,我们证明,我们的数字乔丹曲线的空间的解释是唯一的拓扑正确的解释。这篇文章是根据作者的博士论文改编的。论文

英文摘要:

This research is motivated by studying image processing algorithms through a topological lens. The images we focus on here are those that have been segmented by digital Jordan curves as a means of image compression. The algorithms of interest are those that continuously morph one digital image into another digital image. Digital Jordan curves have been studied in a variety of forms for decades now. Our contribution to this field is interpreting the set of digital Jordan curves that can exist within a given digital plane as a finite topological space. Computing the topological complexity of this space determines the minimal number of continuous motion planning rules required to transform one image into another, and determining the motion planners associated to topological complexity provides the specific algorithms for doing so. The main result of Section 3 is that our space of digital Jordan curves is connected, hence, its topological complexity is finite. To build up to that, we use Section 2 to prove some results about paths and distance functions that are obvious in Hausdorff spaces, yet surprisingly elusive in $T_0$ spaces. We end with Section 4, in which we study applications of these results. In particular, we prove that our interpretation of the space of digital Jordan curves is the only topologically correct interpretation. This article is an adaptation of the author's Ph.D. dissertation.

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

↑