[3] Grimson W E L, Huttenlocher D P[M]. Object recognition by computer: the role of geometric constraints, 350-504(1990).
[5] Serratosa F, Cortés X. Interactive graph-matching using active query strategies[J]. Pattern Recognition, 48, 1364-1373(2015).
[7] Gori M, Maggini M, Sarti L. Exact and approximate graph matching using random walks[J]. IEEE Transactions on Pattern Analysis and Machine Intelligence, 27, 1100-1111(2005).
[8] Cho M, Lee J, Lee K M. Reweighted random walks for graph matching[M]. ∥Daniilidis K, Maragos P, Paragios N. Computer vision-ECCV 2010. Lecture notes in computer science. Berlin, Heidelberg: Springer, 6315, 492-505(2010).
[9] Zaslavskiy M, Bach F, Vert J P. A path following algorithm for the graph matching problem[J]. IEEE Transactions on Pattern Analysis and Machine Intelligence, 31, 2227-2242(2009).
[10] Tao S Q[J]. Wang S T. An algorithm for weighted sub-graph matching based on gradient flows. Information Sciences, 340/341, 104-121(2016).
[11] Suh Y, Adamczewski K, Mu Lee K. Subgraph matching using compactness prior for robust feature correspondence. [C]∥2015 IEEE Conference on Computer Vision and Pattern Recognition (CVPR), June 7-12, 2015, Boston, MA, USA. New York: IEEE, 5070-5078(2015).
[12] Dahm N, Bunke H, Caelli T et al. Efficient subgraph matching using topological node feature constraints[J]. Pattern Recognition, 48, 317-330(2015).
[13] Lee J, Cho M, Lee K M. A graph matching algorithm using data-driven Markov chain Monte Carlo sampling. [C]∥2010 20th International Conference on Pattern Recognition, August 23-26, 2010, Istanbul, Turkey. New York: IEEE, 2816-2819(2010).
[14] Nie W Z, Liu A A, Gao Z et al. Clique-graph matching by preserving global & local structure. [C]∥2015 IEEE Conference on Computer Vision and Pattern Recognition (CVPR), June 7-12, 2015, Boston, MA, USA. New York: IEEE, 4503-4510(2015).
[15] Leordeanu M, Hebert M. A spectral technique for correspondence problems using pairwise constraints. [C]∥Tenth IEEE International Conference on Computer Vision (ICCV'05), October 17-21, 2005, Beijing, China. New York: IEEE, 1, 1482-1489(2005).
[16] Liu A A, Wang Z Y, Nie W Z et al. Graph-based characteristic view set extraction and matching for 3D model retrieval[J]. Information Sciences, 320, 429-442(2015).
[17] Zass R, Shashua A. Probabilistic graph and hypergraph matching. [C]∥IEEE Conference on Computer Vision and Pattern Recognition, June 23-28, 2008, Anchorage, AK, USA. New York: IEEE, 10139805(2008).
[18] Lee J, Cho M, Lee K M. Hyper-graph matching via reweighted random walks. [C]∥2011 IEEE Conference on Computer Vision and Pattern Recognition, June 20-25, 2011, Providence, RI, USA. New York: IEEE, 1633-1640(2011).
[20] Zhou F, de la Torre F. Factorized graph matching. [C]∥2012 IEEE Conference on Computer Vision and Pattern Recognition, June 16-21, 2012, Providence, RI, USA. New York: IEEE, 127-134(2012).
[21] Leordeanu M, Hebert M, Sukthankar R. An integer projected fixed point method for graph matching and map inference. [C]∥Advances in Neural Information Processing Systems. December 7-10, 2009, Vancouver, British Columbia, Canada. Canada: NIPS, 1114-1122(2009).
[22] Cour T, Srinivasan P, Shi J B. Balanced graph matching. [C]∥Advances in Neural Information Processing Systems, December 4-7, 2006, Vancouver, British Columbia, Canada. Canada: NIPS, 313-320(2007).
[23] Gold S, Rangarajan A. A graduated assignment algorithm for graph matching[J]. IEEE Transactions on Pattern Analysis and Machine Intelligence, 18, 377-388(1996).
[24] Chun Y D, Kim N C, Jang I H. Content-based image retrieval using multiresolution color and texture features[J]. IEEE Transactions on Multimedia, 10, 1073-1084(2008).
[26] Wen Y, Gao Y, Hong R C et al. View-based 3D object retrieval by bipartite graph matching. [C]∥Proceedings of the 20th ACM international conference on Multimedia, October 29-November 2, 2012, Nara, Japan. New York: ACM, 897-900(2012).
[27] Ansary T F, Daoudi M, Vandeborre J P. A Bayesian 3-D search engine using adaptive views clustering[J]. IEEE Transactions on Multimedia, Institute of Electrical and Electronics Engineers, 9, 78-88(2007).