{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T22:53:22Z","timestamp":1725490402101},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540442097"},{"type":"electronic","value":"9783540457831"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2002]]},"DOI":"10.1007\/3-540-45783-6_18","type":"book-chapter","created":{"date-parts":[[2007,8,27]],"date-time":"2007-08-27T16:30:58Z","timestamp":1188232258000},"page":"141-149","source":"Crossref","is-referenced-by-count":1,"title":["Unsupervised Image Partitioning with Semidefinite Programming"],"prefix":"10.1007","author":[{"given":"Jens","family":"Keuchel","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Christoph","family":"Schn\u00f6rr","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Christian","family":"Schellewald","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Daniel","family":"Cremers","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2002,10,10]]},"reference":[{"key":"18_CR1","unstructured":"Vision texture database. http:\/\/www-white.media.mit.edu\/vismod\/imagery\/VisionTexture\/vistex.html."},{"issue":"8","key":"18_CR2","doi-asserted-by":"publisher","first-page":"888","DOI":"10.1109\/34.868688","volume":"22","author":"J. Shi","year":"2000","unstructured":"J. Shi and J. Malik. Normalized cuts and image segmentation. IEEE Trans. Patt. Anal. Mach. Intell., 22(8):888\u2013905, 2000.","journal-title":"IEEE Trans. Patt. Anal. Mach. Intell."},{"key":"18_CR3","unstructured":"H. Ishikawa. Global Optimization Using Embedded Graphs. PhD thesis, Dept. Comp. Science, Courant Inst. Math. Sciences, New York University, 2000."},{"issue":"11","key":"18_CR4","doi-asserted-by":"publisher","first-page":"1222","DOI":"10.1109\/34.969114","volume":"23","author":"Y. Boykov","year":"2001","unstructured":"Y. Boykov, O. Veksler, and R. Zabih. Fast approximate energy minimization via graph cuts. IEEE Trans. Patt. Anal. Mach. Intell., 23(11):1222\u20131239, 2001.","journal-title":"IEEE Trans. Patt. Anal. Mach. Intell."},{"key":"18_CR5","doi-asserted-by":"crossref","unstructured":"B. Mohar and S. Poljak. Eigenvalues in combinatorial optimization. In R.A. Brualdi et al., editors, Combinatorial and Graph-Theoretical Problems in Linear Algebra, volume 50 of IMA Vol. Math. Appl., pages 107\u2013151. Springer, 1993.","DOI":"10.1007\/978-1-4613-8354-3_5"},{"key":"18_CR6","doi-asserted-by":"crossref","unstructured":"Y. Weiss. Segmentation using eigenvectors: a unifying view. In Proc. Int. Conf. Comp. Vision (ICCV\u201999), pages 975\u2013982, 1999.","DOI":"10.1109\/ICCV.1999.790354"},{"issue":"2","key":"18_CR7","doi-asserted-by":"publisher","first-page":"166","DOI":"10.1137\/0801013","volume":"1","author":"L. Lov\u00e1sz","year":"1991","unstructured":"L. Lov\u00e1sz and A. Schrijver. Cones of matrices and set-functions and 0\u20131 optimization. SIAM J. Optimization, 1(2):166\u2013190, 1991.","journal-title":"SIAM J. Optimization"},{"key":"18_CR8","doi-asserted-by":"publisher","first-page":"1115","DOI":"10.1145\/227683.227684","volume":"42","author":"M.X. Goemans","year":"1995","unstructured":"M.X. Goemans and D.P. Williamson. Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming. J. ACM, 42:1115\u20131145, 1995.","journal-title":"J. ACM"},{"key":"18_CR9","series-title":"Lect Notes Comput Sci","first-page":"235","volume-title":"Energy Minimization Methods in Computer Vision and Pattern Recognition","author":"C. Schellewald","year":"2001","unstructured":"C. Schellewald, J. Keuchel, and C. Schn\u00f6rr. Image labeling and grouping by minimizing linear functionals over cones. In M. Figueiredo et al., editors, Energy Minimization Methods in Computer Vision and Pattern Recognition, volume 2134 of Lect. Not. Comp. Sci., pages 235\u2013250. Springer, 2001."},{"key":"18_CR10","doi-asserted-by":"crossref","unstructured":"Y. Nesterov and A. Nemirovskii. Interior Point Polynomial Methods in Convex Programming. SIAM, 1994.","DOI":"10.1137\/1.9781611970791"},{"issue":"1","key":"18_CR11","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1109\/34.566806","volume":"19","author":"T. Hofmann","year":"1997","unstructured":"T. Hofmann and J. Buhmann. Pairwise data clustering by deterministic annealing. IEEE Trans. Patt. Anal. Mach. Intell., 19(1):1\u201314, 1997.","journal-title":"IEEE Trans. Patt. Anal. Mach. Intell."},{"key":"18_CR12","unstructured":"J. Keuchel, C. Schn\u00f6rr, C. Schellewald, and D. Cremers. Binary partitioning, perceptual grouping, and restoration with semidefinite programming. Technical Report 5\/2002, Computer Science Series, CVGPR Group, Univ. Mannheim, 2002."},{"key":"18_CR13","doi-asserted-by":"publisher","first-page":"515","DOI":"10.1080\/10556789908805761","volume":"11&12","author":"S.J. Benson","year":"1999","unstructured":"S.J. Benson, Y. Ye, and X. Zhang. Mixed linear and semidefinite programming for combinatorial and quadratic optimization. Optimiz. Methods and Software, 11&12:515\u2013544, 1999.","journal-title":"Optimiz. Methods and Software"},{"key":"18_CR14","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1007\/BF02523688","volume":"18","author":"A. Frieze","year":"1997","unstructured":"A. Frieze and M. Jerrum. Improved approximation algorithms for max k-cut and max bisection. Algorithmica, 18:67\u201381, 1997.","journal-title":"Algorithmica"},{"key":"18_CR15","doi-asserted-by":"publisher","first-page":"101","DOI":"10.1007\/PL00011415","volume":"90","author":"Y. Ye","year":"2001","unstructured":"Y. Ye. A.699-approximation algorithm for max-bisection. Mathematical Programming, 90:101\u2013111, 2001.","journal-title":"Mathematical Programming"},{"key":"18_CR16","doi-asserted-by":"publisher","first-page":"467","DOI":"10.1137\/0805024","volume":"5","author":"S. Poljak","year":"1995","unstructured":"S. Poljak and F. Rendl. Nonpolyhedral relaxations of graph-bisection problems. SIAM Journal on Optimization, 5:467\u2013487, 1995.","journal-title":"SIAM Journal on Optimization"},{"key":"18_CR17","doi-asserted-by":"crossref","unstructured":"J. Puzicha, J.M. Buhmann, Y. Rubner, and C. Tomasi. Empirical evaluation of dissimilarity measures for color and texture. In 7th Int. Conf. on Comp. Vision (ICCV\u201999), pages 1165\u20131172, 1999.","DOI":"10.1109\/ICCV.1999.790412"},{"key":"18_CR18","doi-asserted-by":"crossref","unstructured":"D. Comaniciu and P. Meer. Mean shift analysis and applications. In 7th Int. Conf. on Comp. Vision (ICCV\u201999), pages 1197\u20131203, 1999.","DOI":"10.1109\/ICCV.1999.790416"}],"container-title":["Lecture Notes in Computer Science","Pattern Recognition"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-45783-6_18","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,2,23]],"date-time":"2019-02-23T03:33:28Z","timestamp":1550892808000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-45783-6_18"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002]]},"ISBN":["9783540442097","9783540457831"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/3-540-45783-6_18","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2002]]}}}