On the convergence of graph matching: Graduated assignment revisited

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 7574 LNCS, Issue PART 3, 2012, Pages 821-835

  Tian, Yu ^a   Yan, Junchi ^a   Zhang, Hequan ^c   Zhang, Ya ^a   Yang, Xiaokang ^a   Zha, Hongyuan ^b  

^a SHANGHAI JIAO TONG UNIVERSITY   (China)

^b GEORGIA INSTITUTE OF TECHNOLOGY   (United States)

^c BEIJING INSTITUTE OF TECHNOLOGY   (China)

Author keywords

[No Author keywords available]

Indexed keywords

CONTINUOUS DOMAIN; CONVERGENT ALGORITHMS; DISCRETE DOMAINS; EXACT SOLUTION; FIXED POINTS; GRADUATED ASSIGNMENT; GRADUATED ASSIGNMENT ALGORITHM; GRAPH MATCHINGS; HUNGARIAN METHOD; ITERATIVE GRADIENTS; NP-HARD; SECOND ORDERS;

ALGORITHMS; COMPUTER VISION; PATTERN MATCHING;

ITERATIVE METHODS;

EID: 84867877067     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-33712-3_59     Document Type: Conference Paper

References (13)

1. Conte, D., Foggia, P., Sansone, C., Vento, M.: Thirty years of graph matching in pattern recognition. IJPRAI (2004)
2. Gold, S., Rangarajan, A.: A graduated assignment algorithm for graph matching. PAMI (1996)
3. Leordeanu, M., Hebert, M.: A Spectral Technique for Correspondence Problems using Pairwise Constraints. In: ICCV (2005)
4. Cho, M., Lee, J., Lee, K.M.: Reweighted Random Walks for Graph Matching. In: Daniilidis, K., Maragos, P., Paragios, N. (eds.) ECCV 2010, Part V. LNCS, vol. 6315, pp. 492-505. Springer, Heidelberg (2010)
5. Leordeanu, M., Herbert,M.: An integer projected fixed point method for graph matching and map inference. In: NIPS (2009)
6. Gold, S., Rangarajan, A.: Softmax to softassign: neural network algorithms for combinatorial optimization. J. Artif. Neural Netw., 3810-399 (1995)
7. Rangarajan, A., Yuille, A.: Convergence properties of the softassign quadratic assignment algorithm. Neural Computation (1999)
8. Kuhn, H.W.: The Hungarian method for the assignment problem. Naval Research Logistics Quarterly 2(1-2), 83-97 (1955)
9. Christmas, W., Kittler, J., Petrou, M.: Structural matching in computer vision using probabilistic relaxation. PAMI 19(6), 634-648 (1997)
10. Wilson, R., Hancock, E.: Structural matching by discrete relaxation. IEEE Trans. Pattern Anal. Mach. Intell. 17(8), 749-764 (1995)
11. Cour, T., Srinivasan, P., Shi, J.: Balanced Graph Matching. In: NIPS (2006)
12. Lee, J., Cho, M., Lee, K.M.: Hyper-graph Matching via Reweighted RandomWalks. In: CVPR (2011)
13. Kosowsky, J.J., Yuille, A.L.: The Invisible Hand Algorithm: Solving the Assignment Problem With Statistical Physics. Neural Networks 7(3) (1994)