{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,4]],"date-time":"2025-11-04T15:56:24Z","timestamp":1762271784365},"reference-count":32,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2014,3,22]],"date-time":"2014-03-22T00:00:00Z","timestamp":1395446400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Int J Comput Vis"],"published-print":{"date-parts":[[2014,9]]},"DOI":"10.1007\/s11263-014-0707-7","type":"journal-article","created":{"date-parts":[[2014,3,21]],"date-time":"2014-03-21T06:27:23Z","timestamp":1395383243000},"page":"169-186","source":"Crossref","is-referenced-by-count":50,"title":["Graph Matching by Simplified Convex-Concave Relaxation Procedure"],"prefix":"10.1007","volume":"109","author":[{"given":"Zhi-Yong","family":"Liu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hong","family":"Qiao","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xu","family":"Yang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Steven C. H.","family":"Hoi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2014,3,22]]},"reference":[{"key":"707_CR1","doi-asserted-by":"crossref","DOI":"10.7551\/mitpress\/7132.001.0001","volume-title":"Visual Reconstruction","author":"A Blake","year":"1987","unstructured":"Blake, A., & Zisserman, A. (1987). Visual Reconstruction. Cambridge, MA, USA: MIT Press."},{"key":"707_CR2","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511804441","volume-title":"Convex Optimization","author":"S Boyd","year":"2004","unstructured":"Boyd, S., & Vandenberghe, L. (2004). Convex Optimization. New York: Cambridge University Press."},{"key":"707_CR3","unstructured":"Cho, M., Alahari, K., Ponce, J., et al. (2013). Learning graphs to match. In: ICCV 2013-IEEE International Conference on Computer Vision."},{"key":"707_CR4","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-15555-0_36","volume-title":"Reweighted random walks for graph matching. In: Computer Vision-ECCV 2010","author":"M Cho","year":"2010","unstructured":"Cho, M., Lee, J., & Lee, K. M. (2010). Reweighted random walks for graph matching. In: Computer Vision-ECCV 2010. Berlin: Springer."},{"key":"707_CR5","unstructured":"Cho, M., Lee, K.M. (2012). Progressive graph matching: Making a move of graphs via probabilistic voting. In: Computer Vision and Pattern Recognition (CVPR), 2012 IEEE Conference on, pp. 398\u2013405. IEEE."},{"issue":"3","key":"707_CR6","doi-asserted-by":"crossref","first-page":"265","DOI":"10.1142\/S0218001404003228","volume":"18","author":"D Conte","year":"2004","unstructured":"Conte, D., Foggia, P., Sansone, C., & Vento, M. (2004). Thirty years of graph matching in pattern recognition. International Journal of Pattern Recognition and Artificial Intelligence, 18(3), 265\u2013298.","journal-title":"International Journal of Pattern Recognition and Artificial Intelligence"},{"key":"707_CR7","first-page":"313","volume":"19","author":"T Cour","year":"2007","unstructured":"Cour, T., Srinivasan, P., & Shi, J. (2007). Balanced graph matching. Advances in Neural Information Processing Systems, 19, 313.","journal-title":"Advances in Neural Information Processing Systems"},{"issue":"2","key":"707_CR8","doi-asserted-by":"crossref","first-page":"203","DOI":"10.1007\/s11263-006-6993-y","volume":"69","author":"MF Demirci","year":"2006","unstructured":"Demirci, M. F., Shokoufandeh, A., Keselman, Y., Bretzner, L., & Dickinson, S. (2006). Object recognition as many-to-many feature matching. International Journal of Computer Vision, 69(2), 203\u2013222.","journal-title":"International Journal of Computer Vision"},{"key":"707_CR9","doi-asserted-by":"crossref","unstructured":"Duchenne, O., Joulin, A., Ponce, J. (2011). A graph-matching kernel for object categorization. IEEE International Conference on Computer Vision pp. 1792\u20131799.","DOI":"10.1109\/ICCV.2011.6126445"},{"issue":"1","key":"707_CR10","doi-asserted-by":"crossref","first-page":"18","DOI":"10.1109\/TPAMI.2012.51","volume":"35","author":"A Egozi","year":"2013","unstructured":"Egozi, A., Keller, Y., & Guterman, H. (2013). A probabilistic approach to spectral graph matching. IEEE Transactions on Pattern Analysis and Machine Intelligence, 35(1), 18\u201327.","journal-title":"IEEE Transactions on Pattern Analysis and Machine Intelligence"},{"issue":"1","key":"707_CR11","doi-asserted-by":"crossref","first-page":"67","DOI":"10.1109\/T-C.1973.223602","volume":"C\u201322","author":"MA Fischler","year":"1973","unstructured":"Fischler, M. A., & Elschlager, R. A. (1973). The representation and matching of pictorial structures. IEEE Transactions on Computers, C\u201322(1), 67\u201392.","journal-title":"IEEE Transactions on Computers"},{"issue":"1\u20132","key":"707_CR12","doi-asserted-by":"crossref","first-page":"95","DOI":"10.1002\/nav.3800030109","volume":"3","author":"M Frank","year":"1956","unstructured":"Frank, M., & Wolfe, P. (1956). An algorithm for quadratic programming. Naval Research Logistics Quarterly, 3(1\u20132), 95\u2013110.","journal-title":"Naval Research Logistics Quarterly"},{"issue":"3","key":"707_CR13","doi-asserted-by":"crossref","first-page":"227","DOI":"10.1007\/BF00115697","volume":"6","author":"D Geiger","year":"1991","unstructured":"Geiger, D., & Yuille, A. (1991). A common framework for image segmentation. International Journal of Computer Vision, 6(3), 227\u2013243.","journal-title":"International Journal of Computer Vision"},{"issue":"4","key":"707_CR14","doi-asserted-by":"crossref","first-page":"377","DOI":"10.1109\/34.491619","volume":"18","author":"S Gold","year":"1996","unstructured":"Gold, S., & Rangarajan, A. (1996). A graduated assignment algorithm for graph matching. IEEE Transactions on Pattern Analysis and Machine Intelligence, 18(4), 377\u2013388.","journal-title":"IEEE Transactions on Pattern Analysis and Machine Intelligence"},{"issue":"1\u20132","key":"707_CR15","doi-asserted-by":"crossref","first-page":"83","DOI":"10.1002\/nav.3800020109","volume":"2","author":"HW Kuhn","year":"1955","unstructured":"Kuhn, H. W. (1955). The hungarian method for the assignment problem. Naval Research Logistics Quarterly, 2(1\u20132), 83\u201397.","journal-title":"Naval Research Logistics Quarterly"},{"key":"707_CR16","doi-asserted-by":"crossref","first-page":"1482","DOI":"10.1109\/ICCV.2005.20","volume":"2","author":"M Leordeanu","year":"2005","unstructured":"Leordeanu, M., & Hebert, M. (2005). A spectral technique for correspondence problems using pairwise constraints. Tenth IEEE International Conference on Computer Vision, 2, 1482\u20131489.","journal-title":"Tenth IEEE International Conference on Computer Vision"},{"key":"707_CR17","unstructured":"Leordeanu, M., Herbert, M., Sukthankar, R. (2009). An integer projected fixed point method for graph matching and map inference. Advances in Neural Information Processing Systems p. 1114C1122."},{"issue":"1","key":"707_CR18","doi-asserted-by":"crossref","first-page":"28","DOI":"10.1007\/s11263-011-0442-2","volume":"96","author":"M Leordeanu","year":"2012","unstructured":"Leordeanu, M., Sukthankar, R., & Hebert, M. (2012). Unsupervised learning for graph matching. International journal of computer vision, 96(1), 28\u201345.","journal-title":"International journal of computer vision"},{"key":"707_CR19","doi-asserted-by":"crossref","unstructured":"Liu, C. L., Yin, F., Wang, D. H., & Wang, Q. F. (2011). Casia online and offline chinese handwriting databases. In: Preceedings of the International Conference on Document Analysis and Recognition, 2011, 37\u201341.","DOI":"10.1109\/ICDAR.2011.17"},{"key":"707_CR20","first-page":"237","volume":"25","author":"ZY Liu","year":"2012","unstructured":"Liu, Z. Y., & Qiao, H. (2012). A convex-concave relaxation procedure based subgraph matching algorithm. Journal of Machine Learning Research: W&CP, 25, 237\u2013252.","journal-title":"Journal of Machine Learning Research: W&CP"},{"issue":"7","key":"707_CR21","doi-asserted-by":"crossref","first-page":"1451","DOI":"10.1109\/TPAMI.2012.45","volume":"34","author":"ZY Liu","year":"2012","unstructured":"Liu, Z. Y., Qiao, H., & Xu, L. (2012). An extended path following algorithm for graph matching problem. IEEE Transactions on Pattern Analysis and Machine Intelligence, 34(7), 1451\u20131456.","journal-title":"IEEE Transactions on Pattern Analysis and Machine Intelligence"},{"key":"707_CR22","doi-asserted-by":"crossref","unstructured":"Maciel, J., & Costeira, J. P. (2003). A global solution to sparse correspondence problems. IEEE Transactions on Pattern Analysis and Machine Intelligence, 25(2), 187\u2013199.","DOI":"10.1109\/TPAMI.2003.1177151"},{"issue":"2","key":"707_CR23","doi-asserted-by":"crossref","first-page":"138","DOI":"10.1007\/s11263-010-0363-5","volume":"95","author":"G Philbin","year":"2011","unstructured":"Philbin, G., Sivic, J., & Zisserman, A. (2011). Geometric latent dirichlet allocation on a matching graph for large-scale image datasets. International Journal of Computer Vision, 95(2), 138\u2013153.","journal-title":"International Journal of Computer Vision"},{"key":"707_CR24","doi-asserted-by":"crossref","unstructured":"Ravikumar, P., Lakerty, J. (2006). Quadratic programming relaxations for metric labeling and markov random field map estimation. International Conference on Machine Learning.","DOI":"10.1145\/1143844.1143937"},{"issue":"11","key":"707_CR25","doi-asserted-by":"crossref","first-page":"2210","DOI":"10.1109\/5.726788","volume":"86","author":"K Rose","year":"1998","unstructured":"Rose, K. (1998). Deterministic annealing for clustering, compression, classification, regression, and related optimization problems. Proceedings of the IEEE, 86(11), 2210\u20132239.","journal-title":"Proceedings of the IEEE"},{"key":"707_CR26","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-33712-3_45","volume-title":"Graph matching via sequential monte carlo. In: Computer Vision-ECCV 2012","author":"Y Suh","year":"2012","unstructured":"Suh, Y., Cho, M., & Lee, K. M. (2012). Graph matching via sequential monte carlo. In: Computer Vision-ECCV 2012. Berlin: Springer."},{"key":"707_CR27","volume-title":"On the convergence of graph matching: graduated assignment revisited. In: Computer Vision-ECCV 2012","author":"Y Tian","year":"2012","unstructured":"Tian, Y., Yan, J., Zhang, H., Zhang, Y., Yang, X., & Zha, H. (2012). On the convergence of graph matching: graduated assignment revisited. In: Computer Vision-ECCV 2012. Berlin: Springer."},{"key":"707_CR28","doi-asserted-by":"crossref","unstructured":"Torresani, L., Kolmogorov, V., Rother, C. (2008). Feature correspondence via graph matching: Models and global optimization. In D. Forsyth, P. Torr, A. Ziseerman (eds.), ECCV 2008, Part II, LNCS 5303, (pp. 596\u2013609).","DOI":"10.1007\/978-3-540-88688-4_44"},{"issue":"5","key":"707_CR29","doi-asserted-by":"crossref","first-page":"695","DOI":"10.1109\/34.6778","volume":"10","author":"S Umeyama","year":"1988","unstructured":"Umeyama, S. (1988). An eigendecomposition approach to weighted graph matching problems. IEEE Transactions on Pattern Analysis and Machine Intelligence, 10(5), 695\u2013703.","journal-title":"IEEE Transactions on Pattern Analysis and Machine Intelligence"},{"issue":"12","key":"707_CR30","doi-asserted-by":"crossref","first-page":"2227","DOI":"10.1109\/TPAMI.2008.245","volume":"31","author":"M Zaslavskiy","year":"2009","unstructured":"Zaslavskiy, M., Bach, F., & Vert, J. P. (2009). A path following algorithm for the graph matching problem. IEEE Transactions on Pattern Analysis and Machine Intelligence, 31(12), 2227\u20132242.","journal-title":"IEEE Transactions on Pattern Analysis and Machine Intelligence"},{"key":"707_CR31","unstructured":"Zhou, F., De la Torre, F. (2012). Factorized graph matching. In: IEEE International Conference on Computer Vision and Pattern Recognition, pp. 127\u2013134."},{"key":"707_CR32","doi-asserted-by":"crossref","unstructured":"Zhou, F., De la Torre, F. (2013). Deformable graph matching. In: Computer Vision and Pattern Recognition (CVPR), 2013 IEEE Conference on, pp. 2922\u20132929. IEEE.","DOI":"10.1109\/CVPR.2013.376"}],"container-title":["International Journal of Computer Vision"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11263-014-0707-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11263-014-0707-7\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11263-014-0707-7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,8]],"date-time":"2019-08-08T19:27:07Z","timestamp":1565292427000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11263-014-0707-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,3,22]]},"references-count":32,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2014,9]]}},"alternative-id":["707"],"URL":"https:\/\/doi.org\/10.1007\/s11263-014-0707-7","relation":{},"ISSN":["0920-5691","1573-1405"],"issn-type":[{"value":"0920-5691","type":"print"},{"value":"1573-1405","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014,3,22]]}}}