{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T05:19:01Z","timestamp":1725513541153},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540730392"},{"type":"electronic","value":"9783540730408"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-73040-8_29","type":"book-chapter","created":{"date-parts":[[2007,7,2]],"date-time":"2007-07-02T11:48:18Z","timestamp":1183376898000},"page":"283-292","source":"Crossref","is-referenced-by-count":2,"title":["Image Segmentation with Context"],"prefix":"10.1007","author":[{"given":"Anders P.","family":"Eriksson","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Carl","family":"Olsson","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Fredrik","family":"Kahl","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"volume-title":"Handbook of Semidefinite Programming","year":"2000","key":"29_CR1","unstructured":"Wolkowicz, H., Saigal, R., Vandenberghe, L. (eds.): Handbook of Semidefinite Programming. Kluwer Academic Publishers, Dordrecht (2000)"},{"issue":"2","key":"29_CR2","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. Pattern Analysis and Machine Intelligence\u00a026(2), 147\u2013159 (2004)","journal-title":"IEEE Trans. Pattern Analysis and Machine Intelligence"},{"issue":"11","key":"29_CR3","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. Pattern Analysis and Machine Intelligence\u00a023(11), 1222\u20131239 (2001)","journal-title":"IEEE Trans. Pattern Analysis and Machine Intelligence"},{"key":"29_CR4","doi-asserted-by":"crossref","unstructured":"Olsson, C., Eriksson, A.P., Kahl, F.: Solving large scale binary quadratic problems: Spectral methods vs semidefinite programming. In: CVPR (2007)","DOI":"10.1109\/CVPR.2007.383202"},{"key":"29_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"82","DOI":"10.1007\/3-540-47977-5_6","volume-title":"Computer Vision - ECCV 2002","author":"V. Kolmogorov","year":"2002","unstructured":"Kolmogorov, V., Zabih, R.: Multi-camera Scene Reconstruction via Graph Cuts. In: Heyden, A., Sparr, G., Nielsen, M., Johansen, P. (eds.) ECCV 2002. LNCS, vol.\u00a02352, pp. 82\u201396. Springer, Heidelberg (2002)"},{"issue":"8","key":"29_CR6","doi-asserted-by":"publisher","first-page":"888","DOI":"10.1109\/34.868688","volume":"22","author":"J. Shi","year":"2000","unstructured":"Shi, J., Malik, J.: Normalized cuts and image segmentation. IEEE Trans. Pattern Analysis and Machine Intelligence\u00a022(8), 888\u2013905 (2000)","journal-title":"IEEE Trans. Pattern Analysis and Machine Intelligence"},{"key":"29_CR7","doi-asserted-by":"crossref","unstructured":"Rother, C., Kolmogorov, V., Blake, A.: \u201dgrabcut\u201d: interactive foreground extraction using iterated graph cuts. ACM Transactions on Graphics, 309\u2013314 (2004)","DOI":"10.1145\/1015706.1015720"},{"issue":"3","key":"29_CR8","doi-asserted-by":"publisher","first-page":"611","DOI":"10.1137\/S105262349928887X","volume":"11","author":"M. Rojas","year":"2000","unstructured":"Rojas, M., Santos, S., Sorensen, D.: A new matrix-free algorithm for the large-scale trust-region subproblem. SIAM Journal on optimization\u00a011(3), 611\u2013646 (2000)","journal-title":"SIAM Journal on optimization"},{"key":"29_CR9","unstructured":"Rojas, M., Santos, S., Sorensen, D.: Lstrs: Matlab software for large-scale trust-region subproblems and regularization. Technical Report 2003-4, Department of Mathematics, Wake Forest University (2003)"},{"key":"29_CR10","volume-title":"Practical Methods of Optimization","author":"R. Fletcher","year":"1987","unstructured":"Fletcher, R.: Practical Methods of Optimization. John WIley & Sons, Chichester (1987)"},{"issue":"1","key":"29_CR11","doi-asserted-by":"publisher","first-page":"141","DOI":"10.1137\/S1052623494274374","volume":"7","author":"D. Sorensen","year":"1997","unstructured":"Sorensen, D.: Minimization of a large-scale quadratic fuction subject to a spherical constraint. SIAM J. Optim.\u00a07(1), 141\u2013161 (1997)","journal-title":"SIAM J. Optim."},{"issue":"2","key":"29_CR12","doi-asserted-by":"publisher","first-page":"409","DOI":"10.1137\/0719026","volume":"19","author":"D. Sorensen","year":"1982","unstructured":"Sorensen, D.: Newton\u2019s method with a model trust region modification. SIAM Journal on Nomerical Analysis\u00a019(2), 409\u2013426 (1982)","journal-title":"SIAM Journal on Nomerical Analysis"},{"issue":"2","key":"29_CR13","first-page":"273","volume":"77","author":"F. Rendl","year":"1997","unstructured":"Rendl, F., Wolkowicz, H.: A semidefinite framework for trust region subproblems with applications to large scale minimization. Math. Prog. Ser. B\u00a077(2), 273\u2013299 (1997)","journal-title":"Math. Prog. Ser. B"},{"key":"29_CR14","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511804441","volume-title":"Convex Optimization","author":"S. Boyd","year":"2004","unstructured":"Boyd, S., Vandenberghe, L.: Convex Optimization. Cambridge University Press, Cambridge (2004)"},{"issue":"3","key":"29_CR15","doi-asserted-by":"publisher","first-page":"553","DOI":"10.1137\/0904038","volume":"4","author":"J. Mor\u00e9","year":"1983","unstructured":"Mor\u00e9, J., Sorensen, D.: Computing a trust region step. SIAM J. Sci. Stat. Comput.\u00a04(3), 553\u2013572 (1983)","journal-title":"SIAM J. Sci. Stat. Comput."},{"key":"29_CR16","doi-asserted-by":"crossref","unstructured":"Dempster, A.P., Laird, N.M., Rubin, D.B.: Maximum likelihood from incomplete data via the em algorithm. J. R. Stat. Soc. (1977)","DOI":"10.1111\/j.2517-6161.1977.tb01600.x"}],"container-title":["Lecture Notes in Computer Science","Image Analysis"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-73040-8_29.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,19]],"date-time":"2020-11-19T05:10:18Z","timestamp":1605762618000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-73040-8_29"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540730392","9783540730408"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-73040-8_29","relation":{},"subject":[]}}