Graph matching on a low-cost and parallel architecture

Authors:
David Rodenas;Francesc Serratosa;Albert Solé
Affiliations:
Universitat Rovira i Virgili, Departament d'Enginyeria Informàtica i Matemàtiques;Universitat Rovira i Virgili, Departament d'Enginyeria Informàtica i Matemàtiques;Universitat Rovira i Virgili, Departament d'Enginyeria Informàtica i Matemàtiques
Venue:
IbPRIA'11 Proceedings of the 5th Iberian conference on Pattern recognition and image analysis
Year:
2011

Citing 2
Cited 0

Vector and parallel computing for matrix balancing

Annals of Operations Research
A Graduated Assignment Algorithm for Graph Matching

IEEE Transactions on Pattern Analysis and Machine Intelligence

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper presents a new parallel algorithm to compute the graph-matching based on the Graduated Assignment. The aim of this paper is to perform graph matching in a current desktop computer, but, instead of executing the code in the generic processor, we execute a parallel code in the graphic processor unit. This computer can be embedded in a low-cost pattern recognition system or a mobile robot. Experiments show a speed-up of the run time around 400 times, which makes the use of attributed graphs to represent objects a valid solution.