{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T18:31:02Z","timestamp":1743013862625,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":20,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540338345"},{"type":"electronic","value":"9783540338352"}],"license":[{"start":{"date-parts":[[2006,1,1]],"date-time":"2006-01-01T00:00:00Z","timestamp":1136073600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11744047_35","type":"book-chapter","created":{"date-parts":[[2006,7,23]],"date-time":"2006-07-23T11:16:35Z","timestamp":1153653395000},"page":"454-467","source":"Crossref","is-referenced-by-count":7,"title":["Multiclass Image Labeling with Semidefinite Programming"],"prefix":"10.1007","author":[{"given":"Jens","family":"Keuchel","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"35_CR1","series-title":"Appl. of Mathematics","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-97522-6","volume-title":"Image Analysis, Random Fields and Dynamic Monte Carlo Methods","author":"G. Winkler","year":"1995","unstructured":"Winkler, G.: Image Analysis, Random Fields and Dynamic Monte Carlo Methods. Appl. of Mathematics, vol.\u00a027. Springer, Heidelberg (1995)"},{"key":"35_CR2","doi-asserted-by":"publisher","first-page":"721","DOI":"10.1109\/TPAMI.1984.4767596","volume":"6","author":"S. Geman","year":"1984","unstructured":"Geman, S., Geman, D.: Stochastic relaxation, Gibbs distributions, and the Bayesian restoration of images. IEEE Trans. PAMI\u00a06, 721\u2013741 (1984)","journal-title":"IEEE Trans. PAMI"},{"key":"35_CR3","doi-asserted-by":"crossref","first-page":"259","DOI":"10.1111\/j.2517-6161.1986.tb01412.x","volume":"48","author":"J. Besag","year":"1986","unstructured":"Besag, J.: On the statistical analysis of dirty pictures. Journal of the Royal Statistical Society, Series B\u00a048, 259\u2013302 (1986)","journal-title":"Journal of the Royal Statistical Society, Series B"},{"key":"35_CR4","doi-asserted-by":"publisher","DOI":"10.1007\/978-4-431-67044-5","volume-title":"Markov Random Field Modeling in Image Analysis","author":"S.Z. Li","year":"2001","unstructured":"Li, S.Z.: Markov Random Field Modeling in Image Analysis. Springer, Heidelberg (2001)"},{"key":"35_CR5","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 Trans. PAMI\u00a023, 1222\u20131239 (2001)","journal-title":"IEEE Trans. PAMI"},{"key":"35_CR6","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.: Visual Reconstruction. MIT Press, Cambridge (1987)"},{"key":"35_CR7","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1109\/34.566806","volume":"19","author":"T. Hofmann","year":"1997","unstructured":"Hofmann, T., Buhmann, J.: Pairwise data clustering by deterministic annealing. IEEE Trans. PAMI\u00a019, 1\u201314 (1997)","journal-title":"IEEE Trans. PAMI"},{"key":"35_CR8","doi-asserted-by":"publisher","first-page":"616","DOI":"10.1145\/585265.585268","volume":"49","author":"J. Kleinberg","year":"2002","unstructured":"Kleinberg, J., Tardos, E.: Approximation algorithms for classification problems with pairwise relationships: Metric labeling and Markov random fields. Journal of the ACM\u00a049, 616\u2013639 (2002)","journal-title":"Journal of the ACM"},{"key":"35_CR9","doi-asserted-by":"publisher","first-page":"1364","DOI":"10.1109\/TPAMI.2003.1240111","volume":"25","author":"J. Keuchel","year":"2003","unstructured":"Keuchel, J., Schn\u00f6rr, C., Schellewald, C., Cremers, D.: Binary partitioning, perceptual grouping, and restoration with semidefinite programming. IEEE Trans. PAMI\u00a025, 1364\u20131379 (2003)","journal-title":"IEEE Trans. PAMI"},{"key":"35_CR10","doi-asserted-by":"publisher","first-page":"71","DOI":"10.1023\/A:1009795911987","volume":"2","author":"Q. Zhao","year":"1998","unstructured":"Zhao, Q., Karisch, S.E., Rendl, F., Wolkowicz, H.: Semidefinite programming relaxations for the quadratic assignment problem. J. Combinat. Optim.\u00a02, 71\u2013109 (1998)","journal-title":"J. Combinat. Optim."},{"key":"35_CR11","doi-asserted-by":"publisher","first-page":"513","DOI":"10.1016\/S0166-218X(01)00352-3","volume":"123","author":"H. Wolkowicz","year":"2002","unstructured":"Wolkowicz, H., Anjos, M.F.: Semidefinite programming for discrete optimization and matrix completion problems. Discr. Appl. Math.\u00a0123, 513\u2013577 (2002)","journal-title":"Discr. Appl. Math."},{"key":"35_CR12","series-title":"Handbooks in Op. Res. and Man. Sci","doi-asserted-by":"publisher","DOI":"10.1016\/S0927-0507(05)12008-8","volume-title":"Discrete Optimization","author":"M. Laurent","year":"2005","unstructured":"Laurent, M., Rendl, F.: Semidefinite programming and integer programming. In: Aardal, K., Nemhauser, G.L., Weismantel, R. (eds.) Discrete Optimization. Handbooks in Op. Res. and Man. Sci, vol.\u00a012, Elsevier, Amsterdam (2005)"},{"key":"35_CR13","doi-asserted-by":"publisher","first-page":"147","DOI":"10.1109\/TPAMI.2004.1262177","volume":"26","author":"V. Kolmogorov","year":"2004","unstructured":"Kolmogorov, V., Zabih, R.: What energy functions can be minimized via graph cuts? IEEE Trans. PAMI\u00a026, 147\u2013159 (2004)","journal-title":"IEEE Trans. PAMI"},{"key":"35_CR14","doi-asserted-by":"crossref","unstructured":"Rother, C., Kumar, S., Kolmogorov, V., Blake, A.: Digital tapestry. In: Proceedings CVPR, vol.\u00a0(1), pp. 589\u2013596 (2005)","DOI":"10.1109\/CVPR.2005.130"},{"key":"35_CR15","doi-asserted-by":"crossref","unstructured":"Raj, A., Zabih, R.: A graph cut algorithm for generalized image deconvolution. In: Proc. 10th Int. Conf. Computer Vision (ICCV), pp. 1048\u20131054 (2005)","DOI":"10.1109\/ICCV.2005.8"},{"key":"35_CR16","series-title":"International Series in Operations Research & Management Science","volume-title":"Handbook of Semidefinite Programming","year":"2000","unstructured":"Wolkowicz, H., Saigal, R., Vandenberghe, L. (eds.): Handbook of Semidefinite Programming. International Series in Operations Research & Management Science, vol.\u00a027. Kluwer Acad. Publ., Boston (2000)"},{"key":"35_CR17","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4757-2787-6","volume-title":"The Quadratic Assignment Problem: Theory and Algorithms","author":"E. \u00c7ela","year":"1998","unstructured":"\u00c7ela, E.: The Quadratic Assignment Problem: Theory and Algorithms. Kluwer Academic Publishers, Dordrecht (1998)"},{"key":"35_CR18","doi-asserted-by":"publisher","first-page":"49","DOI":"10.1080\/10556780108805828","volume":"16","author":"N. Brixius","year":"2001","unstructured":"Brixius, N., Anstreicher, K.: Solving quadratic assignment problems using convex quadratic programming relaxations. Optim. Methods Software\u00a016, 49\u201368 (2001)","journal-title":"Optim. Methods Software"},{"key":"35_CR19","doi-asserted-by":"publisher","first-page":"13","DOI":"10.1137\/0805002","volume":"5","author":"F. Alizadeh","year":"1995","unstructured":"Alizadeh, F.: Interior point methods in semidefinite programming with applications to combinatorial optimization. SIAM J.\u00a0Optimization\u00a05, 13\u201351 (1995)","journal-title":"SIAM J.\u00a0Optimization"},{"key":"35_CR20","doi-asserted-by":"publisher","first-page":"317","DOI":"10.1080\/1055678031000098773","volume":"18","author":"M. Ko\u010dvara","year":"2003","unstructured":"Ko\u010dvara, M., Stingl, M.: PENNON - a code for convex nonlinear and semidefinite programming. Optimization Methods and Software\u00a018, 317\u2013333 (2003)","journal-title":"Optimization Methods and Software"}],"container-title":["Lecture Notes in Computer Science","Computer Vision \u2013 ECCV 2006"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11744047_35","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,10]],"date-time":"2025-01-10T01:28:37Z","timestamp":1736472517000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11744047_35"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540338345","9783540338352"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/11744047_35","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2006]]}}}