Parallel graduated assignment algorithm for multiple graph matching based on a common labelling

Authors:
David Rodenas;Francesc Serratosa;Albert Solé-Ribalta
Affiliations:
Universtitat Rovira i Virgili, Department d'Enginyeria Informàtica i Matemàtiques, Tarragona, Spain;Universtitat Rovira i Virgili, Department d'Enginyeria Informàtica i Matemàtiques, Tarragona, Spain;Universtitat Rovira i Virgili, Department d'Enginyeria Informàtica i Matemàtiques, Tarragona, Spain
Venue:
GbRPR'11 Proceedings of the 8th international conference on Graph-based representations in pattern recognition
Year:
2011

Citing 7
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
Loop tiling for parallelism

Loop tiling for parallelism
IAM Graph Database Repository for Graph Based Pattern Recognition and Machine Learning

SSPR & SPR '08 Proceedings of the 2008 Joint IAPR International Workshop on Structural, Syntactic, and Statistical Pattern Recognition
On the Computation of the Common Labelling of a Set of Attributed Graphs

CIARP '09 Proceedings of the 14th Iberoamerican Conference on Pattern Recognition: Progress in Pattern Recognition, Image Analysis, Computer Vision, and Applications
Constellations and the unsupervised learning of graphs

GbRPR'07 Proceedings of the 6th IAPR-TC-15 international conference on Graph-based representations in pattern recognition
Graduated assignment algorithm for finding the common labelling of a set of graphs

SSPR&SPR'10 Proceedings of the 2010 joint IAPR international conference on Structural, syntactic, and statistical pattern recognition

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper presents a new parallel algorithm to compute multiple graph-matching based on the Graduated Assignment. The aim of developing this parallel algorithm is to perform multiple 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. Our new algorithm is ready to take advantage of incoming desktop computers capabilities. While comparing the classical algorithm (executed in the main processor) respect our parallel algorithm (executed in the graphic processor unit), experiments show an important speed-up of the run time.