Open Access

The construction of simplicial groups in digital images

Journal of Inequalities and Applications20132013:143

https://doi.org/10.1186/1029-242X-2013-143

Received: 17 December 2012

Accepted: 8 March 2013

Published: 2 April 2013

Abstract

In this paper, we recall some definitions and properties from digital topology, and we consider the simplices and simplicial complexes in digital images due to adjacency relations. Then we define the simplicial set and conclude that the simplicial identities are satisfied in digital images. Finally, we construct the group structure in digital images and define the simplicial groups in digital images. Consequently, we calculate the digital homology group of two-dimensional digital simplicial group.

MSC:55N35, 68R10, 68U10, 18G30.

Keywords

digital imageadjacency relationsimplicial mapface and degenerate mapsimplicial setsimplicial group

1 Introduction and basic concepts

Digital topology is a branch of mathematics where the image processing and digital image processing are studied. Many mathematicians such as Rosenfeld [1], Han [2], Kong [3, 4], Malgouyres [5], Boxer [68], Karaca [911] and others have contributed to this area with their research. The notions of a digital image, a digital continuous map and digital homotopy were studied in literature [1, 4, 5, 7, 8]. Their recognition and efficient computation became a useful material for our study.

On the other hand, simplicial groups were first studied by Kan [12] in the 1950s. We carry the notion of a digital image on to the simplicial groups and construct algebraic structures in digital images such as simplicial sets, simplicial groups by using the figures and definitions in [13]. In dimension one, we use the 2-adjacency relation, and in dimension two, we use the 8-adjacency relation.

Assume that Z n is n-dimensional Euclidean spaces. A finite subset of Z n with an adjacency relation is called to be a digital image.

Definition 1.1 ([4]; see also [14] and [9])

  1. (1)

    Two points p and q in are 2-adjacent if | p q | = 1 .

     
  2. (2)

    Two points p and q in Z 2 are 8-adjacent if they are distinct and differ by at most 1 in each coordinate.

     
  3. (3)

    Two points p and q in Z 2 are 4-adjacent if they are 8-adjacent and differ by exactly one coordinate.

     
  4. (4)

    Two points p and q in Z 3 are 26-adjacent if they are distinct and differ by at most 1 in each coordinate.

     
  5. (5)

    Two points p and q in Z 3 are 18-adjacent if they are 26-adjacent and differ in at most two coordinates.

     
  6. (6)

    Two points p and q in Z 3 are 6-adjacent if they are 18-adjacent and differ by exactly one coordinate (see Figures 1-3).

     
Figure 1

2-adjacency.

Figure 2

4-adjacency, 8-adjacency.

Figure 3

6-adjacency, 18-adjacency, 26-adjacency.

Suppose that κ is an adjacency relation defined on Z n . A digital image X Z n is κ-connected [15] if and only if for every pair of points { x , y } X , x y , there is a set { x 0 , x 1 , , x c } X such that x = x 0 , x c = y and x i and x i + 1 are κ-neighbors, i { 0 , 1 , , c 1 } .

Definition 1.2 Let X and Y be digital images such that X Z n 0 , Y Z n 1 . Then the digital function f : X Y is a function which is defined between digital images.

Definition 1.3 ([6]; see also [7] and [8])

Let X and Y be digital images such that X Z n 0 , Y Z n 1 . Assume that f : X Y is a function. Let κ i be an adjacency relation defined on Z n i , i { 0 , 1 } . Then f is called to be ( κ 0 , κ 1 ) -continuous if the image under f of every κ 0 -connected subset of X is κ 1 -connected.

A function which is defined in Definition 1.3 is referred to be digitally continuous. A consequence of this definition is given below.

Definition 1.4 ([6]; see also [8])

Let X and Y be digital images. Then the function f : X Y is said to be ( κ 0 , κ 1 ) -continuous if and only if for every { x , y } X such that x 0 and x 1 are κ 0 -adjacent, either f ( x 0 ) = f ( x 1 ) or f ( x 0 ) and f ( x 1 ) are κ 1 -adjacent.

Definition 1.5 ([6])

Let a , b Z , a < b . A digital interval is a set of the form
[ a , b ] Z = { z Z | a z b } ,

in which 2-adjacency is assumed.

For instance, if κ is an adjacency relation on a digital image Y, then f : [ a , b ] Z Y is ( 2 , κ ) -connected if and only if for every { c , c + 1 } [ a , b ] Z , either f ( c ) = f ( c + 1 ) or f ( c ) and f ( c + 1 ) are κ-adjacent.

Definition 1.6 ([14])

Let S be a set of nonempty subsets of a digital image ( X , κ ) . Then the members of S are called simplices of ( X , κ ) if the following hold:
  1. (a)

    If p and q are distinct points of s S , then p and q are κ-adjacent.

     
  2. (b)

    If s S and t s , then t S (note that this implies that every point p belonging to a simplex determines a simplex { p } ).

     
An m-simplex is a simplex S such that | S | = m + 1 .

Definition 1.7 ([9, 14])

Let ( X , κ ) be a finite collection of digital m-simplices, 0 m d , for some nonnegative integer d. If the following statements hold, then ( X , κ ) is called a finite digital simplicial complex:
  1. (1)

    If P belongs to X, then every face of P also belongs to X.

     
  2. (2)

    If P , Q X , then P Q is either empty or a common face of P and Q.

     

The dimension of a digital simplicial complex X is the largest integer m such that X has an m-simplex.

Example 1.8 If X is a digital simplicial complex and [ v i 0 , , v i m ] is a ( κ , m ) -simplex of X, then any subset of { v i 0 , , v i m } ( Z n , κ ) is a face of that digital simplex and thus is itself a digital simplex of X. In particular, we can think of the ( κ , m ) -simplex [ v i 0 , , v i m ] as a geometric digital simplicial complex consisting of itself and its face.

2 Digital simplicial maps

If K and L are geometric digital simplicial complexes, then a digital simplicial map f : K L is determined by taking the vertices { v i } of K to vertices { f ( v i ) } of L such that if [ v i 0 , , v i m ] is a ( κ 1 , m ) -simplex of K, then f ( v i 0 ) , , f ( v i m ) are all vertices (not necessarily unique) of some ( κ 2 , m ) -simplex in L. Given such a function K 0 L 0 , the rest of f : K L is determined by linear interpolation on each ( κ 1 , m ) -simplex (if x K can be represented by x = j = 1 m t j v i j in barycentric coordinates of the ( κ 1 , m ) -simplex spanned by the v i j , then f ( x ) = j = 1 m t j f ( v i j ) ) (see Figures 4, 5).
Figure 4

Including the simplex [ v 2 , v 3 , v 4 ] into a larger digital simplicial complex.

Figure 5

A collapse of a ( 8 , 2 ) -simplex to a ( 2 , 1 ) -simplex.

Corollary 2.1 Every digital simplicial map is digitally continuous.

Proof Let K and L be digital simplicial complexes having κ 1 and κ 2 adjacency, respectively, and let f : K L be a digital simplicial map. Since K is a simplicial complex, then the point of simplices of K have κ 1 adjacency. So, f maps the points of the simplices of K to the points of the simplices of L. Therefore the image of κ 1 -adjacent points under f is κ 2 -adjacent points. Consequently, f is ( κ 1 , κ 2 ) -continuous, i.e., digitally continuous. □

Example 2.2 A simple but interesting and important example is the inclusion of a ( κ , m ) -simplex into a digital simplicial complex. If X is a digital simplicial complex and v i 0 , , v i m is a collection of vertices of X that spans a ( κ , m ) -simplex of X, then K = [ v i 0 , , v i m ] is itself a digital simplicial complex. We then have a simplicial map K X that takes each v i j to the corresponding vertex in X and hence takes K identically to itself inside X.

Example 2.3 Let [ v 0 , v 1 , v 2 ] be a ( 8 , 2 ) -simplex, one of whose ( 8 , 1 ) -faces is [ v 0 , v 1 ] . Consider the simplicial map f : [ v 0 , v 1 , v 2 ] [ v 0 , v 1 ] , determined by f ( v 0 ) = v 0 , f ( v 1 ) = v 1 , f ( v 2 ) = v 1 , that collapses the ( 8 , 2 ) -simplex down to the ( 8 , 1 ) -simplex (see Figure 5). The great benefit of the theory of digital simplicial sets is a way to generalize these kinds of maps in order to preserve information so that we can still see the image of the ( κ , 2 ) -simplex hiding in the ( κ , 1 ) -simplex as a degenerate ( κ , m ) -simplex.

2.1 Face maps in digital images

Given a ( κ , n ) -simplex, we would like a handy way of referring to its ( n 1 ) -dimensional faces. This is handled by the face maps. On the standard ( κ , n ) -simplex, we have n + 1 face maps d 0 , , d n , defined so that d j [ 0 , , n ] = [ 0 , , j ˆ , , n ] , where, as usual, the ˆ denotes a term that is being omitted. Thus applying d j to [ 0 , , n ] yields the ( n 1 ) -face missing the vertex j. It is important to note that each d j simply assigns one of its faces to the ( κ , n ) -simplex (see Figures 6, 7).
Figure 6

[ v 2 , v 3 , v 4 ] as image of | Δ 2 | κ .

Figure 7

The face maps of | Δ 2 | 8 . Note that the arrows denote assignments and also not continuous maps of spaces.

2.2 Delta sets and delta maps in digital images

Delta sets (sometimes called Δ κ -sets) constitute an intermediary between digital simplicial complexes and digital simplicial sets.

Definition 2.4 A delta set consists of a sequence of sets X 0 , X 1 , which have κ 0 , κ 1 , adjacency respectively, and the maps d i : X n + 1 X n for each i and n 0 , 0 i n + 1 , such that d i d j = d j 1 d i whenever i < j .

Of course this is just an abstraction, and generalization, of the definition of an ordered digital simplicial complex, in which X n are the sets of ( κ , n ) -simplices and the d i are the digital face maps.

2.3 Degenerate maps in digital images

Degeneracy maps in digital images are, in some sense, the conceptual converse of face maps. Recall that the face map d j takes a ( κ , n ) -simplex and gives us back its j th ( n 1 ) -face. On the other hand, the j th digital degeneracy map s j takes a ( κ , n ) -simplex and gives us back the j th degenerate ( κ , ( n + 1 ) ) -simplex in digital images living inside it.

As usual, we illustrate with the standard ( κ , n ) -simplex, which will be a model for what happens in all digital simplicial sets. Given the standard ( κ , n ) -simplex as | Δ 2 | κ = [ 0 , , n ] , there are ( n + 1 ) -digital degeneracy maps s 0 , , s n , defined by s j [ 0 , , n ] = [ 0 , , j , j , , n ] . In other words, s j [ 0 , , n ] gives us the unique degenerate ( κ , ( n + 1 ) ) -simplex in | Δ n | κ with only the j th vertex repeated.

Again, the geometric concept is that s j | Δ n | κ can be thought of as the process of collapsing Δ n + 1 down into Δ n by the digital simplicial map π j defined by π j ( i ) = i for i < j , π j ( j ) = π j ( j + 1 ) = j and π j ( j ) = i 1 for i > j + 1 .

This idea extends naturally to digital simplicial complexes, to digital delta sets, and also to ( κ , n ) 1 simplices that are already degenerate. If we have a (possibly degenerate) ( κ , n ) -simplex [ v i 0 , , v i n ] with i k i k + 1 for each k, 0 k < n , then we set s j [ v i 0 , , v i n ] = [ v i 0 , , v i j , v i j , , v i n ] , i.e., v i j always repeats. Thus we may say that this is a digital degenerate simplex in [ v i 0 , , v i n ] .

Also, as for the d i , there are certain natural relations that the degeneracy maps possess. In particular, if i j , then s i s j [ 0 , , n ] = [ 0 , , i , i , , j , j , , n ] = s j + 1 s i [ 0 , , n ] . Note that we have s j + 1 in the last formula, not s j , since the application of s i pushes j one slot to the right.

Furthermore, there are relations amongst the face and degeneracy operators. These are a little bit advantageous to write down since there are three possibilities:

These situations are all clear. For example, applying [ 0 , , n ] to either side of the first formula yields [ 0 , , ı ˆ , , j , j , , n ] . Note also that the middle formula takes care of both i = j and i = j + 1 .

3 The structure of a simplicial set in digital images

Now we give the definition of digital simplicial sets.

Definition 3.1 A digital simplicial set consists of a sequence of sets X 0 , X 1 , which have κ 0 , κ 1 , adjacency respectively, the functions d i : X n X n 1 and s i : X n X n + 1 for each i and n 0 with 0 i n are such that

Example 3.2 If the standard ( 2 , 0 ) -simplex X = [ 0 ] is now realized as a digital simplicial set, then it is the unique digital simplicial set with one element in each X n , n 0 . Thus the element in dimension n is [ 0 , 0 , , 0 n + 1 - times ] .

Example 3.3 As a digital simplicial set, the standard ordered ( 2 , 1 ) -simplex X = [ 0 , 1 ] already has n + 2 elements in each X n . Namely, X 2 = { [ 0 , 0 , 0 ] , [ 0 , 0 , 1 ] , [ 0 , 1 , 1 ] , [ 1 , 1 , 1 ] } .

3.1 Nondegenerate simplices in digital images

A ( κ , n ) -simplex x X n is called nondegenerate if x cannot be written as s i y for any y X n 1 and any i.

Every ( κ , n ) -simplex of a digital simplicial complex or digital delta set is a nondegenerate simplex of the corresponding digital simplicial set. If Y is a topological space, then a ( κ , n ) -simplex of S ( Y ) is nondegenerate. It cannot be written as the composition Δ κ n π Δ κ k σ Y , where π is a simplicial collapse with k < n and σ is a singular ( κ , k ) -simplex (see Figures 8-10).
Figure 8

A singular ( κ , n ) -simplex.

Figure 9

A face of a singular ( κ , n ) -simplex.

Figure 10

A degenerate ( κ , n ) -singular simplex.

Note that it is possible for a nondegenerate ( κ , n ) -simplex to have a degenerate ( κ , n ) -face. It is also possible for a degenerate simplex to have a nondegenerate face (for example, we know d j s j x = x for any x, it is degenerate or not).

3.2 Categorical definition

As for digital delta sets, the basic properties of simplicial sets derive from those of the standard ordered ( κ , n ) -simplex. In fact, that is where the prototypes of both the face and degeneracy maps live and where we first developed the axioms relating them. Thus it is not surprising (at this point) that there is a categorical definition of digital simplicial sets, analogous to the one for delta sets, in which each digital simplicial set is the functorial image of a category and Δ is built from the standard digital simplices.

Definition 3.4 The category Δ κ has the finite ordered sets [ n ] κ = { 0 , 1 , 2 , , n } as objects. The morphisms of Δ κ are order-preserving functions [ m ] κ [ n ] κ .

Definition 3.5 (Categorical definition of digital simplicial set)

Let DSet be a category of digital sets, that is, DSet has digital images as objects and digital functions as morphisms. A digital simplicial set is a contravariant functor X : Δ κ DSet (equivalently, a covariant functor X : Δ κ o p DSet ).

4 Simplicial groups in digital images

Group axioms are satisfied in a finite subset of Z n , including the ( 0 , 0 , , 0 ) point.

Definition 4.1 Let G be a subset of the digital image which has κ-adjacency relation. A simplicial group G in digital images consists of a sequence of groups G n and collections of group homomorphisms d i : G n G n 1 and s i : G n G n + 1 , 0 i n , that satisfy the following axioms:
An example of a simplicial group in a digital image can be seen in Figure 11.
Figure 11

A pictoral representation of a ( 8 , 2 ) -simplex of a simplicial group with arrows representing the face morphisms from dimension 2 to dimension 1 and from dimension 1 to dimension 0.

Example 4.2 Suppose X is a digital simplicial set with κ-adjacency. Then we may define the simplicial group C ( X ) having ( C X ) n = C n ( X ) as a free abelian group generated by the elements of X n with d i and s i in C ( X ) taken to be linear extensions of the face maps d i and s i of X.

We can also present the total face map d = i = 0 n ( 1 ) i d i : C n ( X ) C n 1 ( X ) and then define the homology H ( X ) as the homology of the chain complex ( C ( X ) , d ) .

Example 4.3 Let us give a remarkable example for a simplicial group in digital images, which is important in the theory of homology of groups in digital images. Assume that G is a group of digital images and DG is the simplicial group defined as follows. Let D G n = G × n be the product of G with itself n times. Thus G × 0 is just the trivial group { e } . For an element ( g 1 , , g n ) D G n , let

This defines a simplicial group in digital images. The realization of an underlying digital simplicial set turns out to be the classifying space of the group G, and so the homology H ( D G ) coincides with group homology of the group G.

5 Digital homology groups of simplicial groups

In this section, we consider X as a digital simplicial group, and we use the method of calculations given by [14] and [9].

Definition 5.1 C n ( X ) is a free abelian group with basis of all digital ( κ , n ) -simplices in X.

Corollary 5.2 Let X be an m-dimensional digital simplicial group with κ-adjacency. Then if q > m , then C q κ ( X ) is a trivial group.

Definition 5.3 Let ( X , κ ) Z n be an m-dimensional digital simplicial group. The homomorphism q : C q κ ( X ) C q 1 κ ( X ) defined by
q ( x 0 , , x q ) = { i = 0 q ( 1 ) i p 0 , , p ˆ i , , p q , q m , 0 , q > m

is called boundary homomorphism. (Here p ˆ i denotes the deletion of the point p i .)

Proposition 5.4 n 1 n = 0 for 1 n m . (See [9, 14]).

Proof Let Δ = [ x 0 , , x n ] be a ( κ , n ) -simplex. Then
n 1 n ( Δ ) = n 1 ( n [ x 0 , , x n ] ) = n 1 ( i = 1 n ( 1 ) i [ x 0 , , x ˆ i , , x n ] ) = i = 1 n ( 1 ) i [ j = 1 n ( 1 ) j [ x 0 , , x ˆ j , , x ˆ i , , x n ] ] + j = i + 1 n ( 1 ) j 1 [ x 0 , , x ˆ i , , x ˆ j , , x n ] = j < i n ( 1 ) i + j [ x 0 , , x ˆ j , , x ˆ i , , x n ] + i < j n ( 1 ) i + j 1 [ x 0 , , x ˆ i , , x ˆ j , , x n ] = i j ( ( 1 ) i + j + ( 1 ) i + j 1 ) [ x 0 , , x ˆ j , , x ˆ i , , x n ] = 0 .

 □

Definition 5.5 Let X be a digital simplicial group with κ-adjacency. Then
H q κ ( X ) = Z q κ ( X ) B q κ ( X ) = Ker q Im q + 1

is called the q th digital homology group, where Z q κ ( X ) = Ker q is the groups of digital simplicial q-cycles and B q κ ( X ) = Im q + 1 is the groups of digital simplicial q-boundaries.

Proposition 5.6 Let X 0 = [ 0 ] be a ( 2 , 0 ) -simplex. Then H 0 2 ( X 0 ) Z .

Proof Consider the X 0 = [ 0 ] , ( 2 , 0 ) -simplex which is shown as

So, C 0 2 ( X 0 ) = 0 Z ve C i 2 ( X 0 ) = { 0 } , i 1 .

Then we get the short sequence as follows:

Since Z 0 κ ( X 0 ) = Ker 0 = C 0 2 ( X 0 ) Z , then B 0 κ ( X 0 ) = Im 1 = { 0 } .

Consequently, H 0 κ ( X 0 ) = Z 0 κ ( X 0 ) B 0 κ ( X 0 ) = Ker 0 Im 1 Z . □

Proposition 5.7 Let X 1 = [ 0 , 1 ] be ( 8 , 1 ) -simplex. Then
H q κ ( X 1 ) = { Z , q = 0 , 0 , q > 0 .
Proof Consider the X 1 = [ 0 , 1 ] , ( 8 , 1 ) -simplex as follows.
Let us choose the direction as 0 < 1 . Thus H q 8 ( X 1 ) { 0 } for q > 1 . Then C 0 8 ( X 1 ) and C 1 8 ( X 1 ) are free abelian groups induced by the following basis, respectively:
Hence we get the following short sequence:
We may point out:

Thus Z 1 8 ( X 1 ) = { 0 } . Therefore H 1 8 ( X 0 ) = Z 1 8 ( X 0 ) B 1 8 ( X 0 ) = Ker 1 Im 2 { 0 } . □

Proposition 5.8 Let X 2 = [ 0 , 1 , 2 ] be ( 8 , 2 ) -simplex. Then
H q 8 ( X 1 ) = { Z , q = 0 , 0 , q > 0 .
Proof Consider the X 2 = [ 0 , 1 , 2 ] , ( 8 , 2 ) -simplex as follows.
Choosing the direction is 0 < 1 < 2 for this simplex, then H q 8 ( X 1 ) { 0 } for q > 2 . On the other hand, C 0 8 ( X 2 ) , C 1 8 ( X 2 ) and C 2 8 ( X 2 ) are free abelian groups induced by the following basis, respectively:
Hence, we get the following short sequence:
Here B 2 8 ( X 2 ) = Im 3 = { 0 } .
2 ( a 0 , 1 , 2 ) = a ( 1 , 2 0 , 2 + 0 , 1 ) .

So, Z 2 8 ( X 2 ) = { 0 } . Thus H 2 8 ( X 2 ) = { 0 } .

From the description of 2 , we get
B 1 8 ( X 2 ) = { a ( 0 , 1 + 1 , 2 0 , 2 ) | a Z }
and
1 ( a 0 , 1 + b 1 , 2 + c 0 , 2 ) = ( a b ) 0 + ( a c ) 1 + ( b + c ) 2 = 0 .
Therefore a = b = c , so
Z 1 8 ( X 2 ) = { a ( 0 , 1 + 1 , 2 0 , 2 ) | a Z } = B 1 8 ( X 2 ) .
Thus H 1 8 ( X 2 ) = { 0 } . Hence

Therefore B 0 8 ( X 2 ) = Z 2 .

By using a short sequence again, we obtain
Z 0 8 ( X 2 ) = { a 0 + b 1 + c 2 | a , b , c Z , a + b + c = 0 } Z 3 .

Then H 0 8 ( X 2 ) = Z 0 8 ( X 2 ) B 0 8 ( X 2 ) = Z .

Consequently,
H q 8 ( X 2 ) = { Z , q = 0 , 0 , q > 0 .

 □

Theorem 5.9 Let X be a digital simplicial group of dimension 2 with 8-adjacency, then
H q 8 ( X ) = { Z , q = 0 , 0 , q > 0 .

Proof

Considering Propositions 5.6, 5.7 and 5.8, we have
H q 8 ( X ) = { Z , q = 0 , 0 , q > 0 .

 □

6 Conclusion

In this paper we introduce the simplicial groups in digital images, and we calculate digital homology group of two-dimensional simplicial group.

Declarations

Acknowledgements

Dedicated to Professor Hari M Srivastava.

The authors thank the editor and the referees for their valuable suggestions to improve the quality of this paper.

Authors’ Affiliations

(1)
Mathematics Department, Faculty of Science and Arts, Celal Bayar University

References

  1. Rosenfeld A: Continuous functions on digital pictures. Pattern Recognit. Lett. 1986, 4: 177–184. 10.1016/0167-8655(86)90017-6View ArticleGoogle Scholar
  2. Han SE: Computer topology and its applications. Honam Math. J. 2003, 25: 153–162.MathSciNetGoogle Scholar
  3. Kong TY: A digital fundamental group. Comput. Graph. 1989, 13: 159–166. 10.1016/0097-8493(89)90058-7View ArticleGoogle Scholar
  4. Kong TY, Roscoe AW, Rosenfeld A: Concepts of digital topology. Topol. Appl. 1992, 46: 219–262. 10.1016/0166-8641(92)90016-SMathSciNetView ArticleGoogle Scholar
  5. Malgouyres R: Homotopy in 2-dimensional digital images. Theor. Comput. Sci. 2000, 230: 221–233. 10.1016/S0304-3975(98)00347-8MathSciNetView ArticleGoogle Scholar
  6. Boxer L: Digitally continuous functions. Pattern Recognit. Lett. 1994, 15: 833–839. 10.1016/0167-8655(94)90012-4View ArticleGoogle Scholar
  7. Boxer L: A classical construction for the digital fundamental group. J. Math. Imaging Vis. 1999, 10: 51–62. 10.1023/A:1008370600456MathSciNetView ArticleGoogle Scholar
  8. Boxer L: Properties of digital homotopy. J. Math. Imaging Vis. 2005, 22: 19–26. 10.1007/s10851-005-4780-yMathSciNetView ArticleGoogle Scholar
  9. Karaca I, Boxer L, Öztel A: Topological invariants in digital images. J. Math. Sci.: Adv. Appl. 2011, 11(2):109–140.MathSciNetGoogle Scholar
  10. Karaca I, Boxer L: Some properties of digital covering spaces. J. Math. Imaging Vis. 2010, 37: 17–26. 10.1007/s10851-010-0189-3MathSciNetView ArticleGoogle Scholar
  11. Karaca I, Boxer L: The classification of digital covering spaces. J. Math. Imaging Vis. 2008, 32: 23–29. 10.1007/s10851-008-0088-zMathSciNetView ArticleGoogle Scholar
  12. Kan DM: A combinatorial definition of homotopy groups. Ann. Math. 1958, 61: 288–312.Google Scholar
  13. Freidman G: An elementary illustrated introduction to simplicial set. Rocky Mt. J. Math. 2011, 42: 353–424.View ArticleGoogle Scholar
  14. Arslan H, Karaca I, Öztel A: Homology groups of n -dimensional digital images. XXI. Turkish National Mathematics Symposium 2008. B1–13Google Scholar
  15. Herman GT: Oriented surfaces in digital spaces. CVGIP, Graph. Models Image Process. 1993, 55: 381–396. 10.1006/cgip.1993.1029View ArticleGoogle Scholar
  16. Khalimsky E: Motion, deformation, and homotopy in finite spaces. Proceedings IEEE Intl. Conf. on Systems, Man, and Cybernetics 1987, 227–234.Google Scholar
  17. Munkres JR: Topology a First Course. Prentice Hall International, Englewood Cliffs; 1975.Google Scholar
  18. Mutlu A, Mutlu B, Öztunç S: On digital homotopy of digital paths. Res. J. Pure Algebra 2012, 2(6):147–154.Google Scholar
  19. Öztunç S, Mutlu A: Categories in digital images. Am. J. Math. Stat. 2013, 3(1):62–66.Google Scholar

Copyright

© Öztunç et al.; licensee Springer 2013

This article is published under license to BioMed Central Ltd. This is an Open Access article distributed under the terms of the Creative Commons Attribution License (http://creativecommons.org/licenses/by/2.0), which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.