On Recognition of Graphs and Images
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.
Keywordsrecognition feature tables heuristics reconstruction graph graph invariant chromatic number independence number external stability number and internal stability number
Unable to display preview. Download preview PDF.
- 1.Yu. I. Zhuravlev, “On an algebraic approach to the solution of pattern recognition and classification problems,” Problemy Kibernet. No. 33, 5–68 (1978) [in Russian].Google Scholar
- 4.I. Yu. Torshin and K. V. Rudakov, “On the application of the combinatorial theory of solvability to the analysis of chemographs. Part 2: Local completeness of invariants of chemographs in view of the combinatorial theory of solvability,” Pattern Recogn. Image Anal. 24 (2), 196–208 (2014).CrossRefGoogle Scholar
- 5.M. Gary and D. Johnson, Computers and Intractability: A Guide to the Theory of NP–Completeness (Freeman, New York, 1979; Mir, Moscow, 1982).Google Scholar
- 6.W. T. Tutte, Graph Theory (Cambridge Univ. Press, 2001; Mir, Moscow, 1988).Google Scholar
- 10.V. K. Leontiev, Combinatorics and Information (Mosk. Fiz.–Tekh. Inst., Moscow, 2015) [in Russian].Google Scholar