Stable and informative spectral signatures for graph matching

Proceedings of the IEEE Computer Society Conference on Computer Vision and Pattern Recognition

Volumn , Issue , 2014, Pages 2313-2320

  Hu, Nan ^a   Rustamov, Raif ^a   Guibas, Leonidas ^a  

^a STANFORD UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

HEATING; INTEGER PROGRAMMING; QUADRATIC PROGRAMMING;

ADJACENCY MATRICES; COMPATIBILITY FUNCTION; INFORMATIVE NESS; OBJECTIVE FUNCTIONS; QUADRATIC PROGRAMS; RIGOROUS ANALYSIS; SPECTRAL SIGNATURE; SYNTHETIC GRAPHS;

PATTERN RECOGNITION;

EID: 84911377863     PISSN: 10636919     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/CVPR.2014.296     Document Type: Conference Paper

References (38)

1. Y. Aflalo, A. M. Bronstein, M. M. Bronstein, and R. Kimmel. Deformable shape retrieval by learning diffusion kernels. In SSVM'11, pages 689-700, 2011.
2. M. Aubry, U. Schlickewei, and D. Cremers. The wave kernel signature: A quantum mechanical approach to shape analysis. In ICCV-Workshop 4DMOD, 2011.
3. T. Biyikoglu, J. Leydold, and P. F. Stadler. Laplacian eigenvectors of graphs: Perron-Frobenius and Faber-Krahn Type Theorems. 2007.
4. M. Chertok and Y. Keller. Efficient high order matching. IEEE Transactions on PAMI, 32(12):2205-2215, 2010.
5. M. Cho, J. Lee, and K. M. Lee. Reweighted random walks for graph matching. In ECCV'10, pages 492-505, 2010.
6. T. Cour, P. Srinivasan, and J. Shi. Balanced graph matching. In NIPS'06, pages 313-320, 2006.
7. O. Duchenne, F. Bach, I. Kweon, and J. Ponce. A tensor-based algorithm for high-order graph matching. CVPR, pages 1980-1987, 2009.
8. A. Egozi, Y. Keller, and H. Guterman. A probabilistic approach to spectral graph matching. IEEE Transactions on PAMI, 99(PrePrints), 2012.
9. D. Emms, R. C. Wilson, and E. R. Hancock. Graph matching using the interference of continuous-time quantum walks. Pattern Recogn., 42(5):985-1002, May 2009.
10. M. Eshera and K. Fu. A graph distance measure for image analysis. IEEE Trans. Syst. Man Cybern., pages 398-408, 1984.
11. S. Gold and A. Rangarajan. A graduated assignment algorithm for graph matching. IEEE Trans. Patt. Anal. Mach. Intell., 18, 1996.
12. M. Gori, M. Maggini, and L. Sarti. Exact and approximate graph matching using random walks. IEEE Trans. Pattern Anal. Mach. Intell., 27(7):1100-1111, July 2005.
13. D. K. Hammond, P. Vandergheynst, and R. Gribonval. Wavelets on graphs via spectral graph theory. Applied and Computational Harmonic Analysis, 30(2):129-150, Mar. 2011.
14. N. Hu and L. Guibas. Spectral descriptors for graph matching. arXiv:1304.1572, 2013.
15. N. Hu, R. Rustamov, and L. Guibas. Graph matching with anchor nodes: A learning approach. CVPR, 2013.
16. S. Jouili and S. Tabbone. Graph matching based on node signatures. In GbRPR '09, pages 154-163, 2009.
17. H. Kuhn. The hungarian method for the assignment problem. Naval Research Logistic Quarterly, pages 83-97, 1955.
18. J. Lee, M. Cho, and K. M. Lee. Hyper-graph matching via reweighted random walks. CVPR, pages 1633-1640, 2011.
19. M. Leordeanu and M. Hebert. A spectral technique for correspondence problems using pairwise constraints. In ICCV '05, volume 2, pages 1482-1489, 2005.
20. M. Leordeanu, M. Hebert, and R. Sukthankar. An integer projected fixed point method for graph matching and map inference. In Proceedings NIPS, December 2009.
21. R. Litman and A. M. Bronstein. Learning spectral descriptors for deformable shape correspondence. IEEE Transactions on PAMI, 99(PrePrints):1, 2013.
22. B. Luo and E. R. Hancock. Structural graph matching using the em algorithm and singular value decomposition. IEEE Trans. PAMI, 23(10):1120-1136, Oct. 2001.
23. M. Newman. Networks, An Introduction. 2010.
24. H. Qiu and E. R. Hancock. Graph matching and clustering using spectral partitions. Pattern Recogn., 39(1):22-34, Jan. 2006.
25. A. Robles-Kelly and E. R. Hancock. String edit distance, random walks and graph matching. In Joint IAPR International Workshop SSSPR, pages 104-112, 2002.
26. A. Robles-Kelly and E. R. Hancock. Graph edit distance from spectral seriation. IEEE Trans. Pattern Anal. Mach. Intell., 27(3):365-378, Mar. 2005.
27. C. Schellewald and C. Schnörr. Probabilistic subgraph matching based on convex relaxation. In EMMCVPR'05, pages 171-186, 2005.
28. A. Shokoufandeh and S. Dickinson. Applications of bipartite matching to problems in object recognition. Proceedings, ICCV Workshop on Graph Algorithms and Computer Vision, September 1999.
29. A. Shokoufandeh and S. J. Dickinson. A unified framework for indexing and matching hierarchical shape structures. In Proceedings of IWVF-4, pages 67-84, 2001.
30. J. Sun, M. Ovsjanikov, and L. Guibas. A concise and prov-ably informative multi-scale signature based on heat diffusion. In SGP, 2009.
31. S. Umeyama. An eigendecomposition approach to weighted graph matching problems. IEEE Trans. PAMI, 10(5):695-703, 1988.
32. B. J. van Wyk and M. A. van Wyk. A pocs-based graph matching algorithm. IEEE Trans. PAMI, 26(11):1526-1530, Nov. 2004.
33. R. C. Wilson and P. Zhu. A study of graph spectra for comparing graphs and trees. Pattern Recogn., 41(9):2833-2841, Sept. 2008.
34. P. C. Wong, H. Foote, G. Chin, P. Mackey, and K. Perrine. Graph signatures for visual analytics. IEEE Trans Vis Com-put Graph, 12(6):1399-413, 2006.
35. M. Zaslavskiy, F. Bach, and J.-P. Vert. A path following algorithm for the graph matching problem. IEEE Trans on PAMI, 31(12):2227-2242, 2009.
36. R. Zass and A. Shashua. Probabilistic graph and hypergraph matching. CVPR, 2008.
37. G. Zhao, B. Luo, J. Tang, and J. Ma. Using eigen-decomposition method for weighted graph matching. In ICIC'07, pages 1283-1294, 2007.
38. F. Zhou and F. De la Torre. Factorized graph matching. CVPR, pages 127-134, 2012.