The Topological Complexity of Spaces of Digital Jordan Curves
Shelley Kandola

TL;DR
This paper models the set of digital Jordan curves as a finite topological space to analyze the complexity of morphing one digital image into another, providing algorithms for image transformation based on topological properties.
Contribution
It introduces a topological framework for digital Jordan curves, proving the space's connectedness and finite complexity, and establishes the uniqueness of this interpretation for image processing applications.
Findings
The space of digital Jordan curves is connected.
The topological complexity of this space is finite.
The interpretation of the space is topologically unique.
Abstract
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…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsDigital Image Processing Techniques · Topological and Geometric Data Analysis
