Computing hypercrossed complex pairings in digital images (Q2318957): Difference between revisions
From MaRDI portal
Removed claim: author (P16): Item:Q370117 |
ReferenceBot (talk | contribs) Changed an Item |
||
(3 intermediate revisions by 3 users not shown) | |||
Property / author | |||
Property / author: Necdet Bıldık / rank | |||
Normal rank | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.1155/2013/675373 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W2072497861 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Digitally continuous functions / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4904914 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Group-theoretic algebraic models for homotopy types / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4219215 / rank | |||
Normal rank |
Latest revision as of 05:31, 20 July 2024
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