Graduated consistency-regularized optimization for multi-graph matching

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

Volumn 8689 LNCS, Issue PART 1, 2014, Pages 407-422

  Yan, Junchi ^a,b   Li, Yin ^c   Liu, Wei ^d   Zha, Hongyuan ^c,e   Yang, Xiaokang ^a   Chu, Stephen Mingyu ^b  

^a SHANGHAI JIAO TONG UNIVERSITY   (China)

^b IBM CHINA RESEARCH LAB   (China)

^c GEORGIA INSTITUTE OF TECHNOLOGY   (United States)

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

^e EAST CHINA NORMAL UNIVERSITY   (China)

Author keywords

[No Author keywords available]

Indexed keywords

ITERATIVE METHODS; PATTERN MATCHING;

COMPUTER VISION APPLICATIONS; CONSISTENCY CONSTRAINTS; FEATURE POINT CORRESPONDENCE; ITERATIVE OPTIMIZATION; MATCHING ALGORITHM; MATCHING PROBLEMS; OVERALL ACCURACIES; SUBOPTIMAL SOLUTION;

IMAGE MATCHING;

EID: 84906506704     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-319-10590-1_27     Document Type: Conference Paper

References (52)

1. http://deim.urv.cat/~francesc.serratosa/
2. http://www-users.cs.york.ac.uk/~erh/
3. http://www.iam.unibe.ch/fki/staff/prof.-dr.-horst-bunke
4. Besl, P., McKay, N.: A method for registration of 3-d shapes. PAMI (1992)
5. Brendel, W., Todorovic, S.: Learning spatiotemporal graphs of human activities. In: ICCV (2011)
6. Caetano, T., McAuley, J., Cheng, L., Le, Q., Smola, A.J.: Learning graph matching. IEEE Transaction on PAMI 31(6), 1048-1058 (2009)
7. Chertok, M., Keller, Y.: Efficient high order matching. PAMI (2010)
8. Cho, M., Alahari, K., Ponce, J.: Learning graphs to match. In: ICCV (2013)
9. 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)
10. Cho, M., Lee, K.M.: Progressive graph matching: Making a move of graphs via probabilistic voting. In: CVPR (2012)
11. Cho, M., Sun, J., Duchenne, O., Ponce, J.: Finding matches in a haystack: A max-pooling strategy for graph matching in the presence of outliers. In: CVPR (2014)
12. Conte, D., Foggia, P., Sansone, C., Vento, M.: Thirty years of graph matching in pattern recognition. IJPRAI (2004)
13. Duchenne, O., Bach, F., Kweon, I., Ponce, J.: A tensor-based algorithm for high-order graph matching. In: CVPR (2009)
14. Eshera, M.A., Fu, K.S.: An image understanding system using attributed symbolic representation and inexact graph-matching. PAMI (1986)
15. Fischler, M., Bolles, R.: Random sample consensus: A paradigm for model fitting with applications to image analysis and automated cartography. Comm. of the ACM, 381-395 (1981)
16. Foggia, P., Percannella, G., Vento, M.: Graph matching and learning in pattern recognition in the last 10 years. IJPRAI (2014)
17. Gallagher, B.: Matching structure and semantics: A survey on graph-based pattern matching. In: AAAI, pp. 45-53 (2006)
18. Garey, M.R., Johnson, D.S.: Computers and Intractability; A Guide to the Theory of NP-Completeness. W. H. Freeman and Co., New York (1990)
19. Gavril, F.: Generating the maximum spanning trees of a weighted graph. Journal of Algorithms, 592-597 (1987)
20. Goesele, M., Snavely, N., Curless, B., Hoppe, H., Seitz, S.: Multi-view stereo for community photo collections. In: ICCV (2007)
21. Gold, S., Rangarajan, A.: A graduated assignment algorithm for graph matching. IEEE Transaction on PAMI (1996)
22. Hancock, E.R., Wilson, R.C.: Pattern analysis with graphs: Parallel work at bern and york. Pattern Recognition Letters, 833-841 (2012)
23. Hu, N., Rustamov, R.M., Guibas, L.: Graph mmatching with anchor nodes: a learning approach. In: CVPR (2013)
24. Huang, Q., Zhang, G., Gao, L., Hu, S., Butscher, A., Guibas, L.: An optimization approach for extracting and encoding consistent maps in a shape collection. ACM Transactions on Graphics, TOG (2012)
25. Huang, Q.X., Flory, S., Gelfand, N., Hofer, M., Pottmann, H.: Reassembling fractured objects by geometric matching. ACM Trans. Graph., 569-578 (2006)
26. Kim, V.G., Li, W., Mitra, N.J., DiVerdi, S., Funkhouser, T.: Exploring collections of 3D models using fuzzy correspondences. In: SIGGRAPH (2012)
27. Kuhn, H.W.: The hungarian method for the assignment problem. Export. Naval Research Logistics Quarterly, 83-97 (1955)
28. Lee, J., Cho, M., Lee, K.M.: Hyper-graph matching via reweighted random walks. In: CVPR (2011)
29. Leordeanu, M., Hebert, M.: A spectral technique for correspondence problems using pairwise constraints. In: ICCV (2005)
30. Leordeanu, M., Hebert, M., Sukthankar, R.: Beyond local appearance: Category recognition from pairwise interactions of simple features. In: CVPR (2007)
31. Leordeanu, M., Herbert, M.: An integer projected fixed point method for graph matching and map inference. In: NIPS (2009)
32. Leordeanu, M., Sukthankar, R., Hebert, M.: Unsupervised learning for graph matching. Int. J. Comput. Vis., 28-45 (2012)
33. Leordeanu, M., Zanfir, A., Sminchisescu, C.: Semi-supervised learning and optimization for hypergraph matching. In: ICCV (2011)
34. Livi, L., Rizzi, A.: The graph matching problem. Pattern Anal. Applic., 253-283 (2013)
35. Loiola, E.M., de Abreu, N.M., Boaventura-Netto, P.O., Hahn, P., Querido, T.: A survey for the quadratic assignment problem. EJOR, 657-690 (2007)
36. Pachauri, D., Kondor, R., Vikas, S.: Solving the multi-way matching problem by permutation synchronization. In: NIPS (2013)
37. Pevzner, P.A.: Multiple alignment, communication cost, and graph matching. SIAM JAM (1992)
38. Qiu, H., Hancock, E.R.: Spectral simplification of graphs. In: Pajdla, T., Matas, J. (eds.) ECCV 2004. LNCS, vol. 3024, pp. 114-126. Springer, Heidelberg (2004)
39. Shen, D., Hammer, C.D.: Hierarchical attribute matching mechanism for elastic registration. TMI (2002)
40. Sole-Ribalta, A., Serratosa, F.: Graduated assignment algorithm for multiple graph matching based on a common labeling. IJPRAI (2013)
41. Suh, Y., Cho, M., Lee, K.M.: Graph matching via sequential monte carlo. In: Fitzgibbon, A., Lazebnik, S., Perona, P., Sato, Y., Schmid, C. (eds.) ECCV 2012, Part III. LNCS, vol. 7574, pp. 624-637. Springer, Heidelberg (2012)
42. Cour, T., Srinivasan, P., Shi, J.: Balanced graph matching. In: NIPS (2006)
43. Tian, Y., Yan, J., Zhang, H., Zhang, Y., Yang, X., Zha, H.: On the convergence of graph matching: Graduated assignment revisited. In: Fitzgibbon, A., Lazebnik, S., Perona, P., Sato, Y., Schmid, C. (eds.) ECCV 2012, Part III. LNCS, vol. 7574, pp. 821-835. Springer, Heidelberg (2012)
44. Williams, M.L., Wilson, R.C., Hancock, E.: Multiple graph matching with bayesian inference. Pattern Recognition Letters, 1275-1281 (1997)
45. Wong, A., You, M.: Entropy and distance of random graphs with application to structural pattern recognition. IEEE Transactions on PAMI (1985)
46. Yan, J., Li, Y., Zheng, E., Liu, Y.: An accelerated human motion tracking system based on voxel reconstruction under complex environments. In: Zha, H., Taniguchi, R.-I., Maybank, S. (eds.) ACCV 2009, Part II. LNCS, vol. 5995, pp. 313-324. Springer, Heidelberg (2010)
47. Yan, J., Tian, Y., Zha, H., Yang, X., Zhang, Y.: Joint optimization for consistent multiple graph matching. In: ICCV (2013)
48. Zach, C., Klopschitz, M., Pollefeys, M.: Disambiguating visual relations using loop constraints, pp. 1246-1433 (2010)
49. Zaslavskiy, M., Bach, F.R., Vert, J.P.: A path following algorithm for the graph matching problem. PAMI (2009)
50. Zass, R., Shashua, A.: Probabilistic graph and hypergraph matching. In: CVPR (2008)
51. Zeng, Z., Chan, T.-H., Jia, K., Xu, D.: Finding correspondence from multiple images via sparse and low-rank decomposition. In: Fitzgibbon, A., Lazebnik, S., Perona, P., Sato, Y., Schmid, C. (eds.) ECCV 2012, Part V. LNCS, vol. 7576, pp. 325-339. Springer, Heidelberg (2012)
52. Zhou, F., Torre, F.D.: Factorized graph matching. In: CVPR (2012)