A High-Order Depth-Based Graph Matching Method
We recently proposed a novel depth-based graph matching method by aligning the depth-based representations of vertices. One drawback of the new method is that it only considers the structural co-relations, and the spatial co-relations of vertices are discarded. This drawback limits the performance of the method on graph-based image matching problems. To overcome the shortcoming, we develop a new high-order depth-based matching method, by incorporating the spatial coordinate information of vertices (i.e., the pixel coordinates of vertices in original images). The new matching method is based on a high order dominant cluster analysis . We use the new high-order matching method to identify the mismatches in the original first-order depth-based matching results, and remove the incorrect matches. Experiments on real world image databases demonstrate the effectiveness of our new high-order DB matching method.
KeywordsDepth-based representations Graph matching High-order depth-based matching
Unable to display preview. Download preview PDF.
- 2.Bai, X., Yu, H., Hancock, E.R.: Graph matching using spectral embedding and semidefinite programming. In: Proceedings of the British Machine Vision Conference, BMVC 2004, Kingston, UK, pp. 1–10, September 7–9, 2004Google Scholar
- 8.Solé-Ribalta, A., Serratosa, F.: Graduated assignment algorithm for multiple graph matching based on a common labeling. IJPRAI 27 (2013)Google Scholar
- 10.Bai, L., Ren, P., Bai, X., Hancock, E.R.: A graph kernel from the depth-based representation. In: Fränti, P., Brown, G., Loog, M., Escolano, F., Pelillo, M. (eds.) S+SSPR 2014. LNCS, vol. 8621, pp. 1–11. Springer, Heidelberg (2014) Google Scholar
- 11.Bai, L., Hancock, E.R., Ren, P.: Jensen-shannon graph kernel using information functionals. In: Proceedings of the 21st International Conference on Pattern Recognition, ICPR 2012, Tsukuba, Japan, pp. 2877–2880, November 11–15, 2012Google Scholar
- 13.Scott, G.L., Longuett-Higgins, E.C.: An algorithm to associating the features of two images. In: Proceedings of the Royal Society of London B, pp. 313–320 (1991)Google Scholar