Computing Hypercrossed Complex Pairings in Digital Images
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-adjacency and 26-adjacency.
Saved in:
| Main Authors: | Simge Öztunç, Ali Mutlu, Necdet Bildik |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Wiley
2013-01-01
|
| Series: | Abstract and Applied Analysis |
| Online Access: | http://dx.doi.org/10.1155/2013/675373 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
-
On Common Coupled Fixed Point Theorems for Comparable Mappings in Ordered Partially Metric Spaces
by: Ali Mutlu, et al.
Published: (2014-01-01) -
A Comparison between Adomian Decomposition and Tau Methods
by: Necdet Bildik, et al.
Published: (2013-01-01) -
Distances and other measures of nearness in a set of pairs of black-and-white digital images
by: P. G. Parfenov, et al.
Published: (2007-03-01) -
Doubling multiplexed imaging capability via spatial expression pattern-guided protein pairing and computational unmixing
by: Gyuri Kim, et al.
Published: (2025-06-01) -
Characterization, Antibacterial Evaluation and Computational Study of Synthesized 4,5‐bis(Hydroxymethyl)‐2‐Methylpyridin‐3‐ol Tetraphenylborate Ion‐Pair Complex
by: Ahmed H. Bakheit, et al.
Published: (2025-03-01)