연구동향 분석
박사

Graph and Hypergraph Matching in Computer Vision: Algorithms and Analysis

이정민 2016년

논문상세정보
인용/피인용
' Graph and Hypergraph Matching in Computer Vision: Algorithms and Analysis' 의 주제별 논문영향력
논문영향력 선정 방법
논문영향력 요약
주제
  • 응용 물리
  • Data-Driven
  • Graph Matching
  • Graph Matching Formulations
  • Hypergraph Matching
  • Markov chain Monte Carlo
  • Random Walks
동일주제 총논문수 논문피인용 총횟수 주제별 논문영향력의 평균
4,693 0

0.0%

' Graph and Hypergraph Matching in Computer Vision: Algorithms and Analysis' 의 참고문헌

  • Z.-Y. Liu, H. Qiao, and L. Xu, \An extended path following algorithm for graph-matching problem," IEEE transactions on Pattern Analysis and Machine Intelligence, vol. 34, no. 7, pp. 1451{1456, 2012.
  • Z. Tu and S.-C. Zhu, \Image segmentation by data-driven markov chain monte carlo," IEEE Transactions on Pattern Analysis and Machine Intelli- gence, vol. 24, no. 5, pp. 657{673, 2002.
  • Y. Suh, M. Cho, and K. M. Lee, \Graph matching via sequential monte carlo," in European Conference on Computer Vision. Springer, 2012, pp. 624{637.
  • W. Brendel and S. Todorovic, \Learning spatiotemporal graphs of human activities," in Proceedings of the IEEE International Conference on Computer Vision, 2011, pp. 778{785.
  • T. H. Haveliwala, \Topic-sensitive pagerank," in Proceedings of the 11th inter- national conference on World Wide Web. ACM, 2002, pp. 517{526.
  • T. G. Kolda and B. W. Bader, \Tensor decompositions and applications," SIAM review, vol. 51, no. 3, pp. 455{500, 2009.
  • T. Cour, P. Srinivasan, and J. Shi, \Balanced graph matching," Advances in Neural Information Processing Systems, vol. 19, p. 313, 2007.
  • S. Umeyama, \An eigendecomposition approach to weighted graph matching problems," IEEE transactions on Pattern Analysis and Machine Intelligence, vol. 10, no. 5, pp. 695{703, 1988.
  • S. Gold and A. Rangarajan, \A graduated assignment algorithm for graph matching," IEEE transactions on Pattern Analysis and Machine Intelligence, vol. 18, no. 4, pp. 377{388, 1996.
  • R. Zass and A. Shashua, \Probabilistic graph and hypergraph matching," in Proceedings of the IEEE Conference on Computer Vision and Pattern Recogni- tion, 2008, pp. 1{8.
  • R. Sinkhorn, \A relationship between arbitrary positive matrices and doubly stochastic matrices," The annals of mathematical statistics, vol. 35, no. 2, pp. 876{879, 1964.
  • R. Hartley and A. Zisserman, “Multiple View Geometry in Computer Vision,” Cambridge University Press, 2003.
  • R. Diestel, Graph theory. Springer, 2000.
  • P. J. Besl and N. D. McKay, \Method for registration of 3-d shapes," in Robotics-DL tentative. International Society for Optics and Photonics, 1992, pp. 586{606.
  • P. Foggia, G. Percannella, and M. Vento, \Graph matching and learning in pattern recognition in the last 10 years," International Journal of Pattern Recog- nition and Arti cial Intelligence, vol. 28, no. 01, 2014.
  • P. A. Regalia and E. Ko dis, \The higher-order power method revisited: convergence proofs and e ective initialization," in Proceedings of the IEEE Inter- national Conference on Acoustics, Speech, and Signal Processing, vol. 5, 2000, pp. 2709{2712.
  • O. Duchenne, F. Bach, I.-S. Kweon, and J. Ponce, \A tensor-based algorithm for high-order graph matching," IEEE transactions on Pattern Analysis and Machine Intelligence, vol. 33, no. 12, pp. 2383{2395, 2011.
  • M. Zaslavskiy, F. Bach, and J.-P. Vert, \A path following algorithm for the graph matching problem," IEEE Transactions on Pattern Analysis and Ma- chine Intelligence, vol. 31, no. 12, pp. 2227{2242, 2009.
  • M. Leordeanu, R. Sukthankar, and M. Hebert, \Unsupervised learning for graph matching," International Journal of Computer Vision, vol. 96, no. 1, pp. 28{45, 2012.
  • M. Leordeanu, M. Hebert, and R. Sukthankar, \Beyond local appearance: Category recognition from pairwise interactions of simple features," in Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition, 2007, pp. 1{8. 109
  • M. Leordeanu, M. Hebert, and R. Sukthankar, \An integer projected xed point method for graph matching and map inference," in Advances in Neural Information Processing Systems, 2009, pp. 1114{1122.
  • M. Leordeanu and M. Hebert, \A spectral technique for correspondence problems using pairwise constraints," in Proceedings of the IEEE International Con- ference on Computer Vision, vol. 2, 2005, pp. 1482{1489.
  • M. Gori, M. Maggini, and L. Sarti, \Exact and approximate graph matching using random walks," IEEE transactions on Pattern Analysis and Machine Intelligence, vol. 27, no. 7, pp. 1100{1111, 2005.
  • M. Cho, J. Sun, O. Duchenne, and J. Ponce, \Finding matches in a haystack: A max-pooling strategy for graph matching in the presence of outliers," in Pro- ceedings of the IEEE Conference on Computer Vision and Pattern Recognition, 2014, pp. 2083{2090.
  • M. Cho, J. Lee, and K. M. Lee, \Reweighted random walks for graph matching," in European Conference on Computer Vision. Springer, 2010, pp. 492{505.
  • M. Cho, J. Lee, and K. M. Lee, \Feature correspondence and deformable object matching via agglomerative correspondence clustering." in Proceedings of the IEEE International Conference on Computer Vision, 2009, pp. 1280{1287.
  • M. Chertok and Y. Keller, \Ecient high order matching," IEEE transactions on Pattern Analysis and Machine Intelligence, vol. 32, no. 12, pp. 2205{2215, 2010.
  • M. A. Fischler and R. C. Bolles, \Random sample consensus: a paradigm for model tting with applications to image analysis and automated cartography," Communications of the ACM, vol. 24, no. 6, pp. 381{395, 1981.
  • L. Torresani, V. Kolmogorov, and C. Rother, \Feature correspondence via graph matching: Models and global optimization," in European Conference on Com- puter Vision. Springer, 2008, pp. 596{609.
  • L. Page, S. Brin, R. Motwani, and T. Winograd, \The pagerank citation ranking: bringing order to the web." 1999.
  • L. Livi and A. Rizzi, \The graph matching problem," Pattern Analysis and Applications, vol. 16, no. 3, pp. 253{283, 2013.
  • L. Lin, X. Liu, and S.-C. Zhu, \Layered graph matching with composite cluster sampling," IEEE Transactions on Pattern Analysis and Machine Intelligence, vol. 32, no. 8, pp. 1426{1442, 2010.
  • K. Grauman and T. Darrell, \Pyramid match hashing: Sub-linear time indexing over partial correspondences," in Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition, 2007, pp. 1{8.
  • K. Adamczewski, Y. Suh, and K. Mu Lee, \Discrete tabu search for graph matching," in Proceedings of the IEEE International Conference on Computer Vision, 2015, pp. 109{117.
  • J. Yan, C. Zhang, H. Zha, W. Liu, X. Yang, and S. M. Chu, \Discrete hypergraph matching," in Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition, 2015, pp. 1520{1528.
  • J. Sivic, B. C. Russell, A. A. Efros, A. Zisserman, and W. T. Freeman, \Discovering object categories in image collections," 2005.
  • J. S. Liu, Monte Carlo strategies in scienti c computing. Springer Science & Business Media, 2008.
  • J. Munkres, \Algorithms for the assignment and transportation problems," Journal of the society for industrial and applied mathematics, vol. 5, no. 1, pp. 32{38, 1957.
  • J. Matas, O. Chum, M. Urban, and T. Pajdla, \Robust wide-baseline stereo from maximally stable extremal regions," Image and vision computing, vol. 22, no. 10, pp. 761{767, 2004.
  • J. Maciel and J. P. Costeira, \A global solution to sparse correspondence problems," IEEE Transactions on Pattern Analysis and Machine Intelligence, vol. 25, no. 2, pp. 187{199, 2003.
  • J. M. Kleinberg, \Authoritative sources in a hyperlinked environment," Journal of the ACM, vol. 46, no. 5, pp. 604{632, 1999.
  • J. Lee, M. Cho, and K. M. Lee, \Hyper-graph matching via reweighted random walks," in Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition, 2011, pp. 1633{1640.
  • J. Lee, M. Cho, and K. M. Lee, \A graph matching algorithm using data-driven markov chain monte carlo sampling," in Proceedings of the IEEE International Conference on Pattern Recognition, 2010, pp. 2816{2819.
  • J. Dattorro, Convex optimization & Euclidean distance geometry. Lulu. com, 2010.
  • F. Zhou and F. De la Torre, \Factorized graph matching," in Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition, 2012, pp. 127{134.
  • F. Zhou and F. De la Torre, \Deformable graph matching," in Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition, 2013, pp. 2922{2929.
  • F. Dellaert, S. M. Seitz, S. Thrun, and C. Thorpe, \Feature correspondence: A markov chain monte carlo approach," in Advances in Neural Information Processing Systems, 2000, pp. 852{858.
  • E. Seneta, Non-negative matrices and Markov chains. Springer Science & Business Media, 2006.
  • D. Zhou, J. Huang, and B. Scholkopf, \Learning with hypergraphs: Clustering, classi cation, and embedding," in Advances in Neural Information Processing Systems, 2006, pp. 1601{1608.
  • D. G. Lowe, \Object recognition from local scale-invariant features," in Pro- ceedings of the IEEE International Conference on Computer vision, vol. 2, 1999, pp. 1150{1157.
  • D. Conte, P. Foggia, C. Sansone, and M. Vento, \Thirty years of graph matching in pattern recognition," International Journal of Pattern Recognition and Arti cial Intelligence, vol. 18, no. 03, pp. 265{298, 2004.
  • B. J. van Wyk and M. A. van Wyk, \A pocs-based graph matching algorithm," IEEE transactions on Pattern Analysis and Machine Intelligence, vol. 26, no. 11, pp. 1526{1530, 2004.
  • B. D. Lucas, T. Kanade et al., \An iterative image registration technique with an application to stereo vision." in IJCAI, vol. 81, no. 1, 1981, pp. 674{679.
  • A. Robles-Kelly and E. R. Hancock, \String edit distance, random walks and graph matching," International Journal of Pattern Recognition and Arti cial Intelligence, vol. 18, no. 03, pp. 315{327, 2004.
  • A. N. Langville and C. D. Meyer, \Deeper inside pagerank," Internet Mathe- matics, vol. 1, no. 3, pp. 335{380, 2004.
  • A. Egozi, Y. Keller, and H. Guterman, \A probabilistic approach to spectral graph matching," IEEE Transactions on Pattern Analysis and Machine Intel- ligence, vol. 35, no. 1, pp. 18{27, 2013.
  • A. C. Berg, T. L. Berg, and J. Malik, \Shape matching and object recognition using low distortion correspondences," in Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition, vol. 1, 2005, pp. 26{33.
  • A. Albarelli, S. R. Bulo, A. Torsello, and M. Pelillo, \Matching as a noncooperative game," in Proceedings of the IEEE International Conference on Computer Vision, 2009, pp. 1319{1326.