Parallel graduated assignment algorithm for multiple graph matching based on a common labelling
Universtitat Rovira i Virgili, Department d’Enginyeria Informatica i Matematiques, Tarragona, Spain
Proceedings of the 8th international conference on Graph-based representations in pattern recognition, GbRPR’11, 2011
@article{rodenas2011parallel,
title={Parallel Graduated Assignment Algorithm for Multiple Graph Matching Based on a Common Labelling},
author={Rodenas, D. and Serratosa, F. and Sol{‘e}-Ribalta, A.},
journal={Graph-Based Representations in Pattern Recognition},
pages={132–141},
year={2011},
publisher={Springer}
}
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.
September 21, 2011 by hgpu
