
Deep learning-based object detection models perform well under daytime conditions but face significant challenges at night, primarily because they are predominantly trained on daytime images. Additionally, training with nighttime images presents another challenge: Even human annotators struggle to accurately label objects in low-light conditions. This issue is particularly pronounced in transportation applications, such as detecting vehicles and other objects of interest on rural roads at night, where street lighting is often absent, and headlights may introduce undesirable glare. In this study, we addressed these challenges by introducing a novel framework for labeling-free data augmentation, leveraging synthetic data generated by the Car Learning to Act (CARLA) simulator for day-to-night image style transfer. Specifically, the framework incorporated the efficient attention Generative Adversarial Network for realistic day-to-night style transfer and used CARLA-generated synthetic nighttime images to help the model learn the vehicle headlight effect. To evaluate the efficacy of the proposed framework, we fine-tuned the state-of-the-art object detection model with an augmented dataset curated for rural nighttime environments, achieving significant improvements in nighttime vehicle detection. This novel approach was simple yet effective, offering a scalable solution to enhance deep learning-based detection systems in low-visibility environments and extended the applicability of object detection models to broader real-world contexts.
Citation: Yunxiang Yang, Hao Zhen, Yongcan Huang, Jidong J. Yang. Enhancing nighttime vehicle detection with day-to-night style transfer and labeling-free augmentation[J]. Applied Computing and Intelligence, 2025, 5(1): 14-28. doi: 10.3934/aci.2025002
[1] | Yifan Wu, Xiaohui Ai . Analysis of a stochastic Leslie-Gower predator-prey system with Beddington-DeAngelis and Ornstein–Uhlenbeck process. Electronic Research Archive, 2024, 32(1): 370-385. doi: 10.3934/era.2024018 |
[2] | Meng Gao, Xiaohui Ai . A stochastic Gilpin-Ayala nonautonomous competition model driven by mean-reverting OU process with finite Markov chain and Lévy jumps. Electronic Research Archive, 2024, 32(3): 1873-1900. doi: 10.3934/era.2024086 |
[3] | Wenjie Zuo, Mingguang Shao . Stationary distribution, extinction and density function for a stochastic HIV model with a Hill-type infection rate and distributed delay. Electronic Research Archive, 2022, 30(11): 4066-4085. doi: 10.3934/era.2022206 |
[4] | Jitendra Singh, Maninder Singh Arora, Sunil Sharma, Jang B. Shukla . Modeling the variable transmission rate and various discharges on the spread of Malaria. Electronic Research Archive, 2023, 31(1): 319-341. doi: 10.3934/era.2023016 |
[5] | Bing Zhao, Shuting Lyu, Qimin Zhang . Dynamics and density function for a stochastic anthrax epidemic model. Electronic Research Archive, 2024, 32(3): 1574-1617. doi: 10.3934/era.2024072 |
[6] | Tao Zhang, Mengjuan Wu, Chunjie Gao, Yingdan Wang, Lei Wang . Probability of disease extinction and outbreak in a stochastic tuberculosis model with fast-slow progression and relapse. Electronic Research Archive, 2023, 31(11): 7104-7124. doi: 10.3934/era.2023360 |
[7] | Bo Zheng, Lijie Chang, Jianshe Yu . A mosquito population replacement model consisting of two differential equations. Electronic Research Archive, 2022, 30(3): 978-994. doi: 10.3934/era.2022051 |
[8] | Qin Guo, Binlei Cai . Learning capability of the rescaled pure greedy algorithm with non-iid sampling. Electronic Research Archive, 2023, 31(3): 1387-1404. doi: 10.3934/era.2023071 |
[9] | Mingzhan Huang, Xiaohuan Yu, Shouzong Liu . Modeling and analysis of release strategies of sterile mosquitoes incorporating stage and sex structure of wild ones. Electronic Research Archive, 2023, 31(7): 3895-3914. doi: 10.3934/era.2023198 |
[10] | Feng Wang, Taotao Li . Dynamics of a stochastic epidemic model with information intervention and vertical transmission. Electronic Research Archive, 2024, 32(6): 3700-3727. doi: 10.3934/era.2024168 |
Deep learning-based object detection models perform well under daytime conditions but face significant challenges at night, primarily because they are predominantly trained on daytime images. Additionally, training with nighttime images presents another challenge: Even human annotators struggle to accurately label objects in low-light conditions. This issue is particularly pronounced in transportation applications, such as detecting vehicles and other objects of interest on rural roads at night, where street lighting is often absent, and headlights may introduce undesirable glare. In this study, we addressed these challenges by introducing a novel framework for labeling-free data augmentation, leveraging synthetic data generated by the Car Learning to Act (CARLA) simulator for day-to-night image style transfer. Specifically, the framework incorporated the efficient attention Generative Adversarial Network for realistic day-to-night style transfer and used CARLA-generated synthetic nighttime images to help the model learn the vehicle headlight effect. To evaluate the efficacy of the proposed framework, we fine-tuned the state-of-the-art object detection model with an augmented dataset curated for rural nighttime environments, achieving significant improvements in nighttime vehicle detection. This novel approach was simple yet effective, offering a scalable solution to enhance deep learning-based detection systems in low-visibility environments and extended the applicability of object detection models to broader real-world contexts.
In this paper, we use the notation Z (resp. N and R) to indicate the set of integers (resp. natural numbers and real numbers). Besides, since we will often use the name "Marcus-Wyse" in this paper, we will take the term "MW-" instead of "Marcus-Wyse", if there is no danger of ambiguity. Besides, Zo (resp. Ne) means the set of odd integers (resp. even natural numbers) and further, we will use the notation "⊂" (resp. X♯) to denote a 'proper subset or equal' (resp. the cardinality of the given set X). The notation ":=" will be used to introduce a new notion or a terminology. In addition, let us denote a simple closed MW-curve with l elements by SClγ, 4≤l∈Ne∖{6} (see Definition 2.1(3) in detail).
Indeed, the well-known Jordan curve theorem on the 2-dimensional real space [1] has some limitations of dealing with digital objects on Z2 from the viewpoints of applied sciences such as digital topology and digital geometry. Thus, in relation to the establishment of several types of Jordan curve theorems in digital topological settings, there are many works including the papers [2,3,4,5,6,7,8,9,10,11,12]. In the literature, to do this work, digital graph theory [7,8,9] and several types of topologies have been used such as Khalimsky, Marcus-Wyse, Alexandroff topology, pretopology, and so on. However, given a certain topological space (Z2,T), the earlier works did not examine topological features of J and Z2∖J, where J is a simple closed digital curve in (Z2,T). Since both J and Z2∖J may not be either a closed or an open set in (Z2,T), we need to intensively study some topological features of both J and Z2∖J. Furthermore, with a certain topological space (Z2,T), since the number of the components of Z2∖J can be very important from the viewpoint of mathematics, we need to intensively investigate this topic. For instance, on the MW-topological plane, i.e., (Z2,γ), the present paper clearly shows that the number of the components of the complement of SClγ in (Z2,γ) depends on the situation. Besides, we also find that topological features of the sets SClγ and Z2∖SClγ are so related to the semi-closedness and semi-openness in (Z2,γ). In detail, see [13,14] or Section 3 in the present paper. Indeed, there are lots of works studying various properties of semi-closed and semi-open subsets of a topological space [13,14,15,16,17,18,19]. Based on this approach, the present paper will partially use these works.
The aim of the present paper is initially to propose the semi-Jordan curve theorem on the digital plane with the MW-topology (or (Z2,γ)) because it has something quite independent from the earlier results in the literature including the papers [3,4,6,8,9,11,12]. To propose this theorem and support some utilities, we will mainly deal with the following topics.
∙ Examination of many types of SClγ with respect to the semi-closedness and semi-openness in (Z2,γ).
∙ Establishment of a method for making a continuous analog of SClγ and an investigation of some topological features of A(SClγ) with respect to the semi-openness and semi-closedness in (R2,U), where (R2,U) is the 2-dimensional real space with the usual topology.
∙ Given an SClγ, l≠4, how to separate (R2,U) in terms of A(SClγ) ?
∙ Assume the two subspaces (X,γX) and (Y,γY) that are MW-homeomorphic to SClγ. Then we will examine if the number of the components of R2∖A(X) is equal to that of R2∖A(Y). Besides, we strongly need to further compare the number of the components of Z2∖X and that of Z2∖Y.
∙ Given an SClγ, we need to examine if the number of the components of Z2∖SClγ is a topological invariant.
∙ Under what condition, does SClγ separate (Z2,γ) into exactly two components?
∙ Development of the semi-Jordan curve theorem on the MW-topological plane. Besides, given an SClγ, we investigate how to separate (Z2,γ) with respect to the semi-Jordan curve theorem.
∙ Investigation of some properties of many kinds of SClγ relating to the semi-Jordan curve theorem.
After addressing these topics with a success, we can confirm that the semi-Jordan curve theorem has strong advantages and some utilities compared with the earlier works in the literature because it does not have any paradox raised in the Rosenfeld's approach and further, it proceeds with the topological structures, which makes a distinction from the Rosenfeld's approach.
This paper is organized as follows: Section 2 provides some basic notions related to the digital k-connectivity on Z2 and the MW-topology. Section 3 studies some tools discriminating between semi-open and semi-closed sets in (Z2,γ) and further, investigates various properties of semi-closed or semi-open subsets in (Z2,γ). In Section 4, after examining if a simple closed MW-curve is semi-open and semi-closed in (Z2,γ), we prove the semi-openness of each SClγ and further, the semi-closedness of it is related to the number of l. Section 5 suggests a method for establishing a continuous analog of an SClγ denoted by A(SClγ) by using the local rule in [20,21] considered on R2. Besides, we find some conditions for A(SClγ) to separate (R2,U) into exactly two components, compared to the typical Jordan curve theorem in (R2,U) that is the 2-dimensional real plane. Furthermore, we prove that A(SClγ) is both a semi-open and a semi-closed subset of (R2,U). Meanwhile, every semi-closed SClγ,l≠4, is proved to separate (Z2,γ) into many semi-open components whose number depends on the number l of SClγ. Section 6 proposes the semi-Jordan curve theorem on the MW-topological plane. Besides, a semi-open SClγ is also proved to separate (Z2,γ) into semi-closed or semi-open components whose number depends on the situation. More precisely, after proving that SClγ separates (Z2,γ) into many semi-closed or semi-open components depending on the situation, we find a condition for SClγ to separate (Z2,γ) into exactly two components. Besides, given two simple closed MW-curve with l elements X and Y, we first prove that the number of components of Xc need not be equal to that of Yc. Section 7 refers to some advantages and utilities of MW-topological structure and the semi-Jordan curve theorem on (Z2,γ). Section 8 concludes the paper with summary and a further work.
To study digital objects in Z2, many basic notations will be used such as a digital 4- and 8-neighborhood of a point p∈Z2 [7,8], as follows:
Based on the digital 4- and 8-connectivity in [7,8,22], for a point p=(x,y)∈Z2, the following notations will be often used later [7,8].
{N4(p)={(x±1,y),p,(x,y±1)}N8(p)={(x±1,y),p,(x,y±1),(x±1,y±1)}} |
which is respectively called the 4-neighborhood and 8-neighborhood of a point p.
Then we recall that distinct points p,q∈Z2 are 4-(resp. 8-)adjacent if and only if p∈N4(q)∖{q} (resp. p∈N8(q)∖{q}) or q∈N4(p)∖{p} (resp. q∈N8(p)∖{p}) [7,8].
We now recall an Alexandroff topological structure using the study of some properties of MW-topological spaces. More precisely, a topological space (X,T) is called an Alexandroff space if every point x∈X has the smallest open neighborhood in (X,T) [24]. As an Alexandroff topological space [24,25], the Marcus-Wyse topological space, denoted by (Z2,γ), was established and there are many studies including the papers [5,6,26]. Indeed, the MW-topology, denoted by (Z2,γ), is generated by the set of all U(p) in (2.2) below, i.e., {U(p)|p∈Z2}, as a base [27], where for each point p=(x,y)∈Z2
U(p):={N4(p) if x+y is even, and {p}: else. } | (2.2) |
In the paper we call a point p=(x1,x2) doubly even if x1+x2 is an even number such that each xi is even, i∈{1,2}; even if x1+x2 is an even number such that each xi is odd, i∈{1,2}; and odd if x1+x2 is an odd number [12].
In all subspaces of (Z2,γ) of Figures 1–7 the symbols ◊ and ∙ mean a doubly even point or even point and an odd point, respectively. In view of (2.2), we can obviously obtain the following: Under (Z2,γ), the singleton {◊} is a closed set and {∙} is an open set. Besides, for a subset X⊂Z2, the subspace induced by (Z2,γ) is obtained, denoted by (X,γX) and called an MW-topological space. Hereinafter, for our purpose, we will use the notations
{(Z2)e:={p∈Z2∣p is a doubly even or even point in Z2}, and (Z2)o:={p∈Z2∣p is an odd point in Z2}} | (2.3) |
In terms of this perspective, it turns out that the minimal (open) neighborhood of the point p:=(p1,p2) of Z2, denoted by SNγ(p)⊂Z2, is obtained, as follows [26,28]:
SNγ(p)={{p} if p∈(Z2)o, and N4(p) if p∈(Z2)e} | (2.4) |
Hereinafter, in (X,γX), for p∈X we use the notation SNγ(p):=SNγ(p)∩X for short if there is no danger of ambiguity. Using the smallest open set of (2.4), the notion of an MW-adjacency in (Z2,γ) is defined, as follows: For distinct points p,q in (Z2,γ), we say that p is MW-adjacent to q [26] if
p∈SNγ(p)orq∈SNγ(q) |
In view of the properties of (2.2) and (2.4), we obviously obtain the following:
Based on the structure of (2.4), for a point p:=(p1,p2) of Z2, the closure of the singleton {p} is denoted by Clγ{p})⊂Z2 as follows [26]:
Clγ({p})={{p} if p∈(Z2)e, and N4(p) if p∈(Z2)o.} | (2.5) |
Hereinafter, in relation to the study of MW-topological spaces, we will use the term Cl for brevity instead of Clγ if there is no danger of confusion.
Definition 2.1. [26] Let X:=(X,γX) be an MW-topological space. Then we define the following:
(1) An MW-path from x to y in X is defined as a sequence (pi)i∈[0,l]Z⊂X,l∈N, in X such that p0=x, pl=y and each point pi is MW-adjacent to pi+1 and i∈[0,l−1]Z. The number l is the length of this path. In particular, a singleton in (Z2,γ) is assumed to be an MW-path.
(2) Distinct points x,y∈X are called MW-path connected if there is a finite MW-path (pi)i∈[0,m]Z on X with p0=x and pm=y. For arbitrary points x,y∈X, if there is an MW-path (pi)i∈[0,m]Z⊂X such that p0=x and pm=y, then we say that X is MW-path connected (or MW-connected).
(3) A simple closed MW-curve (resp. simple MW-path) with l elements in X means a finite MW-path (pi)i∈[0,l−1]Z, 4≤l∈Ne∖{6} in Z2 such that the points pi and pj are MW-adjacent if and only if |i−j|=±1(modl) (resp. |i−j|=1). Then we use the notation SClγ to denote a simple closed MW-curve with l elements.
As for some properties of SClγ, it is clear that SCl1γ is MW-homeomorphic to SCl2γ if and only if l1=l2 [26].
This section first recalls the concepts of a semi-open and a semi-closed set. Namely, a subset A of a topological space (X,T) is said to be semi-open if there is an open set O in (X,T) such that O⊂A⊂Cl(O). Besides, we say that a subset B of a topological space (X,T) is semi-closed if the complement of B in X, i.e., Bc, is semi-open in (X,T). Then it turns out that a subset A of (X,T) is semi-open if and only if A⊂Cl(Int(A)) [13] and a subset B of (X,T) is semi-closed if and only if Int(Cl(B))⊂B [29]. Hence, in (X,T), it is clear that each of the empty set and the total set is both semi-open and semi-closed. Besides, "open" (resp. "closed") is stronger than "semi-open" (resp. "semi-closed"). The notions of semi-openness and semi-closedness enable us to get the following [13,19,31]:
(⋆1) The intersection of two semi-open sets need not be semi-open.
(⋆2) The union of two semi-closed sets need not be semi-closed.
(⋆3) The union of two semi-open sets is semi-open.
(⋆4) The intersection of two semi-closed sets is semi-closed.
Remark 3.1. [30,31] In (Z2,γ), the following are obtained:
(1) The singleton {p} is both semi-closed and semi-open, where p∈(Z2)o. Namely, Z2∖{p} is both semi-closed and semi-open, where p∈(Z2)o.
(2) The singleton {q} is not semi-open but semi-closed, where q∈(Z2)e. Namely, Z2∖{q} is semi-open, where q∈(Z2)e.
Let us further establish some techniques to examine if a set in (Z2,γ) is semi-open or semi-closed. In (Z2,γ), for a set X⊂Z2, we will take the following notation [31].
Xop:={x|xis an odd point inX}. | (3.1) |
Besides, the topological structure of (Z2,γ) enables us to get the following [31]:
Remark 3.2 [31] In (Z2,γ), we have the following:
(1) For x,y∈Z2, x∈SNγ(y) if and only if y∈Cl(x), i.e., y∈Clγ(x)(see the properties of (2.4) and (2.5) in the present paper).
(2) If X is an open set in (Z2,γ), then there is at least an odd point x in X (see the property of (2.3)).
(3) The set Xop of (3.1) is an open set in (Z2,γ).
Given a set X in (Z2,γ), to further examine if the set X is semi-open or semi-closed in (Z2,γ), we now introduce the following two theorems that will be strongly used in discriminating against subsets based on the semi-openness and semi-closedness of the MW-topological space.
Theorem 3.3. [31] In (Z2,γ), a (non-empty) set X(⊂Z2) is semi-open if and only if each x∈X, SNγ(x)∩Xop≠∅, where SNγ(x) is assumed in (Z2,γ).
Since this theorem strongly plays an important role in studying many results in the present paper, to make Theorem 3.3 self-contained, we suggest a proof briefly, as follows: In case X=∅, the proof is straightforward. Let us assume that X is not an empty set.
(⇒) According to the choice of a point x∈X, we can consider the following two cases.
(Case 1) Assume that x(∈X) is an odd point. From the hypothesis, we have x∈X⊂Cl(Int(X)) so that we obtain
SNγ(x)∩Int(X)≠∅. | (3.2) |
Since SNγ(x)={x}, we obtain x∈Int(X) and further, x∈Xop. Hence, owing to (3.2), we have SNγ(x)∩Xop≠∅.
(Case 2) Assume that x∈X is a doubly even or even point. Owing to the hypothesis, we obtain x∈Cl(Int(X)) that leads to the following property as mentioned in (3.2).
SNγ(x)∩Int(X)≠∅. |
Since SNγ(x)∩Int(X) is a non-empty open set in (Z2,γ), by Remark 3.2(2), we now take an odd point z in (Z2,γ) such that
z∈SNγ(x)∩Int(X). | (3.3) |
By the property of (3.3), since z∈Int(X)⊂X, we have z∈Xop (see Remark 3.2(2)) so that z∈SNγ(x)∩Xop≠∅. In addition, we see that the point z is indeed MW-adjacent to x.
(⇐) According to the choice of a point x∈X, we can consider the following two cases.
(Case 1) For an arbitrary point x∈X, assume that x is an odd point in (Z2,γ). Since {x}=SNγ(x), owing to the hypothesis of SNγ(x)∩Xop≠∅, we have x∈Xop, i.e., {x}∩Xop≠∅. Furthermore, owing to the identity SNγ(x)={x}, by Remark 3.2(3), it is clear that
x∈Xop⇒{x}⊂Int(X)⇒x∈Cl(Int(X)). | (3.4) |
(Case 2) For an arbitrary point x∈X, assume that x is a doubly even or even point in (Z2,γ). Owing to the hypothesis, since SNγ(x)∩Xop≠∅, by Remark 3.2(2) and (3), there is an odd point z in (Z2,γ) such that z∈SNγ(x)∩Xop because SNγ(x)∩Xop is an open set in (Z2,γ). Hence we get z∈SNγ(x), by Remark 3.2(1), we have
x∈Cl({z})⊂Cl(Int(X))⇒x∈Cl(Int(X)). | (3.5) |
Owing to both (3.4) and (3.5), we obtain X⊂Cl(Int(X)) which prove the assertion.
Owing to the notion of semi-closedness, using Theorem 3.4, we obtain the following:
Theorem 3.4. [31] In (Z2,γ), B(⊂Z2) is semi-closed if and only if each x∈Z2∖B, SNγ(x)∩(Z2∖B)op≠∅, where SNγ(x) is assumed in (Z2,γ).
As examples for Theorems 3.3 and 3.4, see the cases referred to in Remark 3.1(1)–(3).
In view of Theorems 3.3 and 3.4, we have the following:
Remark 3.5. In (Z2,γ), assume a connected subset X with X♯≥2. Then it is semi-open and it may not be semi-closed.
To classify all types of SClγ with respect to the semi-openness and semi-closedness, based on the topological features of SClγ, it suffices to consider the only case of l∈{2m|m∈N∖{1,3}} because no SC6γ exists. Hereinafter, when studying semi-topological features of a set X⊂Z2, we assume that the set X is considered in (Z2,γ).
Theorem 4.1. Given an SClγ, 4≤l∈Ne∖{6}, the semi-topological features of SClγ in (Z2,γ) are determined according to the number l, as follows:
(1) SClγ is always semi-open for any l, where l∈{2m|m∈N∖{1,3}}.
(2) SClγ is always both semi-open and semi-closed whenever l∈{4,10}.
Proof: (1) Given an SClγ:=(xi)i∈[0,l−1]Z, take any element xi∈SClγ. Then SNγ(xi) in (Z2,γ) has the following property,
SNγ(xi)∩(SClγ)op≠∅. |
By Theorem 3.3, we conclude that SClγ is semi-open in (Z2,γ).
(2) (2-1) In the case of SC4γ, let Y:=Z2∖SC4γ. Then, for any p∈Y we have
SNγ(p)∩(Y)op≠∅, |
which implies that Y is semi-open in (Z2,γ) (see Theorem 3.3). Hence SC4γ is semi-closed in (Z2,γ). Also, using a method similar to the proof of (1), it is clear that SC4γ is semi-open in (Z2,γ).
(2-2) In the case of SC10γ (see the objects in Figure 1(3)(a), (b)), let W:=Z2∖SC10γ. Using a method similar to the proof of (2-1) above, by Theorems 3.3 and 3.4, we prove that SC10γ is both semi-open and semi-closed in (Z2,γ).
Remark 4.2. In the case of l∉{4,10}, SClγ may not be semi-closed. The semi-closedness of SClγ depends on the situation.
Proof: In the case of SClγ, where l∉{4,10}, the semi-closedness of SClγ depends on the situation. More precisely, given an SClγ:=(xi)i∈[0,l−1]Z, l∉{4,10}, assume that SClγ does not have the subsequence
X1:=(xt−3(modl),xt−1(modl),xt+1(modl),xt+3(modl)) |
whose each element is an odd point (i.e., X1⊂SClγ∩(Z2)o) and X1⊂N4(x),x∈Z2∖SClγ. Then, by Theorem 3.4, SClγ is semi-closed. For instance, since no SC6γ exists, it suffices to mention that SClγ, l∉{4,10}, is semi-closed depending on the situation. As suggested in Figure 1(2), while the object SC8γ of (a) is not semi-closed (see Theorem 3.4) but semi-open, the object of (b) is both semi-closed and semi-open.
In view of Theorem 4.1, we obtain the following:
Proposition 4.3. There are two types of SClγ,l∉{4,10}, with respect to the semi-closedness.
Proof: Using Theorems 3.3 and 3.4, we prove the assertion. As mentioned in the proof of Theorem 4.1, we need to consider the following two cases:
(Case 1) Assume an SClγ:=(xi)i∈[0,l−1]Z,l∉{4,10}, such that SClγ does not have the subsequence
X1:=(xt−3(modl),xt−1(modl),xt+1(modl),xt+3(modl)) | (4.1) |
whose each element is an odd point and X1⊂N4(x),x∈Z2∖SClγ. Then, by Theorem 3.4, SClγ is semi-closed.
(Case 2) Assume an SClγ:=(xi)i∈[0,l−1]Z,l∉{4,10}, in which there is the subsequence X1 of (4.1) whose each element is an odd point and X1⊂N4(x),x∈Z2∖SClγ. Then, by Theorem 3.4, SClγ is not semi-closed but only semi-open owing to Theorem 3.3. For instance, since SC12γ in Figure 2(a) does not satisfy the condition of Theorem 3.4, it is not semi-closed in (Z2,γ) (see the points p1:=(0,0),p2:=(1,1) in Z2∖SC12γ as in Figure 2(b)).
Example 4.1. In Figure 1, some examples for several types of SClγ are shown for l∈{4,8,10,12}. In view of Theorems 3.3, 3.4 and 4.1, and Proposition 4.3, we obtain the following:
(1) SC4γ in Figure 1 is both semi-open and semi-closed.
(2) As for the SC8γ in Figure 1(2), the object of (a) is semi-open instead of semi-closed because it satisfies only the condition of Theorem 3.3 instead of that of Theorem 3.4. However, the object of (b) is both semi-open and semi-closed (see also Theorems 3.3 and 3.4).
(3) As for the SC10γ in Figure 1(3), each of (a) and (b) is both semi-open and semi-closed (see Theorems 3.3 and 3.4).
(4) As for the SC12γ in Figure 1(4), the object of (a) is semi-open instead of semi-closed because it satisfies only the condition of Theorem 3.3 instead of that of Theorem 3.4. To be specific, based on an SC12γ in Figure 2(a), consider the object in Figure 2(b). Since the set Cl(SC12γ) contains the open sets N4(pi)=SNγ(pi),i∈{1,2}, p1=(0,0) and p2=(1,1), so that Int(Cl(SC12γ))⊈SC12γ, which implies the non-semi-closedness of SC12γ (see the proof of Proposition 4.3). However, the object of Figure 1(4)(b) is both semi-open and semi-closed.
This section introduces a method for establishing a continuous analog of an object on Z2 with respect to the MW-topology. The local rule introduced in Definition 5.1 below will be used in this work and has been widely used in digitization and digital-based rough set theory [20].
Definition 5.1. [20] For each point p:=(p1,p2)∈Z2, the continuous analog of the given point p∈Z2 with respect to the MW-topology, denoted by Ap, is defined by:
Ap={[p1−0.5,p1+0.5]×[p2−0.5,p2+0.5],if p is a doubly even point (see Figure3(1));[p1−0.5,p1+0.5]×[p2−0.5,p2+0.5]∖{q1,q2,q3,q4},where qi,i∈[1,4]Zsuch that q1=(p1−0.5,p2−0.5),q2=(p1−0.5,p2+0.5),q3=(p1+0.5,p2+0.5),q4=(p1+0.5,p2−0.5),if p is an even point (see Figure3(2));and(p1−0.5,p1+0.5)×(p2−0.5,p2+0.5),if p is an odd point (see Figure3(3)−(4)).} | (5.1) |
Hereinafter, we assume the set Ap to be a subspace of (R2,U). Using the local rule around a point p∈Z2 as in Definition 5.1, we define the following:
Definition 5.2. A continuous analog of X(⊂Z2) is defined as
A(X)=⋃p∈XAp by taking the following way.
{A:P(Z2)→P(R2)forX(⊂Z2)defined byA(X):=⋃p∈XAp.} |
Then we assume A(X) to be (A(X),UA(X)) as a subspace of (R2,U).
In particular, the set A(Z2) is defined as A(Z2)=⋃p∈Z2Ap=R2 by taking the following way.
Z2→A(Z2):=⋃p∈Z2Ap=R2. |
Then we assume A(Z2) to be (A(Z2),U), i.e., (A(Z2),U)=(R2,U).
Remark 5.3. The operator A need not preserve an M-homeomorphism into a homeomorphism in (R2,U).
Definitions 5.1 and 5.2 enable us to get the following:
Lemma 5.4. (1) In case X is a connected subset of (Z2,γ), A(X) is also a connected subset of (R2,U).
(2) In case Y is a disconnected subset of (Z2,γ), A(Y) may not be a disconnected subset of (R2,U). Namely, the connectedness of A(Y) in (R2,U) depends on the situation.
Proof: (1) Given a connected subset X of (Z2,γ), we obtain A(X)=⋃p∈XAp that is a connected subset of (R2,U) (see Definition 5.1).
(2) As an example, consider the set {p,q}, where p,q∈(Z2)e,p≠q, and q∈N8(p). While the set {p,q} is a disconnected subset of (Z2,γ), A({p,q})=Ap∪Aq is a connected subset of (R2,U) (see Definition 5.1). For instance, in Figure 4(1), consider the two points p:=(0,0) and q:=(1,−1) in SC4γ. Then the set {p,q} supports the assertion.
Theorem 5.5. Given an SClγ, A(SClγ) is both semi-open and semi-closed in (R2,U).
Proof: Since A(SClγ)⊂Cl(Int(A(SClγ))), the proof of the semi-openness of A(SClγ) is completed.
Besides, since we obtain Int(Cl(A(SClγ))⊂A(SClγ), the proof of the semi-closedness of A(SClγ) is also completed.
To support Theorem 5.5, we can suggest the following examples. The set A(SC4γ) is both semi-open and semi-closed in (R2,U). Similarly, each of the sets A(SC8γ) and A(SC10γ) is also both semi-open and semi-closed in (R2,U).
Proposition 5.6. Given an SClγ, we obtain the following:
(1) In the case of SC4γ, A(SC4γ) does not separates (R2,U) into two non-empty components. Namely, R2∖A(SC4γ) has the only one non-empty component.
(2) In the case of SClγ,l∈{8,10}, A(SClγ) separates (R2,U) into exactly two non-empty components.
(3) For any l of SClγ,l∉{4,8,10}, A(SClγ) separates (R2,U) into more than or equal to two non-empty components.
Proof: (1) Given an SC4γ, we obtain A(SC4γ)=⋃p∈SC4γAp as shown in Figure 4(1)(b) that is a subspace of (R2,U), where A(SC4γ) is both semi-open and semi-closed in (R2,U) (see Figure 4(1)(a), (b)). Then it is clear that A(SC4γ) does not separate (R2,U) into two nonempty components.
(2) In the case of l∈{8,10}, we obtain A(SClγ) as a subspace of (R2,U) whose complement of A(SClγ) in R2 consists of only two non-empty components. See the process of obtaining A(SC8γ) in Figure 4(2) from (a) to (b) and (c) to (d).
(3) For any l of SClγ,l∉{4,8,10}, A(SClγ) separates (R2,U) to obtain that R2∖A(SClγ) has more than or equal to two non-empty components. For instance, as shown in each of the objects SC12γ in Figure 4(4)(a), (b), we see that R2∖A(SC12γ) has only two non-empty components.
Meanwhile, as for the SC12γ as in Figure 4(c) and SC18γ in Figure 5(a), each of R2∖A(SC12γ) and R2∖A(SC18γ) has more than two components. To be specific, we need to strongly recognize that the set R2∖A(SC12γ) of Figure 4(4)(b) has only two components, i.e., we have C(p1)=C(p2), where C(pi) means the component containing the given point pi in (R2,U), i∈{1,2}. Similarly, R2∖A(SC18γ) of Figure 5(d) has only two components. However, as shown in Figure 4(4) from (c) to (d), we see that R2∖A(SC12γ) has three disjoint non-empty components such as
C(q1),C(q2),andR2∖(C(q1)∪C(q2)∪A(SC12γ)). |
Example 5.1. (1) Given the SC4γ in Figure 4(1)(a), A(SC4γ) is obtained as in Figure 4(1)(b).
(2) Given the SC8γ in Figure 4(2)(a), A(SC8γ) is obtained as in Figure 4(2)(b) which leads that A(SC8γ) separates (R2,U) into two components.
(3) Given the SC10γ in Figure 4(3)(a), A(SC10γ) is obtained as in Figure 4(3)(b).
(4) Consider the SC12γ in Figure 4(4)(a), A(SC12γ) is obtained as in Figure 4(4)(b). Note that in Figure 4(4)(b) the set Ap1∪Ap2 is connected in (R2,U).
However, as for the SC12γ in Figure 4(4)(c), we see R2∖A(SC12γ) has three non-empty components because Cq1≠Cq2 as in Figure 4(4)(c), (d), where q1=(1,0) and q2=(2,1) (see Definition 5.1).
(5) Given the SC12γ in Figure 4(5)(a), A(SC12γ) is obtained, as in Figure 4(5)(b) to show that A(SC12γ) separate (R2,U) into exactly two disjoint components.
In view of Proposition 5.6, we have the following query.
Under what condition, does R2∖A(SClγ) have exactly two non-empty components?
Theorem 5.7. Assume an SClγ:=(di)i∈[0,l−1]Z,l≠4, satisfying the following property:
{There are no distinct elementsdt1,dt2inSClγ∩(Z2)esuch thatdt2∈N8(dt1)andCon(dt1)∩{dt2}=∅,whereCon(dt1)is the connected maximal subset ofN8(dt1)∩SClγcontaining the pointdt1.} | (5.2) |
(1) Then A(SClγ) separates (R2,U) into exactly two components in (R2,U) that are both semi-open and semi-closed.
(2) One of the components of R2∖A(SClγ) is bounded and the other is unbounded in R2.
Before proving the assertion, we need to recognize that the hypothesis requires that SClγ always satisfies the property of (5.2). In particular, we need to focus on the part "SClγ∩(Z2)e" of (5.2).
Proof: Owing to the hypothesis, assume an SClγ:=(di)i∈[0,l−1]Z,l≠4, that does not contain the subset
X1:={dt1,dt2}(⊂SClγ∩(Z2)e) | (5.3) |
having the following property:
dt2∈N8(dt1)andCon(dt1)∩{dt2}=∅, |
where Con(dt1) is the connected maximal subset of N8(dt1)∩SClγ containing the point dt1. Then, owing to the notion of (5.1) and the features of SClγ, A(SClγ) separates (R2,U) into exactly two both semi-open and semi-closed components in (R2,U).
For instance, consider the case of SC12γ given in Figure 4(4)(a). Then we obtain A(SC12γ) to separate (R2,U) into exactly two both semi-open and semi-closed components in (R2,U). More precisely, as in Figure 4(4)(a), (b), owing to the property of (5.1), the set Ap1∪Ap2 is a connected subset of (R2,U).
Meanwhile, without the hypothesis, we can consider the following case. Assume an SClγ:=(di)i∈[0,l−1]Z,l≠4, in which there is a subset X1(⊂SClγ∩(Z2)e) of (5.3) such that dt2∈N8(dt1) and Con(dt1)∩{dt2}=∅. To be specific, see the two points r1 and r2 in Figure 5(a). Then, A(SClγ) does not separate (R2,U) into exactly two both semi-open and semi-closed components in (R2,U). As another example, see the objects in Figure 4(4)(c), (d). To be specific, in Figure 4(4)(c), (d), the set Aq1 is not connected with Aq2 (see the property of (5.1)).
(2) With the hypothesis, it is clear that one of the components of R2∖A(SClγ) is bounded and the other is unbounded in R2.
Example 5.2. Consider the object SC18γ in Figure 5(c). Then we observe that the SC18γ of Figure 5(c) satisfies the property of (5.2) and A(SC18γ) separates (R2,U) into exactly two components such as
C(q1)andR2∖(C(q1)∪A(SC18γ)) |
because C(q1)=C(q2)=C(q3)=C(q4) in R2∖A(SC18γ) of Figure 5(d).
Theorem 5.8. Assume the subspaces (X,γX) and (Y,γY) that are MW-homeomorphic to SClγ. Then the number of the components of R2∖A(X) need not be equal to that of R2∖A(Y).
Proof: It suffices to prove it by suggesting a counterexample. Given the two types of SC18γ as in Figure 5(a), (c), we obtain the corresponding two types of A(SC18γ) as in Figure 5(b), (d).
For our purpose, let A1 (resp. A2) be the set R2∖A(SC18γ), where SC18γ is the object in Figure 5(a) (resp. Figure 5(c)). Then it is clear that A1 has four components and A2 has the only two components as in Figure 5(b), (d).
Remark 5.9. The number the components of R2∖A(SClγ) need not be equal to that of Z2∖SClγ.
Proof: As a counterexample, see the objects in Figure 5(c), (d). As shown in Figure 5(c), consider the given SC18γ in Figure 5(c). While Z2∖SC18γ has four components as in Figure 5(c) in (Z2,γ) such as
C(qi)={qi},i∈{1,2},C(q3)={q3,q4},andZ2∖(∪i∈[1,3]ZC(qi)∪SC18γ), |
the set R2∖A(SC18γ) has exactly two components as in Figure 5(d) because C(q1)=C(q2)=C(q3) as the subspaces of (R2,U), i.e., C(q1) is connected with C(q2) and C(q2) is also connected with C(q3). To be specific, see the cases of SC18γ in Figure 5(c) and A(SC18γ) in Figure 5(d) stated in Example 5.2, which completes the proof.
Lemma 5.10. Assume an SClγ:=(di)i∈[0,l−1]Z,l∈{4,8,10}. Then the number of the components of R2∖A(SClγ) in (R2,U) is equal to that of Z2∖SClγ in (Z2,γ).
Proof: (Case 1) Consider an SC4γ:=(di)i∈[0,3]Z. As proved in Proposition 5.6, R2∖A(SC4γ) in (R2,U) has one component. Besides, Z2∖SC4γ also has one component in (Z2,γ).
(Case 2) Consider an SC8γ:=(di)i∈[0,7]Z. As proved in Proposition 5.6, R2∖A(SC8γ) in (R2,U) has exactly two components. Besides, Z2∖SC8γ also has exactly two components in (Z2,γ).
(Case 3) Consider an SC10γ:=(di)i∈[0,9]Z. As proved in Proposition 5.6, R2∖A(SC10γ) in (R2,U) has exactly two components. Besides, Z2∖SC10γ also has exactly two components in (Z2,γ).
Unlike Lemma 5.10, owing to Remark 5.9, let us now find a condition for comparing between the number of the components of R2∖A(SClγ) in (R2,U) and that of Z2∖SClγ in (Z2,γ), as follows:
Proposition 5.11. Assume an SClγ:=(ci)i∈[0,l−1]Z,l∉{4,8,10}, having the following property:
{There are no distinct elementsct1,ct2inSClγ∩(Z2)osuch thatct2∈N8(ct1)andCon(ct1)∩{ct2}=∅,whereCon(ct1)is the connected maximal subset ofN8(ct1)∩SClγcontaining the pointct1.} | (5.4) |
Then the number of the components of R2∖A(SClγ) in (R2,U) is equal to that of Z2∖SClγ in (Z2,γ).
Proof: First of all, without the hypothesis, we need to show that the assertion does not hold. Suppose an SClγ:=(ci)i∈[0,l−1]Z,l∉{4,8,10}, that does not satisfy the property of (5.4). For instance, as shown in Figure 5(c), (d), the given SC18γ in Figure 5(c) does not satisfy the property of (5.4), i.e., see the two points s1 and s2 in Figure 5(c). Based on the SC18γ, we find that R2∖A(SC18γ) has only two components in (R2,U) (see Example 5.2). Meanwhile, Z2∖SC18γ has four components in (Z2,γ).
Next, owing to the property of (5.1), the topological feature of R2∖A(SClγ) in (R2,U), and that of Z2∖SClγ in (Z2,γ), the proof is completed.
Example 5.3. Let us consider SC18γ in Figure 5(a). Then it is clear that it satisfies the property of (5.4) so that we obtain R2∖A(SC18γ) consisting of four components in (R2,U) (see Figure 5(b)) and Z2∖SC18γ is composed of four components in (Z2,γ) (see Figure 5(a)).
In 1970, Rosenfeld [9,10,11] initially considered the digital topological version of the typical Jordan curve theorem (see also [22]). Consider SC2,lk in a binary digital picture D:=(Z2,k,ˉk,SC2,lk). Then the ˉk-components are called white components of D and SC2,lk is said to be a black component (or equivalently, k-component) of the digital picture [22], where we say that a k-component of a non-empty digital image (X,k) is a maximal k-connected subset of (X,k) [22]. To be precise, given an SC2,48 on Z2, to evade from the so-called "digital connectivity paradox"[10,11], the papers [7,8,9] considered it in a binary digital picture D:=(Z2,8,4,SC2,48) instead of (Z2,8,8,SC2,48). In the digital picture (Z2,8,4,SC2,48), to avoid the digital connectivity paradox, it turns out that SC2,48 should be considered to be an (8,4)-binary digital image in the given digital picture D above. Namely, the part Z2∖SC2,48 should be considered with 4-connectivity. Then the given set SC2,48 separates Z2 into the two 4-components A and B [22] such that
{Z2∖SC2,48=A∪Bsuch thatA∩B=∅and further, each element ofAis not4-adjacent tothat ofB.} | (6.1) |
Based on this approach, it is clear that one of the sets A and B is finite and the other is infinite. Then we call a finite set A the interior of the given set B:=SC2,48∪A in the digital picture (Z2,8,4,B). Similarly, as a general case of SC2,48, we can consider SC2,lk(≠SC2,44) in the digital picture D:=(Z2,k,ˉk,SC2,lk) as mentioned above, where (k,ˉk)∈{(4,8),(8,4)}. Then, it also separates Z2 into two non-empty ˉk-components A and B such that
{Z2∖SC2,lk=A∪Bsuch thatA∩B=∅and further, each element ofAis notˉk-adjacent tothat ofB.} | (6.2) |
Meanwhile, unlike this approach followed from Rosenfeld's work, in the category of MW-topological spaces, given an SClγ in (Z2,γ), we now raise the following queries.
(Q1) How can we propose an MW-topological version of the typical Jordan curve theorem?
(Q2) What differences are there between an MW-topological version of the well-known Jordan curve theorem and the typical Jordan curve theorem on (R2,U)?
(Q3) What differences are there between the Jordan curve theorem in an MW-topological setting and the digital Jordan curve theorem established by Rosenfeld?
The paper [12] also studied several types of digital Jordan curve theorems with nine pretopologies on Z2. Besides, the paper [3] also proposed a computational topological version of the curve and surface theorem. In addition, there are some studies on the digital versions of the Jordan curve theorem in digital spaces including the papers [6,12,22]. However, to study this topic more intensively from the viewpoint of the MW-topology, we strongly need to have an approach using semi-topological structures. To study some properties of the semi-closedness or semi-openness of Z2∖SClγ, we first recall that SC4γ does not separate (Z2,γ) into exactly two non-empty components (see Figure 1(1)(a), (b)). Furthermore, we have the following (see Figure 4(1)(a), (2)(a), (3)(a)).
Remark 6.1. Z2∖SC4γ has the only one non-empty component that is both semi-open and semi-closed in (Z2,γ).
Lemma 6.2. (1) SC8γ separates (Z2,γ) into exactly two semi-closed components. One of these components need not be semi-open in (Z2,γ).
(2) SC10γ separates (Z2,γ) into exactly two components that are both semi-open and semi-closed.
Proof: Based on the SC8γ in Figure 1(2)(a), (b), and SC10γ in Figure 1(3)(a), (b), by Theorems 3.3 and 3.4, the proof is clearly completed. In particular, note that the components of Z2∖SC8γ are obviously semi-closed in (Z2,γ). Indeed, in the case of SC8γ in Figure 1(2)(a), one of them is not semi-open. To be specific, consider SC8γ in Figure 1(2)(a), the finite component of Z2∖SC8γ is not semi-open. Meanwhile, the components of Z2∖SC10γ are both semi-open and semi-closed in (Z2,γ) (see Theorems 3.3 and 3.4).
Unlike the case of SClγ:=(ci)i∈[0,l−1]Z,l∈{4,8,10}, motivated by Theorem 5.7 and Proposition 5.11, we obtain the following:
Proposition 6.3. Assume SClγ:=(ci)i∈[0,l−1]Z,l≠4, satisfying the following property:
{There are no distinct elementsct1,ct2inSClγsuch thatct2∈N8(ct1)andCon(ct1)∩{ct2}=∅,whereCon(ct1)is the connected maximal subset ofN8(ct1)∩SClγcontaining the pointct1.} | (6.3) |
Then SClγ separates (Z2,γ) into exactly two semi-closed components, e.g., A and B. Namely, a partition {A,B,SClγ} of (Z2,γ) exists.
Proof: First of all, we need to strongly point out an importance of the given hypothesis. Without the hypothesis, as shown in Figure 4(4)(a), (c), since the given SC12γ in Figure 4(4)(a), (c) do not satisfy the hypothesis of (6.3), they do not separate (Z2,γ) into exactly two components. Besides, some components of Z2∖SC12γ cannot be semi-open. To be specific, in the SC12γ of Figure 4(4)(a), each of C(pi)={pi},i∈{1,2}, is not semi-open in (Z2,γ).
As another case, since the given SC12γ in Figure 4(4)(c) does not satisfy the property of (6.3) either, it does not separate (Z2,γ) into exactly two components. Besides, note that none of the objects in Figure 5(a), (c), Figure 6, and Figure 7(1), (2) satisfies the property of (6.3) either.
In addition, the condition of (6.3) does not support the semi-openness of the component of Z2∖SClγ. For instance, consider SC8γ in Figure 1(2)(a), one component of Z2∖SC8γ is not semi-open in (Z2,γ) as mentioned in the proof of Lemma 6.2.
Meanwhile, with the hypothesis of (6.3), owing to the features of SClγ, it is clear that SClγ separates (Z2,γ) into exactly two components (see Figure 1(4)(c), (d)) which are semi-closed in (Z2,γ).
Owing to Remark 6.1, based on Theorem 5.7, we can define the notions of Definition 6.4 below because given an SClγ satisfying the hypothesis of (5.2), R2∖A(SClγ) has exactly two components in (R2,U) and further, one of them is bounded and the other is unbounded (see the cases of SC38γ in Figure 7(1) and SC28γ in Figure 7(3)).
Definition 6.4. Assume an SClγ satisfying the property of (5.2), l≠4. Then we define the following two notions.
(1) I(SClγ):=B(R2∖A(SClγ))∩Z2, where B(R2∖A(SClγ)) means the bounded component of R2∖A(SClγ).
(2) O(SClγ):=Ub(R2∖A(SClγ))∩Z2, where Ub(R2∖A(SClγ)) stands for the unbounded component of R2∖A(SClγ).
Comparing the condition of Proposition 6.3 and that of Definition 6.4, we can note that the former is stronger than the latter. Hereinafter, the two notions I(SClγ) and O(SClγ) in Definition 6.4 are called "inside" and "outside" of SClγ in (Z2,γ), respectively. In particular, note that these notions are not related to the notions of interior and exterior of a set of (Z2,γ).
Remark 6.5. (1) In Definition 6.4, the hypothesis of (5.2) is strongly required to establish both I(SClγ) and O(SClγ) because it supports the assertion of Theorem 5.7 so that the set R2∖A(SClγ) has exactly two components of which one of them is bounded and the other is unbounded.
(2) Without the hypothesis of (5.2), we have some difficulties in establishing the notions of I(SClγ) and O(SClγ). For instance, consider the case of SC42γ in Figure 6. In particular, see the points c2 and c38, and c4 and c36. Then, owing to these points, it is clear that this SC42γ does not satisfy the property of (5.2). Hence we have some difficulties in establishing I(SC42γ) because R2∖A(SC42γ) does not have exactly two components. As another case, consider the case of SC28γ in Figure 7(2). In particular, consider the two points c19 and c25. Then they clearly does not satisfy the property of (5.2) so that R2∖A(SC28γ) has three components, e.g., two bounded components and one unbounded component. More precisely, since the set Aq2 is a bounded component of R2∖A(SC28γ), Aq2 is not related to the set Ub(R2∖A(SC28γ))∩Z2 which comes across some difficulties in establishing O(SC28γ).
(3) As a good example for Definition 6.4, consider the SC38γ in Figure 7(1). First, see the two points d29 and d35 of the SC38γ in Figure 7(1). Then they can be admissible to establish O(SC38γ). Besides, see the two points d11 and d17 of the SC38γ in Figure 7(1). Then they can be admissible to establish the notion of I(SC38γ) because Aq1 is connected with Aq2.
Similarly, the SC28γ in Figure 7(3) also a good example for Definition 6.4.
Example 6.1. (1) As for the SC42γ in Figure 6, it does not satisfy the property of (5.2) (see the points c2 and c38, and c4 and c36). Hence, as mentioned in Theorem 5.7, A(SC42γ) does not separate (R2,U) into two components. Indeed, R2∖A(SC42γ) consists of four components as follows: C(pi)=Api,i∈[1,2]Z, C(p3)=C(p4) and C(q1)=C(q2).
Furthermore, the set Z2∖SC42γ has six components such as C(pi),i∈[1,4]Z and $ C(q_j), j \in [1,2]_{\mathbb Z} $.
(2) Given the SC38γ in Figure 7(1), it satisfies the property of (5.2). Hence the set R2∖A(SC38γ) consists of the exactly two components. Hence we obtain
I(SC38γ)=C(q1)∪C(q2)andO(SC38γ)=C(q3)∪C(q4),where |
C(qi) is the component of qi in (Z2,γ) containing the given point qi,i∈[1,4]Z.
Meanwhile, the set Z2∖SC38γ consists of four components in (Z2,γ), e.g., C(qi),i∈[1,4]Z.
(3) Given the SC28γ in Figure 7(2), it does not satisfy the property of (5.2). Indeed, the set Z2∖SC28γ consists of three components as follows: C(qi),i∈[1,3]Z and C(q1) consists of eleven elements as in Figure 7(2). In particular, C(q2)={q2} and (C(q3))♯=ℵ0 that is the cardinal number of the set of natural numbers.
(4) Given the SC28γ in Figure 7(3), it is clear that this object satisfies the hypothesis of Definition 6.4. Hence we obtain I(SC28γ)=C(q1) and O(SC28γ)=C(q2)∪C(q3).
Owing to Definition 6.4, we have the following:
Theorem 6.6. Assume an SClγ, l≠4, satisfying the property of (5.2).
Then, a partition {I(SClγ),O(SClγ),SClγ} of Z2 exists.
Proof: Owing to Definition 6.4, the proof is completed.
Remark 6.7. (1) Each of I(SClγ) and O(SClγ) need not be connected.
(2) The number of the components of I(SClγ) depends on the situation.
(3) Each of the sets I(SClγ) and O(SClγ) need not be an open set or a closed set in (Z2,γ).
Proof: (1) As an example, consider the SC38γ in Figure 7(1). It is clear that the given SC38γ satisfies the hypothesis of Definition 6.4. While each of I(SC38γ) and O(SC38γ) exists, they are not connected in (Z2,γ). To be specific, it turns out that
I(SC38γ)=C(q1)∪C(q2)andO(SC38γ)=C(q3)∪C(q4) |
such that C(q1)∩C(q2)=∅, C(q3)∩C(q4)=∅, and each of C(qi),i∈[1,4]Z is not an empty set.
(2) From the above (3) of Example 6.1, it is clear that the number of the components of I(SClγ) depends on the number l.
(3) As an example, consider the SC8γ in Figure 4(2)(a). Then I(SC8γ) is not an open set. Besides, consider the SC38γ in Figure 7(1). Then O(SC38γ) is not an open set.
Let us now investigate the semi-openness or semi-closedness of I(SClγ) and O(SClγ).
Example 6.2. Given any SC8γ, there is a partition of (Z2,γ), i.e., {I(SC8γ),SC8γ,O(SC8γ)} such that each of I(SC8γ) and O(SC8γ) is semi-closed and both of them are connected. Namely, SC8γ separates (Z2,γ) with exactly two components.
Lemma 6.8. I(SC10γ) is both semi-open and semi-closed in (Z2,γ).
Proof: As shown in Figure 1(4)(c), (d), owing to Theorems 3.3 and 3.4, I(SC8γ) is clearly both semi-open and semi-closed in (Z2,γ).
Remark 6.9. The semi-openness or semi-closedness of I(SClγ) depends on the situation, l∉{4,10}.
Proof: The semi-topological features of I(SC8γ) is determined according to the two types of SC8γ in Figure 1(2)(a), (b). To be specific, based on the SC8γ in Figure 1(2)(a), we have I(SC8γ) that is only semi-closed instead of semi-open in (Z2,γ). Meanwhile, for the case of SC8γ in Figure 1(2)(b), I(SC8γ) is proved to be both semi-open and semi-closed in (Z2,γ).
Next, let us consider the case SClγ, 12≤l∈Ne. Then the semi-openness or semi-closedness of I(SClγ) depends on the situation (see Figure 5(c) and 7(1), (3)). For instance, the SC18γ in Figure 5(c) has I(SC18γ) that is not semi-open but semi-closed.
Corollary 6.10. Let X and Y be simple closed MW-curves with l elements in (Z2,γ) and each of them satisfies the property of (6.3). Then the number of the components of Xc is equal to that of Yc.
Proof: By Proposition 6.3, the proof is completed.
Let E be the SC28γ in Figure 7(3) and F be the SC28γ satisfying the property of (6.3). While O(E) is not connected and O(F) is connected. Thus we obtain the following.
Remark 6.11. Without the condition relating to the property (6.3), each of I(SClγ) and O(SClγ) may not be connected.
Theorem 6.12. Assume that the subspaces (X,γX) and (Y,γY) are MW-homeomorphic to SClγ.
(1) (I(X),γI(X)) need not MW-homeomorphic to (I(Y),γI(X)).
(2) (O(X),γO(X)) need not MW-homeomorphic to (O(Y),γO(X)).
Proof: To disprove these assertions (1) and (2), we will use some examples.
(1) Consider the two SC12γ in Figures 4(4)(a) and 5(a). For our purpose, let A be the SC12γ in Figure 4(4)(a) and B be the SC12γ in Figure 4(5)(a). While I(A) is not connected and I(B) is connected, which completes the proof.
(2) For our purpose, let C be the SC28γ in Figure 7(3) and D be the SC28γ satisfying the property of (6.3). While O(C) is not connected and O(D) is connected, which completes the proof.
Corollary 6.13. (1) O(SClγ) need not be semi-open.
(2) The number of the components of O(SClγ) need not depend on the number l.
Proof: To disprove these assertions (1) and (2), we will use some examples.
(1) Let us consider the SC28γ in Figure 7(3). Then it is clear that O(SC28γ) is not semi-open.
(2) In view of the SC28γ in Figure 7(3), the proof is completed. To be specific, let A be the SC28γ in Figure 7(3) and B be the SC28γ satisfying the property of (6.3). Then O(A) has two components and O(B) has the only one component.
Unlike Theorem 6.6, let us find a condition to separate (Z2,γ) into exactly two components, as follows:
Theorem 6.14. Let SClγ satisfy the property of (6.3), l≠4. Under (Z2,γ), we obtain the following:
(1) There is a partition {I(SClγ),O(SClγ),SClγ} such that each of I(SClγ) and O(SClγ) is connected.
(2) Each of I(SClγ) and O(SClγ) is semi-closed. While O(SClγ) is semi-open, I(SClγ) need not be semi-open.
Proof: (1) It suffices to prove the connectedness of both I(SClγ) and O(SClγ). Owing to the hypothesis of the property of (6.3), each of I(SClγ) and O(SClγ) is proved to be connected because there are not two points
{ct1,ct2∈SClγ:=(ci)i∈[0,l−1]Z,l≠4such thatct2∈N8(ct1)andCon(ct1)∩{ct2}=∅.} | (6.4) |
Indeed, this property of (6.4) supports the connectedness of both I(SClγ) and O(SClγ).
(2) With the hypothesis, using Theorems 3.3 and 3.4, we prove that both I(SClγ) and O(SClγ) are semi-closed. To be specific, for any point x∈Z2∖I(SClγ), owing to the hypothesis, we always obtain
SNγ(x)∩(Z2∖I(SClγ))op≠∅, |
which implies the semi-closedness of I(SClγ).
Similarly, for any point x∈Z2∖O(SClγ), owing to the hypothesis, we also obtain
SNγ(x)∩(Z2∖O(SClγ))op≠∅, |
which implies the semi-closedness of O(SClγ).
Besides, by Theorem 3.3, owing to the hypothesis, O(SClγ) is proved to be semi-open. However, I(SClγ) need not be semi-open. For instance, for the SC8γ in Figure 4(2)(a). Then I(SC8γ) is not a semi-open in (Z2,γ).
When studying digital objects X in Z2, the properties of (2.4) and (2.5) enable us to get the following utilities of the MW-topological structure of X.
Remark 7.1. (Utilities of the MW-topological structure)
(1) When studying a self-homeomorphism of (Z2,γ), we should consider the following map [31]
{h:(Z2,γ)→(Z2,γ)defined by:for each pointx:=(x1,x2)∈Z2,h(x)=(x1+t1,x2+t2),whereti∈Zofor eachi∈[1,2]Z,orh(x)=(x1+2m1,x2+2m2),for somemi∈Z,i∈M⊂[1,2]Z.} | (7.1) |
Since the modern electronic devices are usually operated on the finite digital planes with more than ten million pixels to support the high-level display resolution, the mapping of (7.1) can be very admissible. At the moment, note that the following map g cannot be a homeomorphism, where
{g:(Z2,γ)→(Z2,γ)defined by:for each pointx:=(x1,x2)∈Z2,g(x)=(x1+t1,x2+t2)such that there is at leastti∈Zo,i∈M⊊[1,2]Z.} | (7.2) |
(2) Since the MW-topological structure is one of the fundamental frames, motivated by this structure, some more generalized topological structures on Zn can be established.
(3) Based on the MW-topological structure of Z2, we can obtain the 4-digital adjacency induced by the given topological structure [26]. In detail, for distinct elements x,y∈(Z2,γ), they are MW-adjacent if x∈SNγ(y) or y∈SNγ(x) [26]. Namely, the MW-adjacency is equivalent to the 4-adjacency of Z2 as in (2.2).
Example 7.1. The map g:(Z2,γ)→(Z2,γ) defined by g(x1,x2)=(x1+2m1+1,x2+2m2),m1,m2∈Z cannot be a homeomorphism. Meanwhile, it is clear that the map h:(Z2,γ)→(Z2,γ) defined by h(x1,x2)=(x1+2m1+1,x2+2m2+1) or (x1+2m1,x2+2m2), m1,m2∈Z, is a homeomorphism.
Remark 7.2. (Advantages of the semi-Jordan curve theorem)
(1) Unlike the typical Jordan curve theorem in a digital topological setting estabsihed by Rosenfeld [22], no paradox exists in the semi-Jordan curve theorem in the MW-topological structure.
(2) Based on the semi-Jordan curve theorem in the MW-topological structure, we can consider a digital topological version of the typical Jordan curve theorem in terms of a simple closed 4-curve in the digital plane (Z2,4,8).
(3) When digitizing a set X in the 2-dimensional real space with respect to the MW-topological structure, we can use a local rule in [20] to obtain a digitized set Dγ(X)⊂Z2 from X which is used in the fields of mathematical morphology, rough set theory, digital geometry, and so on [20,21].
After developing the semi-Jordan curve theorem in the MW-topological setting, we have studied various properties of it. In particular, we have found a condition for SClγ to separate (Z2,γ) with exactly two components, Furthermore, we studied many semi-topological properties of both I(SClγ) and O(SClγ). As a further work, we can compare among several kinds of digital versions of the typical Jordan curve theorem and the combinatorial version of the Jordan curve theorem in [3]. Besides, based on the digital-topological group structure in [32], we can further examine a topological group structure of SClγ. In addition, based on the established structure in [33], we can study covering spaces in the category of MW-topological spaces.
The author was supported by Basic Science Research Program through the National Research Foundation of Korea (NRF) funded by the Ministry of Education, Science and Technology (2019R1I1A3A03059103). Besides, this work was supported under the framework of international cooperation program managed by the National Research Foundation of Korea (2021K2A9A2A06039864).
The author declares no conflict of interest.
[1] | National Highway Traffic Safety Administration, Daytime and nighttime seat belt use by fatally injured passenger vehicle occupants, U.S. Department of Transportation, 2010. Available from: https://www.nhtsa.gov/sites/nhtsa.gov/files/documents/811281.pdf. |
[2] | National Highway Traffic Safety Administration, Report to congress: nighttime glare and driving performance, U.S. Department of Transportation, 2007. Available from: https://www.nhtsa.gov/sites/nhtsa.gov/files/glare_congressional_report.pdf. |
[3] |
U. Mittal, P. Chawla, R. Tiwari, Ensemblenet: a hybrid approach for vehicle detection and estimation of traffic density based on faster r-cnn and yolo models, Neural Comput. Applic., 35 (2023), 4755–4774. https://doi.org/10.1007/s00521-022-07940-9 doi: 10.1007/s00521-022-07940-9
![]() |
[4] |
M. Bie, Y. Liu, G. Li, J. Hong, J. Li, Real-time vehicle detection algorithm based on a lightweight you-only-look-once (yolov5n-l) approach, Expert Syst. Appl., 213 (2023), 119108. https://doi.org/10.1016/j.eswa.2022.119108 doi: 10.1016/j.eswa.2022.119108
![]() |
[5] | S. Huang, C. Lin, S. Chen, Y. Wu, P. Hsu, S. Lai, Auggan: cross domain adaptation with gan-based data augmentation, Proceedings of the European Conference on Computer Vision (ECCV), 2018,718–731. |
[6] |
G. Bang, J. Lee, Y. Endo, T. Nishimori, K. Nakao, S. Kamijo, Semantic and geometric-aware day-to-night image translation network, Sensors, 24 (2024), 1339. https://doi.org/10.3390/s24041339 doi: 10.3390/s24041339
![]() |
[7] |
X. Shao, C. Wei, Y. Shen, Z. Wang, Feature enhancement based on cyclegan for nighttime vehicle detection, IEEE Access, 9 (2020), 849–859. https://doi.org/10.1109/ACCESS.2020.3046498 doi: 10.1109/ACCESS.2020.3046498
![]() |
[8] | J. Zhu, T. Park, P. Isola, A. Efros, Unpaired image-to-image translation using cycle-consistent adversarial networks, Proceedings of the IEEE International Conference on Computer Vision (ICCV), 2017, 2223–2232. |
[9] |
H. Xu, S. Lai, X. Li, Y. Yang, Cross-domain car detection model with integrated convolutional block attention mechanism, Image Vision Comput., 140 (2023), 104834. https://doi.org/10.1016/j.imavis.2023.104834 doi: 10.1016/j.imavis.2023.104834
![]() |
[10] |
L. Fu, H. Yu, F. Xu, J. Li, Q. Guo, S. Wang, Let there be light: improved traffic surveillance via detail preserving night-to-day transfer, IEEE Trans. Circ. Syst. Vid., 32 (2022), 8217–8226. https://doi.org/10.1109/TCSVT.2021.3081999 doi: 10.1109/TCSVT.2021.3081999
![]() |
[11] |
F. Guo, J. Liu, Q. Xie, H. Chang, Improved nighttime traffic detection using day-to-night image transfer, Transport. Res. Rec., 2677 (2023), 711–721. https://doi.org/10.1177/03611981231166686 doi: 10.1177/03611981231166686
![]() |
[12] | B. Kawar, S. Zada, O. Lang, O. Tov, H. Chang, T. Dekel, et al., Imagic: text-based real image editing with diffusion models, Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR), 2023, 6007–6017. |
[13] |
Q. Zou, H. Ling, S. Luo, Y. Huang, M. Tian, Robust nighttime vehicle detection by tracking and grouping headlights, IEEE Trans. Intell. Transp., 16 (2015), 2838–2849. https://doi.org/10.1109/TITS.2015.2425229 doi: 10.1109/TITS.2015.2425229
![]() |
[14] |
S. Parvin, L. Rozario, M. Islam, Vision-based on-road nighttime vehicle detection and tracking using taillight and headlight features, Journal of Computer and Communications, 9 (2021), 107619. https://doi.org/10.4236/jcc.2021.93003 doi: 10.4236/jcc.2021.93003
![]() |
[15] | A. Dosovitskiy, G. Ros, F. Codevilla, A. Lopez, V. Koltun, Carla: an open urban driving simulator, Proceedings of the 1st Annual Conference on Robot Learning, 2017, 1–16. |
[16] | R. Khanam, M. Hussain, YOLOv11: an overview of the key architectural enhancements, arXiv: 2410.17725. https://doi.org/10.48550/arXiv.2410.17725 |
[17] |
S. Malik, M. Khan, H. El-Sayed, Carla: car learning to act—an inside out, Procedia Computer Science, 198 (2022), 742–749. https://doi.org/10.1016/j.procs.2021.12.316 doi: 10.1016/j.procs.2021.12.316
![]() |
[18] | J. Zhu, T. Park, T. Wang, Efficient-attention-GAN: unsupervised image-to-image translation with shared efficient attention mechanism, GitHub, Inc., 2023. Available from: https://github.com/jccb15/efficient-attention-GAN. |
[19] | X. Mao, Q. Li, H. Xie, R. Lau, Z. Wang, S. Smolley, Least squares generative adversarial networks, Proceedings of the IEEE International Conference on Computer Vision (ICCV), 2017, 2794–2802. |
[20] | Y. Taigman, A. Polyak, L. Wolf, Unsupervised cross-domain image generation, arXiv: 1611.02200. https://doi.org/10.48550/arXiv.1611.02200 |
[21] | T. Lin, M. Maire, S. Belongie, J. Hays, P. Perona, D. Ramanan, et al., Microsoft coco: common objects in context, In: Computer vision—ECCV 2014, Cham: Springer, 2014,740–755. https://doi.org/10.1007/978-3-319-10602-1_48 |
[22] | K. You, M. Long, J. Wang, M. Jordan, How does learning rate decay help modern neural networks? arXiv: 1908.01878. https://doi.org/10.48550/arXiv.1908.01878 |