{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,8]],"date-time":"2024-09-08T15:05:41Z","timestamp":1725807941772},"publisher-location":"Cham","reference-count":14,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319126395"},{"type":"electronic","value":"9783319126401"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-319-12640-1_49","type":"book-chapter","created":{"date-parts":[[2014,10,20]],"date-time":"2014-10-20T20:14:56Z","timestamp":1413836096000},"page":"404-412","source":"Crossref","is-referenced-by-count":6,"title":["MAP Inference with MRF by Graduated Non-Convexity and Concavity Procedure"],"prefix":"10.1007","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":"Jian-Hua","family":"Su","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"11","key":"49_CR1","doi-asserted-by":"publisher","first-page":"1222","DOI":"10.1109\/34.969114","volume":"23","author":"Y. Boykov","year":"2001","unstructured":"Boykov, Y., Veksler, O., Zabih, R.: Fast approximate energy minimization via graph cuts. IEEE Transactions on Pattern Analysis and Machine Intelligence\u00a023(11), 1222\u20131239 (2001)","journal-title":"IEEE Transactions on Pattern Analysis and Machine Intelligence"},{"key":"49_CR2","unstructured":"Cour, T., Shi, J.: Solving markov random fields with spectral relaxation. Journal of Machine Learning Research - Proceedings Track, 75\u201382 (2007)"},{"issue":"1-2","key":"49_CR3","doi-asserted-by":"publisher","first-page":"95","DOI":"10.1002\/nav.3800030109","volume":"3","author":"M. Frank","year":"1956","unstructured":"Frank, M., Wolfe, P.: An algorithm for quadratic programming. Naval Research Logistics Quarterly\u00a03(1-2), 95\u2013110 (1956)","journal-title":"Naval Research Logistics Quarterly"},{"issue":"1","key":"49_CR4","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1023\/A:1026501619075","volume":"40","author":"W. Freeman","year":"2000","unstructured":"Freeman, W., Pasztor, E., Carmichael, O.: Learning low-level vision. International Journal of Computer Vision\u00a040(1), 25\u201347 (2000)","journal-title":"International Journal of Computer Vision"},{"key":"49_CR5","unstructured":"Leordeanu, M., Herbert, M., Sukthankar, R.: An integer projected fixed point method for graph matching and map inference. In: NIPS (2009)"},{"key":"49_CR6","doi-asserted-by":"crossref","unstructured":"Liu, Z.Y., Qiao, H.: Gnccp - graduated nonconvexity and concavity procedure. IEEE Transactions on Pattern Analysis and Machine Intelligence (2014), doi:10.1109\/TPAMI.2013.223","DOI":"10.1109\/TPAMI.2013.223"},{"issue":"7","key":"49_CR7","doi-asserted-by":"publisher","first-page":"1451","DOI":"10.1109\/TPAMI.2012.45","volume":"34","author":"Z.Y. Liu","year":"2012","unstructured":"Liu, Z.Y., Qiao, H., Xu, L.: An extended path following algorithm for graph matching problem. IEEE Transactions on Pattern Analysis and Machine Intelligence\u00a034(7), 1451\u20131456 (2012)","journal-title":"IEEE Transactions on Pattern Analysis and Machine Intelligence"},{"key":"49_CR8","doi-asserted-by":"crossref","unstructured":"Liu, Z.Y., Qiao, H., Yang, X., Hoi, C.S.: Graph matching by simplified convex-concave relaxation procedure. International Journal of Computer Vision (2014), doi:10.1007\/s11263\u2013014\u20130707\u20137","DOI":"10.1007\/s11263-014-0707-7"},{"key":"49_CR9","first-page":"237","volume":"25","author":"Z.Y. Liu","year":"2012","unstructured":"Liu, Z.Y., Qiao, H.: A convex-concave relaxation procedure based subgraph matching algorithm. Journal of Machine Learing Research: W&CP\u00a025, 237\u2013252 (2012)","journal-title":"Journal of Machine Learing Research: W&CP"},{"key":"49_CR10","unstructured":"Murphy, K.P., Weiss, Y., Jordan, M.I.: Loopy belief propagation for approximate inference: An empirical study. In: Uncertainty in Artificial Intelligence (1999)"},{"key":"49_CR11","doi-asserted-by":"crossref","unstructured":"Ravikumar, P., Lafferty, J.D.: Quadratic programming relaxations for metric labeling and markov random field map estimation. In: ICML, pp. 737\u2013744 (2006)","DOI":"10.1145\/1143844.1143937"},{"issue":"6","key":"49_CR12","doi-asserted-by":"publisher","first-page":"1068","DOI":"10.1109\/TPAMI.2007.70844","volume":"30","author":"R. Szeliski","year":"2008","unstructured":"Szeliski, R., Zabih, R., Scharstein, D., Veksler, O., Kolmogorov, V., Agarwala, A., Tappen, M., Rother, C.: A comparative study of energy minimization methods for markov random fields with smoothness-based priors. IEEE Transactions on Pattern Analysis and Machine Intelligence\u00a030(6), 1068\u20131080 (2008)","journal-title":"IEEE Transactions on Pattern Analysis and Machine Intelligence"},{"key":"49_CR13","doi-asserted-by":"crossref","unstructured":"Tappen, M.F., Freeman, W.T.: Comparison of graph cuts with belief propagation for stereo, using identical mrf parameters. In: Proceedings of the Ninth IEEE International Conference on Computer Vision, pp. 900\u2013906. IEEE (2003)","DOI":"10.1109\/ICCV.2003.1238444"},{"issue":"12","key":"49_CR14","doi-asserted-by":"publisher","first-page":"2227","DOI":"10.1109\/TPAMI.2008.245","volume":"31","author":"M. Zaslavskiy","year":"2009","unstructured":"Zaslavskiy, M., Bach, F., Vert, J.P.: A path following algorithm for the graph matching problem. IEEE Transactions on Pattern Analysis and Machine Intelligence\u00a031(12), 2227\u20132242 (2009)","journal-title":"IEEE Transactions on Pattern Analysis and Machine Intelligence"}],"container-title":["Lecture Notes in Computer Science","Neural Information Processing"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-12640-1_49","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,28]],"date-time":"2019-05-28T05:47:29Z","timestamp":1559022449000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-12640-1_49"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783319126395","9783319126401"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-12640-1_49","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2014]]}}}