{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T14:38:18Z","timestamp":1743086298248,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642198663"},{"type":"electronic","value":"9783642198670"}],"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-19867-0_6","type":"book-chapter","created":{"date-parts":[[2011,3,28]],"date-time":"2011-03-28T09:26:42Z","timestamp":1301304402000},"page":"71-82","source":"Crossref","is-referenced-by-count":0,"title":["An Improved Riemannian Metric Approximation for Graph Cuts"],"prefix":"10.1007","author":[{"given":"Ond\u0159ej","family":"Dan\u011bk","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Pavel","family":"Matula","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"6_CR1","doi-asserted-by":"publisher","first-page":"106","DOI":"10.1109\/TPAMI.2006.12","volume":"28","author":"B. Appleton","year":"2006","unstructured":"Appleton, B., Talbot, H.: Globally minimal surfaces by continuous maximal flows. IEEE Transactions on Pattern Analysis and Machine Intelligence\u00a028, 106\u2013118 (2006)","journal-title":"IEEE Transactions on Pattern Analysis and Machine Intelligence"},{"issue":"2","key":"6_CR2","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":"6_CR3","doi-asserted-by":"crossref","unstructured":"Boykov, Y., Kolmogorov, V.: Computing geodesics and minimal surfaces via graph cuts. In: ICCV 2003: Proceedings of the Ninth IEEE International Conference on Computer Vision, p. 26 (2003)","DOI":"10.1109\/ICCV.2003.1238310"},{"issue":"9","key":"6_CR4","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":"6_CR5","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":"6_CR6","unstructured":"Brown, K.Q.: Geometric transforms for fast geometric algorithms. Ph.D. thesis, Carnegie Mellon University, Pittsburgh, PA, USA (1979)"},{"key":"6_CR7","doi-asserted-by":"crossref","unstructured":"Caselles, V., Kimmel, R., Sapiro, G.: Geodesic active contours. In: IEEE International Conference on Computer Vision, pp. 694\u2013699 (1995)","DOI":"10.1109\/ICCV.1995.466871"},{"issue":"2","key":"6_CR8","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":"6_CR9","doi-asserted-by":"crossref","unstructured":"Dan\u011bk, O., Matula, P.: Graph cuts and approximation of the euclidean metric on anisotropic grids. In: VISAPP 2010: International Conference on Computer Vision Theory and Applications, vol.\u00a02, pp. 68\u201373 (2010)","DOI":"10.5220\/0002833000680073"},{"key":"6_CR10","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 Tenth IEEE International Conference on Computer Vision, pp. 564\u2013571 (2005)","DOI":"10.1109\/ICCV.2005.252"},{"issue":"2","key":"6_CR11","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"},{"issue":"1","key":"6_CR12","doi-asserted-by":"publisher","first-page":"12","DOI":"10.1016\/0021-9991(88)90002-2","volume":"79","author":"S. Osher","year":"1988","unstructured":"Osher, S., Sethian, J.A.: Fronts propagating with curvature dependent speed: Algorithms based on Hamilton\u2013Jacobi formulation. Journal of Computational Physics\u00a079(1), 12\u201349 (1988)","journal-title":"Journal of Computational Physics"},{"key":"6_CR13","doi-asserted-by":"publisher","first-page":"527","DOI":"10.1007\/s10898-009-9471-6","volume":"47","author":"G. Strang","year":"2010","unstructured":"Strang, G.: Maximum flows and minimum cuts in the plane. Journal of Global Optimization\u00a047, 527\u2013535 (2010)","journal-title":"Journal of Global Optimization"},{"key":"6_CR14","doi-asserted-by":"crossref","unstructured":"Vogiatzis, G., Torr, P.H.S., Cipolla, R.: Multi-view stereo via volumetric graph-cuts. In: CVPR 2005: IEEE Computer Society Conference on Computer Vision and Pattern Recognition, vol.\u00a02, pp. 391\u2013398 (June 2005)","DOI":"10.1109\/CVPR.2005.238"},{"key":"6_CR15","doi-asserted-by":"crossref","unstructured":"Zach, C., Niethammer, M., Frahm, J.M.: Continuous maximal flows and wulff shapes: Application to mrfs. In: IEEE Computer Society Conference on Computer Vision and Pattern Recognition, pp. 1911\u20131918 (2009)","DOI":"10.1109\/CVPRW.2009.5206565"},{"key":"6_CR16","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":["Lecture Notes in Computer Science","Discrete Geometry for Computer Imagery"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-19867-0_6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,3,4]],"date-time":"2025-03-04T18:25:56Z","timestamp":1741112756000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-19867-0_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642198663","9783642198670"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-19867-0_6","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]}}}