Abstract
The problem of matching two graphs has been considered by many researchers. Our research, the WWW CBIR searching using Query by Approximate Shapes is based on decomposing a query into a graph of primitives, which stores in nodes the type of a primitive with its attributes and in edges the mutual position relations of connected nodes. When the graphs of primitives are stored in a multimedia database used for World Wide Web CBIR searching, the methods of comparisons should be effective because of a very huge number of stored data. Finding such methods was a motivation for this research. In this initial research only the simplest methods are examined: NEH-based, random search-based and Greedy.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Similar content being viewed by others
References
A graph matching approach based on aggregated search. In: 2017 13th International Conference on 2017 13th International Conference on Signal-Image Technology & Internet-Based Systems (SITIS), Signal-Image Technology & Internet-Based Systems (SITIS), SITIS, p. 376 (2017)
Deep learning of graph matching. In: 2018 IEEE/CVF Conference on 2018 IEEE/CVF Conference on Computer Vision and Pattern Recognition, Computer Vision and Pattern Recognition (CVPR), CVPR, p. 2684 (2018)
Deniziak, R.S., Michno, T.: World wide web cbir searching using query by approximate shapes. In: Rodríguez, S., Prieto, J., Faria, P., Kłos, S., Fernández, A., Mazuelas, S., Jiménez-López, M.D., Moreno, M.N., Navarro, E.M. (eds.) Distributed Computing and Artificial Intelligence, Special Sessions, 15th International Conference, pp. 87–95. Springer, Cham (2019)
Deniziak, S., Michno, T.: New content based image retrieval database structure using query by approximate shapes. In: 2017 Federated Conference on Computer Science and Information Systems (FedCSIS), pp. 613–621, September 2017
Lin, X., Niu, D., Zhao, X., Yang, B., Zhang, C.: A novel method for graph matching based on belief propagation. Neurocomputing 325, 131–141 (2019)
Nawaz, M., Enscore Jr., E.E., Ham, I.: A heuristic algorithm for the m-machine, n-job flow-shop sequencing problem. Omega 11(1), 91–95 (1983)
Pinheiro, M.A., Kybic, J.: Incremental B-spline deformation model for geometric graph matching. In: 2018 IEEE 15th International Symposium on Biomedical Imaging (ISBI 2018), pp. 1079–1082, April 2018
Plummer, M.D.: Matching theory—a sampler: from Dénes König to the present. Discret. Math. 100(1), 177–219 (1992)
Wang, T., Ling, H., Lang, C., Feng, S.: Graph matching with adaptive and branching path following. IEEE Trans. Pattern Anal. Mach. Intell. 40(12), 2853–2867 (2018)
Wu, Y., Gong, M., Ma, W., Wang, S.: High-order graph matching based on ant colony optimization. Neurocomputing 328, 97–104 (2019). Chinese Conference on Computer Vision 2017
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2020 Springer Nature Switzerland AG
About this paper
Cite this paper
Deniziak, R.S., Michno, T. (2020). Graph of Primitives Matching Problem in the World Wide Web CBIR Searching Using Query by Approximate Shapes. In: Herrera-Viedma, E., Vale, Z., Nielsen, P., Martin Del Rey, A., Casado Vara, R. (eds) Distributed Computing and Artificial Intelligence, 16th International Conference, Special Sessions. DCAI 2019. Advances in Intelligent Systems and Computing, vol 1004. Springer, Cham. https://doi.org/10.1007/978-3-030-23946-6_9
Download citation
DOI: https://doi.org/10.1007/978-3-030-23946-6_9
Publisher Name: Springer, Cham
Print ISBN: 978-3-030-23945-9
Online ISBN: 978-3-030-23946-6
eBook Packages: Intelligent Technologies and RoboticsIntelligent Technologies and Robotics (R0)