DocumentCode :
457541
Title :
Graph Matching using Commute Time Spanning Trees
Author :
Qiu, Huaijun ; Hancock, Edwin R.
Author_Institution :
Dept. of Comput. Sci., York Univ.
Volume :
3
fYear :
0
fDate :
0-0 0
Firstpage :
1224
Lastpage :
1227
Abstract :
This paper exploits the properties of the commute time for the purposes of graph matching. Our starting point is the random walk on the graph, which is determined by the heat-kernel of the graph and can be computed from the spectrum of the graph Laplacian. We characterise the random walk using the commute time between nodes, and show how this quantity may be computed from the Laplacian spectrum using the discrete Green´s function. We use the commute-time to locate the minimum spanning tree of the graph. The spanning trees located using commute time prove to be stable to structural variations. We match the graphs by applying a tree-matching method to the spanning trees. We experiment with the method on synthetic and real-world image data, where it proves to be effective
Keywords :
Green´s function methods; pattern matching; random processes; trees (mathematics); commute time spanning trees; discrete Green´s function; graph Laplacian spectrum; graph heat kernel; graph matching; random walk; tree matching; Clustering algorithms; Computer science; Computer vision; Image retrieval; Image segmentation; Information retrieval; Laplace equations; Pattern analysis; Search engines; Tree graphs;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Pattern Recognition, 2006. ICPR 2006. 18th International Conference on
Conference_Location :
Hong Kong
ISSN :
1051-4651
Print_ISBN :
0-7695-2521-0
Type :
conf
DOI :
10.1109/ICPR.2006.614
Filename :
1699747
Link To Document :
بازگشت