Discrete tabu search for graph matching

Proceedings of the IEEE International Conference on Computer Vision

Volumn 2015 International Conference on Computer Vision, ICCV 2015, Issue , 2015, Pages 109-117

  Adamczewski, Kamil ^a   Suh, Yumin ^a   Lee, Kyoung Mu ^a  

^a Department of Aerospace Engineering   (South Korea)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTER VISION; OPTIMIZATION; TABU SEARCH;

ASSOCIATION GRAPH; DIRECT OPTIMIZATION; GRAPH MATCHING PROBLEMS; GRAPH-MATCHING ALGORITHMS; MAXIMUM CLIQUE PROBLEMS; OPTIMAL SOLUTIONS; SEARCH OPTIMIZATION; STRATEGIC DECISIONS;

PATTERN MATCHING;

EID: 84973894678     PISSN: 15505499     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICCV.2015.21     Document Type: Conference Paper

References (32)

1. Microsoft research cambridge object recognition image database. http: //www. pascalnetwork. org/challenges/VOC/voc2007/workshop/index. html. 7
2. A. Albarelli, S. R. Bulo, A. Torsello, and M. Pelillo. Matching as a non-cooperative game. In ICCV, 2009. 1
3. R. Aringhieri, R. Cordone, and Y. Melzani. Tabu search versus grasp for the maximum diversity problem. 4OR, 2008. 6
4. A. C. Berg, T. L. Berg, and J. Malik. Shape matching and object recognition using low distortion correspondences. In CVPR, 2005. 1
5. M. Cho, K. Alahari, and J. Ponce. Learning graphs to match. In ICCV, 2013. 7, 8
6. M. Cho and J. Lee. Feature correspondence and deformable object matching via agglomerative correspondence clustering. In ICCV, 2009. 1
7. M. Cho, J. Lee, and K. M. Lee. Reweighted random walks for graph matching. In ECCV, 2010. 1, 6, 7, 8
8. O. Duchenne, A. Joulin, and J. Ponce. A graph-matching kernel for object categorization. In ICCV, 2011. 1
9. M. Everingham, L. Van Gool, C. K. I. Williams, J. Winn, and A. Zisserman. The PASCAL Visual Object Classes Challenge 2007 (VOC2007) Results. http: //www. pascalnetwork. org/challenges/VOC/voc2007/workshop/index. html. 8
10. L. Fei-Fei, R. Fergus, and P. Perona. Learning generative visual models from few training examples: An incremental Bayesian approach tested on 101 object categories. CVIU, 2007. 7
11. F. Glover. Future paths for integer programming and links to artificial intelligence. Computers and Operations Research, 1986. 4
12. F. Glover. Tabu search-part i. ORSA Journal on Computing, 1989. 4
13. F. Glover and M. Laguna. Tabu search. Springer, 1999. 1, 2, 4
14. S. Gold and A. Rangarajan. A graduated assignment algorithm for graph matching. TPAMI, 1996. 1, 6
15. G. Griffin, A. Holub, and P. Perona. Caltech-256 object category dataset. 2007. 8
16. B. Hariharan, J. Malik, and D. Ramanan. Discriminative decorrelation for clustering and classification. In ECCV. 2012. 8
17. R. Horaud and T. Skordas. Stereo correspondence through feature grouping and maximal cliques. TPAMI, 1989. 2
18. S. Kim, S. Kwak, J. Feyereisl, and B. Han. Online multitarget tracking by large margin structured learning. In ACCV. 2013. 1
19. J. Lee, M. Cho, and K. M. Lee. A graph matching algorithm using data-driven markov chain monte carlo sampling. In ICPR, 2010. 1, 2
20. M. Leordeanu and M. Hebert. A spectral technique for correspondence problems using pairwise constraints. In ICCV, 2005. 1, 6
21. M. Leordeanu and M. Hebert. An integer projected fixed point method for graph matching and map inference. In NIPS, 2009. 1, 2, 6
22. H. Liu, L. J. Latecki, and S. Yan. Fast detection of dense subgraphs with iterative shrinking and expansion. TPAMI, 2013. 2, 6
23. H. Liu and S. Yan. Common visual pattern discovery via spatially coherent correspondences. In CVPR, 2010. 2
24. S. Sorlin and C. Solnon. Reactive tabu search for measuring graph similarity. In Graph-Based Representations in Pattern Recognition. Springer, 2005. 2
25. Y. Suh, K. Adamczewski, and K. M. Lee. Subgraph matching using compactness prior for robust feature correspodence. In CVPR, 2015. 1
26. Y. Suh, M. Cho, and K. M. Lee. Graph matching via sequential monte carlo. In ECCV, 2012. 1, 2
27. S. Umeyama. An eigendecomposition approach to weighted graph matching problems. TPAMI, 1988. 1
28. Y. Wang, J.-K. Hao, F. Glover, and Z. Lü. A tabu search based memetic algorithm for the maximum diversity problem. Engineering Applications of Artificial Intelligence, 2014. 4
29. M. L. Williams, R. C. Wilson, and E. R. Hancock. Deterministic search for relational graph matching. Pattern Recognition, 1999. 2
30. J. Yan, C. Zhang, H. Zha, W. Liu, X. Yang, and S. M. Chu. Discrete hyper-graph matching. In CVPR, 2015. 1, 2
31. Z. Zhao, Y. Qiao, J. Yang, and L. Bai. From dense subgraph to graph matching: A label propagation approach. In Audio, Language and Image Processing (ICALIP), 2014. 2
32. F. Zhou and F. D. la Torre. Factorized graph matching. In CVPR, 2012. 1, 2, 6