Computing hypercrossed complex pairings in digital images (Q2318957)
From MaRDI portal
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Computing hypercrossed complex pairings in digital images |
scientific article |
Statements
Computing hypercrossed complex pairings in digital images (English)
0 references
16 August 2019
0 references
Summary: We consider an additive group structure in digital images and introduce the commutator in digital images. Then we calculate the hypercrossed complex pairings which generates a normal subgroup in dimension 2 and in dimension 3 by using 8-\textit{adjacency} and 26-\textit{adjacency}.
0 references