{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,28]],"date-time":"2025-03-28T09:44:48Z","timestamp":1743155088444,"version":"3.40.3"},"publisher-location":"Cham","reference-count":8,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319466866"},{"type":"electronic","value":"9783319466873"}],"license":[{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"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":[[2016]]},"DOI":"10.1007\/978-3-319-46687-3_45","type":"book-chapter","created":{"date-parts":[[2016,9,28]],"date-time":"2016-09-28T09:13:24Z","timestamp":1475054004000},"page":"403-412","source":"Crossref","is-referenced-by-count":1,"title":["Image Segmentation Using Graph Cuts Based on Maximum-Flow Neural Network"],"prefix":"10.1007","author":[{"given":"Masatoshi","family":"Sato","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hideharu","family":"Toda","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hisashi","family":"Aomori","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tsuyoshi","family":"Otake","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mamoru","family":"Tanaka","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2016,9,29]]},"reference":[{"key":"45_CR1","first-page":"79","volume-title":"Handbook of Mathematical Models in Computer Vision","author":"Y Boykov","year":"2005","unstructured":"Boykov, Y., Veksler, O.: Graph cuts in vision and graphics: theories and applications. In: Paragios, N., Chen, Y., Faugeras, O. (eds.) Handbook of Mathematical Models in Computer Vision, pp. 79\u201396. Springer, Heidelberg (2005)"},{"issue":"3","key":"45_CR2","doi-asserted-by":"crossref","first-page":"309","DOI":"10.1145\/1186562.1015720","volume":"23","author":"C Rother","year":"2004","unstructured":"Rother, C., Kolmogorv, V., Blake, A.: GrabCut: interactive foreground extraction using iterated graph cuts. ACM Trans. Graph. SIGGRAPH 2004 23(3), 309\u2013314 (2004)","journal-title":"ACM Trans. Graph. SIGGRAPH 2004"},{"key":"45_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 Anal. Mach. Intell. 23, 1222\u20131239 (2001)","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"issue":"9","key":"45_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 Trans. Pattern Anal. Mach. Intell. 26(9), 1124\u20131137 (2004)","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"key":"45_CR5","doi-asserted-by":"publisher","first-page":"921","DOI":"10.1145\/48014.61051","volume":"35","author":"AV Goldberg","year":"1988","unstructured":"Goldberg, A.V., Tarjan, R.E.: A new approach to the maximum-flow problem. J. ACM 35, 921\u2013940 (1988)","journal-title":"J. ACM"},{"issue":"4","key":"45_CR6","doi-asserted-by":"publisher","first-page":"945","DOI":"10.1587\/transfun.E92.A.945","volume":"E92\u2013A","author":"M Sato","year":"2009","unstructured":"Sato, M., Aomori, H., Tanaka, M.: Maximum-flow neural network: a novel neural network for the maximum flow problem. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. E92\u2013A(4), 945\u2013951 (2009)","journal-title":"IEICE Trans. Fundam. Electron. Commun. Comput. Sci."},{"key":"45_CR7","unstructured":"Hasler, M., Nussbaumer, J.E.: Network flow optimization by a resistor circuit. In: ECCTD 1989, pp. 644\u2013646, Brighton, U.K., September 1989"},{"key":"45_CR8","doi-asserted-by":"publisher","unstructured":"Sato, M., Aomori, H., Tanaka, M.: Node voltages in nonlinear resistive circuits enable new approach to the minimum cut problem. In: 2014 IEEE International Symposium on Circuits and Systems (ISCAS2014), pp. 2788\u20132791, Melbourne, Australia, June 2014","DOI":"10.1109\/ISCAS.2014.6865752"}],"container-title":["Lecture Notes in Computer Science","Neural Information Processing"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-46687-3_45","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,9,13]],"date-time":"2019-09-13T22:36:14Z","timestamp":1568414174000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-46687-3_45"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783319466866","9783319466873"],"references-count":8,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-46687-3_45","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2016]]}}}