TWO-LAYER GRAPH INVARIANT FOR PATTERN RECOGNITION
DOI:
https://doi.org/10.15588/1607-3274-2025-2-7Keywords:
physical object, weighted undirected graph, isomorphism, minimal (maximal) spanning tree of a model graph, graph invariant, pattern recognition, algorithm, methodAbstract
Context. The relevance of the article is driven by the need for further development of object recognition (classification) algorithms, reducing computational complexity, and increasing the functional capabilities of such algorithms. The graph invariant proposed in the article can be applied in machine vision systems for recognizing physical objects, which is essential during rescue and monitoring operations in crisis areas of various origins, as well as in delivering firepower to the enemy using swarms of unmanned aerial vehicles.
Objective is to develop a graph invariant with low computational complexity that enables the classification of physical objects with a certain level of confidence in the presence of external interference.
Method. The physical object to be recognized (identified) is modeled by a connected undirected weighted graph. To identify theconstant characteristics of different model graphs, the idea of selecting the minimum and maximum weighted spanning trees in the structure of these graphs is applied. For this purpose, the classical and modified Boruvka-Sollin’s method are used (modified – for constructing the maximum weighted spanning tree). Such a stratification of the structure of the initial graph into two layers provides a larger information base during image analysis regarding the belonging of a certain implementation to a certain class of objects. Next, for each of the resulting spanning trees, two numerical characteristics are calculated: the weight of the spanning tree and the Randić index. The first characteristic contains indirect information about the linear dimensions of the object, while the second conveys its structural features. These characteristics are independent of vertex labeling and the graphical representation of the graph, which is a necessary condition for graph isomorphism verification. From these four obtained characteristics, an invariant is formed, which describes the corresponding physical object present in a single scene. To fully describe one class or subclass of objects in four scenes (top view; front and rear hemispherical views; side view), the pattern recognition system must have four corresponding invariants.
Results. 1) A two-layer invariant of a weighted undirected graph has been developed, enabling the recognition of physical objects with a certain level of confidence; 2) A method for recognizing physical objects has been formalized in graph theory terms, based on hashing the object structure using the weights of the minimum and maximum spanning trees of the model graph, as well as the Randić index of these trees; 3) The two-layer invariant of the weighted undirected graph has been verified on test tasks for graph isomorphism checking.
Conclusions. The conducted theoretical studies and a series of experiments confirm the feasibility of using the proposed graph invariant for real-time pattern recognition and classification tasks. The estimates obtained using the developed method are probabilistic, allowing the system operator to flexibly approach the classification of physical objects within the machine vision system’s field of view, depending on the technological process requirements or the operational situation in the system’s deployment area.
References
Dotsenko V. Drone Armies. How Drones Are ReplacingArtillery, Aviation, and Boats in the War in Ukraine [Electronic resource]. Access mode: https://forbes.ua/war-in-ukraine/armii-droniv-yak-uviyni-v-ukraini-bpla-zaminyuyut-artileriyu-aviatsiyu-ikateri-06122022-10273.
Girnyk E. Ukraine creates “drone swarm” capable of attacking without human intervention – The Times [Electronic resource]. Access mode: https://unian.net/weapons/voyna-dronov-ukrainasozdaet-bespilotniki-kotorye-ubivayut-roem-the-times-12674718.html.
Christofides N. Theory of graphs. Algorithmic approach. Moscow, Mir, 1978, 432 p.
Berge C. Isomorphism problems forhypergraphs, Mathematical centre tracts, 1974, pp. 3–12. DOI: 10.1007/BFb0066174.
Corneil D. G., Gotlieb C. C. An efficient algorithm for Graph isomorphism, J. of A.C.M.,1970, Vol. 17, No. 1, pp. 51–64. DOI: 10.1145/321556.321562.
A’Ggel Al-Zabi Bilal Rady, Kernytsky A. B., Lobur M. V., et al. New invariants for establishing graph isomorphisms, Academic Journals and Conferences, 2008, Vol. 626, pp. 90–93.
McCarthy M. K., Davida G. J. Invariant features and the graph isomorphism problem, IEEE Syst. Man and Cybern. Soc. Proc. Int. Conf. Cybern and Soc. Boston, Mass, 1973, pp. 81–85.
Foggia P., Sansone C., Vento M. A performance comparison of five algorithms for graph isomorphism, In Proc. 3rd IAPR-TC15 Workshop Graph-Based Representations in Pattern Recognition, 2001, pp. 188–199.
Messmer B. T., Bunke H. Efficient subgraphisomorphismdetection: a decomposition approach, IEEE Trans. Knowl. Data Eng, 2000, Vol. 12, pp. 307–323. DOI: 10.1109/69.842269.
Conte D., Foggia P., Sansone C. et al. Thirtyyears of Graph Matching in pattern Recognition, International Journal of Pattern Recognition and Artificial Intelligence, 2004, Vol. 18, No. 3, pp. 265–298. DOI:10.1142/S0218001404003228.
Automatic generation of graphs and graphs identification problem, Technical Report, april, 1974, No. 16.
Dunaev A. A. Using Graph Theory for Face Identification, International Research Journal, 2017, Vol. 09(63), Issue 3. pp. 31–35. DOI:
23670/IRJ.2017.63.089.
Floyd R. Algorithm 97: Shortest Path, Communications of the ACM, 1961, Vol. 5 (6), 345 p. DOI: 10.1145/367766.368168.
Warshall S. Algorithm on Boolean matrices, Journal of the ACM, 1962, Vol. 9 (1), pp. 11–12. DOI: 10.1145/321105.321107.
Batsamut V., Manzura S., Kosiak O. et al. Fast Algorithm for Calculating Transitive Closures of Binary Relations in the Structure of a Network Object, International Journal of Computing, 2021, Vol. 20(4), pp. 560–566. DOI: 10.47839/ijc.20.4.2444.
Graph invariant[Electronic resource]. Access mode: https://uk.wikipedia.org/wiki/Інваріант_графа.
Delorme С., Favaron O., Rautenbach D. On the Randić index, Discrete Mathematics, 6 November, 2002, Vol. 257, Issue 1, pp. 29–38. DOI: 10.1016/S0012-365X(02)00256-X.
Messom C. H., Barczak A.L.C. Fast and Efficient Rotated Haar-like Features Using Rotated Integral Images, Australian Conference on Robotics and Automation (ACRA 2006),2006,pp. 1–6.
Lienhart R., Maydt J. An Extended Set of Haar-like Features for Rapid Object Detection, IEEE ICIP Sep., 2002, Vol. 1, pp. 900–903. DOI: 10.1109/ICIP.2002.1038171.
Bernardin K., Camp F. V. D., Stiefelhagen R. Automatic person detection and tracking using fuzzy controlled active cameras, In: Proc. IEEE Computer Society Conference on Computer Vision and Pattern Recognition, 2007, pp. 1–8. DOI: 10.1109/CVPR.2007.383502.
Faridawaty Marpaung, Arnita, Wirdatull Jannah Idris Comperative of Prim’s, Kruskal’s and Boruvka’s algoritma to solve minimum spanning tree problems, Jurnal Handayani, 2019, Vol. 10, No. 2, pp. 80–89. DOI:10.24114/jh.v10i2.16053.
Kruskal J. On the Shortest Spanning Subtree of a Graph and the Traveling Salesman Problem, Proc. AMS, 1956, Vol. 7, No. 1, pp. 48–50. DOI: 10.1090/S0002-9939-1956-0078686-7.
Dovbysh A. S., Shelekhov I. V. Fundamentals of Pattern Recognition Theory. Sumy, Sumy State University, 2015, Vol. 1, 109 p.
Boruvka’s algorithm [Electronic resource]. Access mode: https://uk.wikipedia.org/wiki/Алгоритм_Борувки.
Downloads
Published
How to Cite
Issue
Section
License
Copyright (c) 2025 V. M. Batsamut, M. V. Batsamut, Y. H. Bashkatov, D. Yu. Tolstonosov

This work is licensed under a Creative Commons Attribution-ShareAlike 4.0 International License.
Creative Commons Licensing Notifications in the Copyright Notices
The journal allows the authors to hold the copyright without restrictions and to retain publishing rights without restrictions.
The journal allows readers to read, download, copy, distribute, print, search, or link to the full texts of its articles.
The journal allows to reuse and remixing of its content, in accordance with a Creative Commons license СС BY -SA.
Authors who publish with this journal agree to the following terms:
-
Authors retain copyright and grant the journal right of first publication with the work simultaneously licensed under a Creative Commons Attribution License CC BY-SA that allows others to share the work with an acknowledgement of the work's authorship and initial publication in this journal.
-
Authors are able to enter into separate, additional contractual arrangements for the non-exclusive distribution of the journal's published version of the work (e.g., post it to an institutional repository or publish it in a book), with an acknowledgement of its initial publication in this journal.
-
Authors are permitted and encouraged to post their work online (e.g., in institutional repositories or on their website) prior to and during the submission process, as it can lead to productive exchanges, as well as earlier and greater citation of published work.