Multi-Graph Matching via Affinity Optimization with Graduated Consistency Regularization

IEEE Transactions on Pattern Analysis and Machine Intelligence

Volumn 38, Issue 6, 2016, Pages 1228-1242

  Yan, Junchi ^a,b   Cho, Minsu ^c   Zha, Hongyuan ^d,e   Yang, Xiaokang ^a   Chu, Stephen M ^f  

^a SHANGHAI JIAO TONG UNIVERSITY   (China)

^b IBM RESEARCH   (United States)

^c ECOLE NORMALE SUPÉRIEURE   (France)

^d EAST CHINA NORMAL UNIVERSITY   (China)

^e Georgia Institute of Technology   (United States)

^f IBM T J WATSON RESEARCH CENTER   (United States)

Author keywords

feature correspondence; Graph matching

Indexed keywords

ITERATIVE METHODS; PATTERN MATCHING;

CONSISTENCY CONSTRAINTS; CONSISTENCY ENFORCEMENT; CORRELATED COMPONENTS; FEATURE CORRESPONDENCE; GRAPH MATCHING PROBLEMS; GRAPH MATCHINGS; GRAPH-MATCHING METHODS; ITERATIVE OPTIMIZATION;

IMAGE MATCHING;

EID: 84969899005     PISSN: 01628828     EISSN: None     Source Type: Journal    
DOI: 10.1109/TPAMI.2015.2477832     Document Type: Article

References (52)

1. J. Yan, Y. Li, W. Liu, H. Zha, X. Yang, and S. M. Chu, "Graduated consistency-regularized optimization for multi-graph matching," in Proc. 13th Eur. Conf. Comput. Vis., 2014, pp. 407-422.
2. Y. Chen, L. Guibas, and Q. Huang, "Near-optimal joint object matching via convex relaxation," in Proc. 31st Int. Conf. Mach. Learn., 2014, pp. 100-108.
3. M. Cho, J. Sun, O. Duchenne, and J. Ponce, "Finding matches in a haystack: A max-pooling strategy for graph matching in the presence of outliers," in Proc. Conf. Comput. Vis. Pattern Recog., 2014, pp. 2091-2098.
4. J. Yan, J. Wang, H. Zha, and X. Yang, "Consistency-driven alternating optimization for multi-graph matching: A unified approach," IEEE Trans. Image Process., vol. 24, no. 3, pp. 994-1009, Mar. 2015.
5. D. Conte, P. Foggia, C. Sansone, and M. Vento, "Thirty years of graph matching in pattern recognition," Int. J. Pattern Recog. Artif. Intell., vol. 18, no. 3, pp. 265-298, 2004.
6. P. Foggia, G. Percannella, and M. Vento, "Graph matching and learning in pattern recognition in the last 10 years," Int. J. Pattern Recog. Artif. Intell., vol. 28, no. 1, pp. 1-40, 2014.
7. M. Zaslavskiy, F. Bach, and J.-P. Vert, "Global alignment of protein-protein interaction networks by graph matching methods," Bioinformatics, vol. 25, no. 12, pp. i259-1267, 2009.
8. M. L. Williams, R. C. Wilson, and E. Hancock, "Multiple graph matching with Bayesian inference," Pattern Recog. Lett., vol. 18, no. 11-13, pp. 1275-1281, Nov. 1997.
9. L. Liu, W. Lin, and Y. Zhong, "Traffic flow matching with clique and triplet cues," in Proc. IEEE Int. Workshop Multimedia Signal Process., 2015, pp. 1-6.
10. W. Wang, W. Lin, Y. Chen, J. Wu, J. Wang, and B. Sheng, "Finding coherent motions and semantic regions in crowd scenes: A diffusion and clustering approach," in Proc. 13th Eur. Conf. Comput. Vis., 2014, pp. 756-77.
11. Q. Huang and L. Guibas, "Consistent shape maps via semidefinite programming," in Proc. Eurograph. Symp. Geom. Process., 2013, pp. 177-186.
12. S. Liu, X. Wang, J. Chen, J. Zhu, and B. Guo, "Topicpanorama: A full picture of relevant topics," in Proc. IEEE Conf. Vis. Anal. Sci. Technol., 2014, pp. 183-192.
13. M. A. Fischler and R. C. Bolles, "Random sample consensus: A paradigm for model fitting with applications to image analysis and automated cartography," Commun. ACM, vol. 24, no. 6, pp. 381-395, 1981.
14. Z. Zhang, "Iterative point matching for registration of free-form curves and surfaces," in Proc. Int. J. Comput. Vis., vol. 13, no. 2, pp. 11 9-152, 1994.
15. F. Zhou and F. D. Torre, "Factorized graph matching," in Proc. IEEE Conf. Comput. Vis. Pattern Recog., 2012, pp. 127-134.
16. M. Cho, J. Lee, and K. M. Lee, "Reweighted random walks for graph matching," in Proc. 11th Eur. Conf. Comput. Vis., 2010, pp. 492-505.
17. M. Leordeanu, M. Hebert, and R. Sukthankar, "An integer projected fixed point method for graph matching and map inference," in Proc. Adv. Neural Inf. Process. Syst. 22, 2009, pp. 1114-1122.
18. D. Eppstein, "Subgraph isomorphism in planar graphs and related problems," in Proc. 6th Annu. ACM-SIAM Symp. Discrete Algorithms, 1995, pp. 632-640.
19. E. M. Luks, "Isomorphism of graphs of bounded valence can be tested in polynomial time," J. Comput. Syst. Sci., vol. 25, pp. 42-65, 1982.
20. A. V. Aho, M. Ganapathi, and S. W. Tjiang, "Code generation using tree matching and dynamic programming," ACM Trans. Program. Lang. Syst., vol. 11, pp. 491-516, 1989.
21. M. Leordeanu, R. Sukthankar, and M. Hebert, "Unsupervised learning for graph matching," Int. J. Comput. Vis., vol. 96, no. 1, pp. 28-45, Jan. 2012.
22. S. Gold and A. Rangarajan, "A graduated assignment algorithm for graph matching," IEEE Trans. Pattern Anal. Mach. Intell., vol. 18, no. 4, pp. 377-388, Apr. 1996.
23. T. Caetano, J. McAuley, L. Cheng, Q. Le, and A. J. Smola, "Learning graph matching," IEEE Trans. Pattern Anal. Mach. Intell., vol. 31, no. 8, pp. 1048-1058, Jun. 2009.
24. A. Egozi, Y. Keller, and H. Guterman, "A probabilistic approach to spectral graph matching," IEEE Trans. Pattern Anal. Mach. Intell., vol. 35, no. 1, pp. 18-27, Jan. 2013.
25. E. Lawler, "The quadratic assignment problem," Manage. Sci., vol. 9, pp. 586-599, 1963.
26. T. C. Koopmans and M. Beckmann, "Assignment problems and the location of economic activities," Econometrica, vol. 25, pp. 53-76, 1957.
27. T. Funkhouser, M. Kazhdan, P. Shilane, P. Min, W. Kiefer, A. Tal, and D. Dobkin, "Modeling by example," ACM Trans. Graph., vol. 23, pp. 652-663, 2004.
28. A. Solé-Ribalta and F. Serratosa, "Models and algorithms for computing the common labelling of a set of attributed graphs," Comput. Vis. Image Understanding, vol. 115, pp. 929-945, 2011.
29. Q. Huang, G. Zhang, L. Gao, S. Hu, A. Butscher, and L. Guibas, "An optimization approach for extracting and encoding consistent maps in a shape collection," ACM Trans. Graph., vol. 31, pp. 1-11, 2012.
30. D. Pachauri, R. Kondor, and S. Vikas, "Solving the multi-way matching problem by permutation synchronization," in Proc. Adv. Neural Inf. Process. Syst., 2013, pp. 1860-1868.
31. J. Yan, Y. Tian, H. Zha, X. Yang, Y. Zhang, and S. Chu, "Joint optimization for consistent multiple graph matching," in Proc. IEEE Int. Conf. Comput. Vis., 2013, 1649-1656.
32. A. Sole-Ribalta and F. Serratosa, "Graduated assignment algorithm for multiple graph matching based on a common labeling," in IJPRAI, vol. 27, no. 1 pp. 1-27, 2013.
33. M. Leordeanu, A. Zanfir, and C. Sminchisescu, "Semi-supervised learning and optimization for hypergraph matching," in Proc. IEEE Int. Conf. Comput. Vis., 2011, pp. 2274-2281.
34. M. Cho, K. Alahari, and J. Ponce, "Learning graphs to match," in Proc. IEEE Int. Conf. Comput. Vis., 2013, pp. 25-32.
35. N. Hu, R. M. Rustamov, and L. Guibas, "Graph matching with anchor nodes: A learning approach," in Proc. IEEE Conf. Comput. Vis. Pattern Recog., 2013, pp. 2906-2913.
36. M. Chertok and Y. Keller, "Efficient high order matching," IEEE Trans. Pattern Anal. Mach. Intell., vol. 32, no. 12, pp. 2205-2215, Dec. 2010.
37. O. Duchenne, F. Bach, I. Kweon, and J. Ponce, "A tensor-based algorithm for high-order graph matching," in Proc. IEEE Conf. Comput. Vis. Pattern Recog., 2009, pp. 1980-1987.
38. J. Lee, M. Cho, and K. M. Lee, "Hyper-graph matching via reweighted random walks," in Proc. IEEE Conf. Comput. Vis. Pattern Recog., 2011, pp. 1633-1640.
39. R. Zass and A. Shashua, "Probabilistic graph and hypergraph matching," in Proc. IEEE Conf. Comput. Vis. Pattern Recog., 2008, pp. 1-8.
40. J. Yan, C. Zhang, H. Zha, W. Liu, X. Yang, and S. M. Chu, "Discrete hyper-graph matching," in Proc. IEEE Conf. Comput. Vis. Pattern Recog., 2015, pp. 1520-1528.
41. T. Collins, P. Mesejo, and A. Bartoli, "An analysis of errors in graph-based keypoint matching and proposed solutions," in Proc. Eur. Conf. Comput. Vis., 2014, pp. 138-153.
42. S. Gold and A. Rangarajan, "Softmax to softassign: Neural network algorithms for combinatorial optimization," J. Artif. Neural Netw., vol. 2, pp. 381-399, 1996.
43. M. Leordeanu and M. Hebert, "A spectral technique for correspondence problems using pairwise constraints," in Proc. IEEE 10th Int. Conf. Comput. Vis., 2005, pp. 1482-1489.
44. P. S. T. Cour and J. Shi, "Balanced graph matching," in Proc. Adv. Neural Inf. Process. Syst. 19, 2006, pp. 313-320.
45. A. Solé-Ribalta and F. Serratosa, "On the computation of the common labelling of a set of attributed graphs," in Proc. 14th Iberoamerican Conf. Pattern Recog., Guadalajara, Jalisco, Mexico, Nov. 2009, pp. 137-144.
46. F. Gavril, "Generating the maximum spanning trees of a weighted graph," J. Algorithms, vol. 8, pp. 592-597, 1987.
47. A. S. Ribalta and F. Serratosa, "Graduated assignment algorithm for finding the common labelling of a set of graphs," in Proc. SSPR, 2010, pp. 180-190.
48. G. Charpiat, "Learning shape metrics based on deformations and transport," in Proc. IEEE 12th Int. Conf. Comput. Vis. Workshops, 2009, pp. 328-335.
49. S. Umeyama, "An eigendecomposition approach to weighted graph matching problems," IEEE Trans. Pattern Anal. Mach. Intell., vol. 10, no. 5, pp. 695-703, Sep. 1988.
50. L. Torresani, V. Kolmogorov, and C. Rother, "Feature correspondence via graph matching: Models and global optimization," in Proc. 10th Eur. Conf. Comput. Vis., 2008, pp. 596-609.
51. F. Viksten, P. Forssén, B. Johansson, and A. Moe, "Comparison of local image descriptors for full 6 degree-of-freedom pose estimation," in Proc. IEEE Int. Conf. Robot. Autom., 2009, pp. 2779-2786.
52. K. Jia, T. H. Chan, Z. Zeng, G. Wang, T. Zhang, and Y. Ma, "Roml: A robust feature correspondence approach for matching objects in a set of images," arXiv:1403.7877, 2014.