Joint optimization for consistent multiple graph matching

Proceedings of the IEEE International Conference on Computer Vision

Volumn , Issue , 2013, Pages 1649-1656

  Yan, Junchi ^a   Tian, Yu ^a   Zha, Hongyuan ^b   Yang, Xiaokang ^a   Zhang, Ya ^a   Chu, Stephen M ^c  

^a SHANGHAI JIAO TONG UNIVERSITY   (China)

^b GEORGIA INSTITUTE OF TECHNOLOGY   (United States)

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

Author keywords

[No Author keywords available]

Indexed keywords

MAPPING;

ALTERNATING OPTIMIZATIONS; CONSISTENCY CONSTRAINTS; EDGE DENSITIES; GRAPH MATCHINGS; JOINT OPTIMIZATION; NODE MAPPING; PAIR MATCHING; SUBOPTIMAL SOLUTION;

OPTIMIZATION;

EID: 84898779986     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICCV.2013.207     Document Type: Conference Paper

References (26)

1. B. Bonev, F. Escolano, M. Lozano, P. Suau, M. Cazorla, and W. Aguilar. Constellations and the unsupervised learning of graphs. In GbRPR, 2007.
2. T. Caetano, J. McAuley, L. Cheng, Q. Le, and A. J. Smola. Learning graph matching. IEEE Transaction on PAMI, 31(6):1048-1058, 2009.
3. M. Cho, J. Lee, and K. M. Lee. Reweighted random walks for graph matching. In ECCV, 2010.
4. D. Conte, P. Foggia, C. Sansone, and M. Vento. Thirty years of graph matching in pattern recognition. IJPRAI, 2004.
5. O. Duchenne, F. Bach, I. Kweon, and J. Ponce. A tensor-based algorithm for high-order graph matching. In CVPR, 2009.
6. A. Egozi, Y. Keller, and H. Guterman. A probabilistic approach to spectral graph matching. IEEE Transactions on PAMI, pages 18-27, 2013.
7. S. Gold and A. Rangarajan. A graduated assignment algorithm for graphmatching. IEEE Transaction on PAMI, 1996.
8. J. Lee, M. Cho, and K. M. Lee. Hyper-graph matching via reweighted randomwalks. In CVPR, 2011.
9. M. Leordeanu and M. Hebert. A spectral technique for correspondence problems using pairwise constraints. In ICCV, 2005.
10. M. Leordeanu and M. Herbert. An integer projected fixed point method for graph matching and map inference. In NIPS, 2009.
11. M. Leordeanu, R. Sukthankar, and M. Hebert. Unsupervised learning for graph matching. Int. J. Comput. Vis., pages 28-45, 2012.
12. M. Leordeanu, A. Zanfir, and C. Sminchisescu. Semi-supervised learning and optimization for hypergraph matching. In ICCV, 2011.
13. W. Lian and L. Zhang. Robust point matching revisited: A concave optimization approach. In ECCV, 2012.
14. J.Maciel and J. Costeira. A global solution to sparse correspondence problems. IEEE Transaction on PAMI, 2003.
15. S. Ribalta and F. A. Serratosa. A structural and semantic probabilistic model for match-ing and representing a set of graphs. In GbRPR, 2009.
16. A. Sanfeliu, F. Serratosa, and R. Alqúezar. Second-order random graphs for modeling sets of attributed graphs and their application to object learning and recognition. IJPRAI, 2004.
17. F. Serratosa, R. Alqúezar, and A. Sanfeliu. Function-described graphs for modeling objects represented by attributed graphs. Pattern Recognition, 2003.
18. A. Soĺe-Ribalta and F. Serratosa. On the computation of the common labelling of a set of attributed graphs. In CIARP, 2009.
19. A. Soĺe-Ribalta and F. Serratosa. Models and algorithms for computing the common labelling of a set of attributed graphs. CVIU, 2011.
20. P. S. T. Cour and J. Shi. Balanced graph matching. In NIPS, 2006.
21. Y. Tian, J. Yan, H. Zhang, Y. Zhang, X. Yang, and H. Zha. On the convergence of graph matching: Graduated assignment revisited. In ECCV, 2012.
22. L. Torresani, V. Kolmogorov, and C. Rother. Feature correspondence via graph matching: Models and global optimization. In ECCV, 2008.
23. B. van Wyk and M. van Wyk. A pocs-based graph matching algorithm. IEEE Transaction on Pattern Analysis and Machine Intelligence, 2004.
24. M. L. Williams, R. C. Wilson, and E. Hancock. Multiple graph matching with bayesian inference. Pattern Recognition Letters, pages 1275-1281, 1997.
25. A. Wong and M. You. Entropy and distance of random graphs with application to structural pattern recognition. IEEE Transactions on PAMI, 1985.
26. R. Zass and A. Shashua. Probabilistic graph and hypergraph matching. In CVPR, 2008.