Affiliation:
1. Università di Salerno, Italy
Abstract
Many computer vision applications require a comparison between two objects, or between an object and a reference model. When the objects or the scenes are represented by graphs, this comparison can be performed using some form of graph matching. The aim of this chapter is to introduce the main graph matching techniques that have been used for computer vision, and to relate each application with the techniques that are most suited to it.
Reference211 articles.
1. A parallel algorithm for graph matching and its MasPar implementation
2. A linear programming approach for the weighted graph matching problem
3. Graph Edit Distance with Node Splitting and Merging, and Its Application to Diatom Identification
4. Ambler, A. P., Barrow, H. G., Brown, C. M., Burstall, R. M., & Popplestone, R. J. (1973). A versatile computer-controlled assembly system. Proceedings of the 3rd International Joint Conference on Artificial Intelligence, (pp. 298-307).
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. A Short Survey of Recent Advances in Graph Matching;Proceedings of the 2016 ACM on International Conference on Multimedia Retrieval;2016-06-06