Discrete hyper-graph matching

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

Volumn 07-12-June-2015, Issue , 2015, Pages 1520-1528

  Yan, Junchi ^a,b   Zhang, Chao ^b   Zha, Hongyuan ^c   Liu, Wei ^b   Yang, Xiaokang ^a   Chu, Stephen M ^b  

^a SHANGHAI JIAO TONG UNIVERSITY   (China)

^b IBM ALMADEN RESEARCH CENTER   (United States)

^c GEORGIA INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER VISION; PATTERN MATCHING; PATTERN RECOGNITION;

ACCURACY LOSS; CONTINUOUS APPROACH; CONTINUOUS METHODS; DISCRETE GRADIENT; DISCRETE SPACES; HIGHER-ORDER; RELAXATION MECHANISM; SOLUTION PATH;

ITERATIVE METHODS;

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

References (39)

1. A. C. Berg, T. L. Berg, and J. Malik. Shape matching and object recognition using low distortion correspondences. In CVPR, 2005. I
2. I. M. B omze and G. D anninger. A global optimization algorithm for concave quadratic programming problems. SIAM Journal on Optimization, pages 826-842, 1993
3. T. C aetano, J. M cAuley, L. C heng, Q. L e, and A. J. S mola. Learning graph matching. IEEE Transaction on PAMI, 31(6): 1048-1058, 2009. 1,2
4. M. C. Chang and B. B. Kimia. Measuring 3d shape similarity by graph-based matching of the medial scaffolds. Computer Vision and Image Understanding, pages 707-720, 2011. 1,2
5. M. Chertok and Y. Keller. Efficient high order matching. PAMI, 2010
6. M. Cho, K. Alahari, and J. Ponce. Learning graphs to match. In ICCV, 2013
7. M. C ho,J. L ee, and K. M. L ee. R eweighted random walks for graph matching. In ECCV, 2010. 1,2,3,5,6
8. O. D uchenne, F. B ach, I. K weon, and J. P once. A tensor-based algorithm for high-order graph matching. In CVPR, 2009. I, 2, 3, 4, 5
9. G. Fielding and M. Kam. Weighted matchings for dense stereo correspondence. Pattern Recognition, pages I 151-1524, 2000. I
10. S. Gold and A. Rangarajan. A graduated assignment algorithm for graph matching. IEEE Transaction on PAMI, 1996.
11. S. Gold and A. Rangarajan. Softmax to softassign: neural network algorithms for combinatorial opti-mization. 1. Arti( Neural Netw, 1996. 4
12. H. W. Kuhn. The hungarian method for the assignment problem. In Export. Naval Research LOlistics Quarterly, pages 83-97, 1955. I
13. J. Lee, M. Cho, and K. M. Lee. Hyper-graph matching via reweighted randomwalks. In CVPR, 2011. 1,2,3,5,6,7
14. M. Leordeanu and M. Hebert. A spectral technique for correspondence problems using pairwise constraints. In ICCV, 2005. 1,2
15. M. Leordeanu, M. Hebert, and R. Sukthankar. An integer projected fixed point method for graph matching and map inference. In NIPS, 2009. 1,2,3,5
16. M. L eordeanu,R. S ukthankar,a nd M. H ebert. U nsupervised learning for graph matching. Int. J. Comput. Vis., pages 28-45, 2012
17. M. Leordeanu, A. Zanfir, and C. Sminchisescu. Semi-supervised learning and optimization for hypergraph matching. In ICCV, 2011. 2,3
18. C. Li, Q. Liu, W. Dong, X. Zhu, J. Liu, and H. Lu. Human age estimation based on locality and ordinal information. IEEE Transaction on Cybernetics, 2014
19. C. Li, Q. Liu, J. Liu, and H. Lu. Learning ordinal discriminative features for age estimation. In CVPR, 2012
20. A. Rangarajan, A. Yuille, and E. Mjolsness. Convergence properties of the softassign quadratic assignment algorithm. Neural Computation, 1999
21. P. A. Regalia and E. Kofidi. The higher-order power method revisited: Convergence proofs and effective initialization. In ICASSP, 2000
22. E. Rodola, S. R. Bula, T. Windheuser, M. Vestner, and D. Cremers. Dense non-rigid shape correspondence using random forests. In CVPR, 2014. 2
23. R. Sinkhorn and A. Rangarajan. A relationship between arbitrary positive matrices and doubly stochastic matrices. Ann. Math. Statistics, 1964
24. Y. Suh, M. Cho, and K. M. Lee. Graph matching via sequential monte carlo. In ECCV, 2012. 2
25. P. S. T. Cour and J. S hi. B alanced graph matching. I n NIPS, 2006. 2
26. Y. Tian, J. Yan, H. Zhang, Y. Zhang, X. Yang, and H. Zhao On the convergence of graph matching: Graduated assignment revisited. In ECCV, 2012.
27. F. Viksten, P. Forssen, B. Johansson, and A. Moe. Comparison of local image descriptors for full 6 degree-of-freedom pose estimation. In ICRA, 2009
28. J. Xiao, H. Cheng, H. Sawhney, and F. Han. Vehicle detection and tracking in wide fie1d-of-view aerial video. In CVPR, 2010
29. J. Y an,M. C ho,H. Z ha,X. Y ang, and S. C hu. A general multi-graph matching approach via graduated consistency-regularized boosting. arXiv preprint arXiv:I502. 05840, 2015
30. J. Y an, Y. Li,W. L iu, H. Y. Zha,X. K. Y ang, and S. M. C hu. G raduated consistency-regularized optimization for multi-graph matching. In ECCV, 2014
31. J. Y an,J. L iu, Y. Li,Z. N iu, and Y. Liu. V isual saliency detection via rank-sparsity decomposition. In ICTP, 2010
32. J. Yan, Y. Tian, H. Zha, X. Yang, Y. Zhang, and S. Chu. Joint optimization for consistent multiple graph matching. In ICCV, 2013
33. J. Yan, J. Wang, H. Zha, X. Yang, and S. Chu. Multi-view point registration via alternating optimization. In AAAI, 2015. 2
34. J. Y an, J. W ang, H. Y. Zha, and X. K. Y ang. Consistency-driven alternating optimization for multi-graph matching: a unified approach. IEEE Transactions on Image Processing, 2015
35. J. Yan, M. Zhu, H. Liu, and Y. Liu. Visual saliency detection via sparsity pursuit. Silnal Processinl Letters, IEEE, 2010
36. B. Y ao and F. L i. A ction recognition with exemplar based 2. 5 d graph matching. In ECCV, 2012. I
37. R. Z ass and A. S hashua. Probabilistic graph and hypergraph matching. In CVPR, 2008.
38. F. Zhou and F. D. Torre. Deformable graph matching. In CVPR, 2013. I
39. F. Zhou and F. D. L. Torre. Factorized graph matching. In CVPR, 2012.