Deformable graph matching

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

Volumn , Issue , 2013, Pages 2922-2929

  Zhou, Feng ^a   De La Torre, Fernando ^a  

^a CARNEGIE MELLON UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER VISION PROBLEMS; GEOMETRIC CONSTRAINT; GEOMETRIC TRANSFORMATIONS; ITERATIVE CLOSEST POINT ALGORITHM; MATCHING PERFORMANCE; OPTIMIZATION ALGORITHMS; OPTIMIZATION STRATEGY; STATE-OF-THE-ART ALGORITHMS;

ALGORITHMS; DEFORMATION; FACTORIZATION; MATHEMATICAL TRANSFORMATIONS; MATRIX ALGEBRA;

PATTERN MATCHING;

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

References (29)

1. H. A. Almohamad and S. O. Duffuaa. A linear programming approach for the weighted graph matching problem. IEEE Trans. Pattern Anal. Mach. Intell., 15(5):522-525, 1993. 4
2. P. J. Besl and N. D. McKay. A method for registration of 3-d shapes. IEEE Trans. Pattern Anal. Mach. Intell., 14(2):239-256, 1992. 3
3. W. Brendel and S. Todorovic. Learning spatiotemporal graphs of human activities. In ICCV, 2011. 1
4. R. Burkard, M. DellAmico, and S. Martello. Assignment Problems. SIAM, 2009. 1
5. M. Chertok and Y. Keller. Efficient high order matching. IEEE Trans. Pattern Anal. Mach. Intell., 32(12):2205-2215, 2010. 3
6. M. Cho, J. Lee, and K. M. Lee. Reweighted random walks for graph matching. In ECCV, 2010. 1, 3, 4, 6, 7
7. H. Chui and A. Rangarajan. A new point matching algorithm for non-rigid registration. Comput. Vis. Image Underst., 89(2-3):114-141, 2003. 6, 7
8. T. Cour, P. Srinivasan, and J. Shi. Balanced graph matching. In NIPS, 2006. 1, 2, 4, 6
9. O. Duchenne, F. Bach, I.-S. Kweon, and J. Ponce. A tensorbased algorithm for high-order graph matching. IEEE Trans. Pattern Anal. Mach. Intell., 33(12):2383-2395, 2011. 3
10. O. Duchenne, A. Joulin, and J. Ponce. A graph-matching kernel for object categorization. In ICCV, 2011. 1
11. S. Gold and A. Rangarajan. A graduated assignment algorithm for graph matching. IEEE Trans. Pattern Anal. Mach. Intell., 18(4):377-388, 1996. 1, 3, 4, 6
12. J. Hays, M. Leordeanu, A. A. Efros, and Y. Liu. Discovering texture regularity as a higher-order correspondence problem. In ECCV, 2006. 1
13. H. Jiang, S. X. Yu, and D. R. Martin. Linear scale and rotation invariant matching. IEEE Trans. pattern Anal. Mach. Intell., 33(7):1339-1355, 2011. 1
14. M. Leordeanu and M. Hebert. A spectral technique for correspondence problems using pairwise constraints. In ICCV, 2005. 1, 2, 4, 6, 7
15. M. Leordeanu, M. Hebert, and R. Sukthankar. An integer projected fixed point method for graph matching and MAP inference. In NIPS, 2009. 1, 3, 4, 6
16. M. Leordeanu, R. Sukthankar, and M. Hebert. Unsupervised learning for graph matching. Int. J. Comput. Vis., 95(1):1-18, 2011. 6
17. H. Li, J. Huang, S. Zhang, and X. Huang. Optimal object matching via convexification and composition. In ICCV, 2011. 1
18. E. M. Loiola, N. M. De Abreu, P. O. Boaventura, P. Hahn, and T. M. Querido. A survey for the quadratic assignment problem. Eur. J. Oper. Res., 176(2):657-690, 2007. 1, 2
19. A. Myronenko and X. B. Song. Point set registration: Coherent point drift. IEEE Trans. Pattern Anal. Mach. Intell., 32(12):2262-2275, 2010. 7
20. N. Quadrianto, A. J. Smola, L. Song, and T. Tuytelaars. Kernelized sorting. IEEE Trans. Pattern Anal. Mach. Intell., 32(10):1809-1821, 2010. 1
21. L. S. Shapiro and M. Brady. Feature-based correspondence: an eigenvector approach. Image Vision Comput., 10(5):283-288, 1992. 2
22. J. R. Ullmann. An algorithm for subgraph isomorphism. J. ACM, 23:31-42, 1976. 1
23. S. Umeyama. An eigendecomposition approach to weighted graph matching problems. IEEE Trans. Pattern Anal. Mach. Intell., 10(5):695-703, 1988. 2, 4
24. B. J. van Wyk and M. A. van Wyk. A POCS-based graph matching algorithm. IEEE Trans. Pattern Anal. Mach. Intell., 26(11):1526-1530, 2004. 1, 4
25. M. Zaslavskiy, F. R. Bach, and J.-P. Vert. A path following algorithm for the graph matching problem. IEEE Trans. Pattern Anal. Mach. Intell., 31(12):2227-2242, 2009. 3, 4
26. R. Zass and A. Shashua. Probabilistic graph and hypergraph matching. In CVPR, 2008. 1, 3, 4, 6
27. Z. Zhang. Iterative point matching for registration of freeform curves and surfaces. Int. J. Comput. Vis., 13(2):119-152, 1994. 3
28. F. Zhou and F. De la Torre. Factorized graph matching. IEEE Trans. Pattern Anal. Mach. Intell. Under review, http:// humansensing. cs. cmu. edu/fgm. 3, 4, 5
29. F. Zhou and F. De la Torre. Factorized graph matching. In CVPR, 2012. 2, 3, 4, 6