On Recognition of Graphs and Images
- Authors: Leontiev V.K.1, Gordeev E.N.2
-
Affiliations:
- Computer Science and Control Federal Research Center
- Bauman Moscow State Technical University
- Issue: Vol 28, No 4 (2018)
- Pages: 737-746
- Section: Representation, Processing, Analysis, and Understanding of Images
- URL: https://journals.rcsi.science/1054-6618/article/view/195496
- DOI: https://doi.org/10.1134/S1054661818040235
- ID: 195496
Cite item
Abstract
This paper discusses the possibility of using the classical results of graph theory related to reconstruction and recognition of graphs and their characteristics in the field of image recognition. Two heuristic approaches are proposed to estimate the adequacy of object images. Various aspects of the problem of graph description (representation) with the use of graph invariants are analyzed. New classes of invariants that can be used to construct the heuristics mentioned above are introduced and investigated. In addition, some statements concerning two aspects of the problem—the formation of complex invariants taking into account the basic and functional dependences among invariants—are proved.
About the authors
V. K. Leontiev
Computer Science and Control Federal Research Center
Author for correspondence.
Email: vkleontiev@yandex.ru
Russian Federation, Vavilova str. 44, Building 2, Moscow, 119333
E. N. Gordeev
Bauman Moscow State Technical University
Email: vkleontiev@yandex.ru
Russian Federation, 2-ya Baumanskaya ul. 5/1, Moscow, 105005
Supplementary files
