PROPERTIES OF NETWORKS BUILT ON DIGITAL IMAGES
Background. It is known that some important properties of natural-language texts can be revealed when mapping a text on a network and studying the properties of this network. Here the words of a text are regarded as nodes and their co-occurrences as links. Materials and Methods. Drawing an analog...
Saved in:
| Main Authors: | , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Ivan Franko National University of Lviv
2025-03-01
|
| Series: | Електроніка та інформаційні технології |
| Subjects: | |
| Online Access: | http://publications.lnu.edu.ua/collections/index.php/electronics/article/view/4778 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1850167712349683712 |
|---|---|
| author | Oleh Kushnir Oleksiy Kravchuk Volodymyr Franiv |
| author_facet | Oleh Kushnir Oleksiy Kravchuk Volodymyr Franiv |
| author_sort | Oleh Kushnir |
| collection | DOAJ |
| description | Background. It is known that some important properties of natural-language texts can be revealed when mapping a text on a network and studying the properties of this network. Here the words of a text are regarded as nodes and their co-occurrences as links.
Materials and Methods. Drawing an analogy between texts and digital images, in this work we study experimentally and analyze phenomenologically the properties of a network built on an image. In this network, the nodes are pixel values and the links are assigned among those pixel values that spatially adjoin each other in an image. The neighborhood of pixels is defined by a radius r (r = 1, 2, ...). We build our networks for a test informative image and the corresponding images obtained from the initial one by adding calibrated portions of white Gaussian noise. Both weighted and non-weighted networks are analyzed and a number of practical methods for building an image network and adding a noise to an image are compared with each other.
Results and Discussion. The main network parameters such as the average clustering coefficient and the average shortest-path length are measured as functions of the relative noise parameter. The main qualitative and quantitative features of the dependences are analyzed. The network characteristics are critically compared with those known for the lexical networks build upon the natural texts and the random texts obtained with randomizing words in the initial natural text. The main similarities and distinctions of the lexical and image networks are scrutinized.
Conclusion. It is shown that the average clustering coefficient and path length for the networks built upon the initial informative image and the corresponding noisy images are essentially small worlds. In spite of this similarity, the above networks reveal a number of distinct features so that the dependences of the image-network parameters on the noise level can be used for distinguishing between these types of images. Finally, we analyze a number of consequences of our empirical results and some data known from the literature. Since both informative and noisy images reveal a small-worldliness, it would hardly be appropriate to associate this effect with the information load of the image. |
| format | Article |
| id | doaj-art-9dfa776c4dd24b2f933f68ff990183b4 |
| institution | OA Journals |
| issn | 2224-087X 2224-0888 |
| language | English |
| publishDate | 2025-03-01 |
| publisher | Ivan Franko National University of Lviv |
| record_format | Article |
| series | Електроніка та інформаційні технології |
| spelling | doaj-art-9dfa776c4dd24b2f933f68ff990183b42025-08-20T02:21:09ZengIvan Franko National University of LvivЕлектроніка та інформаційні технології2224-087X2224-08882025-03-0129132810.30970/eli.29.2PROPERTIES OF NETWORKS BUILT ON DIGITAL IMAGESOleh Kushnir0https://orcid.org/0000-0002-1545-7666Oleksiy Kravchuk1https://orcid.org/0009-0000-8558-5957Volodymyr Franiv2https://orcid.org/0000-0001-9856-1962Department of Optoelectronics and Information Technologies, Ivan Franko National University of LvivDepartment of Optoelectronics and Information Technologies, Ivan Franko National University of LvivDepartment of Optoelectronics and Information Technologies, Ivan Franko National University of LvivBackground. It is known that some important properties of natural-language texts can be revealed when mapping a text on a network and studying the properties of this network. Here the words of a text are regarded as nodes and their co-occurrences as links. Materials and Methods. Drawing an analogy between texts and digital images, in this work we study experimentally and analyze phenomenologically the properties of a network built on an image. In this network, the nodes are pixel values and the links are assigned among those pixel values that spatially adjoin each other in an image. The neighborhood of pixels is defined by a radius r (r = 1, 2, ...). We build our networks for a test informative image and the corresponding images obtained from the initial one by adding calibrated portions of white Gaussian noise. Both weighted and non-weighted networks are analyzed and a number of practical methods for building an image network and adding a noise to an image are compared with each other. Results and Discussion. The main network parameters such as the average clustering coefficient and the average shortest-path length are measured as functions of the relative noise parameter. The main qualitative and quantitative features of the dependences are analyzed. The network characteristics are critically compared with those known for the lexical networks build upon the natural texts and the random texts obtained with randomizing words in the initial natural text. The main similarities and distinctions of the lexical and image networks are scrutinized. Conclusion. It is shown that the average clustering coefficient and path length for the networks built upon the initial informative image and the corresponding noisy images are essentially small worlds. In spite of this similarity, the above networks reveal a number of distinct features so that the dependences of the image-network parameters on the noise level can be used for distinguishing between these types of images. Finally, we analyze a number of consequences of our empirical results and some data known from the literature. Since both informative and noisy images reveal a small-worldliness, it would hardly be appropriate to associate this effect with the information load of the image.http://publications.lnu.edu.ua/collections/index.php/electronics/article/view/4778complex networksanalysis and classification of imagesimage recognitioninformation and noise detectionsemanticsrandom models. |
| spellingShingle | Oleh Kushnir Oleksiy Kravchuk Volodymyr Franiv PROPERTIES OF NETWORKS BUILT ON DIGITAL IMAGES Електроніка та інформаційні технології complex networks analysis and classification of images image recognition information and noise detection semantics random models. |
| title | PROPERTIES OF NETWORKS BUILT ON DIGITAL IMAGES |
| title_full | PROPERTIES OF NETWORKS BUILT ON DIGITAL IMAGES |
| title_fullStr | PROPERTIES OF NETWORKS BUILT ON DIGITAL IMAGES |
| title_full_unstemmed | PROPERTIES OF NETWORKS BUILT ON DIGITAL IMAGES |
| title_short | PROPERTIES OF NETWORKS BUILT ON DIGITAL IMAGES |
| title_sort | properties of networks built on digital images |
| topic | complex networks analysis and classification of images image recognition information and noise detection semantics random models. |
| url | http://publications.lnu.edu.ua/collections/index.php/electronics/article/view/4778 |
| work_keys_str_mv | AT olehkushnir propertiesofnetworksbuiltondigitalimages AT oleksiykravchuk propertiesofnetworksbuiltondigitalimages AT volodymyrfraniv propertiesofnetworksbuiltondigitalimages |