{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T11:50:05Z","timestamp":1725537005188},"publisher-location":"Berlin, Heidelberg","reference-count":10,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642037979"},{"type":"electronic","value":"9783642037986"}],"license":[{"start":{"date-parts":[[2009,1,1]],"date-time":"2009-01-01T00:00:00Z","timestamp":1230768000000},"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":[[2009]]},"DOI":"10.1007\/978-3-642-03798-6_32","type":"book-chapter","created":{"date-parts":[[2009,9,1]],"date-time":"2009-09-01T11:15:17Z","timestamp":1251803717000},"page":"312-321","source":"Crossref","is-referenced-by-count":2,"title":["A Gradient Descent Approximation for Graph Cuts"],"prefix":"10.1007","author":[{"given":"Alparslan","family":"Yildiz","sequence":"first","affiliation":[]},{"given":"Yusuf Sinan","family":"Akgul","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"32_CR1","doi-asserted-by":"crossref","unstructured":"Boykov, Y., Kolmogorov, V.: An experimental comparison of min-cut\/max-flow algorithms for energy minimization in vision. PAMI 26(9) (September 2004)","DOI":"10.1109\/TPAMI.2004.60"},{"key":"32_CR2","doi-asserted-by":"crossref","unstructured":"GoldBerg, A.V., Tarjan, R.E.: A new approach to the maximum flow problem. JACM 1988 (1988)","DOI":"10.1145\/48014.61051"},{"key":"32_CR3","doi-asserted-by":"crossref","unstructured":"Lombaert, H., Sun, Y., Grady, L., Xu, C.: A multilevel banded graph cuts method for fast image segmentation. In: ICCV 2005 (2005)","DOI":"10.1109\/ICCV.2005.13"},{"key":"32_CR4","doi-asserted-by":"crossref","unstructured":"Juan, O., Boykov, Y.: Active Graph Cuts. In: CVPR 2006, pp. 1023\u20131029 (2006)","DOI":"10.1109\/CVPR.2006.47"},{"key":"32_CR5","doi-asserted-by":"crossref","unstructured":"Kohli, P., Torr, P.H.S.: Dynamic graph cuts for efficient inference in markov random fields. PAMI 2007 (2007)","DOI":"10.1109\/TPAMI.2007.1128"},{"key":"32_CR6","unstructured":"Dixit, N., Keriven, R., Paragios, N.: GPU-Cuts: Combinatorial optimisation, graphic processing units and adaptive object extraction. Research Report 05-07, CERTIS (March 2005)"},{"key":"32_CR7","unstructured":"Vineet, V., Narayanan, P.J.: CUDA Cuts: Fast graphs cuts on the gpu. Technical Report, International Institute of Information Technology, Hyderabd"},{"key":"32_CR8","doi-asserted-by":"crossref","unstructured":"Bhusnurmath, A., Taylor, C.J.: Solving the graph cut problem via l1-norm minimization. Technical Reports, CIS (2007)","DOI":"10.1109\/TPAMI.2008.82"},{"key":"32_CR9","doi-asserted-by":"crossref","unstructured":"Ford, Jr., L.R., Fulkerson, D.R.: Maximal flow through a network. Canadian Journal of Mathematics (1956)","DOI":"10.4153\/CJM-1956-045-5"},{"key":"32_CR10","unstructured":"Nvidia Geforce Family GPUs, http:\/\/www.nvidia.com\/object\/geforce_family.html"}],"container-title":["Lecture Notes in Computer Science","Pattern Recognition"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-03798-6_32","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,22]],"date-time":"2019-05-22T09:19:42Z","timestamp":1558516782000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-03798-6_32"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642037979","9783642037986"],"references-count":10,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-03798-6_32","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2009]]}}}