University of Surrey

Test tubes in the lab Research in the ATI Dance Research

Refining graph matching using inherent structure information

Li, W., Song, Yi-Zhe and Cavallaro, A. (2015) Refining graph matching using inherent structure information In: 2015 IEEE International Conference on Multimedia and Expo (ICME 2015), 29 Jun - 03 Jul 2015, Turin, Italy.

Full text not available from this repository.


We present a graph matching refinement framework that improves the performance of a given graph matching algorithm. Our method synergistically uses the inherent structure information embedded globally in the active association graph, and locally on each individual graph. The combination of such information reveals how consistent each candidate match is with its global and local contexts. In doing so, the proposed method removes most false matches and improves precision. The validation on standard benchmark datasets demonstrates the effectiveness of our method.

Item Type: Conference or Workshop Item (Conference Paper)
Divisions : Faculty of Engineering and Physical Sciences > Electronic Engineering
Authors :
Li, W.
Cavallaro, A.
Date : 2015
DOI : 10.1109/ICME.2015.7177409
Uncontrolled Keywords : Active matched graphs; Association graph; Feature correspondence; Graph matching
Related URLs :
Depositing User : Clive Harris
Date Deposited : 12 Aug 2019 09:52
Last Modified : 12 Aug 2019 09:52

Actions (login required)

View Item View Item


Downloads per month over past year

Information about this web site

© The University of Surrey, Guildford, Surrey, GU2 7XH, United Kingdom.
+44 (0)1483 300800