{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,5]],"date-time":"2022-04-05T01:35:10Z","timestamp":1649122510823},"reference-count":14,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2012,1,1]],"date-time":"2012-01-01T00:00:00Z","timestamp":1325376000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["New Gener. Comput."],"published-print":{"date-parts":[[2012,1]]},"DOI":"10.1007\/s00354-012-0102-2","type":"journal-article","created":{"date-parts":[[2012,2,6]],"date-time":"2012-02-06T12:26:12Z","timestamp":1328531172000},"page":"3-16","source":"Crossref","is-referenced-by-count":0,"title":["A Family of CCCP Algorithms Which Minimize the TRW Free Energy"],"prefix":"10.1007","volume":"30","author":[{"given":"Yu","family":"Nishiyama","sequence":"first","affiliation":[]},{"given":"Xingyao","family":"Ye","sequence":"additional","affiliation":[]},{"given":"Alan L.","family":"Yuille","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2012,2,7]]},"reference":[{"issue":"1","key":"102_CR1","doi-asserted-by":"crossref","first-page":"25","DOI":"10.1023\/A:1026501619075","volume":"40","author":"W. Freeman","year":"2000","unstructured":"Freeman W., Pasztor E., Carmichael O.: \u201cLearning Low-Level Vision\u201d. International Journal of Computer Vision 40(1), 25\u201347 (2000)","journal-title":"International Journal of Computer Vision"},{"key":"102_CR2","doi-asserted-by":"crossref","unstructured":"Tappen, M. and Freeman, W., \u201cComparison of Graph Cuts with Belief Propagation for Stereo, Using Identical MRF Parameters,\u201d in Proc. of the 9th International Conference on Computer Vision (ICCV2003), pp. 900\u2013907, 2003.","DOI":"10.1109\/ICCV.2003.1238444"},{"key":"102_CR3","first-page":"1887","volume":"7","author":"C. Yanover","year":"2006","unstructured":"Yanover C., Meltzer T., Weiss Y.: \u201cLinear programming relaxations and belief propagation -an empirical study\u201d. Journal of Machine Learning Research 7, 1887\u20131907 (2006)","journal-title":"Journal of Machine Learning Research"},{"issue":"4","key":"102_CR4","doi-asserted-by":"crossref","first-page":"489","DOI":"10.1214\/ss\/1081443232","volume":"18","author":"S. Lauritzen","year":"2003","unstructured":"Lauritzen S., Sheehan N: \u201cGraphical Models for Genetic Analyses\u201d. Statistical Science 18(4), 489\u2013514 (2003)","journal-title":"Statistical Science"},{"issue":"9","key":"102_CR5","doi-asserted-by":"crossref","first-page":"2502","DOI":"10.1162\/neco.2009.08-08-837","volume":"21","author":"A. Steimer","year":"2009","unstructured":"Steimer A., Maass W., Douglas R.: \u201cBelief propagation in networks of spiking neurons\u201d. Neural Comput 21(9), 2502\u20132523 (2009)","journal-title":"Neural Comput"},{"issue":"7","key":"102_CR6","doi-asserted-by":"crossref","first-page":"1691","DOI":"10.1162\/08997660260028674","volume":"14","author":"A. Yuille","year":"2002","unstructured":"Yuille A.: \u201cCCCP Algorithms to Minimize the Bethe and Kikuchi Free Energies: Convergent Alternatives to Belief Propagation\u201d. Neural Comput 14(7), 1691\u20131722 (2002)","journal-title":"Neural Comput"},{"key":"102_CR7","doi-asserted-by":"crossref","first-page":"153","DOI":"10.1613\/jair.1933","volume":"26","author":"T. Heskes","year":"2006","unstructured":"Heskes T.: \u201cConvexity Arguments for Efficient Minimization of the Bethe and Kikuchi Free Energies\u201d. Journal of Artificial Intelligence Research 26, 153\u2013190 (2006)","journal-title":"Journal of Artificial Intelligence Research"},{"issue":"7","key":"102_CR8","doi-asserted-by":"crossref","first-page":"2313","DOI":"10.1109\/TIT.2005.850091","volume":"51","author":"M. Wainwright","year":"2005","unstructured":"Wainwright M., Jaakkola T., Willsky A.: \u201cA New Class of Upper Bounds on the Log Partition Function\u201d. IEEE trans. Information Theory 51(7), 2313\u20132335 (2005)","journal-title":"IEEE trans. Information Theory"},{"key":"102_CR9","unstructured":"Yu, C. and Joachims, T. \u201cLearning structural svms with latent variables,\u201d in Proc. of the 26th International Conference on Machine Learning (ICML2009), pp. 1169\u20131176, 2009."},{"key":"102_CR10","doi-asserted-by":"crossref","unstructured":"Nishiyama, Y. and Watanabe, S., \u201cGeneralization of Concave and Convex Decomposition in Kikuchi Free Energy\u201d in Proc. of International Conference on Artifical Neural Networks (ICANN 2008), pp. 51\u201360, 2008.","DOI":"10.1007\/978-3-540-87536-9_6"},{"key":"102_CR11","unstructured":"Wainwright, M. and Jordan, M., \u201cGraphical models, exponential families, and variational inference,\u201d Technical Report, UC Berkeley, Dept. of Statistics, 2003."},{"issue":"4","key":"102_CR12","doi-asserted-by":"crossref","first-page":"915","DOI":"10.1162\/08997660360581958","volume":"15","author":"A. Yuille","year":"2003","unstructured":"Yuille A., Rangarajan A.: \u201cThe Concave-Convex Procedure\u201d Neural Comput 15(4), 915\u2013936 (2003)","journal-title":"\u201cThe Concave-Convex Procedure\u201d Neural Comput"},{"key":"102_CR13","unstructured":"Globerson, A. and Jaakkola, T., \u201cConvergent propagation algorithms via oriented trees,\u201d in Proc. of The 23rd Conference on Uncertainty in Artificial Intelligence (UAI2007), 2007."},{"key":"102_CR14","unstructured":"Meltzer, T., Globerson, A. and Weiss, Y., \u201cConvergent message passing algorithms -a unifying view,\u201d in Proc. of The 25rd Conference on Uncertainty in Artificial Intelligence (UAI2009), 2009."}],"container-title":["New Generation Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00354-012-0102-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00354-012-0102-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00354-012-0102-2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,23]],"date-time":"2019-06-23T07:22:32Z","timestamp":1561274552000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00354-012-0102-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,1]]},"references-count":14,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2012,1]]}},"alternative-id":["102"],"URL":"https:\/\/doi.org\/10.1007\/s00354-012-0102-2","relation":{},"ISSN":["0288-3635","1882-7055"],"issn-type":[{"value":"0288-3635","type":"print"},{"value":"1882-7055","type":"electronic"}],"subject":[],"published":{"date-parts":[[2012,1]]}}}