{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T22:47:16Z","timestamp":1725662836030},"publisher-location":"Berlin, Heidelberg","reference-count":10,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642253812"},{"type":"electronic","value":"9783642253829"}],"license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2011]]},"DOI":"10.1007\/978-3-642-25382-9_9","type":"book-chapter","created":{"date-parts":[[2012,2,24]],"date-time":"2012-02-24T23:32:22Z","timestamp":1330126342000},"page":"125-134","source":"Crossref","is-referenced-by-count":1,"title":["On Euclidean Metric Approximation via Graph Cuts"],"prefix":"10.1007","author":[{"given":"Ond\u0159ej","family":"Dan\u011bk","sequence":"first","affiliation":[]},{"given":"Pavel","family":"Matula","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"2","key":"9_CR1","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1007\/s11263-006-7934-5","volume":"70","author":"Y. Boykov","year":"2006","unstructured":"Boykov, Y., Funka-Lea, G.: Graph cuts and efficient n-d image segmentation (review). International Journal of Computer Vision\u00a070(2), 109\u2013131 (2006)","journal-title":"International Journal of Computer Vision"},{"key":"9_CR2","doi-asserted-by":"crossref","unstructured":"Boykov, Y., Kolmogorov, V.: Computing geodesics and minimal surfaces via graph cuts. In: ICCV 2003: Proceedings of the 9th IEEE International Conference on Computer Vision, p. 26 (2003)","DOI":"10.1109\/ICCV.2003.1238310"},{"issue":"9","key":"9_CR3","doi-asserted-by":"publisher","first-page":"1124","DOI":"10.1109\/TPAMI.2004.60","volume":"26","author":"Y. Boykov","year":"2004","unstructured":"Boykov, Y., Kolmogorov, V.: An experimental comparison of min-cut\/max-flow algorithms for energy minimization in vision. IEEE Transactions on Pattern Analysis and Machine Intelligence\u00a026(9), 1124\u20131137 (2004)","journal-title":"IEEE Transactions on Pattern Analysis and Machine Intelligence"},{"key":"9_CR4","doi-asserted-by":"publisher","first-page":"79","DOI":"10.1007\/0-387-28831-7_5","volume-title":"Handbook of Mathematical Models in Computer Vision","author":"Y. Boykov","year":"2006","unstructured":"Boykov, Y., Veksler, O.: Graph cuts in vision and graphics: Theories and applications. In: Handbook of Mathematical Models in Computer Vision, pp. 79\u201396. Springer, Heidelberg (2006)"},{"key":"9_CR5","unstructured":"Brown, K.Q.: Geometric transforms for fast geometric algorithms. Ph.D. thesis, Carnegie Mellon University, Pittsburgh, PA, USA (1979)"},{"issue":"2","key":"9_CR6","doi-asserted-by":"publisher","first-page":"266","DOI":"10.1109\/83.902291","volume":"10","author":"T.F. Chan","year":"2001","unstructured":"Chan, T.F., Vese, L.A.: Active contours without edges. IEEE Transactions on Image Processing\u00a010(2), 266\u2013277 (2001)","journal-title":"IEEE Transactions on Image Processing"},{"key":"9_CR7","doi-asserted-by":"crossref","unstructured":"Kolmogorov, V., Boykov, Y.: What metrics can be approximated by geo-cuts, or global optimization of length\/area and flux. In: ICCV 2005: Proceedings of the 10th IEEE International Conference on Computer Vision, pp. 564\u2013571 (2005)","DOI":"10.1109\/ICCV.2005.252"},{"issue":"2","key":"9_CR8","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 Transactions on Pattern Analysis and Machine Intelligence\u00a026(2), 147\u2013159 (2004)","journal-title":"IEEE Transactions on Pattern Analysis and Machine Intelligence"},{"key":"9_CR9","doi-asserted-by":"publisher","first-page":"577","DOI":"10.1002\/cpa.3160420503","volume":"42","author":"D. Mumford","year":"1989","unstructured":"Mumford, D., Shah, J.: Optimal approximations by piecewise smooth functions and associated variational problems. Communications on Pure and Applied Mathematics\u00a042, 577\u2013684 (1989)","journal-title":"Communications on Pure and Applied Mathematics"},{"key":"9_CR10","unstructured":"Zeng, Y., Chen, W., Peng, Q.: Efficiently solving the piecewise constant mumford-shah model using graph cuts. Tech. rep., Dept. of Computer Science, Zhejiang University, P.R. China (2006)"}],"container-title":["Communications in Computer and Information Science","Computer Vision, Imaging and Computer Graphics. Theory and Applications"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-25382-9_9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,28]],"date-time":"2019-04-28T00:46:47Z","timestamp":1556412407000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-25382-9_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642253812","9783642253829"],"references-count":10,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-25382-9_9","relation":{},"ISSN":["1865-0929","1865-0937"],"issn-type":[{"type":"print","value":"1865-0929"},{"type":"electronic","value":"1865-0937"}],"subject":[],"published":{"date-parts":[[2011]]}}}