We propose a new strategy for solving the non-bijective graph matching problem in model-based pattern recognition. The search for the best correspondence between a model and an over-segmented image is formulated as a combinatorial optimization problem, defined by the relational attributed graphs representing the model and the image where recognition has to be performed, together with the node and edge similarities between them. A randomized construction algorithm is proposed to build feasible solutions to the problem. Two neighborhood structures and a local search procedure for solution improvement are also proposed. Computational results are presented and discussed, illustrating the effectiveness of the combined approach involving randomized construction and local search. © Springer-Verlag 2004.
CITATION STYLE
Boeres, M. C., Ribeiro, C. C., & Bloch, I. (2004). A Randomized heuristic for scene recognition by graph matching. Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 3059, 100–113. https://doi.org/10.1007/978-3-540-24838-5_8
Mendeley helps you to discover research relevant for your work.